gcc/cp/decl.c

   1 /* Process declarations and variables for C compiler.
   2    Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000
   3    Free Software Foundation, Inc.
   4    Contributed by Michael Tiemann (tiemann@cygnus.com)
   5
   6 This file is part of GNU CC.
   7
   8 GNU CC 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 GNU CC 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 GNU CC; see the file COPYING.  If not, write to
  20 the Free Software Foundation, 59 Temple Place - Suite 330,
  21 Boston, MA 02111-1307, USA.  */
  22
  23
  24 /* Process declarations and symbol lookup for C front end.
  25    Also constructs types; the standard scalar types at initialization,
  26    and structure, union, array and enum types when they are declared.  */
  27
  28 /* ??? not all decl nodes are given the most useful possible
  29    line numbers.  For example, the CONST_DECLs for enum values.  */
  30
  31 #include "config.h"
  32 #include "system.h"
  33 #include "tree.h"
  34 #include "rtl.h"
  35 #include "expr.h"
  36 #include "flags.h"
  37 #include "cp-tree.h"
  38 #include "decl.h"
  39 #include "lex.h"
  40 #include <signal.h>
  41 #include "defaults.h"
  42 #include "output.h"
  43 #include "except.h"
  44 #include "toplev.h"
  45 #include "../hash.h"
  46 #include "defaults.h"
  47 #include "ggc.h"
  48
  49 extern int current_class_depth;
  50
  51 extern tree static_ctors, static_dtors;
  52
  53 extern tree global_namespace;
  54
  55 extern int (*valid_lang_attribute) PARAMS ((tree, tree, tree, tree));
  56
  57 /* Use garbage collection.  */
  58
  59 int ggc_p = 1;
  60
  61 #ifndef WCHAR_UNSIGNED
  62 #define WCHAR_UNSIGNED 0
  63 #endif
  64
  65 #ifndef CHAR_TYPE_SIZE
  66 #define CHAR_TYPE_SIZE BITS_PER_UNIT
  67 #endif
  68
  69 #ifndef BOOL_TYPE_SIZE
  70 #ifdef SLOW_BYTE_ACCESS
  71 /* In the new ABI, `bool' has size and alignment `1', on all
  72    platforms.  */
  73 #define BOOL_TYPE_SIZE \
  74   ((SLOW_BYTE_ACCESS && !flag_new_abi) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
  75 #else
  76 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
  77 #endif
  78 #endif
  79
  80 /* We let tm.h override the types used here, to handle trivial differences
  81    such as the choice of unsigned int or long unsigned int for size_t.
  82    When machines start needing nontrivial differences in the size type,
  83    it would be best to do something here to figure out automatically
  84    from other information what type to use.  */
  85
  86 #ifndef SIZE_TYPE
  87 #define SIZE_TYPE "long unsigned int"
  88 #endif
  89
  90 #ifndef PTRDIFF_TYPE
  91 #define PTRDIFF_TYPE "long int"
  92 #endif
  93
  94 #ifndef WCHAR_TYPE
  95 #define WCHAR_TYPE "int"
  96 #endif
  97
  98 static tree grokparms                           PARAMS ((tree, int));
  99 static const char *redeclaration_error_message  PARAMS ((tree, tree));
 100
 101 static void push_binding_level PARAMS ((struct binding_level *, int,
 102                                       int));
 103 static void pop_binding_level PARAMS ((void));
 104 static void suspend_binding_level PARAMS ((void));
 105 static void resume_binding_level PARAMS ((struct binding_level *));
 106 static struct binding_level *make_binding_level PARAMS ((void));
 107 static void declare_namespace_level PARAMS ((void));
 108 static void signal_catch PARAMS ((int)) ATTRIBUTE_NORETURN;
 109 static int decl_jump_unsafe PARAMS ((tree));
 110 static void storedecls PARAMS ((tree));
 111 static void require_complete_types_for_parms PARAMS ((tree));
 112 static int ambi_op_p PARAMS ((enum tree_code));
 113 static int unary_op_p PARAMS ((enum tree_code));
 114 static tree store_bindings PARAMS ((tree, tree));
 115 static tree lookup_tag_reverse PARAMS ((tree, tree));
 116 static tree obscure_complex_init PARAMS ((tree, tree));
 117 static tree lookup_name_real PARAMS ((tree, int, int, int));
 118 static void warn_extern_redeclared_static PARAMS ((tree, tree));
 119 static void grok_reference_init PARAMS ((tree, tree, tree));
 120 static tree grokfndecl PARAMS ((tree, tree, tree, tree, int,
 121                               enum overload_flags, tree,
 122                               tree, int, int, int, int, int, int, tree));
 123 static tree grokvardecl PARAMS ((tree, tree, RID_BIT_TYPE *, int, int, tree));
 124 static tree lookup_tag PARAMS ((enum tree_code, tree,
 125                               struct binding_level *, int));
 126 static void set_identifier_type_value_with_scope
 127         PARAMS ((tree, tree, struct binding_level *));
 128 static void record_builtin_type PARAMS ((enum rid, const char *, tree));
 129 static void record_unknown_type PARAMS ((tree, const char *));
 130 static tree build_library_fn_1 PARAMS ((tree, enum tree_code, tree));
 131 static int member_function_or_else PARAMS ((tree, tree, enum overload_flags));
 132 static void bad_specifiers PARAMS ((tree, const char *, int, int, int, int,
 133                                   int));
 134 static void lang_print_error_function PARAMS ((const char *));
 135 static tree maybe_process_template_type_declaration PARAMS ((tree, int, struct binding_level*));
 136 static void check_for_uninitialized_const_var PARAMS ((tree));
 137 static unsigned long typename_hash PARAMS ((hash_table_key));
 138 static boolean typename_compare PARAMS ((hash_table_key, hash_table_key));
 139 static void push_binding PARAMS ((tree, tree, struct binding_level*));
 140 static int add_binding PARAMS ((tree, tree));
 141 static void pop_binding PARAMS ((tree, tree));
 142 static tree local_variable_p_walkfn PARAMS ((tree *, int *, void *));
 143 static tree find_binding PARAMS ((tree, tree));
 144 static tree select_decl PARAMS ((tree, int));
 145 static int lookup_flags PARAMS ((int, int));
 146 static tree qualify_lookup PARAMS ((tree, int));
 147 static tree record_builtin_java_type PARAMS ((const char *, int));
 148 static const char *tag_name PARAMS ((enum tag_types code));
 149 static void find_class_binding_level PARAMS ((void));
 150 static struct binding_level *innermost_nonclass_level PARAMS ((void));
 151 static void warn_about_implicit_typename_lookup PARAMS ((tree, tree));
 152 static int walk_namespaces_r PARAMS ((tree, walk_namespaces_fn, void *));
 153 static int walk_globals_r PARAMS ((tree, void *));
 154 static void add_decl_to_level PARAMS ((tree, struct binding_level *));
 155 static tree make_label_decl PARAMS ((tree, int));
 156 static void use_label PARAMS ((tree));
 157 static void check_previous_goto_1 PARAMS ((tree, struct binding_level *, tree,
 158                                            const char *, int));
 159 static void check_previous_goto PARAMS ((struct named_label_use_list *));
 160 static void check_switch_goto PARAMS ((struct binding_level *));
 161 static void check_previous_gotos PARAMS ((tree));
 162 static void pop_label PARAMS ((tree, tree));
 163 static void pop_labels PARAMS ((tree));
 164 static void maybe_deduce_size_from_array_init PARAMS ((tree, tree));
 165 static void layout_var_decl PARAMS ((tree));
 166 static void maybe_commonize_var PARAMS ((tree));
 167 static tree check_initializer PARAMS ((tree, tree));
 168 static void make_rtl_for_nonlocal_decl PARAMS ((tree, tree, const char *));
 169 static void push_cp_function_context PARAMS ((struct function *));
 170 static void pop_cp_function_context PARAMS ((struct function *));
 171 static void mark_binding_level PARAMS ((void *));
 172 static void mark_named_label_lists PARAMS ((void *, void *));
 173 static void mark_cp_function_context PARAMS ((struct function *));
 174 static void mark_saved_scope PARAMS ((void *));
 175 static void mark_lang_function PARAMS ((struct language_function *));
 176 static void mark_stmt_tree PARAMS ((struct stmt_tree *));
 177 static void save_function_data PARAMS ((tree));
 178 static void check_function_type PARAMS ((tree));
 179 static void destroy_local_var PARAMS ((tree));
 180 static void finish_constructor_body PARAMS ((void));
 181 static void finish_destructor_body PARAMS ((void));
 182 static tree create_array_type_for_decl PARAMS ((tree, tree, tree));
 183 static tree get_atexit_node PARAMS ((void));
 184 static tree get_dso_handle_node PARAMS ((void));
 185 static tree start_cleanup_fn PARAMS ((void));
 186 static void end_cleanup_fn PARAMS ((void));
 187 static tree cp_make_fname_decl PARAMS ((tree, const char *, int));
 188 static void initialize_predefined_identifiers PARAMS ((void));
 189 static tree check_special_function_return_type
 190   PARAMS ((special_function_kind, tree, tree, tree));
 191 static tree push_cp_library_fn PARAMS ((enum tree_code, tree));
 192 static tree build_cp_library_fn PARAMS ((tree, enum tree_code, tree));
 193
 194 #if defined (DEBUG_CP_BINDING_LEVELS)
 195 static void indent PARAMS ((void));
 196 #endif
 197
 198 /* Erroneous argument lists can use this *IFF* they do not modify it.  */
 199 tree error_mark_list;
 200
 201 /* The following symbols are subsumed in the cp_global_trees array, and
 202    listed here individually for documentation purposes.
 203
 204    C++ extensions
 205         tree wchar_decl_node;
 206         tree void_zero_node;
 207
 208         tree vtable_entry_type;
 209         tree delta_type_node;
 210 #if 0
 211    Old rtti stuff.
 212         tree __baselist_desc_type_node;
 213         tree __i_desc_type_node, __m_desc_type_node;
 214         tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
 215 #endif
 216         tree __t_desc_type_node;
 217 #if 0
 218         tree __tp_desc_type_node;
 219 #endif
 220         tree ti_desc_type_node;
 221         tree bltn_desc_type_node, ptr_desc_type_node;
 222         tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
 223         tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
 224         tree ptm_desc_type_node;
 225         tree base_desc_type_node;
 226 #if 0
 227    Not needed yet?  May be needed one day?
 228         tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
 229         tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
 230         tree __ptmf_desc_array_type, __ptmd_desc_array_type;
 231 #endif
 232
 233         tree class_type_node, record_type_node, union_type_node, enum_type_node;
 234         tree unknown_type_node;
 235
 236    Array type `vtable_entry_type[]'
 237
 238         tree vtbl_type_node;
 239         tree vtbl_ptr_type_node;
 240
 241    Namespaces,
 242
 243         tree std_node;
 244         tree abi_node;
 245
 246    A FUNCTION_DECL which can call `abort'.  Not necessarily the
 247    one that the user will declare, but sufficient to be called
 248    by routines that want to abort the program.
 249
 250         tree abort_fndecl;
 251
 252    The FUNCTION_DECL for the default `::operator delete'.
 253
 254         tree global_delete_fndecl;
 255
 256    Used by RTTI
 257         tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
 258         tree tinfo_var_id;
 259
 260 */
 261
 262 tree cp_global_trees[CPTI_MAX];
 263
 264 /* Indicates that there is a type value in some namespace, although
 265    that is not necessarily in scope at the moment.  */
 266
 267 static tree global_type_node;
 268
 269 /* Namespace std.  */
 270 int in_std;
 271
 272 /* Expect only namespace names now. */
 273 static int only_namespace_names;
 274
 275 /* If original DECL_RESULT of current function was a register,
 276    but due to being an addressable named return value, would up
 277    on the stack, this variable holds the named return value's
 278    original location.  */
 279
 280 #define original_result_rtx cp_function_chain->x_result_rtx
 281
 282 /* Used only for jumps to as-yet undefined labels, since jumps to
 283    defined labels can have their validity checked immediately.  */
 284
 285 struct named_label_use_list
 286 {
 287   struct binding_level *binding_level;
 288   tree names_in_scope;
 289   tree label_decl;
 290   const char *filename_o_goto;
 291   int lineno_o_goto;
 292   struct named_label_use_list *next;
 293 };
 294
 295 #define named_label_uses cp_function_chain->x_named_label_uses
 296
 297 /* A list of objects which have constructors or destructors
 298    which reside in the global scope.  The decl is stored in
 299    the TREE_VALUE slot and the initializer is stored
 300    in the TREE_PURPOSE slot.  */
 301 tree static_aggregates;
 302
 303 /* -- end of C++ */
 304
 305 /* A node for the integer constants 2, and 3.  */
 306
 307 tree integer_two_node, integer_three_node;
 308
 309 /* Parsing a function declarator leaves here a chain of structure
 310    and enum types declared in the parmlist.  */
 311
 312 static tree last_function_parm_tags;
 313
 314 /* Similar, for last_function_parm_tags.  */
 315 tree last_function_parms;
 316 static tree current_function_parm_tags;
 317
 318 /* A list of all LABEL_DECLs in the function that have names.  Here so
 319    we can clear out their names' definitions at the end of the
 320    function, and so we can check the validity of jumps to these labels.  */
 321
 322 struct named_label_list
 323 {
 324   struct binding_level *binding_level;
 325   tree names_in_scope;
 326   tree old_value;
 327   tree label_decl;
 328   tree bad_decls;
 329   int eh_region;
 330   struct named_label_list *next;
 331 };
 332
 333 #define named_labels cp_function_chain->x_named_labels
 334
 335 /* Set to 0 at beginning of a function definition, and whenever
 336    a label (case or named) is defined.  Set to value of expression
 337    returned from function when that value can be transformed into
 338    a named return value.  */
 339
 340 tree current_function_return_value;
 341
 342 /* Nonzero means use the ISO C99 dialect of C.  */
 343
 344 int flag_isoc99;
 345
 346 /* Nonzero means give `double' the same size as `float'.  */
 347
 348 extern int flag_short_double;
 349
 350 /* Nonzero means don't recognize any builtin functions.  */
 351
 352 extern int flag_no_builtin;
 353
 354 /* Nonzero means don't recognize the non-ANSI builtin functions.
 355    -ansi sets this.  */
 356
 357 extern int flag_no_nonansi_builtin;
 358
 359 /* Nonzero if we want to conserve space in the .o files.  We do this
 360    by putting uninitialized data and runtime initialized data into
 361    .common instead of .data at the expense of not flagging multiple
 362    definitions.  */
 363 extern int flag_conserve_space;
 364 \f
 365 /* C and C++ flags are in decl2.c.  */
 366
 367 /* Flag used when debugging spew.c */
 368
 369 extern int spew_debug;
 370
 371 /* A expression of value 0 with the same precision as a sizetype
 372    node, but signed.  */
 373 tree signed_size_zero_node;
 374
 375 /* The name of the anonymous namespace, throughout this translation
 376    unit.  */
 377 tree anonymous_namespace_name;
 378
 379 \f
 380 /* For each binding contour we allocate a binding_level structure
 381    which records the names defined in that contour.
 382    Contours include:
 383     0) the global one
 384     1) one for each function definition,
 385        where internal declarations of the parameters appear.
 386     2) one for each compound statement,
 387        to record its declarations.
 388
 389    The current meaning of a name can be found by searching the levels
 390    from the current one out to the global one.
 391
 392    Off to the side, may be the class_binding_level.  This exists only
 393    to catch class-local declarations.  It is otherwise nonexistent.
 394
 395    Also there may be binding levels that catch cleanups that must be
 396    run when exceptions occur.  Thus, to see whether a name is bound in
 397    the current scope, it is not enough to look in the
 398    CURRENT_BINDING_LEVEL.  You should use lookup_name_current_level
 399    instead.  */
 400
 401 /* Note that the information in the `names' component of the global contour
 402    is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers.  */
 403
 404 struct binding_level
 405   {
 406     /* A chain of _DECL nodes for all variables, constants, functions,
 407        and typedef types.  These are in the reverse of the order
 408        supplied.  There may be OVERLOADs on this list, too, but they
 409        are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD.  */
 410     tree names;
 411
 412     /* A list of structure, union and enum definitions, for looking up
 413        tag names.
 414        It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
 415        or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
 416        or ENUMERAL_TYPE node.
 417
 418        C++: the TREE_VALUE nodes can be simple types for
 419        component_bindings.  */
 420     tree tags;
 421
 422     /* A list of USING_DECL nodes. */
 423     tree usings;
 424
 425     /* A list of used namespaces. PURPOSE is the namespace,
 426        VALUE the common ancestor with this binding_level's namespace. */
 427     tree using_directives;
 428
 429     /* If this binding level is the binding level for a class, then
 430        class_shadowed is a TREE_LIST.  The TREE_PURPOSE of each node
 431        is the name of an entity bound in the class; the TREE_VALUE is
 432        the IDENTIFIER_CLASS_VALUE before we entered the class.  Thus,
 433        when leaving class scope, we can restore the
 434        IDENTIFIER_CLASS_VALUE by walking this list.  The TREE_TYPE is
 435        the DECL bound by this name in the class.  */
 436     tree class_shadowed;
 437
 438     /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
 439        is used for all binding levels.  */
 440     tree type_shadowed;
 441
 442     /* A TREE_LIST.  Each TREE_VALUE is the LABEL_DECL for a local
 443        label in this scope.  The TREE_PURPOSE is the previous value of
 444        the IDENTIFIER_LABEL VALUE.  */
 445     tree shadowed_labels;
 446
 447     /* For each level (except not the global one),
 448        a chain of BLOCK nodes for all the levels
 449        that were entered and exited one level down.  */
 450     tree blocks;
 451
 452     /* The BLOCK node for this level, if one has been preallocated.
 453        If 0, the BLOCK is allocated (if needed) when the level is popped.  */
 454     tree this_block;
 455
 456     /* The _TYPE node for this level, if parm_flag == 2.  */
 457     tree this_class;
 458
 459     /* The binding level which this one is contained in (inherits from).  */
 460     struct binding_level *level_chain;
 461
 462     /* List of decls in `names' that have incomplete
 463        structure or union types.  */
 464     tree incomplete;
 465
 466     /* List of VAR_DECLS saved from a previous for statement.
 467        These would be dead in ISO-conforming code, but might
 468        be referenced in ARM-era code.  These are stored in a
 469        TREE_LIST; the TREE_VALUE is the actual declaration.  */
 470     tree dead_vars_from_for;
 471
 472     /* 1 for the level that holds the parameters of a function.
 473        2 for the level that holds a class declaration.  */
 474     unsigned parm_flag : 2;
 475
 476     /* 1 means make a BLOCK for this level regardless of all else.
 477        2 for temporary binding contours created by the compiler.  */
 478     unsigned keep : 2;
 479
 480     /* Nonzero if this level "doesn't exist" for tags.  */
 481     unsigned tag_transparent : 1;
 482
 483     /* Nonzero if this level can safely have additional
 484        cleanup-needing variables added to it.  */
 485     unsigned more_cleanups_ok : 1;
 486     unsigned have_cleanups : 1;
 487
 488     /* Nonzero if this scope is for storing the decls for template
 489        parameters and generic decls; these decls will be discarded and
 490        replaced with a TEMPLATE_DECL.  */
 491     unsigned template_parms_p : 1;
 492
 493     /* Nonzero if this scope corresponds to the `<>' in a
 494        `template <>' clause.  Whenever this flag is set,
 495        TEMPLATE_PARMS_P will be set as well.  */
 496     unsigned template_spec_p : 1;
 497
 498     /* This is set for a namespace binding level.  */
 499     unsigned namespace_p : 1;
 500
 501     /* True if this level is that of a for-statement where we need to
 502        worry about ambiguous (ARM or ISO) scope rules.  */
 503     unsigned is_for_scope : 1;
 504
 505     /* True if this level corresponds to an EH region, as for a try block.
 506        Currently this information is only available while building the
 507        tree structure.  */
 508     unsigned eh_region : 1;
 509
 510     /* Four bits left for this word.  */
 511
 512 #if defined(DEBUG_CP_BINDING_LEVELS)
 513     /* Binding depth at which this level began.  */
 514     unsigned binding_depth;
 515 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
 516   };
 517
 518 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
 519
 520 /* The binding level currently in effect.  */
 521
 522 #define current_binding_level                   \
 523   (cfun                                         \
 524    ? cp_function_chain->bindings                \
 525    : scope_chain->bindings)
 526
 527 /* The binding level of the current class, if any.  */
 528
 529 #define class_binding_level scope_chain->class_bindings
 530
 531 /* A chain of binding_level structures awaiting reuse.  */
 532
 533 static struct binding_level *free_binding_level;
 534
 535 /* The outermost binding level, for names of file scope.
 536    This is created when the compiler is started and exists
 537    through the entire run.  */
 538
 539 static struct binding_level *global_binding_level;
 540
 541 /* Nonzero means unconditionally make a BLOCK for the next level pushed.  */
 542
 543 static int keep_next_level_flag;
 544
 545 #if defined(DEBUG_CP_BINDING_LEVELS)
 546 static int binding_depth = 0;
 547 static int is_class_level = 0;
 548
 549 static void
 550 indent ()
 551 {
 552   register unsigned i;
 553
 554   for (i = 0; i < binding_depth*2; i++)
 555     putc (' ', stderr);
 556 }
 557 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
 558
 559 static tree pushdecl_with_scope PARAMS ((tree, struct binding_level *));
 560
 561 static void
 562 push_binding_level (newlevel, tag_transparent, keep)
 563      struct binding_level *newlevel;
 564      int tag_transparent, keep;
 565 {
 566   /* Add this level to the front of the chain (stack) of levels that
 567      are active.  */
 568   bzero ((char*) newlevel, sizeof (struct binding_level));
 569   newlevel->level_chain = current_binding_level;
 570   current_binding_level = newlevel;
 571   newlevel->tag_transparent = tag_transparent;
 572   newlevel->more_cleanups_ok = 1;
 573
 574   newlevel->keep = keep;
 575 #if defined(DEBUG_CP_BINDING_LEVELS)
 576   newlevel->binding_depth = binding_depth;
 577   indent ();
 578   fprintf (stderr, "push %s level 0x%08x line %d\n",
 579            (is_class_level) ? "class" : "block", newlevel, lineno);
 580   is_class_level = 0;
 581   binding_depth++;
 582 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
 583 }
 584
 585 /* Find the innermost enclosing class scope, and reset
 586    CLASS_BINDING_LEVEL appropriately.  */
 587
 588 static void
 589 find_class_binding_level ()
 590 {
 591   struct binding_level *level = current_binding_level;
 592
 593   while (level && level->parm_flag != 2)
 594     level = level->level_chain;
 595   if (level && level->parm_flag == 2)
 596     class_binding_level = level;
 597   else
 598     class_binding_level = 0;
 599 }
 600
 601 static void
 602 pop_binding_level ()
 603 {
 604   if (global_binding_level)
 605     {
 606       /* Cannot pop a level, if there are none left to pop.  */
 607       if (current_binding_level == global_binding_level)
 608         my_friendly_abort (123);
 609     }
 610   /* Pop the current level, and free the structure for reuse.  */
 611 #if defined(DEBUG_CP_BINDING_LEVELS)
 612   binding_depth--;
 613   indent ();
 614   fprintf (stderr, "pop  %s level 0x%08x line %d\n",
 615           (is_class_level) ? "class" : "block",
 616           current_binding_level, lineno);
 617   if (is_class_level != (current_binding_level == class_binding_level))
 618     {
 619       indent ();
 620       fprintf (stderr, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
 621     }
 622   is_class_level = 0;
 623 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
 624   {
 625     register struct binding_level *level = current_binding_level;
 626     current_binding_level = current_binding_level->level_chain;
 627     level->level_chain = free_binding_level;
 628 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
 629     if (level->binding_depth != binding_depth)
 630       abort ();
 631 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
 632     free_binding_level = level;
 633     find_class_binding_level ();
 634   }
 635 }
 636
 637 static void
 638 suspend_binding_level ()
 639 {
 640   if (class_binding_level)
 641     current_binding_level = class_binding_level;
 642
 643   if (global_binding_level)
 644     {
 645       /* Cannot suspend a level, if there are none left to suspend.  */
 646       if (current_binding_level == global_binding_level)
 647         my_friendly_abort (123);
 648     }
 649   /* Suspend the current level.  */
 650 #if defined(DEBUG_CP_BINDING_LEVELS)
 651   binding_depth--;
 652   indent ();
 653   fprintf (stderr, "suspend  %s level 0x%08x line %d\n",
 654           (is_class_level) ? "class" : "block",
 655           current_binding_level, lineno);
 656   if (is_class_level != (current_binding_level == class_binding_level))
 657     {
 658       indent ();
 659       fprintf (stderr, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
 660     }
 661   is_class_level = 0;
 662 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
 663   current_binding_level = current_binding_level->level_chain;
 664   find_class_binding_level ();
 665 }
 666
 667 static void
 668 resume_binding_level (b)
 669      struct binding_level *b;
 670 {
 671   /* Resuming binding levels is meant only for namespaces,
 672      and those cannot nest into classes. */
 673   my_friendly_assert(!class_binding_level, 386);
 674   /* Also, resuming a non-directly nested namespace is a no-no.  */
 675   my_friendly_assert(b->level_chain == current_binding_level, 386);
 676   current_binding_level = b;
 677 #if defined(DEBUG_CP_BINDING_LEVELS)
 678   b->binding_depth = binding_depth;
 679   indent ();
 680   fprintf (stderr, "resume %s level 0x%08x line %d\n",
 681            (is_class_level) ? "class" : "block", b, lineno);
 682   is_class_level = 0;
 683   binding_depth++;
 684 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
 685 }
 686 \f
 687 /* Create a new `struct binding_level'.  */
 688
 689 static
 690 struct binding_level *
 691 make_binding_level ()
 692 {
 693   /* NOSTRICT */
 694   return (struct binding_level *) xmalloc (sizeof (struct binding_level));
 695 }
 696
 697 /* Nonzero if we are currently in the global binding level.  */
 698
 699 int
 700 global_bindings_p ()
 701 {
 702   return current_binding_level == global_binding_level;
 703 }
 704
 705 /* Return the innermost binding level that is not for a class scope.  */
 706
 707 static struct binding_level *
 708 innermost_nonclass_level ()
 709 {
 710   struct binding_level *b;
 711
 712   b = current_binding_level;
 713   while (b->parm_flag == 2)
 714     b = b->level_chain;
 715
 716   return b;
 717 }
 718
 719 /* Nonzero if we are currently in a toplevel binding level.  This
 720    means either the global binding level or a namespace in a toplevel
 721    binding level.  Since there are no non-toplevel namespace levels,
 722    this really means any namespace or template parameter level.  We
 723    also include a class whose context is toplevel.  */
 724
 725 int
 726 toplevel_bindings_p ()
 727 {
 728   struct binding_level *b = innermost_nonclass_level ();
 729
 730   return b->namespace_p || b->template_parms_p;
 731 }
 732
 733 /* Nonzero if this is a namespace scope, or if we are defining a class
 734    which is itself at namespace scope, or whose enclosing class is
 735    such a class, etc.  */
 736
 737 int
 738 namespace_bindings_p ()
 739 {
 740   struct binding_level *b = innermost_nonclass_level ();
 741
 742   return b->namespace_p;
 743 }
 744
 745 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
 746    unconditionally.  Otherwise, use the normal logic to decide whether
 747    or not to create a BLOCK.  */
 748
 749 void
 750 keep_next_level (keep)
 751      int keep;
 752 {
 753   keep_next_level_flag = keep;
 754 }
 755
 756 /* Nonzero if the current level needs to have a BLOCK made.  */
 757
 758 int
 759 kept_level_p ()
 760 {
 761   return (current_binding_level->blocks != NULL_TREE
 762           || current_binding_level->keep
 763           || current_binding_level->names != NULL_TREE
 764           || (current_binding_level->tags != NULL_TREE
 765               && !current_binding_level->tag_transparent));
 766 }
 767
 768 static void
 769 declare_namespace_level ()
 770 {
 771   current_binding_level->namespace_p = 1;
 772 }
 773
 774 /* Returns non-zero if this scope was created to store template
 775    parameters.  */
 776
 777 int
 778 template_parm_scope_p ()
 779 {
 780   return current_binding_level->template_parms_p;
 781 }
 782
 783 /* Returns the kind of template specialization we are currently
 784    processing, given that it's declaration contained N_CLASS_SCOPES
 785    explicit scope qualifications.  */
 786
 787 tmpl_spec_kind
 788 current_tmpl_spec_kind (n_class_scopes)
 789      int n_class_scopes;
 790 {
 791   int n_template_parm_scopes = 0;
 792   int seen_specialization_p = 0;
 793   int innermost_specialization_p = 0;
 794   struct binding_level *b;
 795
 796   /* Scan through the template parameter scopes.  */
 797   for (b = current_binding_level; b->template_parms_p; b = b->level_chain)
 798     {
 799       /* If we see a specialization scope inside a parameter scope,
 800          then something is wrong.  That corresponds to a declaration
 801          like:
 802
 803             template <class T> template <> ...
 804
 805          which is always illegal since [temp.expl.spec] forbids the
 806          specialization of a class member template if the enclosing
 807          class templates are not explicitly specialized as well.  */
 808       if (b->template_spec_p)
 809         {
 810           if (n_template_parm_scopes == 0)
 811             innermost_specialization_p = 1;
 812           else
 813             seen_specialization_p = 1;
 814         }
 815       else if (seen_specialization_p == 1)
 816         return tsk_invalid_member_spec;
 817
 818       ++n_template_parm_scopes;
 819     }
 820
 821   /* Handle explicit instantiations.  */
 822   if (processing_explicit_instantiation)
 823     {
 824       if (n_template_parm_scopes != 0)
 825         /* We've seen a template parameter list during an explicit
 826            instantiation.  For example:
 827
 828              template <class T> template void f(int);
 829
 830            This is erroneous.  */
 831         return tsk_invalid_expl_inst;
 832       else
 833         return tsk_expl_inst;
 834     }
 835
 836   if (n_template_parm_scopes < n_class_scopes)
 837     /* We've not seen enough template headers to match all the
 838        specialized classes present.  For example:
 839
 840          template <class T> void R<T>::S<T>::f(int);
 841
 842        This is illegal; there needs to be one set of template
 843        parameters for each class.  */
 844     return tsk_insufficient_parms;
 845   else if (n_template_parm_scopes == n_class_scopes)
 846     /* We're processing a non-template declaration (even though it may
 847        be a member of a template class.)  For example:
 848
 849          template <class T> void S<T>::f(int);
 850
 851        The `class T' maches the `S<T>', leaving no template headers
 852        corresponding to the `f'.  */
 853     return tsk_none;
 854   else if (n_template_parm_scopes > n_class_scopes + 1)
 855     /* We've got too many template headers.  For example:
 856
 857          template <> template <class T> void f (T);
 858
 859        There need to be more enclosing classes.  */
 860     return tsk_excessive_parms;
 861   else
 862     /* This must be a template.  It's of the form:
 863
 864          template <class T> template <class U> void S<T>::f(U);
 865
 866        This is a specialization if the innermost level was a
 867        specialization; otherwise it's just a definition of the
 868        template.  */
 869     return innermost_specialization_p ? tsk_expl_spec : tsk_template;
 870 }
 871
 872 void
 873 set_class_shadows (shadows)
 874      tree shadows;
 875 {
 876   class_binding_level->class_shadowed = shadows;
 877 }
 878
 879 /* Enter a new binding level.
 880    If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
 881    not for that of tags.  */
 882
 883 void
 884 pushlevel (tag_transparent)
 885      int tag_transparent;
 886 {
 887   struct binding_level *newlevel;
 888
 889   if (cfun && !doing_semantic_analysis_p ())
 890     return;
 891
 892   /* Reuse or create a struct for this binding level.  */
 893 #if defined(DEBUG_CP_BINDING_LEVELS)
 894   if (0)
 895 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
 896   if (free_binding_level)
 897 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
 898     {
 899       newlevel = free_binding_level;
 900       free_binding_level = free_binding_level->level_chain;
 901     }
 902   else
 903     newlevel = make_binding_level ();
 904
 905   push_binding_level (newlevel, tag_transparent, keep_next_level_flag);
 906   GNU_xref_start_scope ((HOST_WIDE_INT) newlevel);
 907   keep_next_level_flag = 0;
 908 }
 909
 910 /* Enter a new scope.  The KIND indicates what kind of scope is being
 911    created.  */
 912
 913 void
 914 begin_scope (sk)
 915      scope_kind sk;
 916 {
 917   pushlevel (0);
 918
 919   switch (sk)
 920     {
 921     case sk_template_spec:
 922       current_binding_level->template_spec_p = 1;
 923       /* Fall through.  */
 924
 925     case sk_template_parms:
 926       current_binding_level->template_parms_p = 1;
 927       break;
 928
 929     default:
 930       my_friendly_abort (20000309);
 931     }
 932 }
 933
 934 /* Exit the current scope.  */
 935
 936 void
 937 finish_scope ()
 938 {
 939   poplevel (0, 0, 0);
 940 }
 941
 942 void
 943 note_level_for_for ()
 944 {
 945   current_binding_level->is_for_scope = 1;
 946 }
 947
 948 /* Record that the current binding level represents a try block.  */
 949
 950 void
 951 note_level_for_eh ()
 952 {
 953   current_binding_level->eh_region = 1;
 954 }
 955
 956 /* For a binding between a name and an entity at a block scope,
 957    this is the `struct binding_level' for the block.  */
 958 #define BINDING_LEVEL(NODE) \
 959    (((struct tree_binding*)NODE)->scope.level)
 960
 961 /* Make DECL the innermost binding for ID.  The LEVEL is the binding
 962    level at which this declaration is being bound.  */
 963
 964 static void
 965 push_binding (id, decl, level)
 966      tree id;
 967      tree decl;
 968      struct binding_level* level;
 969 {
 970   tree binding;
 971
 972   binding = make_node (CPLUS_BINDING);
 973
 974   /* Now, fill in the binding information.  */
 975   BINDING_VALUE (binding) = decl;
 976   BINDING_TYPE (binding) = NULL_TREE;
 977   BINDING_LEVEL (binding) = level;
 978   INHERITED_VALUE_BINDING_P (binding) = 0;
 979   LOCAL_BINDING_P (binding) = (level != class_binding_level);
 980   BINDING_HAS_LEVEL_P (binding) = 1;
 981
 982   /* And put it on the front of the list of bindings for ID.  */
 983   TREE_CHAIN (binding) = IDENTIFIER_BINDING (id);
 984   IDENTIFIER_BINDING (id) = binding;
 985 }
 986
 987 /* ID is already bound in the current scope.  But, DECL is an
 988    additional binding for ID in the same scope.  This is the `struct
 989    stat' hack whereby a non-typedef class-name or enum-name can be
 990    bound at the same level as some other kind of entity.  It's the
 991    responsibility of the caller to check that inserting this name is
 992    legal here.  Returns nonzero if the new binding was successful.  */
 993 static int
 994 add_binding (id, decl)
 995      tree id;
 996      tree decl;
 997 {
 998   tree binding = IDENTIFIER_BINDING (id);
 999   int ok = 1;
1000
1001   if (TREE_CODE (decl) == TYPE_DECL && DECL_ARTIFICIAL (decl))
1002     /* The new name is the type name.  */
1003     BINDING_TYPE (binding) = decl;
1004   else if (!BINDING_VALUE (binding))
1005     /* This situation arises when push_class_level_binding moves an
1006        inherited type-binding out of the way to make room for a new
1007        value binding.  */
1008     BINDING_VALUE (binding) = decl;
1009   else if (TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
1010            && DECL_ARTIFICIAL (BINDING_VALUE (binding)))
1011     {
1012       /* The old binding was a type name.  It was placed in
1013          BINDING_VALUE because it was thought, at the point it was
1014          declared, to be the only entity with such a name.  Move the
1015          type name into the type slot; it is now hidden by the new
1016          binding.  */
1017       BINDING_TYPE (binding) = BINDING_VALUE (binding);
1018       BINDING_VALUE (binding) = decl;
1019       INHERITED_VALUE_BINDING_P (binding) = 0;
1020     }
1021   else if (TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
1022            && TREE_CODE (decl) == TYPE_DECL
1023            && DECL_NAME (decl) == DECL_NAME (BINDING_VALUE (binding))
1024            && same_type_p (TREE_TYPE (decl),
1025                            TREE_TYPE (BINDING_VALUE (binding))))
1026     /* We have two typedef-names, both naming the same type to have
1027        the same name.  This is OK because of:
1028
1029          [dcl.typedef]
1030
1031          In a given scope, a typedef specifier can be used to redefine
1032          the name of any type declared in that scope to refer to the
1033          type to which it already refers.  */
1034     ok = 0;
1035   /* There can be two block-scope declarations of the same variable,
1036      so long as they are `extern' declarations.  */
1037   else if (TREE_CODE (decl) == VAR_DECL
1038            && TREE_CODE (BINDING_VALUE (binding)) == VAR_DECL
1039            && DECL_EXTERNAL (decl)
1040            && DECL_EXTERNAL (BINDING_VALUE (binding)))
1041     {
1042       duplicate_decls (decl, BINDING_VALUE (binding));
1043       ok = 0;
1044     }
1045   else
1046     {
1047       cp_error ("declaration of `%#D'", decl);
1048       cp_error_at ("conflicts with previous declaration `%#D'",
1049                    BINDING_VALUE (binding));
1050       ok = 0;
1051     }
1052
1053   return ok;
1054 }
1055
1056 /* Add DECL to the list of things declared in B.  */
1057
1058 static void
1059 add_decl_to_level (decl, b)
1060      tree decl;
1061      struct binding_level *b;
1062 {
1063   /* We build up the list in reverse order, and reverse it later if
1064      necessary.  */
1065   TREE_CHAIN (decl) = b->names;
1066   b->names = decl;
1067 }
1068
1069 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1070    binding level.  If PUSH_USING is set in FLAGS, we know that DECL
1071    doesn't really belong to this binding level, that it got here
1072    through a using-declaration.  */
1073
1074 void
1075 push_local_binding (id, decl, flags)
1076      tree id;
1077      tree decl;
1078      int flags;
1079 {
1080   struct binding_level *b;
1081
1082   /* Skip over any local classes.  This makes sense if we call
1083      push_local_binding with a friend decl of a local class.  */
1084   b = current_binding_level;
1085   while (b->parm_flag == 2)
1086     b = b->level_chain;
1087
1088   if (lookup_name_current_level (id))
1089     {
1090       /* Supplement the existing binding.  */
1091       if (!add_binding (id, decl))
1092         /* It didn't work.  Something else must be bound at this
1093            level.  Do not add DECL to the list of things to pop
1094            later.  */
1095         return;
1096     }
1097   else
1098     /* Create a new binding.  */
1099     push_binding (id, decl, b);
1100
1101   if (TREE_CODE (decl) == OVERLOAD || (flags & PUSH_USING))
1102     /* We must put the OVERLOAD into a TREE_LIST since the
1103        TREE_CHAIN of an OVERLOAD is already used.  Similarly for
1104        decls that got here through a using-declaration.  */
1105     decl = build_tree_list (NULL_TREE, decl);
1106
1107   /* And put DECL on the list of things declared by the current
1108      binding level.  */
1109   add_decl_to_level (decl, b);
1110 }
1111
1112 /* Bind DECL to ID in the class_binding_level.  Returns nonzero if the
1113    binding was successful.  */
1114
1115 int
1116 push_class_binding (id, decl)
1117      tree id;
1118      tree decl;
1119 {
1120   int result = 1;
1121   tree binding = IDENTIFIER_BINDING (id);
1122   tree context;
1123
1124   /* Note that we declared this value so that we can issue an error if
1125      this an illegal redeclaration of a name already used for some
1126      other purpose.  */
1127   note_name_declared_in_class (id, decl);
1128
1129   if (binding && BINDING_LEVEL (binding) == class_binding_level)
1130     /* Supplement the existing binding.  */
1131     result = add_binding (id, decl);
1132   else
1133     /* Create a new binding.  */
1134     push_binding (id, decl, class_binding_level);
1135
1136   /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1137      class-level declaration.  Note that we do not use DECL here
1138      because of the possibility of the `struct stat' hack; if DECL is
1139      a class-name or enum-name we might prefer a field-name, or some
1140      such.  */
1141   IDENTIFIER_CLASS_VALUE (id) = BINDING_VALUE (IDENTIFIER_BINDING (id));
1142
1143   /* If this is a binding from a base class, mark it as such.  */
1144   binding = IDENTIFIER_BINDING (id);
1145   if (BINDING_VALUE (binding) == decl && TREE_CODE (decl) != TREE_LIST)
1146     {
1147       /* Any implicit typename must be from a base-class.  The
1148          context for an implicit typename declaration is always
1149          the derived class in which the lookup was done, so the checks
1150          based on the context of DECL below will not trigger.  */
1151       if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl))
1152         INHERITED_VALUE_BINDING_P (binding) = 1;
1153       else
1154         {
1155           if (TREE_CODE (decl) == OVERLOAD)
1156             context = CP_DECL_CONTEXT (OVL_CURRENT (decl));
1157           else
1158             {
1159               my_friendly_assert (DECL_P (decl), 0);
1160               context = CP_DECL_CONTEXT (decl);
1161             }
1162
1163           if (is_properly_derived_from (current_class_type, context))
1164             INHERITED_VALUE_BINDING_P (binding) = 1;
1165           else
1166             INHERITED_VALUE_BINDING_P (binding) = 0;
1167         }
1168     }
1169   else if (BINDING_VALUE (binding) == decl)
1170     /* We only encounter a TREE_LIST when push_class_decls detects an
1171        ambiguity.  Such an ambiguity can be overridden by a definition
1172        in this class.  */
1173     INHERITED_VALUE_BINDING_P (binding) = 1;
1174
1175   return result;
1176 }
1177
1178 /* Remove the binding for DECL which should be the innermost binding
1179    for ID.  */
1180
1181 static void
1182 pop_binding (id, decl)
1183      tree id;
1184      tree decl;
1185 {
1186   tree binding;
1187
1188   if (id == NULL_TREE)
1189     /* It's easiest to write the loops that call this function without
1190        checking whether or not the entities involved have names.  We
1191        get here for such an entity.  */
1192     return;
1193
1194   /* Get the innermost binding for ID.  */
1195   binding = IDENTIFIER_BINDING (id);
1196
1197   /* The name should be bound.  */
1198   my_friendly_assert (binding != NULL_TREE, 0);
1199
1200   /* The DECL will be either the ordinary binding or the type
1201      binding for this identifier.  Remove that binding.  */
1202   if (BINDING_VALUE (binding) == decl)
1203     BINDING_VALUE (binding) = NULL_TREE;
1204   else if (BINDING_TYPE (binding) == decl)
1205     BINDING_TYPE (binding) = NULL_TREE;
1206   else
1207     my_friendly_abort (0);
1208
1209   if (!BINDING_VALUE (binding) && !BINDING_TYPE (binding))
1210     /* We're completely done with the innermost binding for this
1211        identifier.  Unhook it from the list of bindings.  */
1212     IDENTIFIER_BINDING (id) = TREE_CHAIN (binding);
1213 }
1214
1215 /* When a label goes out of scope, check to see if that label was used
1216    in a valid manner, and issue any appropriate warnings or errors.  */
1217
1218 static void
1219 pop_label (label, old_value)
1220      tree label;
1221      tree old_value;
1222 {
1223   if (!processing_template_decl && doing_semantic_analysis_p ())
1224     {
1225       if (DECL_INITIAL (label) == NULL_TREE)
1226         {
1227           cp_error_at ("label `%D' used but not defined", label);
1228           /* Avoid crashing later.  */
1229           define_label (input_filename, 1, DECL_NAME (label));
1230         }
1231       else if (warn_unused_label && !TREE_USED (label))
1232         cp_warning_at ("label `%D' defined but not used", label);
1233     }
1234
1235   SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label), old_value);
1236 }
1237
1238 /* At the end of a function, all labels declared within the fucntion
1239    go out of scope.  BLOCK is the top-level block for the
1240    function.  */
1241
1242 static void
1243 pop_labels (block)
1244      tree block;
1245 {
1246   struct named_label_list *link;
1247
1248   /* Clear out the definitions of all label names, since their scopes
1249      end here.  */
1250   for (link = named_labels; link; link = link->next)
1251     {
1252       pop_label (link->label_decl, link->old_value);
1253       /* Put the labels into the "variables" of the top-level block,
1254          so debugger can see them.  */
1255       TREE_CHAIN (link->label_decl) = BLOCK_VARS (block);
1256       BLOCK_VARS (block) = link->label_decl;
1257     }
1258
1259   named_labels = NULL;
1260 }
1261
1262 /* Exit a binding level.
1263    Pop the level off, and restore the state of the identifier-decl mappings
1264    that were in effect when this level was entered.
1265
1266    If KEEP == 1, this level had explicit declarations, so
1267    and create a "block" (a BLOCK node) for the level
1268    to record its declarations and subblocks for symbol table output.
1269
1270    If FUNCTIONBODY is nonzero, this level is the body of a function,
1271    so create a block as if KEEP were set and also clear out all
1272    label names.
1273
1274    If REVERSE is nonzero, reverse the order of decls before putting
1275    them into the BLOCK.  */
1276
1277 tree
1278 poplevel (keep, reverse, functionbody)
1279      int keep;
1280      int reverse;
1281      int functionbody;
1282 {
1283   register tree link;
1284   /* The chain of decls was accumulated in reverse order.
1285      Put it into forward order, just for cleanliness.  */
1286   tree decls;
1287   int tmp = functionbody;
1288   int real_functionbody;
1289   tree tags;
1290   tree subblocks;
1291   tree block = NULL_TREE;
1292   tree decl;
1293   int block_previously_created;
1294   int leaving_for_scope;
1295
1296   if (cfun && !doing_semantic_analysis_p ())
1297     return NULL_TREE;
1298
1299   my_friendly_assert (current_binding_level->parm_flag != 2,
1300                       19990916);
1301
1302   real_functionbody = (current_binding_level->keep == 2
1303                        ? ((functionbody = 0), tmp) : functionbody);
1304   tags = functionbody >= 0 ? current_binding_level->tags : 0;
1305   subblocks = functionbody >= 0 ? current_binding_level->blocks : 0;
1306
1307   my_friendly_assert (!current_binding_level->class_shadowed,
1308                       19990414);
1309
1310   /* We used to use KEEP == 2 to indicate that the new block should go
1311      at the beginning of the list of blocks at this binding level,
1312      rather than the end.  This hack is no longer used.  */
1313   my_friendly_assert (keep == 0 || keep == 1, 0);
1314
1315   GNU_xref_end_scope ((HOST_WIDE_INT) current_binding_level,
1316                       (HOST_WIDE_INT) current_binding_level->level_chain,
1317                       current_binding_level->parm_flag,
1318                       current_binding_level->keep);
1319
1320   if (current_binding_level->keep == 1)
1321     keep = 1;
1322
1323   /* Any uses of undefined labels, and any defined labels, now operate
1324      under constraints of next binding contour.  */
1325   if (cfun && !functionbody)
1326     {
1327       struct binding_level *level_chain;
1328       level_chain = current_binding_level->level_chain;
1329       if (level_chain)
1330         {
1331           struct named_label_use_list *uses;
1332           struct named_label_list *labels;
1333           for (labels = named_labels; labels; labels = labels->next)
1334             if (labels->binding_level == current_binding_level)
1335               {
1336                 tree decl;
1337                 if (current_binding_level->eh_region)
1338                   labels->eh_region = 1;
1339                 for (decl = labels->names_in_scope; decl;
1340                      decl = TREE_CHAIN (decl))
1341                   if (decl_jump_unsafe (decl))
1342                     labels->bad_decls = tree_cons (NULL_TREE, decl,
1343                                                    labels->bad_decls);
1344                 labels->binding_level = level_chain;
1345                 labels->names_in_scope = level_chain->names;
1346               }
1347
1348           for (uses = named_label_uses; uses; uses = uses->next)
1349             if (uses->binding_level == current_binding_level)
1350               {
1351                 uses->binding_level = level_chain;
1352                 uses->names_in_scope = level_chain->names;
1353               }
1354         }
1355     }
1356
1357   /* Get the decls in the order they were written.
1358      Usually current_binding_level->names is in reverse order.
1359      But parameter decls were previously put in forward order.  */
1360
1361   if (reverse)
1362     current_binding_level->names
1363       = decls = nreverse (current_binding_level->names);
1364   else
1365     decls = current_binding_level->names;
1366
1367   /* Output any nested inline functions within this block
1368      if they weren't already output.  */
1369   for (decl = decls; decl; decl = TREE_CHAIN (decl))
1370     if (TREE_CODE (decl) == FUNCTION_DECL
1371         && ! TREE_ASM_WRITTEN (decl)
1372         && DECL_INITIAL (decl) != NULL_TREE
1373         && TREE_ADDRESSABLE (decl)
1374         && decl_function_context (decl) == current_function_decl)
1375       {
1376         /* If this decl was copied from a file-scope decl
1377            on account of a block-scope extern decl,
1378            propagate TREE_ADDRESSABLE to the file-scope decl.  */
1379         if (DECL_ABSTRACT_ORIGIN (decl) != NULL_TREE)
1380           TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl)) = 1;
1381         else
1382           {
1383             push_function_context ();
1384             output_inline_function (decl);
1385             pop_function_context ();
1386           }
1387       }
1388
1389   /* When not in function-at-a-time mode, expand_end_bindings will
1390      warn about unused variables.  But, in function-at-a-time mode
1391      expand_end_bindings is not passed the list of variables in the
1392      current scope, and therefore no warning is emitted.  So, we
1393      explicitly warn here.  */
1394   if (!processing_template_decl)
1395     warn_about_unused_variables (getdecls ());
1396
1397   /* If there were any declarations or structure tags in that level,
1398      or if this level is a function body,
1399      create a BLOCK to record them for the life of this function.  */
1400   block = NULL_TREE;
1401   block_previously_created = (current_binding_level->this_block != NULL_TREE);
1402   if (block_previously_created)
1403     block = current_binding_level->this_block;
1404   else if (keep == 1 || functionbody)
1405     block = make_node (BLOCK);
1406   if (block != NULL_TREE)
1407     {
1408       if (block_previously_created)
1409         {
1410           if (decls || tags || subblocks)
1411             {
1412               if (BLOCK_VARS (block))
1413                 warning ("internal compiler error: debugging info corrupted");
1414
1415               BLOCK_VARS (block) = decls;
1416
1417               /* We can have previous subblocks and new subblocks when
1418                  doing fixup_gotos with complex cleanups.  We chain the new
1419                  subblocks onto the end of any pre-existing subblocks.  */
1420               BLOCK_SUBBLOCKS (block) = chainon (BLOCK_SUBBLOCKS (block),
1421                                                  subblocks);
1422             }
1423         }
1424       else
1425         {
1426           BLOCK_VARS (block) = decls;
1427           BLOCK_SUBBLOCKS (block) = subblocks;
1428         }
1429     }
1430
1431   /* In each subblock, record that this is its superior.  */
1432   if (keep >= 0)
1433     for (link = subblocks; link; link = TREE_CHAIN (link))
1434       BLOCK_SUPERCONTEXT (link) = block;
1435
1436   /* We still support the old for-scope rules, whereby the variables
1437      in a for-init statement were in scope after the for-statement
1438      ended.  We only use the new rules in flag_new_for_scope is
1439      nonzero.  */
1440   leaving_for_scope
1441     = current_binding_level->is_for_scope && flag_new_for_scope == 1;
1442
1443   /* Remove declarations for all the DECLs in this level.  */
1444   for (link = decls; link; link = TREE_CHAIN (link))
1445     {
1446       if (leaving_for_scope && TREE_CODE (link) == VAR_DECL)
1447         {
1448           tree outer_binding
1449             = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link)));
1450           tree ns_binding;
1451
1452           if (!outer_binding)
1453             ns_binding = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link));
1454           else
1455             ns_binding = NULL_TREE;
1456
1457           if (outer_binding
1458               && (BINDING_LEVEL (outer_binding)
1459                   == current_binding_level->level_chain))
1460             /* We have something like:
1461
1462                  int i;
1463                  for (int i; ;);
1464
1465                and we are leaving the `for' scope.  There's no reason to
1466                keep the binding of the inner `i' in this case.  */
1467             pop_binding (DECL_NAME (link), link);
1468           else if ((outer_binding
1469                     && (TREE_CODE (BINDING_VALUE (outer_binding))
1470                         == TYPE_DECL))
1471                    || (ns_binding
1472                        && TREE_CODE (ns_binding) == TYPE_DECL))
1473             /* Here, we have something like:
1474
1475                  typedef int I;
1476
1477                  void f () {
1478                    for (int I; ;);
1479                  }
1480
1481                We must pop the for-scope binding so we know what's a
1482                type and what isn't.  */
1483             pop_binding (DECL_NAME (link), link);
1484           else
1485             {
1486               /* Mark this VAR_DECL as dead so that we can tell we left it
1487                  there only for backward compatibility.  */
1488               DECL_DEAD_FOR_LOCAL (link) = 1;
1489
1490               /* Keep track of what should of have happenned when we
1491                  popped the binding.  */
1492               if (outer_binding && BINDING_VALUE (outer_binding))
1493                 DECL_SHADOWED_FOR_VAR (link)
1494                   = BINDING_VALUE (outer_binding);
1495
1496               /* Add it to the list of dead variables in the next
1497                  outermost binding to that we can remove these when we
1498                  leave that binding.  */
1499               current_binding_level->level_chain->dead_vars_from_for
1500                 = tree_cons (NULL_TREE, link,
1501                              current_binding_level->level_chain->
1502                              dead_vars_from_for);
1503
1504               /* Although we don't pop the CPLUS_BINDING, we do clear
1505                  its BINDING_LEVEL since the level is going away now.  */
1506               BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link)))
1507                 = 0;
1508             }
1509         }
1510       else
1511         {
1512           /* Remove the binding.  */
1513           decl = link;
1514           if (TREE_CODE (decl) == TREE_LIST)
1515             decl = TREE_VALUE (decl);
1516           if (DECL_P (decl))
1517             pop_binding (DECL_NAME (decl), decl);
1518           else if (TREE_CODE (decl) == OVERLOAD)
1519             pop_binding (DECL_NAME (OVL_FUNCTION (decl)), decl);
1520           else
1521             my_friendly_abort (0);
1522         }
1523     }
1524
1525   /* Remove declarations for any `for' variables from inner scopes
1526      that we kept around.  */
1527   for (link = current_binding_level->dead_vars_from_for;
1528        link; link = TREE_CHAIN (link))
1529     pop_binding (DECL_NAME (TREE_VALUE (link)), TREE_VALUE (link));
1530
1531   /* Restore the IDENTIFIER_TYPE_VALUEs.  */
1532   for (link = current_binding_level->type_shadowed;
1533        link; link = TREE_CHAIN (link))
1534     SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link), TREE_VALUE (link));
1535
1536   /* Restore the IDENTIFIER_LABEL_VALUEs for local labels.  */
1537   for (link = current_binding_level->shadowed_labels;
1538        link;
1539        link = TREE_CHAIN (link))
1540     pop_label (TREE_VALUE (link), TREE_PURPOSE (link));
1541
1542   /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1543      list if a `using' declaration put them there.  The debugging
1544      back-ends won't understand OVERLOAD, so we remove them here.
1545      Because the BLOCK_VARS are (temporarily) shared with
1546      CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1547      popped all the bindings.  */
1548   if (block)
1549     {
1550       tree* d;
1551
1552       for (d = &BLOCK_VARS (block); *d; )
1553         {
1554           if (TREE_CODE (*d) == TREE_LIST)
1555             *d = TREE_CHAIN (*d);
1556           else
1557             d = &TREE_CHAIN (*d);
1558         }
1559     }
1560
1561   /* If the level being exited is the top level of a function,
1562      check over all the labels.  */
1563   if (functionbody)
1564     {
1565       /* Since this is the top level block of a function, the vars are
1566          the function's parameters.  Don't leave them in the BLOCK
1567          because they are found in the FUNCTION_DECL instead.  */
1568       BLOCK_VARS (block) = 0;
1569       pop_labels (block);
1570     }
1571
1572   tmp = current_binding_level->keep;
1573
1574   pop_binding_level ();
1575   if (functionbody)
1576     DECL_INITIAL (current_function_decl) = block;
1577   else if (block)
1578     {
1579       if (!block_previously_created)
1580         current_binding_level->blocks
1581           = chainon (current_binding_level->blocks, block);
1582     }
1583   /* If we did not make a block for the level just exited,
1584      any blocks made for inner levels
1585      (since they cannot be recorded as subblocks in that level)
1586      must be carried forward so they will later become subblocks
1587      of something else.  */
1588   else if (subblocks)
1589     current_binding_level->blocks
1590       = chainon (current_binding_level->blocks, subblocks);
1591
1592   /* Each and every BLOCK node created here in `poplevel' is important
1593      (e.g. for proper debugging information) so if we created one
1594      earlier, mark it as "used".  */
1595   if (block)
1596     TREE_USED (block) = 1;
1597
1598   /* Take care of compiler's internal binding structures.  */
1599   if (tmp == 2)
1600     {
1601       tree scope_stmts;
1602
1603       scope_stmts
1604         = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1605       if (block)
1606         {
1607           SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts)) = block;
1608           SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts)) = block;
1609         }
1610
1611       block = poplevel (keep, reverse, functionbody);
1612     }
1613
1614   return block;
1615 }
1616
1617 /* Delete the node BLOCK from the current binding level.
1618    This is used for the block inside a stmt expr ({...})
1619    so that the block can be reinserted where appropriate.  */
1620
1621 void
1622 delete_block (block)
1623      tree block;
1624 {
1625   tree t;
1626   if (current_binding_level->blocks == block)
1627     current_binding_level->blocks = TREE_CHAIN (block);
1628   for (t = current_binding_level->blocks; t;)
1629     {
1630       if (TREE_CHAIN (t) == block)
1631         TREE_CHAIN (t) = TREE_CHAIN (block);
1632       else
1633         t = TREE_CHAIN (t);
1634     }
1635   TREE_CHAIN (block) = NULL_TREE;
1636   /* Clear TREE_USED which is always set by poplevel.
1637      The flag is set again if insert_block is called.  */
1638   TREE_USED (block) = 0;
1639 }
1640
1641 /* Insert BLOCK at the end of the list of subblocks of the
1642    current binding level.  This is used when a BIND_EXPR is expanded,
1643    to handle the BLOCK node inside the BIND_EXPR.  */
1644
1645 void
1646 insert_block (block)
1647      tree block;
1648 {
1649   TREE_USED (block) = 1;
1650   current_binding_level->blocks
1651     = chainon (current_binding_level->blocks, block);
1652 }
1653
1654 /* Set the BLOCK node for the innermost scope
1655    (the one we are currently in).  */
1656
1657 void
1658 set_block (block)
1659     register tree block;
1660 {
1661   current_binding_level->this_block = block;
1662 }
1663
1664 /* Do a pushlevel for class declarations.  */
1665
1666 void
1667 pushlevel_class ()
1668 {
1669   register struct binding_level *newlevel;
1670
1671   /* Reuse or create a struct for this binding level.  */
1672 #if defined(DEBUG_CP_BINDING_LEVELS)
1673   if (0)
1674 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1675   if (free_binding_level)
1676 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1677     {
1678       newlevel = free_binding_level;
1679       free_binding_level = free_binding_level->level_chain;
1680     }
1681   else
1682     newlevel = make_binding_level ();
1683
1684 #if defined(DEBUG_CP_BINDING_LEVELS)
1685   is_class_level = 1;
1686 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1687
1688   push_binding_level (newlevel, 0, 0);
1689
1690   class_binding_level = current_binding_level;
1691   class_binding_level->parm_flag = 2;
1692   class_binding_level->this_class = current_class_type;
1693 }
1694
1695 /* ...and a poplevel for class declarations.  */
1696
1697 void
1698 poplevel_class ()
1699 {
1700   register struct binding_level *level = class_binding_level;
1701   tree shadowed;
1702
1703   my_friendly_assert (level != 0, 354);
1704
1705   /* If we're leaving a toplevel class, don't bother to do the setting
1706      of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1707      shouldn't even be used when current_class_type isn't set, and second,
1708      if we don't touch it here, we're able to use the cache effect if the
1709      next time we're entering a class scope, it is the same class.  */
1710   if (current_class_depth != 1)
1711     {
1712       struct binding_level* b;
1713
1714       /* Clear out our IDENTIFIER_CLASS_VALUEs.  */
1715       for (shadowed = level->class_shadowed;
1716            shadowed;
1717            shadowed = TREE_CHAIN (shadowed))
1718         IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed)) = NULL_TREE;
1719
1720       /* Find the next enclosing class, and recreate
1721          IDENTIFIER_CLASS_VALUEs appropriate for that class.  */
1722       b = level->level_chain;
1723       while (b && b->parm_flag != 2)
1724         b = b->level_chain;
1725
1726       if (b)
1727         for (shadowed = b->class_shadowed;
1728              shadowed;
1729              shadowed = TREE_CHAIN (shadowed))
1730           {
1731             tree t;
1732
1733             t = IDENTIFIER_BINDING (TREE_PURPOSE (shadowed));
1734             while (t && BINDING_LEVEL (t) != b)
1735               t = TREE_CHAIN (t);
1736
1737             if (t)
1738               IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed))
1739                 = BINDING_VALUE (t);
1740           }
1741     }
1742   else
1743     /* Remember to save what IDENTIFIER's were bound in this scope so we
1744        can recover from cache misses.  */
1745     {
1746       previous_class_type = current_class_type;
1747       previous_class_values = class_binding_level->class_shadowed;
1748     }
1749   for (shadowed = level->type_shadowed;
1750        shadowed;
1751        shadowed = TREE_CHAIN (shadowed))
1752     SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed), TREE_VALUE (shadowed));
1753
1754   /* Remove the bindings for all of the class-level declarations.  */
1755   for (shadowed = level->class_shadowed;
1756        shadowed;
1757        shadowed = TREE_CHAIN (shadowed))
1758     pop_binding (TREE_PURPOSE (shadowed), TREE_TYPE (shadowed));
1759
1760   GNU_xref_end_scope ((HOST_WIDE_INT) class_binding_level,
1761                       (HOST_WIDE_INT) class_binding_level->level_chain,
1762                       class_binding_level->parm_flag,
1763                       class_binding_level->keep);
1764
1765   /* Now, pop out of the binding level which we created up in the
1766      `pushlevel_class' routine.  */
1767 #if defined(DEBUG_CP_BINDING_LEVELS)
1768   is_class_level = 1;
1769 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1770
1771   pop_binding_level ();
1772 }
1773
1774 /* We are entering the scope of a class.  Clear IDENTIFIER_CLASS_VALUE
1775    for any names in enclosing classes.  */
1776
1777 void
1778 clear_identifier_class_values ()
1779 {
1780   tree t;
1781
1782   if (!class_binding_level)
1783     return;
1784
1785   for (t = class_binding_level->class_shadowed;
1786        t;
1787        t = TREE_CHAIN (t))
1788     IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t)) = NULL_TREE;
1789 }
1790
1791 /* Returns non-zero if T is a virtual function table.  */
1792
1793 int
1794 vtable_decl_p (t, data)
1795      tree t;
1796      void *data ATTRIBUTE_UNUSED;
1797 {
1798   return (TREE_CODE (t) == VAR_DECL && DECL_VIRTUAL_P (t));
1799 }
1800
1801 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1802    functions.  */
1803
1804 int
1805 vtype_decl_p (t, data)
1806      tree t;
1807      void *data ATTRIBUTE_UNUSED;
1808 {
1809   return (TREE_CODE (t) == TYPE_DECL
1810           && TREE_CODE (TREE_TYPE (t)) == RECORD_TYPE
1811           && TYPE_POLYMORPHIC_P (TREE_TYPE (t)));
1812 }
1813
1814 /* Return the declarations that are members of the namespace NS.  */
1815
1816 tree
1817 cp_namespace_decls (ns)
1818      tree ns;
1819 {
1820   return NAMESPACE_LEVEL (ns)->names;
1821 }
1822
1823 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1824    itself, calling F for each.  The DATA is passed to F as well.  */
1825
1826 static int
1827 walk_namespaces_r (namespace, f, data)
1828      tree namespace;
1829      walk_namespaces_fn f;
1830      void *data;
1831 {
1832   tree current;
1833   int result = 0;
1834
1835   result |= (*f) (namespace, data);
1836
1837   for (current = cp_namespace_decls (namespace);
1838        current;
1839        current = TREE_CHAIN (current))
1840     {
1841       if (TREE_CODE (current) != NAMESPACE_DECL
1842           || DECL_NAMESPACE_ALIAS (current))
1843         continue;
1844       if (!DECL_LANG_SPECIFIC (current))
1845         {
1846           /* Hmm. std. */
1847           my_friendly_assert (current == std_node, 393);
1848           continue;
1849         }
1850
1851       /* We found a namespace.  */
1852       result |= walk_namespaces_r (current, f, data);
1853     }
1854
1855   return result;
1856 }
1857
1858 /* Walk all the namespaces, calling F for each.  The DATA is passed to
1859    F as well.  */
1860
1861 int
1862 walk_namespaces (f, data)
1863      walk_namespaces_fn f;
1864      void *data;
1865 {
1866   return walk_namespaces_r (global_namespace, f, data);
1867 }
1868
1869 struct walk_globals_data {
1870   walk_globals_pred p;
1871   walk_globals_fn f;
1872   void *data;
1873 };
1874
1875 /* Walk the global declarations in NAMESPACE.  Whenever one is found
1876    for which P returns non-zero, call F with its address.  If any call
1877    to F returns a non-zero value, return a non-zero value.  */
1878
1879 static int
1880 walk_globals_r (namespace, data)
1881      tree namespace;
1882      void *data;
1883 {
1884   struct walk_globals_data* wgd = (struct walk_globals_data *) data;
1885   walk_globals_pred p = wgd->p;
1886   walk_globals_fn f = wgd->f;
1887   void *d = wgd->data;
1888   tree *t;
1889   int result = 0;
1890
1891   t = &NAMESPACE_LEVEL (namespace)->names;
1892
1893   while (*t)
1894     {
1895       tree glbl = *t;
1896
1897       if ((*p) (glbl, d))
1898         result |= (*f) (t, d);
1899
1900       /* If F changed *T, then *T still points at the next item to
1901          examine.  */
1902       if (*t == glbl)
1903         t = &TREE_CHAIN (*t);
1904     }
1905
1906   return result;
1907 }
1908
1909 /* Walk the global declarations.  Whenever one is found for which P
1910    returns non-zero, call F with its address.  If any call to F
1911    returns a non-zero value, return a non-zero value.  */
1912
1913 int
1914 walk_globals (p, f, data)
1915      walk_globals_pred p;
1916      walk_globals_fn f;
1917      void *data;
1918 {
1919   struct walk_globals_data wgd;
1920   wgd.p = p;
1921   wgd.f = f;
1922   wgd.data = data;
1923
1924   return walk_namespaces (walk_globals_r, &wgd);
1925 }
1926
1927 /* Call wrapup_globals_declarations for the globals in NAMESPACE.  If
1928    DATA is non-NULL, this is the last time we will call
1929    wrapup_global_declarations for this NAMESPACE.  */
1930
1931 int
1932 wrapup_globals_for_namespace (namespace, data)
1933      tree namespace;
1934      void *data;
1935 {
1936   tree globals = cp_namespace_decls (namespace);
1937   int len = list_length (globals);
1938   tree *vec = (tree *) alloca (sizeof (tree) * len);
1939   int i;
1940   int result;
1941   tree decl;
1942   int last_time = (data != 0);
1943
1944   if (last_time && namespace == global_namespace)
1945     /* Let compile_file handle the global namespace.  */
1946     return 0;
1947
1948   /* Process the decls in reverse order--earliest first.
1949      Put them into VEC from back to front, then take out from front.  */
1950
1951   for (i = 0, decl = globals; i < len; i++, decl = TREE_CHAIN (decl))
1952     {
1953       /* Pretend we've output an unused static variable.  This ensures
1954          that the toplevel __FUNCTION__ etc won't be emitted, unless
1955          needed. */
1956       if (TREE_CODE (decl) == VAR_DECL && DECL_ARTIFICIAL (decl)
1957           && !TREE_PUBLIC (decl) && !TREE_USED (decl))
1958         {
1959           TREE_ASM_WRITTEN (decl) = 1;
1960           DECL_IGNORED_P (decl) = 1;
1961         }
1962       vec[len - i - 1] = decl;
1963     }
1964
1965   if (last_time)
1966     {
1967       check_global_declarations (vec, len);
1968       return 0;
1969     }
1970
1971   /* Temporarily mark vtables as external.  That prevents
1972      wrapup_global_declarations from writing them out; we must process
1973      them ourselves in finish_vtable_vardecl.  */
1974   for (i = 0; i < len; ++i)
1975     if (vtable_decl_p (vec[i], /*data=*/0) && !DECL_EXTERNAL (vec[i]))
1976       {
1977         DECL_NOT_REALLY_EXTERN (vec[i]) = 1;
1978         DECL_EXTERNAL (vec[i]) = 1;
1979       }
1980
1981   /* Write out any globals that need to be output.  */
1982   result = wrapup_global_declarations (vec, len);
1983
1984   /* Undo the hack to DECL_EXTERNAL above.  */
1985   for (i = 0; i < len; ++i)
1986     if (vtable_decl_p (vec[i], /*data=*/0)
1987         && DECL_NOT_REALLY_EXTERN (vec[i]))
1988       {
1989         DECL_NOT_REALLY_EXTERN (vec[i]) = 0;
1990         DECL_EXTERNAL (vec[i]) = 0;
1991       }
1992
1993   return result;
1994 }
1995
1996 \f
1997 /* Mark ARG (which is really a struct binding_level **) for GC.  */
1998
1999 static void
2000 mark_binding_level (arg)
2001      void *arg;
2002 {
2003   struct binding_level *lvl = *(struct binding_level **)arg;
2004
2005   for (; lvl; lvl = lvl->level_chain)
2006     {
2007       ggc_mark_tree (lvl->names);
2008       ggc_mark_tree (lvl->tags);
2009       ggc_mark_tree (lvl->usings);
2010       ggc_mark_tree (lvl->using_directives);
2011       ggc_mark_tree (lvl->class_shadowed);
2012       ggc_mark_tree (lvl->type_shadowed);
2013       ggc_mark_tree (lvl->shadowed_labels);
2014       ggc_mark_tree (lvl->blocks);
2015       ggc_mark_tree (lvl->this_block);
2016       ggc_mark_tree (lvl->this_class);
2017       ggc_mark_tree (lvl->incomplete);
2018       ggc_mark_tree (lvl->dead_vars_from_for);
2019     }
2020 }
2021
2022 static void
2023 mark_named_label_lists (labs, uses)
2024      void *labs;
2025      void *uses;
2026 {
2027   struct named_label_list *l = *(struct named_label_list **)labs;
2028   struct named_label_use_list *u = *(struct named_label_use_list **)uses;
2029
2030   for (; l; l = l->next)
2031     {
2032       ggc_mark (l);
2033       mark_binding_level (l->binding_level);
2034       ggc_mark_tree (l->old_value);
2035       ggc_mark_tree (l->label_decl);
2036       ggc_mark_tree (l->bad_decls);
2037     }
2038
2039   for (; u; u = u->next)
2040     ggc_mark (u);
2041 }
2042 \f
2043 /* For debugging.  */
2044 static int no_print_functions = 0;
2045 static int no_print_builtins = 0;
2046
2047 void
2048 print_binding_level (lvl)
2049      struct binding_level *lvl;
2050 {
2051   tree t;
2052   int i = 0, len;
2053   fprintf (stderr, " blocks=");
2054   fprintf (stderr, HOST_PTR_PRINTF, lvl->blocks);
2055   fprintf (stderr, " n_incomplete=%d parm_flag=%d keep=%d",
2056            list_length (lvl->incomplete), lvl->parm_flag, lvl->keep);
2057   if (lvl->tag_transparent)
2058     fprintf (stderr, " tag-transparent");
2059   if (lvl->more_cleanups_ok)
2060     fprintf (stderr, " more-cleanups-ok");
2061   if (lvl->have_cleanups)
2062     fprintf (stderr, " have-cleanups");
2063   fprintf (stderr, "\n");
2064   if (lvl->names)
2065     {
2066       fprintf (stderr, " names:\t");
2067       /* We can probably fit 3 names to a line?  */
2068       for (t = lvl->names; t; t = TREE_CHAIN (t))
2069         {
2070           if (no_print_functions && (TREE_CODE (t) == FUNCTION_DECL))
2071             continue;
2072           if (no_print_builtins
2073               && (TREE_CODE (t) == TYPE_DECL)
2074               && (!strcmp (DECL_SOURCE_FILE (t),"<built-in>")))
2075             continue;
2076
2077           /* Function decls tend to have longer names.  */
2078           if (TREE_CODE (t) == FUNCTION_DECL)
2079             len = 3;
2080           else
2081             len = 2;
2082           i += len;
2083           if (i > 6)
2084             {
2085               fprintf (stderr, "\n\t");
2086               i = len;
2087             }
2088           print_node_brief (stderr, "", t, 0);
2089           if (t == error_mark_node)
2090             break;
2091         }
2092       if (i)
2093         fprintf (stderr, "\n");
2094     }
2095   if (lvl->tags)
2096     {
2097       fprintf (stderr, " tags:\t");
2098       i = 0;
2099       for (t = lvl->tags; t; t = TREE_CHAIN (t))
2100         {
2101           if (TREE_PURPOSE (t) == NULL_TREE)
2102             len = 3;
2103           else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t)))
2104             len = 2;
2105           else
2106             len = 4;
2107           i += len;
2108           if (i > 5)
2109             {
2110               fprintf (stderr, "\n\t");
2111               i = len;
2112             }
2113           if (TREE_PURPOSE (t) == NULL_TREE)
2114             {
2115               print_node_brief (stderr, "<unnamed-typedef", TREE_VALUE (t), 0);
2116               fprintf (stderr, ">");
2117             }
2118           else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t)))
2119             print_node_brief (stderr, "", TREE_VALUE (t), 0);
2120           else
2121             {
2122               print_node_brief (stderr, "<typedef", TREE_PURPOSE (t), 0);
2123               print_node_brief (stderr, "", TREE_VALUE (t), 0);
2124               fprintf (stderr, ">");
2125             }
2126         }
2127       if (i)
2128         fprintf (stderr, "\n");
2129     }
2130   if (lvl->class_shadowed)
2131     {
2132       fprintf (stderr, " class-shadowed:");
2133       for (t = lvl->class_shadowed; t; t = TREE_CHAIN (t))
2134         {
2135           fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
2136         }
2137       fprintf (stderr, "\n");
2138     }
2139   if (lvl->type_shadowed)
2140     {
2141       fprintf (stderr, " type-shadowed:");
2142       for (t = lvl->type_shadowed; t; t = TREE_CHAIN (t))
2143         {
2144           fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
2145         }
2146       fprintf (stderr, "\n");
2147     }
2148 }
2149
2150 void
2151 print_other_binding_stack (stack)
2152      struct binding_level *stack;
2153 {
2154   struct binding_level *level;
2155   for (level = stack; level != global_binding_level; level = level->level_chain)
2156     {
2157       fprintf (stderr, "binding level ");
2158       fprintf (stderr, HOST_PTR_PRINTF, level);
2159       fprintf (stderr, "\n");
2160       print_binding_level (level);
2161     }
2162 }
2163
2164 void
2165 print_binding_stack ()
2166 {
2167   struct binding_level *b;
2168   fprintf (stderr, "current_binding_level=");
2169   fprintf (stderr, HOST_PTR_PRINTF, current_binding_level);
2170   fprintf (stderr, "\nclass_binding_level=");
2171   fprintf (stderr, HOST_PTR_PRINTF, class_binding_level);
2172   fprintf (stderr, "\nglobal_binding_level=");
2173   fprintf (stderr, HOST_PTR_PRINTF, global_binding_level);
2174   fprintf (stderr, "\n");
2175   if (class_binding_level)
2176     {
2177       for (b = class_binding_level; b; b = b->level_chain)
2178         if (b == current_binding_level)
2179           break;
2180       if (b)
2181         b = class_binding_level;
2182       else
2183         b = current_binding_level;
2184     }
2185   else
2186     b = current_binding_level;
2187   print_other_binding_stack (b);
2188   fprintf (stderr, "global:\n");
2189   print_binding_level (global_binding_level);
2190 }
2191
2192 /* Namespace binding access routines: The namespace_bindings field of
2193    the identifier is polymorphic, with three possible values:
2194    NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2195    indicating the BINDING_VALUE of global_namespace. */
2196
2197 /* Check whether the a binding for the name to scope is known.
2198    Assumes that the bindings of the name are already a list
2199    of bindings. Returns the binding found, or NULL_TREE. */
2200
2201 static tree
2202 find_binding (name, scope)
2203      tree name;
2204      tree scope;
2205 {
2206   tree iter, prev = NULL_TREE;
2207
2208   scope = ORIGINAL_NAMESPACE (scope);
2209
2210   for (iter = IDENTIFIER_NAMESPACE_BINDINGS (name); iter;
2211        iter = TREE_CHAIN (iter))
2212     {
2213       my_friendly_assert (TREE_CODE (iter) == CPLUS_BINDING, 374);
2214       if (BINDING_SCOPE (iter) == scope)
2215         {
2216           /* Move binding found to the front of the list, so
2217              subsequent lookups will find it faster. */
2218           if (prev)
2219             {
2220               TREE_CHAIN (prev) = TREE_CHAIN (iter);
2221               TREE_CHAIN (iter) = IDENTIFIER_NAMESPACE_BINDINGS (name);
2222               IDENTIFIER_NAMESPACE_BINDINGS (name) = iter;
2223             }
2224           return iter;
2225         }
2226       prev = iter;
2227     }
2228   return NULL_TREE;
2229 }
2230
2231 /* Always returns a binding for name in scope. If the
2232    namespace_bindings is not a list, convert it to one first.
2233    If no binding is found, make a new one. */
2234
2235 tree
2236 binding_for_name (name, scope)
2237      tree name;
2238      tree scope;
2239 {
2240   tree b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2241   tree result;
2242
2243   scope = ORIGINAL_NAMESPACE (scope);
2244
2245   if (b && TREE_CODE (b) != CPLUS_BINDING)
2246     {
2247       /* Get rid of optimization for global scope. */
2248       IDENTIFIER_NAMESPACE_BINDINGS (name) = NULL_TREE;
2249       BINDING_VALUE (binding_for_name (name, global_namespace)) = b;
2250       b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2251     }
2252   if (b && (result = find_binding (name, scope)))
2253     return result;
2254   /* Not found, make a new one. */
2255   result = make_node (CPLUS_BINDING);
2256   TREE_CHAIN (result) = b;
2257   IDENTIFIER_NAMESPACE_BINDINGS (name) = result;
2258   BINDING_SCOPE (result) = scope;
2259   BINDING_TYPE (result) = NULL_TREE;
2260   BINDING_VALUE (result) = NULL_TREE;
2261   return result;
2262 }
2263
2264 /* Return the binding value for name in scope, considering that
2265    namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2266
2267 tree
2268 namespace_binding (name, scope)
2269      tree name;
2270      tree scope;
2271 {
2272   tree b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2273   if (b == NULL_TREE)
2274     return NULL_TREE;
2275   if (scope == NULL_TREE)
2276     scope = global_namespace;
2277   if (TREE_CODE (b) != CPLUS_BINDING)
2278     return (scope == global_namespace) ? b : NULL_TREE;
2279   name = find_binding (name,scope);
2280   if (name == NULL_TREE)
2281     return name;
2282   return BINDING_VALUE (name);
2283 }
2284
2285 /* Set the binding value for name in scope. If modifying the binding
2286    of global_namespace is attempted, try to optimize it. */
2287
2288 void
2289 set_namespace_binding (name, scope, val)
2290      tree name;
2291      tree scope;
2292      tree val;
2293 {
2294   tree b;
2295
2296   if (scope == NULL_TREE)
2297     scope = global_namespace;
2298
2299   if (scope == global_namespace)
2300     {
2301       b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2302       if (b == NULL_TREE || TREE_CODE (b) != CPLUS_BINDING)
2303         {
2304           IDENTIFIER_NAMESPACE_BINDINGS (name) = val;
2305           return;
2306         }
2307     }
2308   b = binding_for_name (name, scope);
2309   BINDING_VALUE (b) = val;
2310 }
2311
2312 /* Push into the scope of the NAME namespace.  If NAME is NULL_TREE, then we
2313    select a name that is unique to this compilation unit.  */
2314
2315 void
2316 push_namespace (name)
2317      tree name;
2318 {
2319   tree d = NULL_TREE;
2320   int need_new = 1;
2321   int implicit_use = 0;
2322   int global = 0;
2323   if (!global_namespace)
2324     {
2325       /* This must be ::. */
2326       my_friendly_assert (name == get_identifier ("::"), 377);
2327       global = 1;
2328     }
2329   else if (!name)
2330     {
2331       /* The name of anonymous namespace is unique for the translation
2332          unit.  */
2333       if (!anonymous_namespace_name)
2334         anonymous_namespace_name = get_file_function_name ('N');
2335       name = anonymous_namespace_name;
2336       d = IDENTIFIER_NAMESPACE_VALUE (name);
2337       if (d)
2338         /* Reopening anonymous namespace.  */
2339         need_new = 0;
2340       implicit_use = 1;
2341     }
2342   else if (current_namespace == global_namespace
2343            && name == DECL_NAME (std_node))
2344     {
2345       in_std++;
2346       return;
2347     }
2348   else
2349     {
2350       /* Check whether this is an extended namespace definition. */
2351       d = IDENTIFIER_NAMESPACE_VALUE (name);
2352       if (d != NULL_TREE && TREE_CODE (d) == NAMESPACE_DECL)
2353         {
2354           need_new = 0;
2355           if (DECL_NAMESPACE_ALIAS (d))
2356             {
2357               cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2358                         d, DECL_NAMESPACE_ALIAS (d));
2359               d = DECL_NAMESPACE_ALIAS (d);
2360             }
2361         }
2362     }
2363
2364   if (need_new)
2365     {
2366       /* Make a new namespace, binding the name to it. */
2367       d = build_lang_decl (NAMESPACE_DECL, name, void_type_node);
2368       /* The global namespace is not pushed, and the global binding
2369          level is set elsewhere.  */
2370       if (!global)
2371         {
2372           d = pushdecl (d);
2373           pushlevel (0);
2374           declare_namespace_level ();
2375           NAMESPACE_LEVEL (d) = current_binding_level;
2376         }
2377     }
2378   else
2379     resume_binding_level (NAMESPACE_LEVEL (d));
2380
2381   if (implicit_use)
2382     do_using_directive (d);
2383   /* Enter the name space. */
2384   current_namespace = d;
2385 }
2386
2387 /* Pop from the scope of the current namespace.  */
2388
2389 void
2390 pop_namespace ()
2391 {
2392   if (current_namespace == global_namespace)
2393     {
2394       my_friendly_assert (in_std>0, 980421);
2395       in_std--;
2396       return;
2397     }
2398   current_namespace = CP_DECL_CONTEXT (current_namespace);
2399   /* The binding level is not popped, as it might be re-opened later.  */
2400   suspend_binding_level ();
2401 }
2402
2403 /* Push into the scope of the namespace NS, even if it is deeply
2404    nested within another namespace.  */
2405
2406 void
2407 push_nested_namespace (ns)
2408      tree ns;
2409 {
2410   if (ns == global_namespace)
2411     push_to_top_level ();
2412   else
2413     {
2414       push_nested_namespace (CP_DECL_CONTEXT (ns));
2415       push_namespace (DECL_NAME (ns));
2416     }
2417 }
2418
2419 /* Pop back from the scope of the namespace NS, which was previously
2420    entered with push_nested_namespace.  */
2421
2422 void
2423 pop_nested_namespace (ns)
2424      tree ns;
2425 {
2426   while (ns != global_namespace)
2427     {
2428       pop_namespace ();
2429       ns = CP_DECL_CONTEXT (ns);
2430     }
2431
2432   pop_from_top_level ();
2433 }
2434
2435 \f
2436 /* Subroutines for reverting temporarily to top-level for instantiation
2437    of templates and such.  We actually need to clear out the class- and
2438    local-value slots of all identifiers, so that only the global values
2439    are at all visible.  Simply setting current_binding_level to the global
2440    scope isn't enough, because more binding levels may be pushed.  */
2441 struct saved_scope *scope_chain;
2442
2443 /* Mark ST for GC.  */
2444
2445 static void
2446 mark_stmt_tree (st)
2447      struct stmt_tree *st;
2448 {
2449   ggc_mark_tree (st->x_last_stmt);
2450   ggc_mark_tree (st->x_last_expr_type);
2451 }
2452
2453 /* Mark ARG (which is really a struct saved_scope **) for GC.  */
2454
2455 static void
2456 mark_saved_scope (arg)
2457      void *arg;
2458 {
2459   struct saved_scope *t = *(struct saved_scope **)arg;
2460   while (t)
2461     {
2462       mark_binding_level (&t->class_bindings);
2463       ggc_mark_tree (t->old_bindings);
2464       ggc_mark_tree (t->old_namespace);
2465       ggc_mark_tree (t->class_name);
2466       ggc_mark_tree (t->class_type);
2467       ggc_mark_tree (t->access_specifier);
2468       ggc_mark_tree (t->function_decl);
2469       if (t->lang_base)
2470         ggc_mark_tree_varray (t->lang_base);
2471       ggc_mark_tree (t->lang_name);
2472       ggc_mark_tree (t->x_function_parms);
2473       ggc_mark_tree (t->template_parms);
2474       ggc_mark_tree (t->x_previous_class_type);
2475       ggc_mark_tree (t->x_previous_class_values);
2476       ggc_mark_tree (t->x_saved_tree);
2477       ggc_mark_tree (t->incomplete);
2478       ggc_mark_tree (t->lookups);
2479
2480       mark_stmt_tree (&t->x_stmt_tree);
2481       mark_binding_level (&t->bindings);
2482       t = t->prev;
2483     }
2484 }
2485
2486 static tree
2487 store_bindings (names, old_bindings)
2488      tree names, old_bindings;
2489 {
2490   tree t;
2491   for (t = names; t; t = TREE_CHAIN (t))
2492     {
2493       tree binding, t1, id;
2494
2495       if (TREE_CODE (t) == TREE_LIST)
2496         id = TREE_PURPOSE (t);
2497       else
2498         id = DECL_NAME (t);
2499
2500       if (!id
2501           /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2502              we have no IDENTIFIER_BINDING if we have left the class
2503              scope, but cached the class-level declarations.  */
2504           || !(IDENTIFIER_BINDING (id) || IDENTIFIER_CLASS_VALUE (id)))
2505         continue;
2506
2507       for (t1 = old_bindings; t1; t1 = TREE_CHAIN (t1))
2508         if (TREE_VEC_ELT (t1, 0) == id)
2509           goto skip_it;
2510
2511       binding = make_tree_vec (4);
2512
2513       if (id)
2514         {
2515           my_friendly_assert (TREE_CODE (id) == IDENTIFIER_NODE, 135);
2516           TREE_VEC_ELT (binding, 0) = id;
2517           TREE_VEC_ELT (binding, 1) = REAL_IDENTIFIER_TYPE_VALUE (id);
2518           TREE_VEC_ELT (binding, 2) = IDENTIFIER_BINDING (id);
2519           TREE_VEC_ELT (binding, 3) = IDENTIFIER_CLASS_VALUE (id);
2520           IDENTIFIER_BINDING (id) = NULL_TREE;
2521           IDENTIFIER_CLASS_VALUE (id) = NULL_TREE;
2522         }
2523       TREE_CHAIN (binding) = old_bindings;
2524       old_bindings = binding;
2525     skip_it:
2526       ;
2527     }
2528   return old_bindings;
2529 }
2530
2531 void
2532 maybe_push_to_top_level (pseudo)
2533      int pseudo;
2534 {
2535   struct saved_scope *s;
2536   struct binding_level *b;
2537   tree old_bindings;
2538   int need_pop;
2539
2540   s = (struct saved_scope *) xcalloc (1, sizeof (struct saved_scope));
2541
2542   b = scope_chain ? current_binding_level : 0;
2543
2544   /* If we're in the middle of some function, save our state.  */
2545   if (cfun)
2546     {
2547       need_pop = 1;
2548       push_function_context_to (NULL_TREE);
2549     }
2550   else
2551     need_pop = 0;
2552
2553   old_bindings = NULL_TREE;
2554   if (scope_chain && previous_class_type)
2555     old_bindings = store_bindings (previous_class_values, old_bindings);
2556
2557   /* Have to include global_binding_level, because class-level decls
2558      aren't listed anywhere useful.  */
2559   for (; b; b = b->level_chain)
2560     {
2561       tree t;
2562
2563       /* Template IDs are inserted into the global level. If they were
2564          inserted into namespace level, finish_file wouldn't find them
2565          when doing pending instantiations. Therefore, don't stop at
2566          namespace level, but continue until :: .  */
2567       if (b == global_binding_level || (pseudo && b->template_parms_p))
2568         break;
2569
2570       old_bindings = store_bindings (b->names, old_bindings);
2571       /* We also need to check class_shadowed to save class-level type
2572          bindings, since pushclass doesn't fill in b->names.  */
2573       if (b->parm_flag == 2)
2574         old_bindings = store_bindings (b->class_shadowed, old_bindings);
2575
2576       /* Unwind type-value slots back to top level.  */
2577       for (t = b->type_shadowed; t; t = TREE_CHAIN (t))
2578         SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t), TREE_VALUE (t));
2579     }
2580   s->prev = scope_chain;
2581   s->old_bindings = old_bindings;
2582   s->bindings = b;
2583   s->need_pop_function_context = need_pop;
2584   s->function_decl = current_function_decl;
2585
2586   scope_chain = s;
2587   current_function_decl = NULL_TREE;
2588   VARRAY_TREE_INIT (current_lang_base, 10, "current_lang_base");
2589   current_lang_stack = &VARRAY_TREE (current_lang_base, 0);
2590   current_lang_name = lang_name_cplusplus;
2591   strict_prototype = strict_prototypes_lang_cplusplus;
2592   current_namespace = global_namespace;
2593 }
2594
2595 void
2596 push_to_top_level ()
2597 {
2598   maybe_push_to_top_level (0);
2599 }
2600
2601 void
2602 pop_from_top_level ()
2603 {
2604   struct saved_scope *s = scope_chain;
2605   tree t;
2606
2607   /* Clear out class-level bindings cache.  */
2608   if (previous_class_type)
2609     invalidate_class_lookup_cache ();
2610
2611   VARRAY_FREE (current_lang_base);
2612
2613   scope_chain = s->prev;
2614   for (t = s->old_bindings; t; t = TREE_CHAIN (t))
2615     {
2616       tree id = TREE_VEC_ELT (t, 0);
2617       if (id)
2618         {
2619           SET_IDENTIFIER_TYPE_VALUE (id, TREE_VEC_ELT (t, 1));
2620           IDENTIFIER_BINDING (id) = TREE_VEC_ELT (t, 2);
2621           IDENTIFIER_CLASS_VALUE (id) = TREE_VEC_ELT (t, 3);
2622         }
2623     }
2624
2625   if (current_lang_name == lang_name_cplusplus)
2626     strict_prototype = strict_prototypes_lang_cplusplus;
2627   else if (current_lang_name == lang_name_c)
2628     strict_prototype = strict_prototypes_lang_c;
2629
2630   /* If we were in the middle of compiling a function, restore our
2631      state.  */
2632   if (s->need_pop_function_context)
2633     pop_function_context_from (NULL_TREE);
2634   current_function_decl = s->function_decl;
2635
2636   free (s);
2637 }
2638 \f
2639 /* Push a definition of struct, union or enum tag "name".
2640    into binding_level "b".   "type" should be the type node,
2641    We assume that the tag "name" is not already defined.
2642
2643    Note that the definition may really be just a forward reference.
2644    In that case, the TYPE_SIZE will be a NULL_TREE.
2645
2646    C++ gratuitously puts all these tags in the name space.  */
2647
2648 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2649    record the shadowed value for this binding contour.  TYPE is
2650    the type that ID maps to.  */
2651
2652 static void
2653 set_identifier_type_value_with_scope (id, type, b)
2654      tree id;
2655      tree type;
2656      struct binding_level *b;
2657 {
2658   if (!b->namespace_p)
2659     {
2660       /* Shadow the marker, not the real thing, so that the marker
2661          gets restored later. */
2662       tree old_type_value = REAL_IDENTIFIER_TYPE_VALUE (id);
2663       b->type_shadowed
2664         = tree_cons (id, old_type_value, b->type_shadowed);
2665     }
2666   else
2667     {
2668       tree binding = binding_for_name (id, current_namespace);
2669       BINDING_TYPE (binding) = type;
2670       /* Store marker instead of real type. */
2671       type = global_type_node;
2672     }
2673   SET_IDENTIFIER_TYPE_VALUE (id, type);
2674 }
2675
2676 /* As set_identifier_type_value_with_scope, but using current_binding_level.  */
2677
2678 void
2679 set_identifier_type_value (id, type)
2680      tree id;
2681      tree type;
2682 {
2683   set_identifier_type_value_with_scope (id, type, current_binding_level);
2684 }
2685
2686 /* Return the type associated with id. */
2687
2688 tree
2689 identifier_type_value (id)
2690      tree id;
2691 {
2692   /* There is no type with that name, anywhere. */
2693   if (REAL_IDENTIFIER_TYPE_VALUE (id) == NULL_TREE)
2694     return NULL_TREE;
2695   /* This is not the type marker, but the real thing. */
2696   if (REAL_IDENTIFIER_TYPE_VALUE (id) != global_type_node)
2697     return REAL_IDENTIFIER_TYPE_VALUE (id);
2698   /* Have to search for it. It must be on the global level, now.
2699      Ask lookup_name not to return non-types. */
2700   id = lookup_name_real (id, 2, 1, 0);
2701   if (id)
2702     return TREE_TYPE (id);
2703   return NULL_TREE;
2704 }
2705
2706 /* Pop off extraneous binding levels left over due to syntax errors.
2707
2708    We don't pop past namespaces, as they might be valid.  */
2709
2710 void
2711 pop_everything ()
2712 {
2713 #ifdef DEBUG_CP_BINDING_LEVELS
2714   fprintf (stderr, "XXX entering pop_everything ()\n");
2715 #endif
2716   while (!toplevel_bindings_p ())
2717     {
2718       if (current_binding_level->parm_flag == 2)
2719         pop_nested_class ();
2720       else
2721         poplevel (0, 0, 0);
2722     }
2723 #ifdef DEBUG_CP_BINDING_LEVELS
2724   fprintf (stderr, "XXX leaving pop_everything ()\n");
2725 #endif
2726 }
2727
2728 /* The type TYPE is being declared.  If it is a class template, or a
2729    specialization of a class template, do any processing required and
2730    perform error-checking.  If IS_FRIEND is non-zero, this TYPE is
2731    being declared a friend.  B is the binding level at which this TYPE
2732    should be bound.
2733
2734    Returns the TYPE_DECL for TYPE, which may have been altered by this
2735    processing.  */
2736
2737 static tree
2738 maybe_process_template_type_declaration (type, globalize, b)
2739      tree type;
2740      int globalize;
2741      struct binding_level* b;
2742 {
2743   tree decl = TYPE_NAME (type);
2744
2745   if (processing_template_parmlist)
2746     /* You can't declare a new template type in a template parameter
2747        list.  But, you can declare a non-template type:
2748
2749          template <class A*> struct S;
2750
2751        is a forward-declaration of `A'.  */
2752     ;
2753   else
2754     {
2755       maybe_check_template_type (type);
2756
2757       my_friendly_assert (IS_AGGR_TYPE (type)
2758                           || TREE_CODE (type) == ENUMERAL_TYPE, 0);
2759
2760
2761       if (processing_template_decl)
2762         {
2763           /* This may change after the call to
2764              push_template_decl_real, but we want the original value.  */
2765           tree name = DECL_NAME (decl);
2766
2767           decl = push_template_decl_real (decl, globalize);
2768           /* If the current binding level is the binding level for the
2769              template parameters (see the comment in
2770              begin_template_parm_list) and the enclosing level is a class
2771              scope, and we're not looking at a friend, push the
2772              declaration of the member class into the class scope.  In the
2773              friend case, push_template_decl will already have put the
2774              friend into global scope, if appropriate.  */
2775           if (TREE_CODE (type) != ENUMERAL_TYPE
2776               && !globalize && b->template_parms_p
2777               && b->level_chain->parm_flag == 2)
2778             {
2779               finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type));
2780               /* Put this tag on the list of tags for the class, since
2781                  that won't happen below because B is not the class
2782                  binding level, but is instead the pseudo-global level.  */
2783               b->level_chain->tags =
2784                 tree_cons (name, type, b->level_chain->tags);
2785               if (!COMPLETE_TYPE_P (current_class_type))
2786                 CLASSTYPE_TAGS (current_class_type) = b->level_chain->tags;
2787             }
2788         }
2789     }
2790
2791   return decl;
2792 }
2793
2794 /* In C++, you don't have to write `struct S' to refer to `S'; you
2795    can just use `S'.  We accomplish this by creating a TYPE_DECL as
2796    if the user had written `typedef struct S S'.  Create and return
2797    the TYPE_DECL for TYPE.  */
2798
2799 tree
2800 create_implicit_typedef (name, type)
2801      tree name;
2802      tree type;
2803 {
2804   tree decl;
2805
2806   decl = build_decl (TYPE_DECL, name, type);
2807   SET_DECL_ARTIFICIAL (decl);
2808   /* There are other implicit type declarations, like the one *within*
2809      a class that allows you to write `S::S'.  We must distinguish
2810      amongst these.  */
2811   SET_DECL_IMPLICIT_TYPEDEF_P (decl);
2812   TYPE_NAME (type) = decl;
2813
2814   return decl;
2815 }
2816
2817 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2818    Normally put it into the inner-most non-tag-transparent scope,
2819    but if GLOBALIZE is true, put it in the inner-most non-class scope.
2820    The latter is needed for implicit declarations.  */
2821
2822 void
2823 pushtag (name, type, globalize)
2824      tree name, type;
2825      int globalize;
2826 {
2827   register struct binding_level *b;
2828
2829   b = current_binding_level;
2830   while (b->tag_transparent
2831          || (globalize && b->parm_flag == 2))
2832     b = b->level_chain;
2833
2834   b->tags = tree_cons (name, type, b->tags);
2835
2836   if (name)
2837     {
2838       /* Do C++ gratuitous typedefing.  */
2839       if (IDENTIFIER_TYPE_VALUE (name) != type)
2840         {
2841           register tree d = NULL_TREE;
2842           int in_class = 0;
2843           tree context = TYPE_CONTEXT (type);
2844
2845           if (! context)
2846             {
2847               tree cs = current_scope ();
2848
2849               if (! globalize)
2850                 context = cs;
2851               else if (cs != NULL_TREE && TYPE_P (cs))
2852                 /* When declaring a friend class of a local class, we want
2853                    to inject the newly named class into the scope
2854                    containing the local class, not the namespace scope.  */
2855                 context = decl_function_context (get_type_decl (cs));
2856             }
2857           if (!context)
2858             context = current_namespace;
2859
2860           if ((b->template_parms_p && b->level_chain->parm_flag == 2)
2861               || b->parm_flag == 2)
2862             in_class = 1;
2863
2864           if (current_lang_name == lang_name_java)
2865             TYPE_FOR_JAVA (type) = 1;
2866
2867           d = create_implicit_typedef (name, type);
2868           DECL_CONTEXT (d) = FROB_CONTEXT (context);
2869           if (! in_class)
2870             set_identifier_type_value_with_scope (name, type, b);
2871
2872           d = maybe_process_template_type_declaration (type,
2873                                                        globalize, b);
2874
2875           if (b->parm_flag == 2)
2876             {
2877               if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2878                 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2879                    class.  But if it's a member template class, we
2880                    want the TEMPLATE_DECL, not the TYPE_DECL, so this
2881                    is done later.  */
2882                 finish_member_declaration (d);
2883               else
2884                 pushdecl_class_level (d);
2885             }
2886           else
2887             d = pushdecl_with_scope (d, b);
2888
2889           if (ANON_AGGRNAME_P (name))
2890             DECL_IGNORED_P (d) = 1;
2891
2892           TYPE_CONTEXT (type) = DECL_CONTEXT (d);
2893           DECL_ASSEMBLER_NAME (d) = DECL_NAME (d);
2894
2895           /* If this is a local class, keep track of it.  We need this
2896              information for name-mangling, and so that it is possible to find
2897              all function definitions in a translation unit in a convenient
2898              way.  (It's otherwise tricky to find a member function definition
2899              it's only pointed to from within a local class.)  */
2900           if (TYPE_CONTEXT (type)
2901               && TREE_CODE (TYPE_CONTEXT (type)) == FUNCTION_DECL)
2902             VARRAY_PUSH_TREE (local_classes, type);
2903
2904           if (!uses_template_parms (type))
2905             {
2906               if (flag_new_abi)
2907                 DECL_ASSEMBLER_NAME (d) = mangle_type (type);
2908               else
2909                 DECL_ASSEMBLER_NAME (d)
2910                   = get_identifier (build_overload_name (type, 1, 1));
2911             }
2912         }
2913       if (b->parm_flag == 2)
2914         {
2915           if (!COMPLETE_TYPE_P (current_class_type))
2916             CLASSTYPE_TAGS (current_class_type) = b->tags;
2917         }
2918     }
2919
2920   if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL)
2921     /* Use the canonical TYPE_DECL for this node.  */
2922     TYPE_STUB_DECL (type) = TYPE_NAME (type);
2923   else
2924     {
2925       /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2926          will be the tagged type we just added to the current
2927          binding level.  This fake NULL-named TYPE_DECL node helps
2928          dwarfout.c to know when it needs to output a
2929          representation of a tagged type, and it also gives us a
2930          convenient place to record the "scope start" address for
2931          the tagged type.  */
2932
2933       tree d = build_decl (TYPE_DECL, NULL_TREE, type);
2934       TYPE_STUB_DECL (type) = pushdecl_with_scope (d, b);
2935     }
2936 }
2937
2938 /* Counter used to create anonymous type names.  */
2939
2940 static int anon_cnt = 0;
2941
2942 /* Return an IDENTIFIER which can be used as a name for
2943    anonymous structs and unions.  */
2944
2945 tree
2946 make_anon_name ()
2947 {
2948   char buf[32];
2949
2950   sprintf (buf, ANON_AGGRNAME_FORMAT, anon_cnt++);
2951   return get_identifier (buf);
2952 }
2953
2954 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2955    This keeps dbxout from getting confused.  */
2956
2957 void
2958 clear_anon_tags ()
2959 {
2960   register struct binding_level *b;
2961   register tree tags;
2962   static int last_cnt = 0;
2963
2964   /* Fast out if no new anon names were declared.  */
2965   if (last_cnt == anon_cnt)
2966     return;
2967
2968   b = current_binding_level;
2969   while (b->tag_transparent)
2970     b = b->level_chain;
2971   tags = b->tags;
2972   while (tags)
2973     {
2974       /* A NULL purpose means we have already processed all tags
2975          from here to the end of the list.  */
2976       if (TREE_PURPOSE (tags) == NULL_TREE)
2977         break;
2978       if (ANON_AGGRNAME_P (TREE_PURPOSE (tags)))
2979         TREE_PURPOSE (tags) = NULL_TREE;
2980       tags = TREE_CHAIN (tags);
2981     }
2982   last_cnt = anon_cnt;
2983 }
2984 \f
2985 /* Subroutine of duplicate_decls: return truthvalue of whether
2986    or not types of these decls match.
2987
2988    For C++, we must compare the parameter list so that `int' can match
2989    `int&' in a parameter position, but `int&' is not confused with
2990    `const int&'.  */
2991
2992 int
2993 decls_match (newdecl, olddecl)
2994      tree newdecl, olddecl;
2995 {
2996   int types_match;
2997
2998   if (newdecl == olddecl)
2999     return 1;
3000
3001   if (TREE_CODE (newdecl) != TREE_CODE (olddecl))
3002     /* If the two DECLs are not even the same kind of thing, we're not
3003        interested in their types.  */
3004     return 0;
3005
3006   if (TREE_CODE (newdecl) == FUNCTION_DECL)
3007     {
3008       tree f1 = TREE_TYPE (newdecl);
3009       tree f2 = TREE_TYPE (olddecl);
3010       tree p1 = TYPE_ARG_TYPES (f1);
3011       tree p2 = TYPE_ARG_TYPES (f2);
3012
3013       if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl)
3014           && ! (DECL_EXTERN_C_P (newdecl)
3015                 && DECL_EXTERN_C_P (olddecl)))
3016         return 0;
3017
3018       if (TREE_CODE (f1) != TREE_CODE (f2))
3019         return 0;
3020
3021       if (same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
3022         {
3023           if ((! strict_prototypes_lang_c || DECL_BUILT_IN (olddecl))
3024               && DECL_EXTERN_C_P (olddecl)
3025               && p2 == NULL_TREE)
3026             {
3027               types_match = self_promoting_args_p (p1);
3028               if (p1 == void_list_node)
3029                 TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
3030             }
3031           else if (!strict_prototypes_lang_c
3032                    && DECL_EXTERN_C_P (olddecl)
3033                    && DECL_EXTERN_C_P (newdecl)
3034                    && p1 == NULL_TREE)
3035             {
3036               types_match = self_promoting_args_p (p2);
3037               TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
3038             }
3039           else
3040             types_match = compparms (p1, p2);
3041         }
3042       else
3043         types_match = 0;
3044     }
3045   else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3046     {
3047       if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
3048                                 DECL_TEMPLATE_PARMS (olddecl)))
3049         return 0;
3050
3051       if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
3052         types_match = 1;
3053       else
3054         types_match = decls_match (DECL_TEMPLATE_RESULT (olddecl),
3055                                    DECL_TEMPLATE_RESULT (newdecl));
3056     }
3057   else
3058     {
3059       if (TREE_TYPE (newdecl) == error_mark_node)
3060         types_match = TREE_TYPE (olddecl) == error_mark_node;
3061       else if (TREE_TYPE (olddecl) == NULL_TREE)
3062         types_match = TREE_TYPE (newdecl) == NULL_TREE;
3063       else if (TREE_TYPE (newdecl) == NULL_TREE)
3064         types_match = 0;
3065       else
3066         types_match = comptypes (TREE_TYPE (newdecl),
3067                                  TREE_TYPE (olddecl),
3068                                  COMPARE_REDECLARATION);
3069     }
3070
3071   return types_match;
3072 }
3073
3074 /* If NEWDECL is `static' and an `extern' was seen previously,
3075    warn about it.  OLDDECL is the previous declaration.
3076
3077    Note that this does not apply to the C++ case of declaring
3078    a variable `extern const' and then later `const'.
3079
3080    Don't complain about built-in functions, since they are beyond
3081    the user's control.  */
3082
3083 static void
3084 warn_extern_redeclared_static (newdecl, olddecl)
3085      tree newdecl, olddecl;
3086 {
3087   static const char *explicit_extern_static_warning
3088     = "`%D' was declared `extern' and later `static'";
3089   static const char *implicit_extern_static_warning
3090     = "`%D' was declared implicitly `extern' and later `static'";
3091
3092   tree name;
3093
3094   if (TREE_CODE (newdecl) == TYPE_DECL
3095       || TREE_CODE (newdecl) == TEMPLATE_DECL)
3096     return;
3097
3098   /* Don't get confused by static member functions; that's a different
3099      use of `static'.  */
3100   if (TREE_CODE (newdecl) == FUNCTION_DECL
3101       && DECL_STATIC_FUNCTION_P (newdecl))
3102     return;
3103
3104   /* If the old declaration was `static', or the new one isn't, then
3105      then everything is OK.  */
3106   if (DECL_THIS_STATIC (olddecl) || !DECL_THIS_STATIC (newdecl))
3107     return;
3108
3109   /* It's OK to declare a builtin function as `static'.  */
3110   if (TREE_CODE (olddecl) == FUNCTION_DECL
3111       && DECL_ARTIFICIAL (olddecl))
3112     return;
3113
3114   name = DECL_ASSEMBLER_NAME (newdecl);
3115   cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name)
3116               ? implicit_extern_static_warning
3117               : explicit_extern_static_warning, newdecl);
3118   cp_pedwarn_at ("previous declaration of `%D'", olddecl);
3119 }
3120
3121 /* Handle when a new declaration NEWDECL has the same name as an old
3122    one OLDDECL in the same binding contour.  Prints an error message
3123    if appropriate.
3124
3125    If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3126    Otherwise, return 0.  */
3127
3128 int
3129 duplicate_decls (newdecl, olddecl)
3130      tree newdecl, olddecl;
3131 {
3132   unsigned olddecl_uid = DECL_UID (olddecl);
3133   int olddecl_friend = 0, types_match = 0;
3134   int new_defines_function = 0;
3135
3136   if (newdecl == olddecl)
3137     return 1;
3138
3139   types_match = decls_match (newdecl, olddecl);
3140
3141   /* If either the type of the new decl or the type of the old decl is an
3142      error_mark_node, then that implies that we have already issued an
3143      error (earlier) for some bogus type specification, and in that case,
3144      it is rather pointless to harass the user with yet more error message
3145      about the same declaration, so just pretend the types match here.  */
3146   if (TREE_TYPE (newdecl) == error_mark_node
3147       || TREE_TYPE (olddecl) == error_mark_node)
3148     types_match = 1;
3149
3150   /* Check for redeclaration and other discrepancies. */
3151   if (TREE_CODE (olddecl) == FUNCTION_DECL
3152       && DECL_ARTIFICIAL (olddecl))
3153     {
3154       if (TREE_CODE (newdecl) != FUNCTION_DECL)
3155         {
3156           /* If you declare a built-in or predefined function name as static,
3157              the old definition is overridden, but optionally warn this was a
3158              bad choice of name.  */
3159           if (! TREE_PUBLIC (newdecl))
3160             {
3161               if (warn_shadow)
3162                 cp_warning ("shadowing %s function `%#D'",
3163                             DECL_BUILT_IN (olddecl) ? "built-in" : "library",
3164                             olddecl);
3165               /* Discard the old built-in function.  */
3166               return 0;
3167             }
3168           /* If the built-in is not ansi, then programs can override
3169              it even globally without an error.  */
3170           else if (! DECL_BUILT_IN (olddecl))
3171             cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3172                         olddecl, newdecl);
3173           else
3174             {
3175               cp_error ("declaration of `%#D'", newdecl);
3176               cp_error ("conflicts with built-in declaration `%#D'",
3177                         olddecl);
3178             }
3179           return 0;
3180         }
3181       else if (!types_match)
3182         {
3183           if ((DECL_EXTERN_C_P (newdecl)
3184                && DECL_EXTERN_C_P (olddecl))
3185               || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
3186                             TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
3187             {
3188               /* A near match; override the builtin.  */
3189
3190               if (TREE_PUBLIC (newdecl))
3191                 {
3192                   cp_warning ("new declaration `%#D'", newdecl);
3193                   cp_warning ("ambiguates built-in declaration `%#D'",
3194                               olddecl);
3195                 }
3196               else if (warn_shadow)
3197                 cp_warning ("shadowing %s function `%#D'",
3198                             DECL_BUILT_IN (olddecl) ? "built-in" : "library",
3199                             olddecl);
3200             }
3201           else
3202             /* Discard the old built-in function.  */
3203             return 0;
3204         }
3205
3206       if (DECL_THIS_STATIC (newdecl) && !DECL_THIS_STATIC (olddecl))
3207         {
3208           /* If a builtin function is redeclared as `static', merge
3209              the declarations, but make the original one static.  */
3210           DECL_THIS_STATIC (olddecl) = 1;
3211           TREE_PUBLIC (olddecl) = 0;
3212
3213           /* Make the old declaration consistent with the new one so
3214              that all remnants of the builtin-ness of this function
3215              will be banished.  */
3216           DECL_LANGUAGE (olddecl) = DECL_LANGUAGE (newdecl);
3217           DECL_RTL (olddecl) = DECL_RTL (newdecl);
3218           DECL_ASSEMBLER_NAME (olddecl) = DECL_ASSEMBLER_NAME (newdecl);
3219           SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl),
3220                                        newdecl);
3221         }
3222     }
3223   else if (TREE_CODE (olddecl) != TREE_CODE (newdecl))
3224     {
3225       if ((TREE_CODE (olddecl) == TYPE_DECL && DECL_ARTIFICIAL (olddecl)
3226            && TREE_CODE (newdecl) != TYPE_DECL
3227            && ! (TREE_CODE (newdecl) == TEMPLATE_DECL
3228                  && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL))
3229           || (TREE_CODE (newdecl) == TYPE_DECL && DECL_ARTIFICIAL (newdecl)
3230               && TREE_CODE (olddecl) != TYPE_DECL
3231               && ! (TREE_CODE (olddecl) == TEMPLATE_DECL
3232                     && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl))
3233                         == TYPE_DECL))))
3234         {
3235           /* We do nothing special here, because C++ does such nasty
3236              things with TYPE_DECLs.  Instead, just let the TYPE_DECL
3237              get shadowed, and know that if we need to find a TYPE_DECL
3238              for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3239              slot of the identifier.  */
3240           return 0;
3241         }
3242
3243       if ((TREE_CODE (newdecl) == FUNCTION_DECL
3244            && DECL_FUNCTION_TEMPLATE_P (olddecl))
3245           || (TREE_CODE (olddecl) == FUNCTION_DECL
3246               && DECL_FUNCTION_TEMPLATE_P (newdecl)))
3247         return 0;
3248
3249       cp_error ("`%#D' redeclared as different kind of symbol", newdecl);
3250       if (TREE_CODE (olddecl) == TREE_LIST)
3251         olddecl = TREE_VALUE (olddecl);
3252       cp_error_at ("previous declaration of `%#D'", olddecl);
3253
3254       /* New decl is completely inconsistent with the old one =>
3255          tell caller to replace the old one.  */
3256
3257       return 0;
3258     }
3259   else if (!types_match)
3260     {
3261       if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl))
3262         /* These are certainly not duplicate declarations; they're
3263            from different scopes.  */
3264         return 0;
3265
3266       if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3267         {
3268           /* The name of a class template may not be declared to refer to
3269              any other template, class, function, object, namespace, value,
3270              or type in the same scope.  */
3271           if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == TYPE_DECL
3272               || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
3273             {
3274               cp_error ("declaration of template `%#D'", newdecl);
3275               cp_error_at ("conflicts with previous declaration `%#D'",
3276                            olddecl);
3277             }
3278           else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == FUNCTION_DECL
3279                    && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
3280                    && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl))),
3281                                  TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl))))
3282                    && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
3283                                            DECL_TEMPLATE_PARMS (olddecl)))
3284             {
3285               cp_error ("new declaration `%#D'", newdecl);
3286               cp_error_at ("ambiguates old declaration `%#D'", olddecl);
3287             }
3288           return 0;
3289         }
3290       if (TREE_CODE (newdecl) == FUNCTION_DECL)
3291         {
3292           if (DECL_EXTERN_C_P (newdecl) && DECL_EXTERN_C_P (olddecl))
3293             {
3294               cp_error ("declaration of C function `%#D' conflicts with",
3295                         newdecl);
3296               cp_error_at ("previous declaration `%#D' here", olddecl);
3297             }
3298           else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
3299                               TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
3300             {
3301               cp_error ("new declaration `%#D'", newdecl);
3302               cp_error_at ("ambiguates old declaration `%#D'", olddecl);
3303             }
3304           else
3305             return 0;
3306         }
3307
3308       /* Already complained about this, so don't do so again.  */
3309       else if (current_class_type == NULL_TREE
3310           || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl)) != current_class_type)
3311         {
3312           cp_error ("conflicting types for `%#D'", newdecl);
3313           cp_error_at ("previous declaration as `%#D'", olddecl);
3314         }
3315     }
3316   else if (TREE_CODE (newdecl) == FUNCTION_DECL
3317             && ((DECL_TEMPLATE_SPECIALIZATION (olddecl)
3318                  && (!DECL_TEMPLATE_INFO (newdecl)
3319                      || (DECL_TI_TEMPLATE (newdecl)
3320                          != DECL_TI_TEMPLATE (olddecl))))
3321                 || (DECL_TEMPLATE_SPECIALIZATION (newdecl)
3322                     && (!DECL_TEMPLATE_INFO (olddecl)
3323                         || (DECL_TI_TEMPLATE (olddecl)
3324                             != DECL_TI_TEMPLATE (newdecl))))))
3325     /* It's OK to have a template specialization and a non-template
3326        with the same type, or to have specializations of two
3327        different templates with the same type.  Note that if one is a
3328        specialization, and the other is an instantiation of the same
3329        template, that we do not exit at this point.  That situation
3330        can occur if we instantiate a template class, and then
3331        specialize one of its methods.  This situation is legal, but
3332        the declarations must be merged in the usual way.  */
3333     return 0;
3334   else if (TREE_CODE (newdecl) == FUNCTION_DECL
3335            && ((DECL_TEMPLATE_INSTANTIATION (olddecl)
3336                 && !DECL_USE_TEMPLATE (newdecl))
3337                || (DECL_TEMPLATE_INSTANTIATION (newdecl)
3338                    && !DECL_USE_TEMPLATE (olddecl))))
3339     /* One of the declarations is a template instantiation, and the
3340        other is not a template at all.  That's OK.  */
3341     return 0;
3342   else if (TREE_CODE (newdecl) == NAMESPACE_DECL
3343            && DECL_NAMESPACE_ALIAS (newdecl)
3344            && DECL_NAMESPACE_ALIAS (newdecl) == DECL_NAMESPACE_ALIAS (olddecl))
3345     /* Redeclaration of namespace alias, ignore it. */
3346     return 1;
3347   else
3348     {
3349       const char *errmsg = redeclaration_error_message (newdecl, olddecl);
3350       if (errmsg)
3351         {
3352           cp_error (errmsg, newdecl);
3353           if (DECL_NAME (olddecl) != NULL_TREE)
3354             cp_error_at ((DECL_INITIAL (olddecl)
3355                           && namespace_bindings_p ())
3356                          ? "`%#D' previously defined here"
3357                          : "`%#D' previously declared here", olddecl);
3358         }
3359       else if (TREE_CODE (olddecl) == FUNCTION_DECL
3360                && DECL_INITIAL (olddecl) != NULL_TREE
3361                && TYPE_ARG_TYPES (TREE_TYPE (olddecl)) == NULL_TREE
3362                && TYPE_ARG_TYPES (TREE_TYPE (newdecl)) != NULL_TREE)
3363         {
3364           /* Prototype decl follows defn w/o prototype.  */
3365           cp_warning_at ("prototype for `%#D'", newdecl);
3366           cp_warning_at ("follows non-prototype definition here", olddecl);
3367         }
3368       else if (TREE_CODE (olddecl) == FUNCTION_DECL
3369                && DECL_LANGUAGE (newdecl) != DECL_LANGUAGE (olddecl))
3370         {
3371           /* extern "C" int foo ();
3372              int foo () { bar (); }
3373              is OK.  */
3374           if (current_lang_stack
3375               == &VARRAY_TREE (current_lang_base, 0))
3376             DECL_LANGUAGE (newdecl) = DECL_LANGUAGE (olddecl);
3377           else
3378             {
3379               cp_error_at ("previous declaration of `%#D' with %L linkage",
3380                            olddecl, DECL_LANGUAGE (olddecl));
3381               cp_error ("conflicts with new declaration with %L linkage",
3382                         DECL_LANGUAGE (newdecl));
3383             }
3384         }
3385
3386       if (DECL_LANG_SPECIFIC (olddecl) && DECL_USE_TEMPLATE (olddecl))
3387         ;
3388       else if (TREE_CODE (olddecl) == FUNCTION_DECL)
3389         {
3390           tree t1 = TYPE_ARG_TYPES (TREE_TYPE (olddecl));
3391           tree t2 = TYPE_ARG_TYPES (TREE_TYPE (newdecl));
3392           int i = 1;
3393
3394           if (TREE_CODE (TREE_TYPE (newdecl)) == METHOD_TYPE)
3395             t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2);
3396
3397           for (; t1 && t1 != void_list_node;
3398                t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2), i++)
3399             if (TREE_PURPOSE (t1) && TREE_PURPOSE (t2))
3400               {
3401                 if (1 == simple_cst_equal (TREE_PURPOSE (t1),
3402                                            TREE_PURPOSE (t2)))
3403                   {
3404                     if (pedantic)
3405                       {
3406                         cp_pedwarn ("default argument given for parameter %d of `%#D'",
3407                                     i, newdecl);
3408                         cp_pedwarn_at ("after previous specification in `%#D'",
3409                                        olddecl);
3410                       }
3411                   }
3412                 else
3413                   {
3414                     cp_error ("default argument given for parameter %d of `%#D'",
3415                               i, newdecl);
3416                     cp_error_at ("after previous specification in `%#D'",
3417                                  olddecl);
3418                   }
3419               }
3420
3421           if (DECL_THIS_INLINE (newdecl) && ! DECL_THIS_INLINE (olddecl)
3422               && TREE_ADDRESSABLE (olddecl) && warn_inline)
3423             {
3424               cp_warning ("`%#D' was used before it was declared inline",
3425                           newdecl);
3426               cp_warning_at ("previous non-inline declaration here",
3427                              olddecl);
3428             }
3429         }
3430     }
3431
3432   /* If new decl is `static' and an `extern' was seen previously,
3433      warn about it.  */
3434   warn_extern_redeclared_static (newdecl, olddecl);
3435
3436   /* We have committed to returning 1 at this point.  */
3437   if (TREE_CODE (newdecl) == FUNCTION_DECL)
3438     {
3439       /* Now that functions must hold information normally held
3440          by field decls, there is extra work to do so that
3441          declaration information does not get destroyed during
3442          definition.  */
3443       if (DECL_VINDEX (olddecl))
3444         DECL_VINDEX (newdecl) = DECL_VINDEX (olddecl);
3445       if (DECL_VIRTUAL_CONTEXT (olddecl))
3446         DECL_VIRTUAL_CONTEXT (newdecl) = DECL_VIRTUAL_CONTEXT (olddecl);
3447       if (DECL_CONTEXT (olddecl))
3448         DECL_CONTEXT (newdecl) = DECL_CONTEXT (olddecl);
3449       if (DECL_PENDING_INLINE_INFO (newdecl) == (struct pending_inline *)0)
3450         DECL_PENDING_INLINE_INFO (newdecl) = DECL_PENDING_INLINE_INFO (olddecl);
3451       DECL_STATIC_CONSTRUCTOR (newdecl) |= DECL_STATIC_CONSTRUCTOR (olddecl);
3452       DECL_STATIC_DESTRUCTOR (newdecl) |= DECL_STATIC_DESTRUCTOR (olddecl);
3453       DECL_PURE_VIRTUAL_P (newdecl) |= DECL_PURE_VIRTUAL_P (olddecl);
3454       DECL_VIRTUAL_P (newdecl) |= DECL_VIRTUAL_P (olddecl);
3455       DECL_NEEDS_FINAL_OVERRIDER_P (newdecl) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl);
3456       DECL_THIS_STATIC (newdecl) |= DECL_THIS_STATIC (olddecl);
3457       DECL_LANG_SPECIFIC (newdecl)->u2 = DECL_LANG_SPECIFIC (olddecl)->u2;
3458       new_defines_function = DECL_INITIAL (newdecl) != NULL_TREE;
3459
3460       /* Optionally warn about more than one declaration for the same
3461          name, but don't warn about a function declaration followed by a
3462          definition.  */
3463       if (warn_redundant_decls && ! DECL_ARTIFICIAL (olddecl)
3464           && !(new_defines_function && DECL_INITIAL (olddecl) == NULL_TREE)
3465           /* Don't warn about extern decl followed by definition. */
3466           && !(DECL_EXTERNAL (olddecl) && ! DECL_EXTERNAL (newdecl))
3467           /* Don't warn about friends, let add_friend take care of it. */
3468           && ! DECL_FRIEND_P (newdecl))
3469         {
3470           cp_warning ("redundant redeclaration of `%D' in same scope", newdecl);
3471           cp_warning_at ("previous declaration of `%D'", olddecl);
3472         }
3473     }
3474
3475   /* Deal with C++: must preserve virtual function table size.  */
3476   if (TREE_CODE (olddecl) == TYPE_DECL)
3477     {
3478       register tree newtype = TREE_TYPE (newdecl);
3479       register tree oldtype = TREE_TYPE (olddecl);
3480
3481       if (newtype != error_mark_node && oldtype != error_mark_node
3482           && TYPE_LANG_SPECIFIC (newtype) && TYPE_LANG_SPECIFIC (oldtype))
3483         {
3484           CLASSTYPE_VSIZE (newtype) = CLASSTYPE_VSIZE (oldtype);
3485           CLASSTYPE_FRIEND_CLASSES (newtype)
3486             = CLASSTYPE_FRIEND_CLASSES (oldtype);
3487         }
3488     }
3489
3490   /* Copy all the DECL_... slots specified in the new decl
3491      except for any that we copy here from the old type.  */
3492   DECL_MACHINE_ATTRIBUTES (newdecl)
3493     = merge_machine_decl_attributes (olddecl, newdecl);
3494
3495   if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3496     {
3497       if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl),
3498                              DECL_TEMPLATE_RESULT (olddecl)))
3499         cp_error ("invalid redeclaration of %D", newdecl);
3500       TREE_TYPE (olddecl) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl));
3501       DECL_TEMPLATE_SPECIALIZATIONS (olddecl)
3502         = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl),
3503                    DECL_TEMPLATE_SPECIALIZATIONS (newdecl));
3504
3505       return 1;
3506     }
3507
3508   if (types_match)
3509     {
3510       /* Automatically handles default parameters.  */
3511       tree oldtype = TREE_TYPE (olddecl);
3512       tree newtype;
3513
3514       /* Merge the data types specified in the two decls.  */
3515       newtype = common_type (TREE_TYPE (newdecl), TREE_TYPE (olddecl));
3516
3517       if (TREE_CODE (newdecl) == VAR_DECL)
3518         DECL_THIS_EXTERN (newdecl) |= DECL_THIS_EXTERN (olddecl);
3519       /* Do this after calling `common_type' so that default
3520          parameters don't confuse us.  */
3521       else if (TREE_CODE (newdecl) == FUNCTION_DECL
3522           && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl))
3523               != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl))))
3524         {
3525           TREE_TYPE (newdecl) = build_exception_variant (newtype,
3526                                                          TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)));
3527           TREE_TYPE (olddecl) = build_exception_variant (newtype,
3528                                                          TYPE_RAISES_EXCEPTIONS (oldtype));
3529
3530           if ((pedantic || ! DECL_IN_SYSTEM_HEADER (olddecl))
3531               && DECL_SOURCE_LINE (olddecl) != 0
3532               && flag_exceptions
3533               && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)),
3534                                      TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl)), 1))
3535             {
3536               cp_error ("declaration of `%F' throws different exceptions",
3537                         newdecl);
3538               cp_error_at ("than previous declaration `%F'", olddecl);
3539             }
3540         }
3541       TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = newtype;
3542
3543       /* Lay the type out, unless already done.  */
3544       if (! same_type_p (newtype, oldtype)
3545           && TREE_TYPE (newdecl) != error_mark_node
3546           && !(processing_template_decl && uses_template_parms (newdecl)))
3547         layout_type (TREE_TYPE (newdecl));
3548
3549       if ((TREE_CODE (newdecl) == VAR_DECL
3550            || TREE_CODE (newdecl) == PARM_DECL
3551            || TREE_CODE (newdecl) == RESULT_DECL
3552            || TREE_CODE (newdecl) == FIELD_DECL
3553            || TREE_CODE (newdecl) == TYPE_DECL)
3554           && !(processing_template_decl && uses_template_parms (newdecl)))
3555         layout_decl (newdecl, 0);
3556
3557       /* Merge the type qualifiers.  */
3558       if (TREE_READONLY (newdecl))
3559         TREE_READONLY (olddecl) = 1;
3560       if (TREE_THIS_VOLATILE (newdecl))
3561         TREE_THIS_VOLATILE (olddecl) = 1;
3562
3563       /* Merge the initialization information.  */
3564       if (DECL_INITIAL (newdecl) == NULL_TREE
3565           && DECL_INITIAL (olddecl) != NULL_TREE)
3566         {
3567           DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
3568           DECL_SOURCE_FILE (newdecl) = DECL_SOURCE_FILE (olddecl);
3569           DECL_SOURCE_LINE (newdecl) = DECL_SOURCE_LINE (olddecl);
3570           if (CAN_HAVE_FULL_LANG_DECL_P (newdecl)
3571               && DECL_LANG_SPECIFIC (newdecl)
3572               && DECL_LANG_SPECIFIC (olddecl))
3573             DECL_SAVED_TREE (newdecl) = DECL_SAVED_TREE (olddecl);
3574         }
3575
3576       /* Merge the section attribute.
3577          We want to issue an error if the sections conflict but that must be
3578          done later in decl_attributes since we are called before attributes
3579          are assigned.  */
3580       if (DECL_SECTION_NAME (newdecl) == NULL_TREE)
3581         DECL_SECTION_NAME (newdecl) = DECL_SECTION_NAME (olddecl);
3582
3583       /* Keep the old rtl since we can safely use it.  */
3584       DECL_RTL (newdecl) = DECL_RTL (olddecl);
3585
3586       if (TREE_CODE (newdecl) == FUNCTION_DECL)
3587         {
3588           DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl)
3589             |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl);
3590           DECL_NO_CHECK_MEMORY_USAGE (newdecl)
3591             |= DECL_NO_CHECK_MEMORY_USAGE (olddecl);
3592           DECL_NO_LIMIT_STACK (newdecl)
3593             |= DECL_NO_LIMIT_STACK (olddecl);
3594         }
3595     }
3596   /* If cannot merge, then use the new type and qualifiers,
3597      and don't preserve the old rtl.  */
3598   else
3599     {
3600       /* Clean out any memory we had of the old declaration.  */
3601       tree oldstatic = value_member (olddecl, static_aggregates);
3602       if (oldstatic)
3603         TREE_VALUE (oldstatic) = error_mark_node;
3604
3605       TREE_TYPE (olddecl) = TREE_TYPE (newdecl);
3606       TREE_READONLY (olddecl) = TREE_READONLY (newdecl);
3607       TREE_THIS_VOLATILE (olddecl) = TREE_THIS_VOLATILE (newdecl);
3608       TREE_SIDE_EFFECTS (olddecl) = TREE_SIDE_EFFECTS (newdecl);
3609     }
3610
3611   /* Merge the storage class information.  */
3612   DECL_WEAK (newdecl) |= DECL_WEAK (olddecl);
3613   DECL_ONE_ONLY (newdecl) |= DECL_ONE_ONLY (olddecl);
3614   DECL_DEFER_OUTPUT (newdecl) |= DECL_DEFER_OUTPUT (olddecl);
3615   TREE_PUBLIC (newdecl) = TREE_PUBLIC (olddecl);
3616   TREE_STATIC (olddecl) = TREE_STATIC (newdecl) |= TREE_STATIC (olddecl);
3617   if (! DECL_EXTERNAL (olddecl))
3618     DECL_EXTERNAL (newdecl) = 0;
3619
3620   if (DECL_LANG_SPECIFIC (newdecl) && DECL_LANG_SPECIFIC (olddecl))
3621     {
3622       DECL_INTERFACE_KNOWN (newdecl) |= DECL_INTERFACE_KNOWN (olddecl);
3623       DECL_NOT_REALLY_EXTERN (newdecl) |= DECL_NOT_REALLY_EXTERN (olddecl);
3624       DECL_COMDAT (newdecl) |= DECL_COMDAT (olddecl);
3625       DECL_TEMPLATE_INSTANTIATED (newdecl)
3626         |= DECL_TEMPLATE_INSTANTIATED (olddecl);
3627       /* Don't really know how much of the language-specific
3628          values we should copy from old to new.  */
3629       DECL_IN_AGGR_P (newdecl) = DECL_IN_AGGR_P (olddecl);
3630       DECL_ACCESS (newdecl) = DECL_ACCESS (olddecl);
3631       DECL_NONCONVERTING_P (newdecl) = DECL_NONCONVERTING_P (olddecl);
3632       DECL_TEMPLATE_INFO (newdecl) = DECL_TEMPLATE_INFO (olddecl);
3633       olddecl_friend = DECL_FRIEND_P (olddecl);
3634
3635       /* Only functions have DECL_BEFRIENDING_CLASSES.  */
3636       if (TREE_CODE (newdecl) == FUNCTION_DECL
3637           || DECL_FUNCTION_TEMPLATE_P (newdecl))
3638         DECL_BEFRIENDING_CLASSES (newdecl)
3639           = chainon (DECL_BEFRIENDING_CLASSES (newdecl),
3640                      DECL_BEFRIENDING_CLASSES (olddecl));
3641     }
3642
3643   if (TREE_CODE (newdecl) == FUNCTION_DECL)
3644     {
3645       if (DECL_TEMPLATE_INSTANTIATION (olddecl)
3646           && !DECL_TEMPLATE_INSTANTIATION (newdecl))
3647         {
3648           /* If newdecl is not a specialization, then it is not a
3649              template-related function at all.  And that means that we
3650              shoud have exited above, returning 0.  */
3651           my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl),
3652                               0);
3653
3654           if (TREE_USED (olddecl))
3655             /* From [temp.expl.spec]:
3656
3657                If a template, a member template or the member of a class
3658                template is explicitly specialized then that
3659                specialization shall be declared before the first use of
3660                that specialization that would cause an implicit
3661                instantiation to take place, in every translation unit in
3662                which such a use occurs.  */
3663             cp_error ("explicit specialization of %D after first use",
3664                       olddecl);
3665
3666           SET_DECL_TEMPLATE_SPECIALIZATION (olddecl);
3667         }
3668       DECL_THIS_INLINE (newdecl) |= DECL_THIS_INLINE (olddecl);
3669
3670       /* If either decl says `inline', this fn is inline, unless its
3671          definition was passed already.  */
3672       if (DECL_INLINE (newdecl) && DECL_INITIAL (olddecl) == NULL_TREE)
3673         DECL_INLINE (olddecl) = 1;
3674       DECL_INLINE (newdecl) = DECL_INLINE (olddecl);
3675
3676       if (! types_match)
3677         {
3678           DECL_LANGUAGE (olddecl) = DECL_LANGUAGE (newdecl);
3679           DECL_ASSEMBLER_NAME (olddecl) = DECL_ASSEMBLER_NAME (newdecl);
3680           DECL_RTL (olddecl) = DECL_RTL (newdecl);
3681         }
3682       if (! types_match || new_defines_function)
3683         {
3684           /* These need to be copied so that the names are available.
3685              Note that if the types do match, we'll preserve inline
3686              info and other bits, but if not, we won't.  */
3687           DECL_ARGUMENTS (olddecl) = DECL_ARGUMENTS (newdecl);
3688           DECL_RESULT (olddecl) = DECL_RESULT (newdecl);
3689         }
3690       if (new_defines_function)
3691         /* If defining a function declared with other language
3692            linkage, use the previously declared language linkage.  */
3693         DECL_LANGUAGE (newdecl) = DECL_LANGUAGE (olddecl);
3694       else if (types_match)
3695         {
3696           /* If redeclaring a builtin function, and not a definition,
3697              it stays built in.  */
3698           if (DECL_BUILT_IN (olddecl))
3699             {
3700               DECL_BUILT_IN_CLASS (newdecl) = DECL_BUILT_IN_CLASS (olddecl);
3701               DECL_FUNCTION_CODE (newdecl) = DECL_FUNCTION_CODE (olddecl);
3702               /* If we're keeping the built-in definition, keep the rtl,
3703                  regardless of declaration matches.  */
3704               DECL_RTL (newdecl) = DECL_RTL (olddecl);
3705             }
3706           else
3707             DECL_FRAME_SIZE (newdecl) = DECL_FRAME_SIZE (olddecl);
3708
3709           DECL_RESULT (newdecl) = DECL_RESULT (olddecl);
3710           if ((DECL_SAVED_INSNS (newdecl) = DECL_SAVED_INSNS (olddecl)))
3711             /* Previously saved insns go together with
3712                the function's previous definition.  */
3713             DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
3714           /* Don't clear out the arguments if we're redefining a function.  */
3715           if (DECL_ARGUMENTS (olddecl))
3716             DECL_ARGUMENTS (newdecl) = DECL_ARGUMENTS (olddecl);
3717         }
3718     }
3719
3720   if (TREE_CODE (newdecl) == NAMESPACE_DECL)
3721     {
3722       NAMESPACE_LEVEL (newdecl) = NAMESPACE_LEVEL (olddecl);
3723     }
3724
3725   /* Now preserve various other info from the definition.  */
3726   TREE_ADDRESSABLE (newdecl) = TREE_ADDRESSABLE (olddecl);
3727   TREE_ASM_WRITTEN (newdecl) = TREE_ASM_WRITTEN (olddecl);
3728   DECL_COMMON (newdecl) = DECL_COMMON (olddecl);
3729   DECL_ASSEMBLER_NAME (newdecl) = DECL_ASSEMBLER_NAME (olddecl);
3730
3731   if (TREE_CODE (newdecl) == FUNCTION_DECL)
3732     {
3733       int function_size;
3734
3735       function_size = sizeof (struct tree_decl);
3736
3737       bcopy ((char *) newdecl + sizeof (struct tree_common),
3738              (char *) olddecl + sizeof (struct tree_common),
3739              function_size - sizeof (struct tree_common));
3740
3741       if (DECL_TEMPLATE_INSTANTIATION (newdecl))
3742         {
3743           /* If newdecl is a template instantiation, it is possible that
3744              the following sequence of events has occurred:
3745
3746              o A friend function was declared in a class template.  The
3747              class template was instantiated.
3748
3749              o The instantiation of the friend declaration was
3750              recorded on the instantiation list, and is newdecl.
3751
3752              o Later, however, instantiate_class_template called pushdecl
3753              on the newdecl to perform name injection.  But, pushdecl in
3754              turn called duplicate_decls when it discovered that another
3755              declaration of a global function with the same name already
3756              existed.
3757
3758              o Here, in duplicate_decls, we decided to clobber newdecl.
3759
3760              If we're going to do that, we'd better make sure that
3761              olddecl, and not newdecl, is on the list of
3762              instantiations so that if we try to do the instantiation
3763              again we won't get the clobbered declaration.  */
3764
3765           tree tmpl = DECL_TI_TEMPLATE (newdecl);
3766           tree decls = DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
3767
3768           for (; decls; decls = TREE_CHAIN (decls))
3769             if (TREE_VALUE (decls) == newdecl)
3770               TREE_VALUE (decls) = olddecl;
3771         }
3772     }
3773   else
3774     {
3775       bcopy ((char *) newdecl + sizeof (struct tree_common),
3776              (char *) olddecl + sizeof (struct tree_common),
3777              sizeof (struct tree_decl) - sizeof (struct tree_common)
3778              + tree_code_length [(int)TREE_CODE (newdecl)] * sizeof (char *));
3779     }
3780
3781   DECL_UID (olddecl) = olddecl_uid;
3782   if (olddecl_friend)
3783     DECL_FRIEND_P (olddecl) = 1;
3784
3785   /* NEWDECL contains the merged attribute lists.
3786      Update OLDDECL to be the same.  */
3787   DECL_MACHINE_ATTRIBUTES (olddecl) = DECL_MACHINE_ATTRIBUTES (newdecl);
3788
3789   return 1;
3790 }
3791
3792 /* Record a decl-node X as belonging to the current lexical scope.
3793    Check for errors (such as an incompatible declaration for the same
3794    name already seen in the same scope).
3795
3796    Returns either X or an old decl for the same name.
3797    If an old decl is returned, it may have been smashed
3798    to agree with what X says.  */
3799
3800 tree
3801 pushdecl (x)
3802      tree x;
3803 {
3804   register tree t;
3805   register tree name;
3806   int need_new_binding;
3807
3808   /* We shouldn't be calling pushdecl when we're generating RTL for a
3809      function that we already did semantic analysis on previously.  */
3810   my_friendly_assert (!cfun || doing_semantic_analysis_p (),
3811                       19990913);
3812
3813   need_new_binding = 1;
3814
3815   if (DECL_TEMPLATE_PARM_P (x))
3816     /* Template parameters have no context; they are not X::T even
3817        when declared within a class or namespace.  */
3818     ;
3819   else
3820     {
3821       if (current_function_decl && x != current_function_decl
3822           /* A local declaration for a function doesn't constitute
3823              nesting.  */
3824           && !(TREE_CODE (x) == FUNCTION_DECL && !DECL_INITIAL (x))
3825           /* A local declaration for an `extern' variable is in the
3826              scoped of the current namespace, not the current
3827              function.  */
3828           && !(TREE_CODE (x) == VAR_DECL && DECL_EXTERNAL (x))
3829           && !DECL_CONTEXT (x))
3830         DECL_CONTEXT (x) = current_function_decl;
3831       if (!DECL_CONTEXT (x))
3832         DECL_CONTEXT (x) = FROB_CONTEXT (current_namespace);
3833
3834       /* If this is the declaration for a namespace-scope function,
3835          but the declaration itself is in a local scope, mark the
3836          declaration.  */
3837       if (TREE_CODE (x) == FUNCTION_DECL
3838           && DECL_NAMESPACE_SCOPE_P (x)
3839           && current_function_decl
3840           && x != current_function_decl)
3841         DECL_LOCAL_FUNCTION_P (x) = 1;
3842     }
3843
3844   name = DECL_NAME (x);
3845   if (name)
3846     {
3847 #if 0
3848       /* Not needed...see below.  */
3849       char *file;
3850       int line;
3851 #endif
3852       if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
3853         name = TREE_OPERAND (name, 0);
3854
3855       /* Namespace-scoped variables are not found in the current level. */
3856       if (TREE_CODE (x) == VAR_DECL && DECL_NAMESPACE_SCOPE_P (x))
3857         t = namespace_binding (name, DECL_CONTEXT (x));
3858       else
3859         t = lookup_name_current_level (name);
3860
3861       /* If we are declaring a function, and the result of name-lookup
3862          was an OVERLOAD, look for an overloaded instance that is
3863          actually the same as the function we are declaring.  (If
3864          there is one, we have to merge our declaration with the
3865          previous declaration.)  */
3866       if (t && TREE_CODE (t) == OVERLOAD && TREE_CODE (x) == FUNCTION_DECL)
3867         {
3868           tree match;
3869
3870           for (match = t; match; match = OVL_NEXT (match))
3871             if (DECL_ASSEMBLER_NAME (OVL_CURRENT (t))
3872                 == DECL_ASSEMBLER_NAME (x))
3873               break;
3874
3875           if (match)
3876             t = OVL_CURRENT (match);
3877           else
3878             t = NULL_TREE;
3879         }
3880
3881       if (t == error_mark_node)
3882         {
3883           /* error_mark_node is 0 for a while during initialization!  */
3884           t = NULL_TREE;
3885           cp_error_at ("`%#D' used prior to declaration", x);
3886         }
3887       else if (t != NULL_TREE)
3888         {
3889           if (TREE_CODE (t) == PARM_DECL)
3890             {
3891               if (DECL_CONTEXT (t) == NULL_TREE)
3892                 fatal ("parse errors have confused me too much");
3893
3894               /* Check for duplicate params.  */
3895               if (duplicate_decls (x, t))
3896                 return t;
3897             }
3898           else if ((DECL_EXTERN_C_FUNCTION_P (x)
3899                     || DECL_FUNCTION_TEMPLATE_P (x))
3900                    && is_overloaded_fn (t))
3901             /* Don't do anything just yet. */;
3902           else if (t == wchar_decl_node)
3903             {
3904               if (pedantic && ! DECL_IN_SYSTEM_HEADER (x))
3905                 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x));
3906
3907               /* Throw away the redeclaration.  */
3908               return t;
3909             }
3910           else if (TREE_CODE (t) != TREE_CODE (x))
3911             {
3912               if (duplicate_decls (x, t))
3913                 return t;
3914             }
3915           else if (duplicate_decls (x, t))
3916             {
3917               if (TREE_CODE (t) == TYPE_DECL)
3918                 SET_IDENTIFIER_TYPE_VALUE (name, TREE_TYPE (t));
3919               else if (TREE_CODE (t) == FUNCTION_DECL)
3920                 check_default_args (t);
3921
3922               return t;
3923             }
3924           else if (DECL_MAIN_P (x))
3925             {
3926               /* A redeclaration of main, but not a duplicate of the
3927                  previous one.
3928
3929                  [basic.start.main]
3930
3931                  This function shall not be overloaded.  */
3932               cp_error_at ("invalid redeclaration of `%D'", t);
3933               cp_error ("as `%D'", x);
3934               /* We don't try to push this declaration since that
3935                  causes a crash.  */
3936               return x;
3937             }
3938         }
3939
3940       check_template_shadow (x);
3941
3942       /* If this is a function conjured up by the backend, massage it
3943          so it looks friendly.  */
3944       if (DECL_NON_THUNK_FUNCTION_P (x) && ! DECL_LANG_SPECIFIC (x))
3945         {
3946           retrofit_lang_decl (x);
3947           DECL_LANGUAGE (x) = lang_c;
3948         }
3949
3950       if (DECL_NON_THUNK_FUNCTION_P (x) && ! DECL_FUNCTION_MEMBER_P (x))
3951         {
3952           t = push_overloaded_decl (x, PUSH_LOCAL);
3953           if (t != x)
3954             return t;
3955           if (!namespace_bindings_p ())
3956             /* We do not need to create a binding for this name;
3957                push_overloaded_decl will have already done so if
3958                necessary.  */
3959             need_new_binding = 0;
3960         }
3961       else if (DECL_FUNCTION_TEMPLATE_P (x) && DECL_NAMESPACE_SCOPE_P (x))
3962         {
3963           t = push_overloaded_decl (x, PUSH_GLOBAL);
3964           if (t == x)
3965             add_decl_to_level (x, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t)));
3966           return t;
3967         }
3968
3969       /* If declaring a type as a typedef, copy the type (unless we're
3970          at line 0), and install this TYPE_DECL as the new type's typedef
3971          name.  See the extensive comment in ../c-decl.c (pushdecl). */
3972       if (TREE_CODE (x) == TYPE_DECL)
3973         {
3974           tree type = TREE_TYPE (x);
3975           if (DECL_SOURCE_LINE (x) == 0)
3976             {
3977               if (TYPE_NAME (type) == 0)
3978                 TYPE_NAME (type) = x;
3979             }
3980           else if (type != error_mark_node && TYPE_NAME (type) != x
3981                    /* We don't want to copy the type when all we're
3982                       doing is making a TYPE_DECL for the purposes of
3983                       inlining.  */
3984                    && (!TYPE_NAME (type)
3985                        || TYPE_NAME (type) != DECL_ABSTRACT_ORIGIN (x)))
3986             {
3987               DECL_ORIGINAL_TYPE (x) = type;
3988               type = build_type_copy (type);
3989               TYPE_STUB_DECL (type) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x));
3990               TYPE_NAME (type) = x;
3991               TREE_TYPE (x) = type;
3992             }
3993
3994           if (type != error_mark_node
3995               && TYPE_NAME (type)
3996               && TYPE_IDENTIFIER (type))
3997             set_identifier_type_value_with_scope (DECL_NAME (x), type,
3998                                                   current_binding_level);
3999
4000         }
4001
4002       /* Multiple external decls of the same identifier ought to match.
4003
4004          We get warnings about inline functions where they are defined.
4005          We get warnings about other functions from push_overloaded_decl.
4006
4007          Avoid duplicate warnings where they are used.  */
4008       if (TREE_PUBLIC (x) && TREE_CODE (x) != FUNCTION_DECL)
4009         {
4010           tree decl;
4011
4012           if (IDENTIFIER_NAMESPACE_VALUE (name) != NULL_TREE
4013               && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name))
4014                   || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name))))
4015             decl = IDENTIFIER_NAMESPACE_VALUE (name);
4016           else
4017             decl = NULL_TREE;
4018
4019           if (decl
4020               /* If different sort of thing, we already gave an error.  */
4021               && TREE_CODE (decl) == TREE_CODE (x)
4022               && !same_type_p (TREE_TYPE (x), TREE_TYPE (decl)))
4023             {
4024               cp_pedwarn ("type mismatch with previous external decl", x);
4025               cp_pedwarn_at ("previous external decl of `%#D'", decl);
4026             }
4027         }
4028
4029       /* This name is new in its binding level.
4030          Install the new declaration and return it.  */
4031       if (namespace_bindings_p ())
4032         {
4033           /* Install a global value.  */
4034
4035           /* If the first global decl has external linkage,
4036              warn if we later see static one.  */
4037           if (IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE && TREE_PUBLIC (x))
4038             TREE_PUBLIC (name) = 1;
4039
4040           /* Bind the mangled name for the entity.  In the future, we
4041              should not need to do this; mangled names are an
4042              implementation detail of which the front-end should not
4043              need to be aware.  */
4044           if (!(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)
4045                 && t != NULL_TREE)
4046               /* For an ordinary function, we create a binding from
4047                  the mangled name (i.e., NAME) to the DECL.  But, for
4048                  an `extern "C"' function, the mangled name and the
4049                  ordinary name are the same so we need not do this.  */
4050               && !DECL_EXTERN_C_FUNCTION_P (x))
4051             {
4052               tree mangled_name;
4053
4054               if (TREE_CODE (x) == TYPE_DECL || TREE_CODE (x) == VAR_DECL
4055                   || TREE_CODE (x) == NAMESPACE_DECL)
4056                 mangled_name = name;
4057               else
4058                 mangled_name = DECL_ASSEMBLER_NAME (x);
4059
4060               if (TREE_CODE (x) == FUNCTION_DECL)
4061                 my_friendly_assert
4062                   ((IDENTIFIER_GLOBAL_VALUE (mangled_name) == NULL_TREE)
4063                   || (IDENTIFIER_GLOBAL_VALUE (mangled_name) == x), 378);
4064               SET_IDENTIFIER_NAMESPACE_VALUE (mangled_name, x);
4065             }
4066
4067           /* Don't forget if the function was used via an implicit decl.  */
4068           if (IDENTIFIER_IMPLICIT_DECL (name)
4069               && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name)))
4070             TREE_USED (x) = 1;
4071
4072           /* Don't forget if its address was taken in that way.  */
4073           if (IDENTIFIER_IMPLICIT_DECL (name)
4074               && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name)))
4075             TREE_ADDRESSABLE (x) = 1;
4076
4077           /* Warn about mismatches against previous implicit decl.  */
4078           if (IDENTIFIER_IMPLICIT_DECL (name) != NULL_TREE
4079               /* If this real decl matches the implicit, don't complain.  */
4080               && ! (TREE_CODE (x) == FUNCTION_DECL
4081                     && TREE_TYPE (TREE_TYPE (x)) == integer_type_node))
4082             cp_warning
4083               ("`%D' was previously implicitly declared to return `int'", x);
4084
4085           /* If new decl is `static' and an `extern' was seen previously,
4086              warn about it.  */
4087           if (x != NULL_TREE && t != NULL_TREE && decls_match (x, t))
4088             warn_extern_redeclared_static (x, t);
4089         }
4090       else
4091         {
4092           /* Here to install a non-global value.  */
4093           tree oldlocal = IDENTIFIER_VALUE (name);
4094           tree oldglobal = IDENTIFIER_NAMESPACE_VALUE (name);
4095
4096           if (need_new_binding)
4097             {
4098               push_local_binding (name, x, 0);
4099               /* Because push_local_binding will hook X on to the
4100                  current_binding_level's name list, we don't want to
4101                  do that again below.  */
4102               need_new_binding = 0;
4103             }
4104
4105           /* If this is a TYPE_DECL, push it into the type value slot.  */
4106           if (TREE_CODE (x) == TYPE_DECL)
4107             set_identifier_type_value_with_scope (name, TREE_TYPE (x),
4108                                                   current_binding_level);
4109
4110           /* Clear out any TYPE_DECL shadowed by a namespace so that
4111              we won't think this is a type.  The C struct hack doesn't
4112              go through namespaces.  */
4113           if (TREE_CODE (x) == NAMESPACE_DECL)
4114             set_identifier_type_value_with_scope (name, NULL_TREE,
4115                                                   current_binding_level);
4116
4117           if (oldlocal)
4118             {
4119               tree d = oldlocal;
4120
4121               while (oldlocal
4122                      && TREE_CODE (oldlocal) == VAR_DECL
4123                      && DECL_DEAD_FOR_LOCAL (oldlocal))
4124                 oldlocal = DECL_SHADOWED_FOR_VAR (oldlocal);
4125
4126               if (oldlocal == NULL_TREE)
4127                 oldlocal = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d));
4128             }
4129
4130           /* If this is an extern function declaration, see if we
4131              have a global definition or declaration for the function.  */
4132           if (oldlocal == NULL_TREE
4133               && DECL_EXTERNAL (x)
4134               && oldglobal != NULL_TREE
4135               && TREE_CODE (x) == FUNCTION_DECL
4136               && TREE_CODE (oldglobal) == FUNCTION_DECL)
4137             {
4138               /* We have one.  Their types must agree.  */
4139               if (decls_match (x, oldglobal))
4140                 /* OK */;
4141               else
4142                 {
4143                   cp_warning ("extern declaration of `%#D' doesn't match", x);
4144                   cp_warning_at ("global declaration `%#D'", oldglobal);
4145                 }
4146             }
4147           /* If we have a local external declaration,
4148              and no file-scope declaration has yet been seen,
4149              then if we later have a file-scope decl it must not be static.  */
4150           if (oldlocal == NULL_TREE
4151               && oldglobal == NULL_TREE
4152               && DECL_EXTERNAL (x)
4153               && TREE_PUBLIC (x))
4154             TREE_PUBLIC (name) = 1;
4155
4156           /* Warn if shadowing an argument at the top level of the body.  */
4157           if (oldlocal != NULL_TREE && !DECL_EXTERNAL (x)
4158               /* Inline decls shadow nothing.  */
4159               && !DECL_FROM_INLINE (x)
4160               && TREE_CODE (oldlocal) == PARM_DECL
4161               /* Don't complain if it's from an enclosing function.  */
4162               && DECL_CONTEXT (oldlocal) == current_function_decl
4163               && TREE_CODE (x) != PARM_DECL)
4164             {
4165               /* Go to where the parms should be and see if we
4166                  find them there.  */
4167               struct binding_level *b = current_binding_level->level_chain;
4168
4169               if (cleanup_label)
4170                 b = b->level_chain;
4171
4172               /* ARM $8.3 */
4173               if (b->parm_flag == 1)
4174                 cp_error ("declaration of `%#D' shadows a parameter", name);
4175             }
4176
4177           /* Maybe warn if shadowing something else.  */
4178           if (warn_shadow && !DECL_EXTERNAL (x)
4179               /* Inline decls shadow nothing.  */
4180               && !DECL_FROM_INLINE (x)
4181               /* No shadow warnings for internally generated vars.  */
4182               && ! DECL_ARTIFICIAL (x)
4183               /* No shadow warnings for vars made for inlining.  */
4184               && ! DECL_FROM_INLINE (x))
4185             {
4186               if (oldlocal != NULL_TREE && TREE_CODE (oldlocal) == PARM_DECL)
4187                 warning ("declaration of `%s' shadows a parameter",
4188                         IDENTIFIER_POINTER (name));
4189               else if (IDENTIFIER_CLASS_VALUE (name) != NULL_TREE
4190                        && current_class_ptr
4191                        && !TREE_STATIC (name))
4192                 warning ("declaration of `%s' shadows a member of `this'",
4193                         IDENTIFIER_POINTER (name));
4194               else if (oldlocal != NULL_TREE)
4195                 warning ("declaration of `%s' shadows previous local",
4196                         IDENTIFIER_POINTER (name));
4197               else if (oldglobal != NULL_TREE)
4198                 /* XXX shadow warnings in outer-more namespaces */
4199                 warning ("declaration of `%s' shadows global declaration",
4200                         IDENTIFIER_POINTER (name));
4201             }
4202         }
4203
4204       if (TREE_CODE (x) == FUNCTION_DECL)
4205         check_default_args (x);
4206
4207       /* Keep count of variables in this level with incomplete type.  */
4208       if (TREE_CODE (x) == VAR_DECL
4209           && TREE_TYPE (x) != error_mark_node
4210           && ((!COMPLETE_TYPE_P (TREE_TYPE (x))
4211                && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x), ARRAY_TYPE))
4212               /* RTTI TD entries are created while defining the type_info.  */
4213               || (TYPE_LANG_SPECIFIC (TREE_TYPE (x))
4214                   && TYPE_BEING_DEFINED (TREE_TYPE (x)))))
4215         {
4216           if (namespace_bindings_p ())
4217             namespace_scope_incomplete
4218               = tree_cons (NULL_TREE, x, namespace_scope_incomplete);
4219           else
4220             current_binding_level->incomplete
4221               = tree_cons (NULL_TREE, x, current_binding_level->incomplete);
4222         }
4223     }
4224
4225   if (need_new_binding)
4226     add_decl_to_level (x,
4227                        DECL_NAMESPACE_SCOPE_P (x)
4228                        ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x))
4229                        : current_binding_level);
4230
4231   return x;
4232 }
4233
4234 /* Same as pushdecl, but define X in binding-level LEVEL.  We rely on the
4235    caller to set DECL_CONTEXT properly.  */
4236
4237 static tree
4238 pushdecl_with_scope (x, level)
4239      tree x;
4240      struct binding_level *level;
4241 {
4242   register struct binding_level *b;
4243   tree function_decl = current_function_decl;
4244
4245   current_function_decl = NULL_TREE;
4246   if (level->parm_flag == 2)
4247     {
4248       b = class_binding_level;
4249       class_binding_level = level;
4250       pushdecl_class_level (x);
4251       class_binding_level = b;
4252     }
4253   else
4254     {
4255       b = current_binding_level;
4256       current_binding_level = level;
4257       x = pushdecl (x);
4258       current_binding_level = b;
4259     }
4260   current_function_decl = function_decl;
4261   return x;
4262 }
4263
4264 /* Like pushdecl, only it places X in the current namespace,
4265    if appropriate.  */
4266
4267 tree
4268 pushdecl_namespace_level (x)
4269      tree x;
4270 {
4271   register struct binding_level *b = current_binding_level;
4272   register tree t;
4273
4274   t = pushdecl_with_scope (x, NAMESPACE_LEVEL (current_namespace));
4275
4276   /* Now, the type_shadowed stack may screw us.  Munge it so it does
4277      what we want.  */
4278   if (TREE_CODE (x) == TYPE_DECL)
4279     {
4280       tree name = DECL_NAME (x);
4281       tree newval;
4282       tree *ptr = (tree *)0;
4283       for (; b != global_binding_level; b = b->level_chain)
4284         {
4285           tree shadowed = b->type_shadowed;
4286           for (; shadowed; shadowed = TREE_CHAIN (shadowed))
4287             if (TREE_PURPOSE (shadowed) == name)
4288               {
4289                 ptr = &TREE_VALUE (shadowed);
4290                 /* Can't break out of the loop here because sometimes
4291                    a binding level will have duplicate bindings for
4292                    PT names.  It's gross, but I haven't time to fix it.  */
4293               }
4294         }
4295       newval = TREE_TYPE (x);
4296       if (ptr == (tree *)0)
4297         {
4298           /* @@ This shouldn't be needed.  My test case "zstring.cc" trips
4299              up here if this is changed to an assertion.  --KR  */
4300           SET_IDENTIFIER_TYPE_VALUE (name, newval);
4301         }
4302       else
4303         {
4304           *ptr = newval;
4305         }
4306     }
4307   return t;
4308 }
4309
4310 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4311    if appropriate.  */
4312
4313 tree
4314 pushdecl_top_level (x)
4315      tree x;
4316 {
4317   push_to_top_level ();
4318   x = pushdecl_namespace_level (x);
4319   pop_from_top_level ();
4320   return x;
4321 }
4322
4323 /* Make the declaration of X appear in CLASS scope.  */
4324
4325 void
4326 pushdecl_class_level (x)
4327      tree x;
4328 {
4329   /* Don't use DECL_ASSEMBLER_NAME here!  Everything that looks in class
4330      scope looks for the pre-mangled name.  */
4331   register tree name;
4332
4333   if (TREE_CODE (x) == OVERLOAD)
4334     x = OVL_CURRENT (x);
4335   name = DECL_NAME (x);
4336
4337   if (name)
4338     {
4339       push_class_level_binding (name, x);
4340       if (TREE_CODE (x) == TYPE_DECL)
4341         set_identifier_type_value (name, TREE_TYPE (x));
4342     }
4343   else if (ANON_AGGR_TYPE_P (TREE_TYPE (x)))
4344     {
4345       tree f;
4346
4347       for (f = TYPE_FIELDS (TREE_TYPE (x));
4348            f;
4349            f = TREE_CHAIN (f))
4350         pushdecl_class_level (f);
4351     }
4352 }
4353
4354 /* Enter DECL into the symbol table, if that's appropriate.  Returns
4355    DECL, or a modified version thereof.  */
4356
4357 tree
4358 maybe_push_decl (decl)
4359      tree decl;
4360 {
4361   tree type = TREE_TYPE (decl);
4362
4363   /* Add this decl to the current binding level, but not if it comes
4364      from another scope, e.g. a static member variable.  TEM may equal
4365      DECL or it may be a previous decl of the same name.  */
4366   if (decl == error_mark_node
4367       || (TREE_CODE (decl) != PARM_DECL
4368           && DECL_CONTEXT (decl) != NULL_TREE
4369           /* Definitions of namespace members outside their namespace are
4370              possible. */
4371           && TREE_CODE (DECL_CONTEXT (decl)) != NAMESPACE_DECL)
4372       || (TREE_CODE (decl) == TEMPLATE_DECL && !namespace_bindings_p ())
4373       || TREE_CODE (type) == UNKNOWN_TYPE
4374       /* The declaration of a template specialization does not affect
4375          the functions available for overload resolution, so we do not
4376          call pushdecl.  */
4377       || (TREE_CODE (decl) == FUNCTION_DECL
4378           && DECL_TEMPLATE_SPECIALIZATION (decl)))
4379     return decl;
4380   else
4381     return pushdecl (decl);
4382 }
4383
4384 /* Make the declaration(s) of X appear in CLASS scope
4385    under the name NAME.  */
4386
4387 void
4388 push_class_level_binding (name, x)
4389      tree name;
4390      tree x;
4391 {
4392   tree binding;
4393   /* The class_binding_level will be NULL if x is a template
4394      parameter name in a member template.  */
4395   if (!class_binding_level)
4396     return;
4397
4398   /* Make sure that this new member does not have the same name
4399      as a template parameter.  */
4400   if (TYPE_BEING_DEFINED (current_class_type))
4401     check_template_shadow (x);
4402
4403   /* If this declaration shadows a declaration from an enclosing
4404      class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4405      we leave this class.  Record the shadowed declaration here.  */
4406   binding = IDENTIFIER_BINDING (name);
4407   if (binding
4408       && ((TREE_CODE (x) == OVERLOAD
4409            && BINDING_VALUE (binding)
4410            && is_overloaded_fn (BINDING_VALUE (binding)))
4411           || INHERITED_VALUE_BINDING_P (binding)))
4412     {
4413       tree shadow;
4414       tree old_decl;
4415
4416       /* If the old binding was from a base class, and was for a tag
4417          name, slide it over to make room for the new binding.  The
4418          old binding is still visible if explicitly qualified with a
4419          class-key.  */
4420       if (INHERITED_VALUE_BINDING_P (binding)
4421           && BINDING_VALUE (binding)
4422           && TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
4423           && DECL_ARTIFICIAL (BINDING_VALUE (binding))
4424           && !(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)))
4425         {
4426           old_decl = BINDING_TYPE (binding);
4427           BINDING_TYPE (binding) = BINDING_VALUE (binding);
4428           BINDING_VALUE (binding) = NULL_TREE;
4429           INHERITED_VALUE_BINDING_P (binding) = 0;
4430         }
4431       else
4432         old_decl = BINDING_VALUE (binding);
4433
4434       /* There was already a binding for X containing fewer
4435          functions than are named in X.  Find the previous
4436          declaration of X on the class-shadowed list, and update it.  */
4437       for (shadow = class_binding_level->class_shadowed;
4438            shadow;
4439            shadow = TREE_CHAIN (shadow))
4440         if (TREE_PURPOSE (shadow) == name
4441             && TREE_TYPE (shadow) == old_decl)
4442           {
4443             BINDING_VALUE (binding) = x;
4444             INHERITED_VALUE_BINDING_P (binding) = 0;
4445             TREE_TYPE (shadow) = x;
4446             return;
4447           }
4448     }
4449
4450   /* If we didn't replace an existing binding, put the binding on the
4451      stack of bindings for the identifier, and update
4452      IDENTIFIER_CLASS_VALUE.  */
4453   if (push_class_binding (name, x))
4454     {
4455       class_binding_level->class_shadowed
4456         = tree_cons (name, IDENTIFIER_CLASS_VALUE (name),
4457                      class_binding_level->class_shadowed);
4458       /* Record the value we are binding NAME to so that we can know
4459          what to pop later.  */
4460       TREE_TYPE (class_binding_level->class_shadowed) = x;
4461     }
4462 }
4463
4464 /* Insert another USING_DECL into the current binding level, returning
4465    this declaration. If this is a redeclaration, do nothing, and
4466    return NULL_TREE if this not in namespace scope (in namespace
4467    scope, a using decl might extend any previous bindings).  */
4468
4469 tree
4470 push_using_decl (scope, name)
4471      tree scope;
4472      tree name;
4473 {
4474   tree decl;
4475
4476   my_friendly_assert (TREE_CODE (scope) == NAMESPACE_DECL, 383);
4477   my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 384);
4478   for (decl = current_binding_level->usings; decl; decl = TREE_CHAIN (decl))
4479     if (DECL_INITIAL (decl) == scope && DECL_NAME (decl) == name)
4480       break;
4481   if (decl)
4482     return namespace_bindings_p () ? decl : NULL_TREE;
4483   decl = build_lang_decl (USING_DECL, name, void_type_node);
4484   DECL_INITIAL (decl) = scope;
4485   TREE_CHAIN (decl) = current_binding_level->usings;
4486   current_binding_level->usings = decl;
4487   return decl;
4488 }
4489
4490 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4491    changed (i.e. there was already a directive), or the fresh
4492    TREE_LIST otherwise.  */
4493
4494 tree
4495 push_using_directive (used)
4496      tree used;
4497 {
4498   tree ud = current_binding_level->using_directives;
4499   tree iter, ancestor;
4500
4501   /* Check if we already have this. */
4502   if (purpose_member (used, ud) != NULL_TREE)
4503     return NULL_TREE;
4504
4505   /* Recursively add all namespaces used. */
4506   for (iter = DECL_NAMESPACE_USING (used); iter; iter = TREE_CHAIN (iter))
4507     push_using_directive (TREE_PURPOSE (iter));
4508
4509   ancestor = namespace_ancestor (current_decl_namespace (), used);
4510   ud = current_binding_level->using_directives;
4511   ud = tree_cons (used, ancestor, ud);
4512   current_binding_level->using_directives = ud;
4513   return ud;
4514 }
4515
4516 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4517    other definitions already in place.  We get around this by making
4518    the value of the identifier point to a list of all the things that
4519    want to be referenced by that name.  It is then up to the users of
4520    that name to decide what to do with that list.
4521
4522    DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4523    DECL_TEMPLATE_RESULT.  It is dealt with the same way.
4524
4525    FLAGS is a bitwise-or of the following values:
4526      PUSH_LOCAL: Bind DECL in the current scope, rather than at
4527                  namespace scope.
4528      PUSH_USING: DECL is being pushed as the result of a using
4529                  declaration.
4530
4531    The value returned may be a previous declaration if we guessed wrong
4532    about what language DECL should belong to (C or C++).  Otherwise,
4533    it's always DECL (and never something that's not a _DECL).  */
4534
4535 tree
4536 push_overloaded_decl (decl, flags)
4537      tree decl;
4538      int flags;
4539 {
4540   tree name = DECL_NAME (decl);
4541   tree old;
4542   tree new_binding;
4543   int doing_global = (namespace_bindings_p () || !(flags & PUSH_LOCAL));
4544
4545   if (doing_global)
4546     old = namespace_binding (name, DECL_CONTEXT (decl));
4547   else
4548     old = lookup_name_current_level (name);
4549
4550   if (old)
4551     {
4552       if (TREE_CODE (old) == TYPE_DECL && DECL_ARTIFICIAL (old))
4553         {
4554           tree t = TREE_TYPE (old);
4555           if (IS_AGGR_TYPE (t) && warn_shadow
4556               && (! DECL_IN_SYSTEM_HEADER (decl)
4557                   || ! DECL_IN_SYSTEM_HEADER (old)))
4558             cp_warning ("`%#D' hides constructor for `%#T'", decl, t);
4559           old = NULL_TREE;
4560         }
4561       else if (is_overloaded_fn (old))
4562         {
4563           tree tmp;
4564
4565           for (tmp = old; tmp; tmp = OVL_NEXT (tmp))
4566             {
4567               tree fn = OVL_CURRENT (tmp);
4568
4569               if (TREE_CODE (tmp) == OVERLOAD && OVL_USED (tmp)
4570                   && !(flags & PUSH_USING)
4571                   && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
4572                                 TYPE_ARG_TYPES (TREE_TYPE (decl))))
4573                 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4574                           decl, fn);
4575
4576               if (duplicate_decls (decl, fn))
4577                 return fn;
4578             }
4579         }
4580       else
4581         {
4582           cp_error_at ("previous non-function declaration `%#D'", old);
4583           cp_error ("conflicts with function declaration `%#D'", decl);
4584           return decl;
4585         }
4586     }
4587
4588   if (old || TREE_CODE (decl) == TEMPLATE_DECL)
4589     {
4590       if (old && TREE_CODE (old) != OVERLOAD)
4591         new_binding = ovl_cons (decl, ovl_cons (old, NULL_TREE));
4592       else
4593         new_binding = ovl_cons (decl, old);
4594       if (flags & PUSH_USING)
4595         OVL_USED (new_binding) = 1;
4596     }
4597   else
4598     /* NAME is not ambiguous.  */
4599     new_binding = decl;
4600
4601   if (doing_global)
4602     set_namespace_binding (name, current_namespace, new_binding);
4603   else
4604     {
4605       /* We only create an OVERLOAD if there was a previous binding at
4606          this level, or if decl is a template. In the former case, we
4607          need to remove the old binding and replace it with the new
4608          binding.  We must also run through the NAMES on the binding
4609          level where the name was bound to update the chain.  */
4610
4611       if (TREE_CODE (new_binding) == OVERLOAD && old)
4612         {
4613           tree *d;
4614
4615           for (d = &BINDING_LEVEL (IDENTIFIER_BINDING (name))->names;
4616                *d;
4617                d = &TREE_CHAIN (*d))
4618             if (*d == old
4619                 || (TREE_CODE (*d) == TREE_LIST
4620                     && TREE_VALUE (*d) == old))
4621               {
4622                 if (TREE_CODE (*d) == TREE_LIST)
4623                   /* Just replace the old binding with the new.  */
4624                   TREE_VALUE (*d) = new_binding;
4625                 else
4626                   /* Build a TREE_LIST to wrap the OVERLOAD.  */
4627                   *d = tree_cons (NULL_TREE, new_binding,
4628                                   TREE_CHAIN (*d));
4629
4630                 /* And update the CPLUS_BINDING node.  */
4631                 BINDING_VALUE (IDENTIFIER_BINDING (name))
4632                   = new_binding;
4633                 return decl;
4634               }
4635
4636           /* We should always find a previous binding in this case.  */
4637           my_friendly_abort (0);
4638         }
4639
4640       /* Install the new binding.  */
4641       push_local_binding (name, new_binding, flags);
4642     }
4643
4644   return decl;
4645 }
4646 \f
4647 /* Generate an implicit declaration for identifier FUNCTIONID
4648    as a function of type int ().  Print a warning if appropriate.  */
4649
4650 tree
4651 implicitly_declare (functionid)
4652      tree functionid;
4653 {
4654   register tree decl;
4655
4656   /* We used to reuse an old implicit decl here,
4657      but this loses with inline functions because it can clobber
4658      the saved decl chains.  */
4659   decl = build_lang_decl (FUNCTION_DECL, functionid, default_function_type);
4660
4661   DECL_EXTERNAL (decl) = 1;
4662   TREE_PUBLIC (decl) = 1;
4663
4664   /* ISO standard says implicit declarations are in the innermost block.
4665      So we record the decl in the standard fashion.  */
4666   pushdecl (decl);
4667   rest_of_decl_compilation (decl, NULL_PTR, 0, 0);
4668
4669   if (warn_implicit
4670       /* Only one warning per identifier.  */
4671       && IDENTIFIER_IMPLICIT_DECL (functionid) == NULL_TREE)
4672     {
4673       cp_pedwarn ("implicit declaration of function `%#D'", decl);
4674     }
4675
4676   SET_IDENTIFIER_IMPLICIT_DECL (functionid, decl);
4677
4678   return decl;
4679 }
4680
4681 /* Return zero if the declaration NEWDECL is valid
4682    when the declaration OLDDECL (assumed to be for the same name)
4683    has already been seen.
4684    Otherwise return an error message format string with a %s
4685    where the identifier should go.  */
4686
4687 static const char *
4688 redeclaration_error_message (newdecl, olddecl)
4689      tree newdecl, olddecl;
4690 {
4691   if (TREE_CODE (newdecl) == TYPE_DECL)
4692     {
4693       /* Because C++ can put things into name space for free,
4694          constructs like "typedef struct foo { ... } foo"
4695          would look like an erroneous redeclaration.  */
4696       if (same_type_p (TREE_TYPE (newdecl), TREE_TYPE (olddecl)))
4697         return 0;
4698       else
4699         return "redefinition of `%#D'";
4700     }
4701   else if (TREE_CODE (newdecl) == FUNCTION_DECL)
4702     {
4703       /* If this is a pure function, its olddecl will actually be
4704          the original initialization to `0' (which we force to call
4705          abort()).  Don't complain about redefinition in this case.  */
4706       if (DECL_LANG_SPECIFIC (olddecl) && DECL_PURE_VIRTUAL_P (olddecl))
4707         return 0;
4708
4709       /* If both functions come from different namespaces, this is not
4710          a redeclaration - this is a conflict with a used function. */
4711       if (DECL_NAMESPACE_SCOPE_P (olddecl)
4712           && DECL_CONTEXT (olddecl) != DECL_CONTEXT (newdecl))
4713         return "`%D' conflicts with used function";
4714
4715       /* We'll complain about linkage mismatches in
4716          warn_extern_redeclared_static.  */
4717
4718       /* Defining the same name twice is no good.  */
4719       if (DECL_INITIAL (olddecl) != NULL_TREE
4720           && DECL_INITIAL (newdecl) != NULL_TREE)
4721         {
4722           if (DECL_NAME (olddecl) == NULL_TREE)
4723             return "`%#D' not declared in class";
4724           else
4725             return "redefinition of `%#D'";
4726         }
4727       return 0;
4728     }
4729   else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
4730     {
4731       if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
4732            && (DECL_TEMPLATE_RESULT (newdecl)
4733                != DECL_TEMPLATE_RESULT (olddecl))
4734            && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl))
4735            && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl)))
4736           || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL
4737               && COMPLETE_TYPE_P (TREE_TYPE (newdecl))
4738               && COMPLETE_TYPE_P (TREE_TYPE (olddecl))))
4739         return "redefinition of `%#D'";
4740       return 0;
4741     }
4742   else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl))
4743     {
4744       /* Objects declared at top level:  */
4745       /* If at least one is a reference, it's ok.  */
4746       if (DECL_EXTERNAL (newdecl) || DECL_EXTERNAL (olddecl))
4747         return 0;
4748       /* Reject two definitions.  */
4749       return "redefinition of `%#D'";
4750     }
4751   else
4752     {
4753       /* Objects declared with block scope:  */
4754       /* Reject two definitions, and reject a definition
4755          together with an external reference.  */
4756       if (!(DECL_EXTERNAL (newdecl) && DECL_EXTERNAL (olddecl)))
4757         return "redeclaration of `%#D'";
4758       return 0;
4759     }
4760 }
4761 \f
4762 /* Create a new label, named ID.  */
4763
4764 static tree
4765 make_label_decl (id, local_p)
4766      tree id;
4767      int local_p;
4768 {
4769   tree decl;
4770
4771   decl = build_decl (LABEL_DECL, id, void_type_node);
4772   if (expanding_p)
4773     /* Make sure every label has an rtx.  */
4774     label_rtx (decl);
4775
4776   DECL_CONTEXT (decl) = current_function_decl;
4777   DECL_MODE (decl) = VOIDmode;
4778   C_DECLARED_LABEL_FLAG (decl) = local_p;
4779
4780   /* Say where one reference is to the label, for the sake of the
4781      error if it is not defined.  */
4782   DECL_SOURCE_LINE (decl) = lineno;
4783   DECL_SOURCE_FILE (decl) = input_filename;
4784
4785   /* Record the fact that this identifier is bound to this label.  */
4786   SET_IDENTIFIER_LABEL_VALUE (id, decl);
4787
4788   return decl;
4789 }
4790
4791 /* Record this label on the list of used labels so that we can check
4792    at the end of the function to see whether or not the label was
4793    actually defined, and so we can check when the label is defined whether
4794    this use is valid.  */
4795
4796 static void
4797 use_label (decl)
4798      tree decl;
4799 {
4800   if (named_label_uses == NULL
4801       || named_label_uses->names_in_scope != current_binding_level->names
4802       || named_label_uses->label_decl != decl)
4803     {
4804       struct named_label_use_list *new_ent;
4805       new_ent = ((struct named_label_use_list *)
4806                  ggc_alloc (sizeof (struct named_label_use_list)));
4807       new_ent->label_decl = decl;
4808       new_ent->names_in_scope = current_binding_level->names;
4809       new_ent->binding_level = current_binding_level;
4810       new_ent->lineno_o_goto = lineno;
4811       new_ent->filename_o_goto = input_filename;
4812       new_ent->next = named_label_uses;
4813       named_label_uses = new_ent;
4814     }
4815 }
4816
4817 /* Look for a label named ID in the current function.  If one cannot
4818    be found, create one.  (We keep track of used, but undefined,
4819    labels, and complain about them at the end of a function.)  */
4820
4821 tree
4822 lookup_label (id)
4823      tree id;
4824 {
4825   tree decl;
4826   struct named_label_list *ent;
4827
4828   /* You can't use labels at global scope.  */
4829   if (current_function_decl == NULL_TREE)
4830     {
4831       error ("label `%s' referenced outside of any function",
4832              IDENTIFIER_POINTER (id));
4833       return NULL_TREE;
4834     }
4835
4836   /* See if we've already got this label.  */
4837   decl = IDENTIFIER_LABEL_VALUE (id);
4838   if (decl != NULL_TREE && DECL_CONTEXT (decl) == current_function_decl)
4839     return decl;
4840
4841   /* Record this label on the list of labels used in this function.
4842      We do this before calling make_label_decl so that we get the
4843      IDENTIFIER_LABEL_VALUE before the new label is declared.  */
4844   ent = ((struct named_label_list *)
4845          ggc_alloc_cleared (sizeof (struct named_label_list)));
4846   ent->old_value = IDENTIFIER_LABEL_VALUE (id);
4847   ent->next = named_labels;
4848   named_labels = ent;
4849
4850   /* We need a new label.  */
4851   decl = make_label_decl (id, /*local_p=*/0);
4852
4853   /* Now fill in the information we didn't have before.  */
4854   ent->label_decl = decl;
4855
4856   return decl;
4857 }
4858
4859 /* Declare a local label named ID.  */
4860
4861 tree
4862 declare_local_label (id)
4863      tree id;
4864 {
4865   tree decl;
4866
4867   /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4868      this scope we can restore the old value of
4869      IDENTIFIER_TYPE_VALUE.  */
4870   current_binding_level->shadowed_labels
4871     = tree_cons (IDENTIFIER_LABEL_VALUE (id), NULL_TREE,
4872                  current_binding_level->shadowed_labels);
4873   /* Look for the label.  */
4874   decl = make_label_decl (id, /*local_p=*/1);
4875   /* Now fill in the information we didn't have before.  */
4876   TREE_VALUE (current_binding_level->shadowed_labels) = decl;
4877
4878   return decl;
4879 }
4880
4881 /* Returns nonzero if it is ill-formed to jump past the declaration of
4882    DECL.  Returns 2 if it's also a real problem.  */
4883
4884 static int
4885 decl_jump_unsafe (decl)
4886      tree decl;
4887 {
4888   if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
4889     return 0;
4890
4891   if (DECL_INITIAL (decl) == NULL_TREE
4892       && pod_type_p (TREE_TYPE (decl)))
4893     return 0;
4894
4895   /* This is really only important if we're crossing an initialization.
4896      The POD stuff is just pedantry; why should it matter if the class
4897      contains a field of pointer to member type?  */
4898   if (DECL_INITIAL (decl)
4899       || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl))))
4900     return 2;
4901   return 1;
4902 }
4903
4904 /* Check that a single previously seen jump to a newly defined label
4905    is OK.  DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4906    the jump context; NAMES are the names in scope in LEVEL at the jump
4907    context; FILE and LINE are the source position of the jump or 0.  */
4908
4909 static void
4910 check_previous_goto_1 (decl, level, names, file, line)
4911      tree decl;
4912      struct binding_level *level;
4913      tree names;
4914      const char *file;
4915      int line;
4916 {
4917   int identified = 0;
4918   int saw_eh = 0;
4919   struct binding_level *b = current_binding_level;
4920   for (; b; b = b->level_chain)
4921     {
4922       tree new_decls = b->names;
4923       tree old_decls = (b == level ? names : NULL_TREE);
4924       for (; new_decls != old_decls;
4925            new_decls = TREE_CHAIN (new_decls))
4926         {
4927           int problem = decl_jump_unsafe (new_decls);
4928           if (! problem)
4929             continue;
4930
4931           if (! identified)
4932             {
4933               if (decl)
4934                 cp_pedwarn ("jump to label `%D'", decl);
4935               else
4936                 pedwarn ("jump to case label");
4937
4938               if (file)
4939                 pedwarn_with_file_and_line (file, line, "  from here");
4940               identified = 1;
4941             }
4942
4943           if (problem > 1 && DECL_ARTIFICIAL (new_decls))
4944             /* Can't skip init of __exception_info.  */
4945             cp_error_at ("  enters catch block", new_decls);
4946           else if (problem > 1)
4947             cp_error_at ("  crosses initialization of `%#D'",
4948                          new_decls);
4949           else
4950             cp_pedwarn_at ("  enters scope of non-POD `%#D'",
4951                            new_decls);
4952         }
4953
4954       if (b == level)
4955         break;
4956       if (b->eh_region && ! saw_eh)
4957         {
4958           if (! identified)
4959             {
4960               if (decl)
4961                 cp_pedwarn ("jump to label `%D'", decl);
4962               else
4963                 pedwarn ("jump to case label");
4964
4965               if (file)
4966                 pedwarn_with_file_and_line (file, line, "  from here");
4967               identified = 1;
4968             }
4969           error ("  enters try block");
4970           saw_eh = 1;
4971         }
4972     }
4973 }
4974
4975 static void
4976 check_previous_goto (use)
4977      struct named_label_use_list *use;
4978 {
4979   check_previous_goto_1 (use->label_decl, use->binding_level,
4980                          use->names_in_scope, use->filename_o_goto,
4981                          use->lineno_o_goto);
4982 }
4983
4984 static void
4985 check_switch_goto (level)
4986      struct binding_level *level;
4987 {
4988   check_previous_goto_1 (NULL_TREE, level, level->names, NULL, 0);
4989 }
4990
4991 /* Check that any previously seen jumps to a newly defined label DECL
4992    are OK.  Called by define_label.  */
4993
4994 static void
4995 check_previous_gotos (decl)
4996      tree decl;
4997 {
4998   struct named_label_use_list **usep;
4999
5000   if (! TREE_USED (decl))
5001     return;
5002
5003   for (usep = &named_label_uses; *usep; )
5004     {
5005       struct named_label_use_list *use = *usep;
5006       if (use->label_decl == decl)
5007         {
5008           check_previous_goto (use);
5009           *usep = use->next;
5010         }
5011       else
5012         usep = &(use->next);
5013     }
5014 }
5015
5016 /* Check that a new jump to a label DECL is OK.  Called by
5017    finish_goto_stmt.  */
5018
5019 void
5020 check_goto (decl)
5021      tree decl;
5022 {
5023   int identified = 0;
5024   tree bad;
5025   struct named_label_list *lab;
5026
5027   /* If the label hasn't been defined yet, defer checking.  */
5028   if (! DECL_INITIAL (decl))
5029     {
5030       use_label (decl);
5031       return;
5032     }
5033
5034   for (lab = named_labels; lab; lab = lab->next)
5035     if (decl == lab->label_decl)
5036       break;
5037
5038   /* If the label is not on named_labels it's a gcc local label, so
5039      it must be in an outer scope, so jumping to it is always OK.  */
5040   if (lab == 0)
5041     return;
5042
5043   if ((lab->eh_region || lab->bad_decls) && !identified)
5044     {
5045       cp_pedwarn_at ("jump to label `%D'", decl);
5046       pedwarn ("  from here");
5047       identified = 1;
5048     }
5049
5050   for (bad = lab->bad_decls; bad; bad = TREE_CHAIN (bad))
5051     {
5052       tree b = TREE_VALUE (bad);
5053       int u = decl_jump_unsafe (b);
5054
5055       if (u > 1 && DECL_ARTIFICIAL (b))
5056         /* Can't skip init of __exception_info.  */
5057         cp_error_at ("  enters catch block", b);
5058       else if (u > 1)
5059         cp_error_at ("  skips initialization of `%#D'", b);
5060       else
5061         cp_pedwarn_at ("  enters scope of non-POD `%#D'", b);
5062     }
5063
5064   if (lab->eh_region)
5065     error ("  enters try block");
5066 }
5067
5068 /* Define a label, specifying the location in the source file.
5069    Return the LABEL_DECL node for the label, if the definition is valid.
5070    Otherwise return 0.  */
5071
5072 tree
5073 define_label (filename, line, name)
5074      const char *filename;
5075      int line;
5076      tree name;
5077 {
5078   tree decl = lookup_label (name);
5079   struct named_label_list *ent;
5080
5081   for (ent = named_labels; ent; ent = ent->next)
5082     if (ent->label_decl == decl)
5083       break;
5084
5085   /* After labels, make any new cleanups go into their
5086      own new (temporary) binding contour.  */
5087   current_binding_level->more_cleanups_ok = 0;
5088
5089   if (name == get_identifier ("wchar_t"))
5090     cp_pedwarn ("label named wchar_t");
5091
5092   if (DECL_INITIAL (decl) != NULL_TREE)
5093     {
5094       cp_error ("duplicate label `%D'", decl);
5095       return 0;
5096     }
5097   else
5098     {
5099       /* Mark label as having been defined.  */
5100       DECL_INITIAL (decl) = error_mark_node;
5101       /* Say where in the source.  */
5102       DECL_SOURCE_FILE (decl) = filename;
5103       DECL_SOURCE_LINE (decl) = line;
5104       if (ent)
5105         {
5106           ent->names_in_scope = current_binding_level->names;
5107           ent->binding_level = current_binding_level;
5108         }
5109       check_previous_gotos (decl);
5110       current_function_return_value = NULL_TREE;
5111       return decl;
5112     }
5113 }
5114
5115 struct cp_switch
5116 {
5117   struct binding_level *level;
5118   struct cp_switch *next;
5119 };
5120
5121 static struct cp_switch *switch_stack;
5122
5123 void
5124 push_switch ()
5125 {
5126   struct cp_switch *p
5127     = (struct cp_switch *) xmalloc (sizeof (struct cp_switch));
5128   p->level = current_binding_level;
5129   p->next = switch_stack;
5130   switch_stack = p;
5131 }
5132
5133 void
5134 pop_switch ()
5135 {
5136   struct cp_switch *cs;
5137
5138   cs = switch_stack;
5139   switch_stack = switch_stack->next;
5140   free (cs);
5141 }
5142
5143 /* Note that we've seen a definition of a case label, and complain if this
5144    is a bad place for one.  */
5145
5146 void
5147 define_case_label ()
5148 {
5149   tree cleanup = last_cleanup_this_contour ();
5150
5151   if (! switch_stack)
5152     /* Don't crash; we'll complain in do_case.  */
5153     return;
5154
5155   if (cleanup)
5156     {
5157       static int explained = 0;
5158       cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup));
5159       warning ("where case label appears here");
5160       if (!explained)
5161         {
5162           warning ("(enclose actions of previous case statements requiring");
5163           warning ("destructors in their own binding contours.)");
5164           explained = 1;
5165         }
5166     }
5167
5168   check_switch_goto (switch_stack->level);
5169
5170   /* After labels, make any new cleanups go into their
5171      own new (temporary) binding contour.  */
5172
5173   current_binding_level->more_cleanups_ok = 0;
5174   current_function_return_value = NULL_TREE;
5175 }
5176 \f
5177 /* Return the list of declarations of the current level.
5178    Note that this list is in reverse order unless/until
5179    you nreverse it; and when you do nreverse it, you must
5180    store the result back using `storedecls' or you will lose.  */
5181
5182 tree
5183 getdecls ()
5184 {
5185   return current_binding_level->names;
5186 }
5187
5188 /* Return the list of type-tags (for structs, etc) of the current level.  */
5189
5190 tree
5191 gettags ()
5192 {
5193   return current_binding_level->tags;
5194 }
5195
5196 /* Store the list of declarations of the current level.
5197    This is done for the parameter declarations of a function being defined,
5198    after they are modified in the light of any missing parameters.  */
5199
5200 static void
5201 storedecls (decls)
5202      tree decls;
5203 {
5204   current_binding_level->names = decls;
5205 }
5206
5207 /* Similarly, store the list of tags of the current level.  */
5208
5209 void
5210 storetags (tags)
5211      tree tags;
5212 {
5213   current_binding_level->tags = tags;
5214 }
5215 \f
5216 /* Given NAME, an IDENTIFIER_NODE,
5217    return the structure (or union or enum) definition for that name.
5218    Searches binding levels from BINDING_LEVEL up to the global level.
5219    If THISLEVEL_ONLY is nonzero, searches only the specified context
5220    (but skips any tag-transparent contexts to find one that is
5221    meaningful for tags).
5222    FORM says which kind of type the caller wants;
5223    it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5224    If the wrong kind of type is found, and it's not a template, an error is
5225    reported.  */
5226
5227 static tree
5228 lookup_tag (form, name, binding_level, thislevel_only)
5229      enum tree_code form;
5230      tree name;
5231      struct binding_level *binding_level;
5232      int thislevel_only;
5233 {
5234   register struct binding_level *level;
5235   /* Non-zero if, we should look past a template parameter level, even
5236      if THISLEVEL_ONLY.  */
5237   int allow_template_parms_p = 1;
5238
5239   for (level = binding_level; level; level = level->level_chain)
5240     {
5241       register tree tail;
5242       if (ANON_AGGRNAME_P (name))
5243         for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5244           {
5245             /* There's no need for error checking here, because
5246                anon names are unique throughout the compilation.  */
5247             if (TYPE_IDENTIFIER (TREE_VALUE (tail)) == name)
5248               return TREE_VALUE (tail);
5249           }
5250       else if (level->namespace_p)
5251         /* Do namespace lookup. */
5252         for (tail = current_namespace; 1; tail = CP_DECL_CONTEXT (tail))
5253           {
5254             tree old = binding_for_name (name, tail);
5255
5256             /* If we just skipped past a template parameter level,
5257                even though THISLEVEL_ONLY, and we find a template
5258                class declaration, then we use the _TYPE node for the
5259                template.  See the example below.  */
5260             if (thislevel_only && !allow_template_parms_p
5261                 && old && BINDING_VALUE (old)
5262                 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old)))
5263               old = TREE_TYPE (BINDING_VALUE (old));
5264             else
5265               old = BINDING_TYPE (old);
5266
5267             /* If it has an original type, it is a typedef, and we
5268                should not return it.  */
5269             if (old && DECL_ORIGINAL_TYPE (TYPE_NAME (old)))
5270               old = NULL_TREE;
5271             if (old && TREE_CODE (old) != form
5272                 && !(form != ENUMERAL_TYPE && TREE_CODE (old) == TEMPLATE_DECL))
5273               {
5274                 cp_error ("`%#D' redeclared as %C", old, form);
5275                 return NULL_TREE;
5276               }
5277             if (old)
5278               return old;
5279             if (thislevel_only || tail == global_namespace)
5280               return NULL_TREE;
5281           }
5282       else
5283         for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5284           {
5285             if (TREE_PURPOSE (tail) == name)
5286               {
5287                 enum tree_code code = TREE_CODE (TREE_VALUE (tail));
5288                 /* Should tighten this up; it'll probably permit
5289                    UNION_TYPE and a struct template, for example.  */
5290                 if (code != form
5291                     && !(form != ENUMERAL_TYPE && code == TEMPLATE_DECL))
5292                   {
5293                     /* Definition isn't the kind we were looking for.  */
5294                     cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail),
5295                               form);
5296                     return NULL_TREE;
5297                   }
5298                 return TREE_VALUE (tail);
5299               }
5300           }
5301       if (thislevel_only && ! level->tag_transparent)
5302         {
5303           if (level->template_parms_p && allow_template_parms_p)
5304             {
5305               /* We must deal with cases like this:
5306
5307                    template <class T> struct S;
5308                    template <class T> struct S {};
5309
5310                  When looking up `S', for the second declaration, we
5311                  would like to find the first declaration.  But, we
5312                  are in the pseudo-global level created for the
5313                  template parameters, rather than the (surrounding)
5314                  namespace level.  Thus, we keep going one more level,
5315                  even though THISLEVEL_ONLY is non-zero.  */
5316               allow_template_parms_p = 0;
5317               continue;
5318             }
5319           else
5320             return NULL_TREE;
5321         }
5322     }
5323   return NULL_TREE;
5324 }
5325
5326 #if 0
5327 void
5328 set_current_level_tags_transparency (tags_transparent)
5329      int tags_transparent;
5330 {
5331   current_binding_level->tag_transparent = tags_transparent;
5332 }
5333 #endif
5334
5335 /* Given a type, find the tag that was defined for it and return the tag name.
5336    Otherwise return 0.  However, the value can never be 0
5337    in the cases in which this is used.
5338
5339    C++: If NAME is non-zero, this is the new name to install.  This is
5340    done when replacing anonymous tags with real tag names.  */
5341
5342 static tree
5343 lookup_tag_reverse (type, name)
5344      tree type;
5345      tree name;
5346 {
5347   register struct binding_level *level;
5348
5349   for (level = current_binding_level; level; level = level->level_chain)
5350     {
5351       register tree tail;
5352       for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5353         {
5354           if (TREE_VALUE (tail) == type)
5355             {
5356               if (name)
5357                 TREE_PURPOSE (tail) = name;
5358               return TREE_PURPOSE (tail);
5359             }
5360         }
5361     }
5362   return NULL_TREE;
5363 }
5364 \f
5365 /* Look up NAME in the NAMESPACE.  */
5366
5367 tree
5368 lookup_namespace_name (namespace, name)
5369      tree namespace, name;
5370 {
5371   tree val;
5372   tree template_id = NULL_TREE;
5373
5374   my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL, 370);
5375
5376   if (TREE_CODE (name) == NAMESPACE_DECL)
5377     /* This happens for A::B<int> when B is a namespace. */
5378     return name;
5379   else if (TREE_CODE (name) == TEMPLATE_DECL)
5380     {
5381       /* This happens for A::B where B is a template, and there are no
5382          template arguments.  */
5383       cp_error ("invalid use of `%D'", name);
5384       return error_mark_node;
5385     }
5386
5387   namespace = ORIGINAL_NAMESPACE (namespace);
5388
5389   if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
5390     {
5391       template_id = name;
5392       name = TREE_OPERAND (name, 0);
5393       if (TREE_CODE (name) == OVERLOAD)
5394         name = DECL_NAME (OVL_CURRENT (name));
5395       else if (DECL_P (name))
5396         name = DECL_NAME (name);
5397     }
5398
5399   my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 373);
5400
5401   val = make_node (CPLUS_BINDING);
5402   if (!qualified_lookup_using_namespace (name, namespace, val, 0))
5403     return error_mark_node;
5404
5405   if (BINDING_VALUE (val))
5406     {
5407       val = BINDING_VALUE (val);
5408
5409       if (template_id)
5410         {
5411           if (DECL_CLASS_TEMPLATE_P (val))
5412             val = lookup_template_class (val,
5413                                          TREE_OPERAND (template_id, 1),
5414                                          /*in_decl=*/NULL_TREE,
5415                                          /*context=*/NULL_TREE,
5416                                          /*entering_scope=*/0);
5417           else if (DECL_FUNCTION_TEMPLATE_P (val)
5418                    || TREE_CODE (val) == OVERLOAD)
5419             val = lookup_template_function (val,
5420                                             TREE_OPERAND (template_id, 1));
5421           else
5422             {
5423               cp_error ("`%D::%D' is not a template",
5424                         namespace, name);
5425               return error_mark_node;
5426             }
5427         }
5428
5429       /* If we have a single function from a using decl, pull it out.  */
5430       if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
5431         val = OVL_FUNCTION (val);
5432       return val;
5433     }
5434
5435   cp_error ("`%D' undeclared in namespace `%D'", name, namespace);
5436   return error_mark_node;
5437 }
5438
5439 /* Hash a TYPENAME_TYPE.  K is really of type `tree'.  */
5440
5441 static unsigned long
5442 typename_hash (k)
5443      hash_table_key k;
5444 {
5445   unsigned long hash;
5446   tree t;
5447
5448   t = (tree) k;
5449   hash = (((unsigned long) TYPE_CONTEXT (t))
5450           ^ ((unsigned long) DECL_NAME (TYPE_NAME (t))));
5451
5452   return hash;
5453 }
5454
5455 /* Compare two TYPENAME_TYPEs.  K1 and K2 are really of type `tree'.  */
5456
5457 static boolean
5458 typename_compare (k1, k2)
5459      hash_table_key k1;
5460      hash_table_key k2;
5461 {
5462   tree t1;
5463   tree t2;
5464   tree d1;
5465   tree d2;
5466
5467   t1 = (tree) k1;
5468   t2 = (tree) k2;
5469   d1 = TYPE_NAME (t1);
5470   d2 = TYPE_NAME (t2);
5471
5472   return (DECL_NAME (d1) == DECL_NAME (d2)
5473           && same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2))
5474           && ((TREE_TYPE (t1) != NULL_TREE)
5475               == (TREE_TYPE (t2) != NULL_TREE))
5476           && same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
5477           && TYPENAME_TYPE_FULLNAME (t1) == TYPENAME_TYPE_FULLNAME (t2));
5478 }
5479
5480 /* Build a TYPENAME_TYPE.  If the type is `typename T::t', CONTEXT is
5481    the type of `T', NAME is the IDENTIFIER_NODE for `t'.  If BASE_TYPE
5482    is non-NULL, this type is being created by the implicit typename
5483    extension, and BASE_TYPE is a type named `t' in some base class of
5484    `T' which depends on template parameters.
5485
5486    Returns the new TYPENAME_TYPE.  */
5487
5488 tree
5489 build_typename_type (context, name, fullname, base_type)
5490      tree context;
5491      tree name;
5492      tree fullname;
5493      tree base_type;
5494 {
5495   tree t;
5496   tree d;
5497   struct hash_entry* e;
5498
5499   static struct hash_table ht;
5500
5501   if (!ht.table)
5502     {
5503       static struct hash_table *h = &ht;
5504       if (!hash_table_init (&ht, &hash_newfunc, &typename_hash,
5505                             &typename_compare))
5506         fatal ("virtual memory exhausted");
5507       ggc_add_tree_hash_table_root (&h, 1);
5508     }
5509
5510   /* Build the TYPENAME_TYPE.  */
5511   t = make_aggr_type (TYPENAME_TYPE);
5512   TYPE_CONTEXT (t) = FROB_CONTEXT (context);
5513   TYPENAME_TYPE_FULLNAME (t) = fullname;
5514   TREE_TYPE (t) = base_type;
5515
5516   /* Build the corresponding TYPE_DECL.  */
5517   d = build_decl (TYPE_DECL, name, t);
5518   TYPE_NAME (TREE_TYPE (d)) = d;
5519   TYPE_STUB_DECL (TREE_TYPE (d)) = d;
5520   DECL_CONTEXT (d) = FROB_CONTEXT (context);
5521   DECL_ARTIFICIAL (d) = 1;
5522
5523   /* See if we already have this type.  */
5524   e = hash_lookup (&ht, t, /*create=*/false, /*copy=*/0);
5525   if (e)
5526     t = (tree) e->key;
5527   else
5528     /* Insert the type into the table.  */
5529     hash_lookup (&ht, t, /*create=*/true, /*copy=*/0);
5530
5531   return t;
5532 }
5533
5534 /* Resolve `typename CONTEXT::NAME'.  Returns an appropriate type,
5535    unless an error occurs, in which case error_mark_node is returned.
5536    If COMPLAIN zero, don't complain about any errors that occur.  */
5537
5538 tree
5539 make_typename_type (context, name, complain)
5540      tree context, name;
5541      int complain;
5542 {
5543   tree fullname;
5544
5545   if (TYPE_P (name))
5546     {
5547       if (!(TYPE_LANG_SPECIFIC (name)
5548             && (CLASSTYPE_IS_TEMPLATE (name)
5549                 || CLASSTYPE_USE_TEMPLATE (name))))
5550         name = TYPE_IDENTIFIER (name);
5551       else
5552         /* Create a TEMPLATE_ID_EXPR for the type.  */
5553         name = build_nt (TEMPLATE_ID_EXPR,
5554                          CLASSTYPE_TI_TEMPLATE (name),
5555                          CLASSTYPE_TI_ARGS (name));
5556     }
5557   else if (TREE_CODE (name) == TYPE_DECL)
5558     name = DECL_NAME (name);
5559
5560   fullname = name;
5561
5562   if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
5563     {
5564       name = TREE_OPERAND (name, 0);
5565       if (TREE_CODE (name) == TEMPLATE_DECL)
5566         name = TREE_OPERAND (fullname, 0) = DECL_NAME (name);
5567     }
5568   if (TREE_CODE (name) != IDENTIFIER_NODE)
5569     my_friendly_abort (2000);
5570
5571   if (TREE_CODE (context) == NAMESPACE_DECL)
5572     {
5573       /* We can get here from typename_sub0 in the explicit_template_type
5574          expansion.  Just fail.  */
5575       if (complain)
5576         cp_error ("no class template named `%#T' in `%#T'",
5577                   name, context);
5578       return error_mark_node;
5579     }
5580
5581   if (! uses_template_parms (context)
5582       || currently_open_class (context))
5583     {
5584       if (TREE_CODE (fullname) == TEMPLATE_ID_EXPR)
5585         {
5586           tree tmpl = NULL_TREE;
5587           if (IS_AGGR_TYPE (context))
5588             tmpl = lookup_field (context, name, 0, 0);
5589           if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
5590             {
5591               if (complain)
5592                 cp_error ("no class template named `%#T' in `%#T'",
5593                           name, context);
5594               return error_mark_node;
5595             }
5596
5597           return lookup_template_class (tmpl,
5598                                         TREE_OPERAND (fullname, 1),
5599                                         NULL_TREE, context,
5600                                         /*entering_scope=*/0);
5601         }
5602       else
5603         {
5604           tree t;
5605
5606           if (!IS_AGGR_TYPE (context))
5607             {
5608               if (complain)
5609                 cp_error ("no type named `%#T' in `%#T'", name, context);
5610               return error_mark_node;
5611             }
5612
5613           t = lookup_field (context, name, 0, 1);
5614           if (t)
5615             return TREE_TYPE (t);
5616         }
5617     }
5618
5619   /* If the CONTEXT is not a template type, then either the field is
5620      there now or its never going to be.  */
5621   if (!uses_template_parms (context))
5622     {
5623       if (complain)
5624         cp_error ("no type named `%#T' in `%#T'", name, context);
5625       return error_mark_node;
5626     }
5627
5628
5629   return build_typename_type (context, name, fullname,  NULL_TREE);
5630 }
5631
5632 /* Select the right _DECL from multiple choices. */
5633
5634 static tree
5635 select_decl (binding, flags)
5636      tree binding;
5637      int flags;
5638 {
5639   tree val;
5640   val = BINDING_VALUE (binding);
5641   if (LOOKUP_NAMESPACES_ONLY (flags))
5642     {
5643       /* We are not interested in types. */
5644       if (val && TREE_CODE (val) == NAMESPACE_DECL)
5645         return val;
5646       return NULL_TREE;
5647     }
5648
5649   /* If we could have a type and
5650      we have nothing or we need a type and have none.  */
5651   if (BINDING_TYPE (binding)
5652       && (!val || ((flags & LOOKUP_PREFER_TYPES)
5653                    && TREE_CODE (val) != TYPE_DECL)))
5654     val = TYPE_STUB_DECL (BINDING_TYPE (binding));
5655   /* Don't return non-types if we really prefer types. */
5656   else if (val && LOOKUP_TYPES_ONLY (flags)  && TREE_CODE (val) != TYPE_DECL
5657            && (TREE_CODE (val) != TEMPLATE_DECL
5658                || !DECL_CLASS_TEMPLATE_P (val)))
5659     val = NULL_TREE;
5660
5661   return val;
5662 }
5663
5664 /* Unscoped lookup of a global: iterate over current namespaces,
5665    considering using-directives.  If SPACESP is non-NULL, store a list
5666    of the namespaces we've considered in it.  */
5667
5668 tree
5669 unqualified_namespace_lookup (name, flags, spacesp)
5670      tree name;
5671      int flags;
5672      tree *spacesp;
5673 {
5674   tree b = make_node (CPLUS_BINDING);
5675   tree initial = current_decl_namespace();
5676   tree scope = initial;
5677   tree siter;
5678   struct binding_level *level;
5679   tree val = NULL_TREE;
5680
5681   if (spacesp)
5682     *spacesp = NULL_TREE;
5683
5684   for (; !val; scope = CP_DECL_CONTEXT (scope))
5685     {
5686       if (spacesp)
5687         *spacesp = tree_cons (scope, NULL_TREE, *spacesp);
5688       val = binding_for_name (name, scope);
5689
5690       /* Initialize binding for this context. */
5691       BINDING_VALUE (b) = BINDING_VALUE (val);
5692       BINDING_TYPE (b) = BINDING_TYPE (val);
5693
5694       /* Add all _DECLs seen through local using-directives. */
5695       for (level = current_binding_level;
5696            !level->namespace_p;
5697            level = level->level_chain)
5698         if (!lookup_using_namespace (name, b, level->using_directives,
5699                                      scope, flags, spacesp))
5700           /* Give up because of error. */
5701           return error_mark_node;
5702
5703       /* Add all _DECLs seen through global using-directives. */
5704       /* XXX local and global using lists should work equally. */
5705       siter = initial;
5706       while (1)
5707         {
5708           if (!lookup_using_namespace (name, b, DECL_NAMESPACE_USING (siter),
5709                                        scope, flags, spacesp))
5710             /* Give up because of error. */
5711             return error_mark_node;
5712           if (siter == scope) break;
5713           siter = CP_DECL_CONTEXT (siter);
5714         }
5715
5716       val = select_decl (b, flags);
5717       if (scope == global_namespace)
5718         break;
5719     }
5720   return val;
5721 }
5722
5723 /* Combine prefer_type and namespaces_only into flags.  */
5724
5725 static int
5726 lookup_flags (prefer_type, namespaces_only)
5727   int prefer_type, namespaces_only;
5728 {
5729   if (namespaces_only)
5730     return LOOKUP_PREFER_NAMESPACES;
5731   if (prefer_type > 1)
5732     return LOOKUP_PREFER_TYPES;
5733   if (prefer_type > 0)
5734     return LOOKUP_PREFER_BOTH;
5735   return 0;
5736 }
5737
5738 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5739    ignore it or not.  Subroutine of lookup_name_real.  */
5740
5741 static tree
5742 qualify_lookup (val, flags)
5743      tree val;
5744      int flags;
5745 {
5746   if (val == NULL_TREE)
5747     return val;
5748   if ((flags & LOOKUP_PREFER_NAMESPACES) && TREE_CODE (val) == NAMESPACE_DECL)
5749     return val;
5750   if ((flags & LOOKUP_PREFER_TYPES)
5751       && (TREE_CODE (val) == TYPE_DECL
5752           || ((flags & LOOKUP_TEMPLATES_EXPECTED)
5753               && DECL_CLASS_TEMPLATE_P (val))))
5754     return val;
5755   if (flags & (LOOKUP_PREFER_NAMESPACES | LOOKUP_PREFER_TYPES))
5756     return NULL_TREE;
5757   return val;
5758 }
5759
5760 /* Any other BINDING overrides an implicit TYPENAME.  Warn about
5761    that.  */
5762
5763 static void
5764 warn_about_implicit_typename_lookup (typename, binding)
5765      tree typename;
5766      tree binding;
5767 {
5768   tree subtype = TREE_TYPE (TREE_TYPE (typename));
5769   tree name = DECL_NAME (typename);
5770
5771   if (! (TREE_CODE (binding) == TEMPLATE_DECL
5772          && CLASSTYPE_TEMPLATE_INFO (subtype)
5773          && CLASSTYPE_TI_TEMPLATE (subtype) == binding)
5774       && ! (TREE_CODE (binding) == TYPE_DECL
5775             && same_type_p (TREE_TYPE (binding), subtype)))
5776     {
5777       cp_warning ("lookup of `%D' finds `%#D'",
5778                   name, binding);
5779       cp_warning ("  instead of `%D' from dependent base class",
5780                   typename);
5781       cp_warning ("  (use `typename %T::%D' if that's what you meant)",
5782                   constructor_name (current_class_type), name);
5783     }
5784 }
5785
5786 /* Look up NAME in the current binding level and its superiors in the
5787    namespace of variables, functions and typedefs.  Return a ..._DECL
5788    node of some kind representing its definition if there is only one
5789    such declaration, or return a TREE_LIST with all the overloaded
5790    definitions if there are many, or return 0 if it is undefined.
5791
5792    If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5793    If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5794    If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5795    Otherwise we prefer non-TYPE_DECLs.
5796
5797    If NONCLASS is non-zero, we don't look for the NAME in class scope,
5798    using IDENTIFIER_CLASS_VALUE.  */
5799
5800 static tree
5801 lookup_name_real (name, prefer_type, nonclass, namespaces_only)
5802      tree name;
5803      int prefer_type, nonclass, namespaces_only;
5804 {
5805   tree t;
5806   tree val = NULL_TREE;
5807   int yylex = 0;
5808   tree from_obj = NULL_TREE;
5809   int flags;
5810   int val_is_implicit_typename = 0;
5811
5812   /* Hack: copy flag set by parser, if set. */
5813   if (only_namespace_names)
5814     namespaces_only = 1;
5815
5816   if (prefer_type == -2)
5817     {
5818       extern int looking_for_typename;
5819       tree type = NULL_TREE;
5820
5821       yylex = 1;
5822       prefer_type = looking_for_typename;
5823
5824       flags = lookup_flags (prefer_type, namespaces_only);
5825       /* If the next thing is '<', class templates are types. */
5826       if (looking_for_template)
5827         flags |= LOOKUP_TEMPLATES_EXPECTED;
5828
5829       /* std:: becomes :: for now.  */
5830       if (got_scope == std_node)
5831         got_scope = void_type_node;
5832
5833       if (got_scope)
5834         type = got_scope;
5835       else if (got_object != error_mark_node)
5836         type = got_object;
5837
5838       if (type)
5839         {
5840           if (type == error_mark_node)
5841             return error_mark_node;
5842           if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type))
5843             type = TREE_TYPE (type);
5844
5845           if (TYPE_P (type))
5846             type = complete_type (type);
5847
5848           if (TREE_CODE (type) == VOID_TYPE)
5849             type = global_namespace;
5850           if (TREE_CODE (type) == NAMESPACE_DECL)
5851             {
5852               val = make_node (CPLUS_BINDING);
5853               flags |= LOOKUP_COMPLAIN;
5854               if (!qualified_lookup_using_namespace (name, type, val, flags))
5855                 return NULL_TREE;
5856               val = select_decl (val, flags);
5857             }
5858           else if (! IS_AGGR_TYPE (type)
5859                    || TREE_CODE (type) == TEMPLATE_TYPE_PARM
5860                    || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM
5861                    || TREE_CODE (type) == TYPENAME_TYPE)
5862             /* Someone else will give an error about this if needed.  */
5863             val = NULL_TREE;
5864           else if (type == current_class_type)
5865             val = IDENTIFIER_CLASS_VALUE (name);
5866           else
5867             {
5868               val = lookup_member (type, name, 0, prefer_type);
5869               type_access_control (type, val);
5870             }
5871         }
5872       else
5873         val = NULL_TREE;
5874
5875       if (got_scope)
5876         goto done;
5877       else if (got_object && val)
5878         from_obj = val;
5879     }
5880   else
5881     {
5882       flags = lookup_flags (prefer_type, namespaces_only);
5883       /* If we're not parsing, we need to complain. */
5884       flags |= LOOKUP_COMPLAIN;
5885     }
5886
5887   /* First, look in non-namespace scopes.  */
5888
5889   if (current_class_type == NULL_TREE)
5890     nonclass = 1;
5891
5892   for (t = IDENTIFIER_BINDING (name); t; t = TREE_CHAIN (t))
5893     {
5894       tree binding;
5895
5896       if (!LOCAL_BINDING_P (t) && nonclass)
5897         /* We're not looking for class-scoped bindings, so keep going.  */
5898         continue;
5899
5900       /* If this is the kind of thing we're looking for, we're done.  */
5901       if (qualify_lookup (BINDING_VALUE (t), flags))
5902         binding = BINDING_VALUE (t);
5903       else if ((flags & LOOKUP_PREFER_TYPES)
5904                && qualify_lookup (BINDING_TYPE (t), flags))
5905         binding = BINDING_TYPE (t);
5906       else
5907         binding = NULL_TREE;
5908
5909       /* Handle access control on types from enclosing or base classes.  */
5910       if (binding && ! yylex
5911           && BINDING_LEVEL (t) && BINDING_LEVEL (t)->parm_flag == 2)
5912         type_access_control (BINDING_LEVEL (t)->this_class, binding);
5913
5914       if (binding
5915           && (!val || !IMPLICIT_TYPENAME_TYPE_DECL_P (binding)))
5916         {
5917           if (val_is_implicit_typename && !yylex)
5918             warn_about_implicit_typename_lookup (val, binding);
5919           val = binding;
5920           val_is_implicit_typename
5921             = IMPLICIT_TYPENAME_TYPE_DECL_P (val);
5922           if (!val_is_implicit_typename)
5923             break;
5924         }
5925     }
5926
5927   /* Now lookup in namespace scopes.  */
5928   if (!val || val_is_implicit_typename)
5929     {
5930       t = unqualified_namespace_lookup (name, flags, 0);
5931       if (t)
5932         {
5933           if (val_is_implicit_typename && !yylex)
5934             warn_about_implicit_typename_lookup (val, t);
5935           val = t;
5936         }
5937     }
5938
5939  done:
5940   if (val)
5941     {
5942       /* This should only warn about types used in qualified-ids.  */
5943       if (from_obj && from_obj != val)
5944         {
5945           if (looking_for_typename && TREE_CODE (from_obj) == TYPE_DECL
5946               && TREE_CODE (val) == TYPE_DECL
5947               && TREE_TYPE (from_obj) != TREE_TYPE (val))
5948             {
5949               cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5950                           name, got_object, TREE_TYPE (from_obj));
5951               cp_pedwarn ("  does not match lookup in the current scope (`%#T')",
5952                           TREE_TYPE (val));
5953             }
5954
5955           /* We don't change val to from_obj if got_object depends on
5956              template parms because that breaks implicit typename for
5957              destructor calls.  */
5958           if (! uses_template_parms (got_object))
5959             val = from_obj;
5960         }
5961
5962       /* If we have a single function from a using decl, pull it out.  */
5963       if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
5964         val = OVL_FUNCTION (val);
5965     }
5966   else if (from_obj)
5967     val = from_obj;
5968
5969   return val;
5970 }
5971
5972 tree
5973 lookup_name_nonclass (name)
5974      tree name;
5975 {
5976   return lookup_name_real (name, 0, 1, 0);
5977 }
5978
5979 tree
5980 lookup_function_nonclass (name, args)
5981      tree name;
5982      tree args;
5983 {
5984   return lookup_arg_dependent (name, lookup_name_nonclass (name), args);
5985 }
5986
5987 tree
5988 lookup_name_namespace_only (name)
5989      tree name;
5990 {
5991   /* type-or-namespace, nonclass, namespace_only */
5992   return lookup_name_real (name, 1, 1, 1);
5993 }
5994
5995 tree
5996 lookup_name (name, prefer_type)
5997      tree name;
5998      int prefer_type;
5999 {
6000   return lookup_name_real (name, prefer_type, 0, 0);
6001 }
6002
6003 /* Similar to `lookup_name' but look only in the innermost non-class
6004    binding level.  */
6005
6006 tree
6007 lookup_name_current_level (name)
6008      tree name;
6009 {
6010   struct binding_level *b;
6011   tree t = NULL_TREE;
6012
6013   b = current_binding_level;
6014   while (b->parm_flag == 2)
6015     b = b->level_chain;
6016
6017   if (b->namespace_p)
6018     {
6019       t = IDENTIFIER_NAMESPACE_VALUE (name);
6020
6021       /* extern "C" function() */
6022       if (t != NULL_TREE && TREE_CODE (t) == TREE_LIST)
6023         t = TREE_VALUE (t);
6024     }
6025   else if (IDENTIFIER_BINDING (name)
6026            && LOCAL_BINDING_P (IDENTIFIER_BINDING (name)))
6027     {
6028       while (1)
6029         {
6030           if (BINDING_LEVEL (IDENTIFIER_BINDING (name)) == b)
6031             return IDENTIFIER_VALUE (name);
6032
6033           if (b->keep == 2)
6034             b = b->level_chain;
6035           else
6036             break;
6037         }
6038     }
6039
6040   return t;
6041 }
6042
6043 /* Like lookup_name_current_level, but for types.  */
6044
6045 tree
6046 lookup_type_current_level (name)
6047      tree name;
6048 {
6049   register tree t = NULL_TREE;
6050
6051   my_friendly_assert (! current_binding_level->namespace_p, 980716);
6052
6053   if (REAL_IDENTIFIER_TYPE_VALUE (name) != NULL_TREE
6054       && REAL_IDENTIFIER_TYPE_VALUE (name) != global_type_node)
6055     {
6056       struct binding_level *b = current_binding_level;
6057       while (1)
6058         {
6059           if (purpose_member (name, b->type_shadowed))
6060             return REAL_IDENTIFIER_TYPE_VALUE (name);
6061           if (b->keep == 2)
6062             b = b->level_chain;
6063           else
6064             break;
6065         }
6066     }
6067
6068   return t;
6069 }
6070
6071 void
6072 begin_only_namespace_names ()
6073 {
6074   only_namespace_names = 1;
6075 }
6076
6077 void
6078 end_only_namespace_names ()
6079 {
6080   only_namespace_names = 0;
6081 }
6082 \f
6083 /* Arrange for the user to get a source line number, even when the
6084    compiler is going down in flames, so that she at least has a
6085    chance of working around problems in the compiler.  We used to
6086    call error(), but that let the segmentation fault continue
6087    through; now, it's much more passive by asking them to send the
6088    maintainers mail about the problem.  */
6089
6090 static void
6091 signal_catch (sig)
6092      int sig ATTRIBUTE_UNUSED;
6093 {
6094   signal (SIGSEGV, SIG_DFL);
6095 #ifdef SIGIOT
6096   signal (SIGIOT, SIG_DFL);
6097 #endif
6098 #ifdef SIGILL
6099   signal (SIGILL, SIG_DFL);
6100 #endif
6101 #ifdef SIGABRT
6102   signal (SIGABRT, SIG_DFL);
6103 #endif
6104 #ifdef SIGBUS
6105   signal (SIGBUS, SIG_DFL);
6106 #endif
6107   my_friendly_abort (0);
6108 }
6109
6110 /* Push the declarations of builtin types into the namespace.
6111    RID_INDEX, if < RID_MAX is the index of the builtin type
6112    in the array RID_POINTERS.  NAME is the name used when looking
6113    up the builtin type.  TYPE is the _TYPE node for the builtin type.  */
6114
6115 static void
6116 record_builtin_type (rid_index, name, type)
6117      enum rid rid_index;
6118      const char *name;
6119      tree type;
6120 {
6121   tree rname = NULL_TREE, tname = NULL_TREE;
6122   tree tdecl = NULL_TREE;
6123
6124   if ((int) rid_index < (int) RID_MAX)
6125     rname = ridpointers[(int) rid_index];
6126   if (name)
6127     tname = get_identifier (name);
6128
6129   TYPE_BUILT_IN (type) = 1;
6130
6131   if (tname)
6132     {
6133       tdecl = pushdecl (build_decl (TYPE_DECL, tname, type));
6134       set_identifier_type_value (tname, NULL_TREE);
6135       if ((int) rid_index < (int) RID_MAX)
6136         /* Built-in types live in the global namespace. */
6137         SET_IDENTIFIER_GLOBAL_VALUE (tname, tdecl);
6138     }
6139   if (rname != NULL_TREE)
6140     {
6141       if (tname != NULL_TREE)
6142         {
6143           set_identifier_type_value (rname, NULL_TREE);
6144           SET_IDENTIFIER_GLOBAL_VALUE (rname, tdecl);
6145         }
6146       else
6147         {
6148           tdecl = pushdecl (build_decl (TYPE_DECL, rname, type));
6149           set_identifier_type_value (rname, NULL_TREE);
6150         }
6151     }
6152 }
6153
6154 /* Record one of the standard Java types.
6155  * Declare it as having the given NAME.
6156  * If SIZE > 0, it is the size of one of the integral types;
6157  * otherwise it is the negative of the size of one of the other types.  */
6158
6159 static tree
6160 record_builtin_java_type (name, size)
6161      const char *name;
6162      int size;
6163 {
6164   tree type, decl;
6165   if (size > 0)
6166     type = make_signed_type (size);
6167   else if (size > -32)
6168     { /* "__java_char" or ""__java_boolean". */
6169       type = make_unsigned_type (-size);
6170       /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6171     }
6172   else
6173     { /* "__java_float" or ""__java_double". */
6174       type = make_node (REAL_TYPE);
6175       TYPE_PRECISION (type) = - size;
6176       layout_type (type);
6177     }
6178   record_builtin_type (RID_MAX, name, type);
6179   decl = TYPE_NAME (type);
6180
6181   /* Suppress generate debug symbol entries for these types,
6182      since for normal C++ they are just clutter.
6183      However, push_lang_context undoes this if extern "Java" is seen. */
6184   DECL_IGNORED_P (decl) = 1;
6185
6186   TYPE_FOR_JAVA (type) = 1;
6187   return type;
6188 }
6189
6190 /* Push a type into the namespace so that the back-ends ignore it. */
6191
6192 static void
6193 record_unknown_type (type, name)
6194      tree type;
6195      const char *name;
6196 {
6197   tree decl = pushdecl (build_decl (TYPE_DECL, get_identifier (name), type));
6198   /* Make sure the "unknown type" typedecl gets ignored for debug info.  */
6199   DECL_IGNORED_P (decl) = 1;
6200   TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
6201   TYPE_SIZE (type) = TYPE_SIZE (void_type_node);
6202   TYPE_ALIGN (type) = 1;
6203   TYPE_USER_ALIGN (type) = 0;
6204   TYPE_MODE (type) = TYPE_MODE (void_type_node);
6205 }
6206
6207 /* An string for which we should create an IDENTIFIER_NODE at
6208    startup.  */
6209
6210 typedef struct predefined_identifier
6211 {
6212   /* The name of the identifier.  */
6213   const char *name;
6214   /* The place where the IDENTIFIER_NODE should be stored.  */
6215   tree *node;
6216   /* Non-zero if this is the name of a constructor or destructor.  */
6217   int ctor_or_dtor_p;
6218 } predefined_identifier;
6219
6220 /* Create all the predefined identifiers.  */
6221
6222 static void
6223 initialize_predefined_identifiers ()
6224 {
6225   struct predefined_identifier *pid;
6226
6227   /* A table of identifiers to create at startup.  */
6228   static predefined_identifier predefined_identifiers[] = {
6229     { "C++", &lang_name_cplusplus, 0 },
6230     { "C", &lang_name_c, 0 },
6231     { "Java", &lang_name_java, 0 },
6232     { CTOR_NAME, &ctor_identifier, 1 },
6233     { "__base_ctor", &base_ctor_identifier, 1 },
6234     { "__comp_ctor", &complete_ctor_identifier, 1 },
6235     { DTOR_NAME, &dtor_identifier, 1 },
6236     { "__comp_dtor", &complete_dtor_identifier, 1 },
6237     { "__base_dtor", &base_dtor_identifier, 1 },
6238     { "__deleting_dtor", &deleting_dtor_identifier, 1 },
6239     { VTABLE_DELTA2_NAME, &delta2_identifier, 0 },
6240     { VTABLE_DELTA_NAME, &delta_identifier, 0 },
6241     { IN_CHARGE_NAME, &in_charge_identifier, 0 },
6242     { VTABLE_INDEX_NAME, &index_identifier, 0 },
6243     { "nelts", &nelts_identifier, 0 },
6244     { THIS_NAME, &this_identifier, 0 },
6245     { VTABLE_PFN_NAME, &pfn_identifier, 0 },
6246     { "__pfn_or_delta2", &pfn_or_delta2_identifier, 0 },
6247     { "_vptr", &vptr_identifier, 0 },
6248     { "__cp_push_exception", &cp_push_exception_identifier, 0 },
6249     { "__vtt_parm", &vtt_parm_identifier, 0 },
6250     { "std", &std_identifier, 0 },
6251     { NULL, NULL, 0 }
6252   };
6253
6254   for (pid = predefined_identifiers; pid->name; ++pid)
6255     {
6256       *pid->node = get_identifier (pid->name);
6257       if (pid->ctor_or_dtor_p)
6258         IDENTIFIER_CTOR_OR_DTOR_P (*pid->node) = 1;
6259     }
6260 }
6261
6262 /* Create the predefined scalar types of C,
6263    and some nodes representing standard constants (0, 1, (void *)0).
6264    Initialize the global binding level.
6265    Make definitions for built-in primitive functions.  */
6266
6267 void
6268 init_decl_processing ()
6269 {
6270   tree fields[20];
6271   int wchar_type_size;
6272   tree array_domain_type;
6273
6274   /* Check to see that the user did not specify an invalid combination
6275      of command-line options.  */
6276   if (flag_new_abi && !flag_vtable_thunks)
6277     fatal ("the new ABI requires vtable thunks");
6278
6279   /* Create all the identifiers we need.  */
6280   initialize_predefined_identifiers ();
6281
6282   /* Let the back-end now how to save and restore language-specific
6283      per-function globals.  */
6284   init_lang_status = &push_cp_function_context;
6285   free_lang_status = &pop_cp_function_context;
6286   mark_lang_status = &mark_cp_function_context;
6287
6288   cp_parse_init ();
6289   init_decl2 ();
6290   init_pt ();
6291
6292   /* Create the global variables.  */
6293   push_to_top_level ();
6294
6295   /* Enter the global namespace. */
6296   my_friendly_assert (global_namespace == NULL_TREE, 375);
6297   push_namespace (get_identifier ("::"));
6298   global_namespace = current_namespace;
6299   current_lang_name = NULL_TREE;
6300
6301   /* Adjust various flags based on command-line settings.  */
6302   if (flag_strict_prototype == 2)
6303     flag_strict_prototype = pedantic;
6304   if (! flag_permissive && ! pedantic)
6305     flag_pedantic_errors = 1;
6306   if (!flag_no_inline)
6307     flag_inline_trees = 1;
6308
6309   strict_prototypes_lang_c = flag_strict_prototype;
6310
6311   /* Initially, C.  */
6312   current_lang_name = lang_name_c;
6313
6314   current_function_decl = NULL_TREE;
6315   current_binding_level = NULL_BINDING_LEVEL;
6316   free_binding_level = NULL_BINDING_LEVEL;
6317
6318   /* Because most segmentation signals can be traced back into user
6319      code, catch them and at least give the user a chance of working
6320      around compiler bugs.  */
6321   signal (SIGSEGV, signal_catch);
6322
6323   /* We will also catch aborts in the back-end through signal_catch and
6324      give the user a chance to see where the error might be, and to defeat
6325      aborts in the back-end when there have been errors previously in their
6326      code.  */
6327 #ifdef SIGIOT
6328   signal (SIGIOT, signal_catch);
6329 #endif
6330 #ifdef SIGILL
6331   signal (SIGILL, signal_catch);
6332 #endif
6333 #ifdef SIGABRT
6334   signal (SIGABRT, signal_catch);
6335 #endif
6336 #ifdef SIGBUS
6337   signal (SIGBUS, signal_catch);
6338 #endif
6339
6340   build_common_tree_nodes (flag_signed_char);
6341
6342   error_mark_list = build_tree_list (error_mark_node, error_mark_node);
6343   TREE_TYPE (error_mark_list) = error_mark_node;
6344
6345   /* Make the binding_level structure for global names.  */
6346   pushlevel (0);
6347   global_binding_level = current_binding_level;
6348   /* The global level is the namespace level of ::.  */
6349   NAMESPACE_LEVEL (global_namespace) = global_binding_level;
6350   declare_namespace_level ();
6351
6352   /* Define `int' and `char' first so that dbx will output them first.  */
6353   record_builtin_type (RID_INT, NULL_PTR, integer_type_node);
6354   record_builtin_type (RID_CHAR, "char", char_type_node);
6355
6356   /* `signed' is the same as `int' */
6357   record_builtin_type (RID_SIGNED, NULL_PTR, integer_type_node);
6358   record_builtin_type (RID_LONG, "long int", long_integer_type_node);
6359   record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
6360   record_builtin_type (RID_MAX, "long unsigned int", long_unsigned_type_node);
6361   record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
6362   record_builtin_type (RID_MAX, "long long int", long_long_integer_type_node);
6363   record_builtin_type (RID_MAX, "long long unsigned int",
6364                        long_long_unsigned_type_node);
6365   record_builtin_type (RID_MAX, "long long unsigned",
6366                        long_long_unsigned_type_node);
6367   record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
6368   record_builtin_type (RID_MAX, "short unsigned int", short_unsigned_type_node);
6369   record_builtin_type (RID_MAX, "unsigned short", short_unsigned_type_node);
6370
6371   ptrdiff_type_node
6372     = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE)));
6373
6374   /* Define both `signed char' and `unsigned char'.  */
6375   record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
6376   record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
6377
6378   /* `unsigned long' is the standard type for sizeof.
6379      Note that stddef.h uses `unsigned long',
6380      and this must agree, even if long and int are the same size.  */
6381   set_sizetype
6382     (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE))));
6383
6384   /* Create the widest literal types. */
6385   widest_integer_literal_type_node = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
6386   pushdecl (build_decl (TYPE_DECL, NULL_TREE,
6387                         widest_integer_literal_type_node));
6388
6389   widest_unsigned_literal_type_node = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
6390   pushdecl (build_decl (TYPE_DECL, NULL_TREE,
6391                         widest_unsigned_literal_type_node));
6392
6393   /* These are types that type_for_size and type_for_mode use.  */
6394   pushdecl (build_decl (TYPE_DECL, NULL_TREE, intQI_type_node));
6395   pushdecl (build_decl (TYPE_DECL, NULL_TREE, intHI_type_node));
6396   pushdecl (build_decl (TYPE_DECL, NULL_TREE, intSI_type_node));
6397   pushdecl (build_decl (TYPE_DECL, NULL_TREE, intDI_type_node));
6398 #if HOST_BITS_PER_WIDE_INT >= 64
6399   pushdecl (build_decl (TYPE_DECL, get_identifier ("__int128_t"), intTI_type_node));
6400 #endif
6401   pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intQI_type_node));
6402   pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intHI_type_node));
6403   pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intSI_type_node));
6404   pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intDI_type_node));
6405 #if HOST_BITS_PER_WIDE_INT >= 64
6406   pushdecl (build_decl (TYPE_DECL, get_identifier ("__uint128_t"), unsigned_intTI_type_node));
6407 #endif
6408
6409   build_common_tree_nodes_2 (flag_short_double);
6410
6411   java_byte_type_node = record_builtin_java_type ("__java_byte", 8);
6412   java_short_type_node = record_builtin_java_type ("__java_short", 16);
6413   java_int_type_node = record_builtin_java_type ("__java_int", 32);
6414   java_long_type_node = record_builtin_java_type ("__java_long", 64);
6415   java_float_type_node = record_builtin_java_type ("__java_float", -32);
6416   java_double_type_node = record_builtin_java_type ("__java_double", -64);
6417   java_char_type_node = record_builtin_java_type ("__java_char", -16);
6418   java_boolean_type_node = record_builtin_java_type ("__java_boolean", -1);
6419
6420   integer_two_node = build_int_2 (2, 0);
6421   TREE_TYPE (integer_two_node) = integer_type_node;
6422   integer_three_node = build_int_2 (3, 0);
6423   TREE_TYPE (integer_three_node) = integer_type_node;
6424
6425   boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
6426   TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
6427   TYPE_MAX_VALUE (boolean_type_node) = build_int_2 (1, 0);
6428   TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node)) = boolean_type_node;
6429   TYPE_PRECISION (boolean_type_node) = 1;
6430   record_builtin_type (RID_BOOL, "bool", boolean_type_node);
6431   boolean_false_node = build_int_2 (0, 0);
6432   TREE_TYPE (boolean_false_node) = boolean_type_node;
6433   boolean_true_node = build_int_2 (1, 0);
6434   TREE_TYPE (boolean_true_node) = boolean_type_node;
6435
6436   signed_size_zero_node = build_int_2 (0, 0);
6437   record_builtin_type (RID_FLOAT, NULL_PTR, float_type_node);
6438   record_builtin_type (RID_DOUBLE, NULL_PTR, double_type_node);
6439   record_builtin_type (RID_MAX, "long double", long_double_type_node);
6440
6441   pushdecl (build_decl (TYPE_DECL, get_identifier ("complex int"),
6442                         complex_integer_type_node));
6443   pushdecl (build_decl (TYPE_DECL, get_identifier ("complex float"),
6444                         complex_float_type_node));
6445   pushdecl (build_decl (TYPE_DECL, get_identifier ("complex double"),
6446                         complex_double_type_node));
6447   pushdecl (build_decl (TYPE_DECL, get_identifier ("complex long double"),
6448                         complex_long_double_type_node));
6449
6450   TREE_TYPE (signed_size_zero_node) = make_signed_type (TYPE_PRECISION (sizetype));
6451
6452   record_builtin_type (RID_VOID, NULL_PTR, void_type_node);
6453   void_list_node = build_tree_list (NULL_TREE, void_type_node);
6454   TREE_PARMLIST (void_list_node) = 1;
6455
6456   /* Used for expressions that do nothing, but are not errors.  */
6457   void_zero_node = build_int_2 (0, 0);
6458   TREE_TYPE (void_zero_node) = void_type_node;
6459
6460   string_type_node = build_pointer_type (char_type_node);
6461   const_string_type_node
6462     = build_pointer_type (build_qualified_type (char_type_node,
6463                                                 TYPE_QUAL_CONST));
6464   empty_except_spec = build_tree_list (NULL_TREE, NULL_TREE);
6465 #if 0
6466   record_builtin_type (RID_MAX, NULL_PTR, string_type_node);
6467 #endif
6468
6469   /* Make a type to be the domain of a few array types
6470      whose domains don't really matter.
6471      200 is small enough that it always fits in size_t.  */
6472   array_domain_type = build_index_type (build_int_2 (200, 0));
6473
6474   /* Make a type for arrays of characters.
6475      With luck nothing will ever really depend on the length of this
6476      array type.  */
6477   char_array_type_node
6478     = build_array_type (char_type_node, array_domain_type);
6479
6480   /* Likewise for arrays of ints.  */
6481   int_array_type_node
6482     = build_array_type (integer_type_node, array_domain_type);
6483
6484   if (flag_new_abi)
6485     delta_type_node = ptrdiff_type_node;
6486   else if (flag_huge_objects)
6487     delta_type_node = long_integer_type_node;
6488   else
6489     delta_type_node = short_integer_type_node;
6490
6491   if (flag_new_abi)
6492     vtable_index_type = ptrdiff_type_node;
6493   else
6494     vtable_index_type = delta_type_node;
6495
6496   default_function_type
6497     = build_function_type (integer_type_node, NULL_TREE);
6498
6499   ptr_type_node = build_pointer_type (void_type_node);
6500   const_ptr_type_node
6501     = build_pointer_type (build_qualified_type (void_type_node,
6502                                                 TYPE_QUAL_CONST));
6503   vtt_parm_type = build_pointer_type (const_ptr_type_node);
6504   c_common_nodes_and_builtins (1, flag_no_builtin, flag_no_nonansi_builtin);
6505   lang_type_promotes_to = convert_type_from_ellipsis;
6506
6507   void_ftype_ptr
6508     = build_exception_variant (void_ftype_ptr, empty_except_spec);
6509
6510   /* C++ extensions */
6511
6512   unknown_type_node = make_node (UNKNOWN_TYPE);
6513   record_unknown_type (unknown_type_node, "unknown type");
6514
6515   /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node.  */
6516   TREE_TYPE (unknown_type_node) = unknown_type_node;
6517
6518   TREE_TYPE (null_node) = type_for_size (POINTER_SIZE, 0);
6519
6520   /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6521      result.  */
6522   TYPE_POINTER_TO (unknown_type_node) = unknown_type_node;
6523   TYPE_REFERENCE_TO (unknown_type_node) = unknown_type_node;
6524
6525   /* This is special for C++ so functions can be overloaded.  */
6526   wchar_type_node = get_identifier (flag_short_wchar
6527                                     ? "short unsigned int"
6528                                     : WCHAR_TYPE);
6529   wchar_type_node = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node));
6530   wchar_type_size = TYPE_PRECISION (wchar_type_node);
6531   signed_wchar_type_node = make_signed_type (wchar_type_size);
6532   unsigned_wchar_type_node = make_unsigned_type (wchar_type_size);
6533   wchar_type_node
6534     = TREE_UNSIGNED (wchar_type_node)
6535       ? unsigned_wchar_type_node
6536       : signed_wchar_type_node;
6537   record_builtin_type (RID_WCHAR, "__wchar_t", wchar_type_node);
6538
6539   /* Artificial declaration of wchar_t -- can be bashed */
6540   wchar_decl_node = build_decl (TYPE_DECL, get_identifier ("wchar_t"),
6541                                 wchar_type_node);
6542   pushdecl (wchar_decl_node);
6543
6544   /* This is for wide string constants.  */
6545   wchar_array_type_node
6546     = build_array_type (wchar_type_node, array_domain_type);
6547
6548   if (flag_vtable_thunks)
6549     {
6550       /* Make sure we get a unique function type, so we can give
6551          its pointer type a name.  (This wins for gdb.) */
6552       tree vfunc_type = make_node (FUNCTION_TYPE);
6553       TREE_TYPE (vfunc_type) = integer_type_node;
6554       TYPE_ARG_TYPES (vfunc_type) = NULL_TREE;
6555       layout_type (vfunc_type);
6556
6557       vtable_entry_type = build_pointer_type (vfunc_type);
6558     }
6559   else
6560     {
6561       vtable_entry_type = make_aggr_type (RECORD_TYPE);
6562       fields[0] = build_decl (FIELD_DECL, delta_identifier,
6563                               delta_type_node);
6564       fields[1] = build_decl (FIELD_DECL, index_identifier,
6565                               delta_type_node);
6566       fields[2] = build_decl (FIELD_DECL, pfn_identifier,
6567                               ptr_type_node);
6568       finish_builtin_type (vtable_entry_type, VTBL_PTR_TYPE, fields, 2,
6569                            double_type_node);
6570
6571       /* Make this part of an invisible union.  */
6572       fields[3] = copy_node (fields[2]);
6573       TREE_TYPE (fields[3]) = delta_type_node;
6574       DECL_NAME (fields[3]) = delta2_identifier;
6575       DECL_MODE (fields[3]) = TYPE_MODE (delta_type_node);
6576       DECL_SIZE (fields[3]) = TYPE_SIZE (delta_type_node);
6577       DECL_SIZE_UNIT (fields[3]) = TYPE_SIZE_UNIT (delta_type_node);
6578       TREE_UNSIGNED (fields[3]) = 0;
6579       TREE_CHAIN (fields[2]) = fields[3];
6580       vtable_entry_type = build_qualified_type (vtable_entry_type,
6581                                                 TYPE_QUAL_CONST);
6582     }
6583   record_builtin_type (RID_MAX, VTBL_PTR_TYPE, vtable_entry_type);
6584
6585   vtbl_type_node
6586     = build_cplus_array_type (vtable_entry_type, NULL_TREE);
6587   layout_type (vtbl_type_node);
6588   vtbl_type_node = build_qualified_type (vtbl_type_node, TYPE_QUAL_CONST);
6589   record_builtin_type (RID_MAX, NULL_PTR, vtbl_type_node);
6590   vtbl_ptr_type_node = build_pointer_type (vtable_entry_type);
6591   layout_type (vtbl_ptr_type_node);
6592   record_builtin_type (RID_MAX, NULL_PTR, vtbl_ptr_type_node);
6593
6594   std_node = build_decl (NAMESPACE_DECL,
6595                          flag_honor_std
6596                          ? get_identifier ("fake std") : std_identifier,
6597                          void_type_node);
6598   pushdecl (std_node);
6599
6600   if (flag_new_abi)
6601     {
6602       push_namespace (get_identifier ("__cxxabiv1"));
6603       abi_node = current_namespace;
6604       pop_namespace ();
6605     }
6606
6607   global_type_node = make_node (LANG_TYPE);
6608   record_unknown_type (global_type_node, "global type");
6609
6610   /* Now, C++.  */
6611   current_lang_name = lang_name_cplusplus;
6612
6613   {
6614     tree bad_alloc_type_node, newtype, deltype;
6615     if (flag_honor_std)
6616       push_namespace (get_identifier ("std"));
6617     bad_alloc_type_node = xref_tag
6618       (class_type_node, get_identifier ("bad_alloc"), 1);
6619     if (flag_honor_std)
6620       pop_namespace ();
6621     newtype = build_exception_variant
6622       (ptr_ftype_sizetype, add_exception_specifier (NULL_TREE, bad_alloc_type_node, -1));
6623     deltype = build_exception_variant (void_ftype_ptr, empty_except_spec);
6624     push_cp_library_fn (NEW_EXPR, newtype);
6625     push_cp_library_fn (VEC_NEW_EXPR, newtype);
6626     global_delete_fndecl = push_cp_library_fn (DELETE_EXPR, deltype);
6627     push_cp_library_fn (VEC_DELETE_EXPR, deltype);
6628   }
6629
6630   abort_fndecl
6631     = build_library_fn_ptr ("__pure_virtual", void_ftype);
6632
6633   /* Perform other language dependent initializations.  */
6634   init_class_processing ();
6635   init_init_processing ();
6636   init_search_processing ();
6637   init_rtti_processing ();
6638
6639   if (flag_exceptions)
6640     init_exception_processing ();
6641   if (flag_no_inline)
6642     {
6643       flag_inline_functions = 0;
6644     }
6645
6646   if (! supports_one_only ())
6647     flag_weak = 0;
6648
6649   /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__.  */
6650   make_fname_decl = cp_make_fname_decl;
6651   declare_function_name ();
6652
6653   /* Prepare to check format strings against argument lists.  */
6654   init_function_format_info ();
6655
6656   /* Show we use EH for cleanups.  */
6657   using_eh_for_cleanups ();
6658
6659   print_error_function = lang_print_error_function;
6660   valid_lang_attribute = cp_valid_lang_attribute;
6661
6662   /* Maintain consistency.  Perhaps we should just complain if they
6663      say -fwritable-strings?  */
6664   if (flag_writable_strings)
6665     flag_const_strings = 0;
6666
6667   /* Add GC roots for all of our global variables.  */
6668   ggc_add_tree_root (c_global_trees, sizeof c_global_trees / sizeof(tree));
6669   ggc_add_tree_root (cp_global_trees, sizeof cp_global_trees / sizeof(tree));
6670   ggc_add_tree_root (&integer_three_node, 1);
6671   ggc_add_tree_root (&integer_two_node, 1);
6672   ggc_add_tree_root (&signed_size_zero_node, 1);
6673   ggc_add_tree_root (&size_one_node, 1);
6674   ggc_add_tree_root (&size_zero_node, 1);
6675   ggc_add_root (&global_binding_level, 1, sizeof global_binding_level,
6676                 mark_binding_level);
6677   ggc_add_root (&scope_chain, 1, sizeof scope_chain, &mark_saved_scope);
6678   ggc_add_tree_root (&static_ctors, 1);
6679   ggc_add_tree_root (&static_dtors, 1);
6680   ggc_add_tree_root (&lastiddecl, 1);
6681
6682   ggc_add_tree_root (&last_function_parm_tags, 1);
6683   ggc_add_tree_root (&current_function_return_value, 1);
6684   ggc_add_tree_root (&current_function_parms, 1);
6685   ggc_add_tree_root (&current_function_parm_tags, 1);
6686   ggc_add_tree_root (&last_function_parms, 1);
6687   ggc_add_tree_root (&error_mark_list, 1);
6688
6689   ggc_add_tree_root (&global_namespace, 1);
6690   ggc_add_tree_root (&global_type_node, 1);
6691   ggc_add_tree_root (&anonymous_namespace_name, 1);
6692
6693   ggc_add_tree_root (&got_object, 1);
6694   ggc_add_tree_root (&got_scope, 1);
6695
6696   ggc_add_tree_root (&current_lang_name, 1);
6697   ggc_add_tree_root (&static_aggregates, 1);
6698 }
6699
6700 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6701    decl, NAME is the initialization string and TYPE_DEP indicates whether
6702    NAME depended on the type of the function. We make use of that to detect
6703    __PRETTY_FUNCTION__ inside a template fn.  Because we build a tree for
6704    the function before emitting any of it, we don't need to treat the
6705    VAR_DECL specially. We can decide whether to emit it later, if it was
6706    used.  */
6707
6708 static tree
6709 cp_make_fname_decl (id, name, type_dep)
6710      tree id;
6711      const char *name;
6712      int type_dep;
6713 {
6714   tree decl, type, init;
6715   size_t length = strlen (name);
6716   tree domain = NULL_TREE;
6717
6718   if (!processing_template_decl)
6719     type_dep = 0;
6720   if (!type_dep)
6721     domain = build_index_type (build_int_2 (length, 0));
6722
6723   type =  build_cplus_array_type
6724           (build_qualified_type (char_type_node, TYPE_QUAL_CONST),
6725            domain);
6726
6727   decl = build_decl (VAR_DECL, id, type);
6728   TREE_STATIC (decl) = 1;
6729   TREE_READONLY (decl) = 1;
6730   DECL_SOURCE_LINE (decl) = 0;
6731   DECL_ARTIFICIAL (decl) = 1;
6732   DECL_IN_SYSTEM_HEADER (decl) = 1;
6733   pushdecl (decl);
6734   if (processing_template_decl)
6735     decl = push_template_decl (decl);
6736   if (type_dep)
6737     {
6738       init = build (FUNCTION_NAME, type);
6739       DECL_PRETTY_FUNCTION_P (decl) = 1;
6740     }
6741   else
6742     {
6743       init = build_string (length + 1, name);
6744       TREE_TYPE (init) = type;
6745     }
6746   DECL_INITIAL (decl) = init;
6747   cp_finish_decl (decl, init, NULL_TREE, LOOKUP_ONLYCONVERTING);
6748
6749   /* We will have to make sure we only emit this, if it is actually used. */
6750   return decl;
6751 }
6752
6753 /* Function to print any language-specific context for an error message.  */
6754
6755 static void
6756 lang_print_error_function (file)
6757      const char *file;
6758 {
6759   default_print_error_function (file);
6760   maybe_print_template_context ();
6761 }
6762
6763 /* Entry point for the benefit of c_common_nodes_and_builtins.
6764
6765    Make a definition for a builtin function named NAME and whose data type
6766    is TYPE.  TYPE should be a function type with argument types.
6767
6768    CLASS and CODE tell later passes how to compile calls to this function.
6769    See tree.h for possible values.
6770
6771    If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6772    the name to be called if we can't opencode the function.  */
6773
6774 tree
6775 builtin_function (name, type, code, class, libname)
6776      const char *name;
6777      tree type;
6778      int code;
6779      enum built_in_class class;
6780      const char *libname;
6781 {
6782   tree decl = build_library_fn_1 (get_identifier (name), ERROR_MARK, type);
6783   DECL_BUILT_IN_CLASS (decl) = class;
6784   DECL_FUNCTION_CODE (decl) = code;
6785
6786   my_friendly_assert (DECL_CONTEXT (decl) == NULL_TREE, 392);
6787
6788   /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6789      we cannot change DECL_ASSEMBLER_NAME until we have installed this
6790      function in the namespace.  */
6791   pushdecl (decl);
6792   if (libname)
6793     DECL_ASSEMBLER_NAME (decl) = get_identifier (libname);
6794   make_function_rtl (decl);
6795
6796   /* Warn if a function in the namespace for users
6797      is used without an occasion to consider it declared.  */
6798   if (name[0] != '_' || name[1] != '_')
6799     DECL_ANTICIPATED (decl) = 1;
6800
6801   return decl;
6802 }
6803
6804 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6805    function.  Not called directly.  */
6806
6807 static tree
6808 build_library_fn_1 (name, operator_code, type)
6809      tree name;
6810      enum tree_code operator_code;
6811      tree type;
6812 {
6813   tree fn = build_lang_decl (FUNCTION_DECL, name, type);
6814   DECL_EXTERNAL (fn) = 1;
6815   TREE_PUBLIC (fn) = 1;
6816   DECL_ARTIFICIAL (fn) = 1;
6817   TREE_NOTHROW (fn) = 1;
6818   SET_OVERLOADED_OPERATOR_CODE (fn, operator_code);
6819   return fn;
6820 }
6821
6822 /* Returns the _DECL for a library function with C linkage.
6823    We assume that such functions never throw; if this is incorrect,
6824    callers should unset TREE_NOTHROW.  */
6825
6826 tree
6827 build_library_fn (name, type)
6828      tree name;
6829      tree type;
6830 {
6831   tree fn = build_library_fn_1 (name, ERROR_MARK, type);
6832   make_function_rtl (fn);
6833   return fn;
6834 }
6835
6836 /* Returns the _DECL for a library function with C++ linkage.  */
6837
6838 static tree
6839 build_cp_library_fn (name, operator_code, type)
6840      tree name;
6841      enum tree_code operator_code;
6842      tree type;
6843 {
6844   tree fn = build_library_fn_1 (name, operator_code, type);
6845   TREE_NOTHROW (fn) = TYPE_NOTHROW_P (type);
6846   DECL_CONTEXT (fn) = FROB_CONTEXT (current_namespace);
6847   set_mangled_name_for_decl (fn);
6848   make_function_rtl (fn);
6849   return fn;
6850 }
6851
6852 /* Like build_library_fn, but takes a C string instead of an
6853    IDENTIFIER_NODE.  */
6854
6855 tree
6856 build_library_fn_ptr (name, type)
6857      const char *name;
6858      tree type;
6859 {
6860   return build_library_fn (get_identifier (name), type);
6861 }
6862
6863 /* Like build_cp_library_fn, but takes a C string instead of an
6864    IDENTIFIER_NODE.  */
6865
6866 tree
6867 build_cp_library_fn_ptr (name, type)
6868      const char *name;
6869      tree type;
6870 {
6871   return build_cp_library_fn (get_identifier (name), ERROR_MARK, type);
6872 }
6873
6874 /* Like build_library_fn, but also pushes the function so that we will
6875    be able to find it via IDENTIFIER_GLOBAL_VALUE.  */
6876
6877 tree
6878 push_library_fn (name, type)
6879      tree name, type;
6880 {
6881   tree fn = build_library_fn (name, type);
6882   pushdecl_top_level (fn);
6883   return fn;
6884 }
6885
6886 /* Like build_cp_library_fn, but also pushes the function so that it
6887    will be found by normal lookup.  */
6888
6889 static tree
6890 push_cp_library_fn (operator_code, type)
6891      enum tree_code operator_code;
6892      tree type;
6893 {
6894   tree fn = build_cp_library_fn (ansi_opname (operator_code),
6895                                  operator_code,
6896                                  type);
6897   pushdecl (fn);
6898   return fn;
6899 }
6900
6901 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6902    a FUNCTION_TYPE.  */
6903
6904 tree
6905 push_void_library_fn (name, parmtypes)
6906      tree name, parmtypes;
6907 {
6908   tree type = build_function_type (void_type_node, parmtypes);
6909   return push_library_fn (name, type);
6910 }
6911
6912 /* Like push_library_fn, but also note that this function throws
6913    and does not return.  Used for __throw_foo and the like.  */
6914
6915 tree
6916 push_throw_library_fn (name, type)
6917      tree name, type;
6918 {
6919   tree fn = push_library_fn (name, type);
6920   TREE_THIS_VOLATILE (fn) = 1;
6921   TREE_NOTHROW (fn) = 0;
6922   return fn;
6923 }
6924 \f
6925 /* When we call finish_struct for an anonymous union, we create
6926    default copy constructors and such.  But, an anonymous union
6927    shouldn't have such things; this function undoes the damage to the
6928    anonymous union type T.
6929
6930    (The reason that we create the synthesized methods is that we don't
6931    distinguish `union { int i; }' from `typedef union { int i; } U'.
6932    The first is an anonymous union; the second is just an ordinary
6933    union type.)  */
6934
6935 void
6936 fixup_anonymous_aggr (t)
6937      tree t;
6938 {
6939   tree *q;
6940
6941   /* Wipe out memory of synthesized methods */
6942   TYPE_HAS_CONSTRUCTOR (t) = 0;
6943   TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 0;
6944   TYPE_HAS_INIT_REF (t) = 0;
6945   TYPE_HAS_CONST_INIT_REF (t) = 0;
6946   TYPE_HAS_ASSIGN_REF (t) = 0;
6947   TYPE_HAS_CONST_ASSIGN_REF (t) = 0;
6948
6949   /* Splice the implicitly generated functions out of the TYPE_METHODS
6950      list.  */
6951   q = &TYPE_METHODS (t);
6952   while (*q)
6953     {
6954       if (DECL_ARTIFICIAL (*q))
6955         *q = TREE_CHAIN (*q);
6956       else
6957         q = &TREE_CHAIN (*q);
6958     }
6959
6960   /* ISO C++ 9.5.3.  Anonymous unions may not have function members.  */
6961   if (TYPE_METHODS (t))
6962     error ("an anonymous union cannot have function members");
6963 }
6964
6965 /* Make sure that a declaration with no declarator is well-formed, i.e.
6966    just defines a tagged type or anonymous union.
6967
6968    Returns the type defined, if any.  */
6969
6970 tree
6971 check_tag_decl (declspecs)
6972      tree declspecs;
6973 {
6974   int found_type = 0;
6975   int saw_friend = 0;
6976   tree ob_modifier = NULL_TREE;
6977   register tree link;
6978   register tree t = NULL_TREE;
6979
6980   for (link = declspecs; link; link = TREE_CHAIN (link))
6981     {
6982       register tree value = TREE_VALUE (link);
6983
6984       if (TYPE_P (value)
6985           || (TREE_CODE (value) == IDENTIFIER_NODE
6986               && IDENTIFIER_GLOBAL_VALUE (value)
6987               && TYPE_P (IDENTIFIER_GLOBAL_VALUE (value))))
6988         {
6989           ++found_type;
6990
6991           if (IS_AGGR_TYPE (value) || TREE_CODE (value) == ENUMERAL_TYPE)
6992             {
6993               my_friendly_assert (TYPE_MAIN_DECL (value) != NULL_TREE, 261);
6994               t = value;
6995             }
6996         }
6997       else if (value == ridpointers[(int) RID_FRIEND])
6998         {
6999           if (current_class_type == NULL_TREE
7000               || current_scope () != current_class_type)
7001             ob_modifier = value;
7002           else
7003             saw_friend = 1;
7004         }
7005       else if (value == ridpointers[(int) RID_STATIC]
7006                || value == ridpointers[(int) RID_EXTERN]
7007                || value == ridpointers[(int) RID_AUTO]
7008                || value == ridpointers[(int) RID_REGISTER]
7009                || value == ridpointers[(int) RID_INLINE]
7010                || value == ridpointers[(int) RID_VIRTUAL]
7011                || value == ridpointers[(int) RID_CONST]
7012                || value == ridpointers[(int) RID_VOLATILE]
7013                || value == ridpointers[(int) RID_EXPLICIT])
7014         ob_modifier = value;
7015     }
7016
7017   if (found_type > 1)
7018     error ("multiple types in one declaration");
7019
7020   if (t == NULL_TREE && ! saw_friend)
7021     pedwarn ("declaration does not declare anything");
7022
7023   /* Check for an anonymous union.  We're careful
7024      accessing TYPE_IDENTIFIER because some built-in types, like
7025      pointer-to-member types, do not have TYPE_NAME.  */
7026   else if (t && IS_AGGR_TYPE_CODE (TREE_CODE (t))
7027            && TYPE_NAME (t)
7028            && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
7029     {
7030       /* Anonymous unions are objects, so they can have specifiers.  */;
7031       SET_ANON_AGGR_TYPE_P (t);
7032
7033       if (TREE_CODE (t) != UNION_TYPE && pedantic && ! in_system_header)
7034         pedwarn ("ISO C++ prohibits anonymous structs");
7035     }
7036
7037   else if (ob_modifier)
7038     {
7039       if (ob_modifier == ridpointers[(int) RID_INLINE]
7040           || ob_modifier == ridpointers[(int) RID_VIRTUAL])
7041         cp_error ("`%D' can only be specified for functions", ob_modifier);
7042       else if (ob_modifier == ridpointers[(int) RID_FRIEND])
7043         cp_error ("`%D' can only be specified inside a class", ob_modifier);
7044       else if (ob_modifier == ridpointers[(int) RID_EXPLICIT])
7045         cp_error ("`%D' can only be specified for constructors",
7046                   ob_modifier);
7047       else
7048         cp_error ("`%D' can only be specified for objects and functions",
7049                   ob_modifier);
7050     }
7051
7052   return t;
7053 }
7054
7055 /* Called when a declaration is seen that contains no names to declare.
7056    If its type is a reference to a structure, union or enum inherited
7057    from a containing scope, shadow that tag name for the current scope
7058    with a forward reference.
7059    If its type defines a new named structure or union
7060    or defines an enum, it is valid but we need not do anything here.
7061    Otherwise, it is an error.
7062
7063    C++: may have to grok the declspecs to learn about static,
7064    complain for anonymous unions.  */
7065
7066 void
7067 shadow_tag (declspecs)
7068      tree declspecs;
7069 {
7070   tree t = check_tag_decl (declspecs);
7071
7072   if (t)
7073     maybe_process_partial_specialization (t);
7074
7075   /* This is where the variables in an anonymous union are
7076      declared.  An anonymous union declaration looks like:
7077      union { ... } ;
7078      because there is no declarator after the union, the parser
7079      sends that declaration here.  */
7080   if (t && ANON_AGGR_TYPE_P (t))
7081     {
7082       fixup_anonymous_aggr (t);
7083
7084       if (TYPE_FIELDS (t))
7085         {
7086           tree decl = grokdeclarator (NULL_TREE, declspecs, NORMAL, 0,
7087                                       NULL_TREE);
7088           finish_anon_union (decl);
7089         }
7090     }
7091 }
7092 \f
7093 /* Decode a "typename", such as "int **", returning a ..._TYPE node.  */
7094
7095 tree
7096 groktypename (typename)
7097      tree typename;
7098 {
7099   if (TREE_CODE (typename) != TREE_LIST)
7100     return typename;
7101   return grokdeclarator (TREE_VALUE (typename),
7102                          TREE_PURPOSE (typename),
7103                          TYPENAME, 0, NULL_TREE);
7104 }
7105
7106 /* Decode a declarator in an ordinary declaration or data definition.
7107    This is called as soon as the type information and variable name
7108    have been parsed, before parsing the initializer if any.
7109    Here we create the ..._DECL node, fill in its type,
7110    and put it on the list of decls for the current context.
7111    The ..._DECL node is returned as the value.
7112
7113    Exception: for arrays where the length is not specified,
7114    the type is left null, to be filled in by `cp_finish_decl'.
7115
7116    Function definitions do not come here; they go to start_function
7117    instead.  However, external and forward declarations of functions
7118    do go through here.  Structure field declarations are done by
7119    grokfield and not through here.  */
7120
7121 tree
7122 start_decl (declarator, declspecs, initialized, attributes, prefix_attributes)
7123      tree declarator, declspecs;
7124      int initialized;
7125      tree attributes, prefix_attributes;
7126 {
7127   register tree decl;
7128   register tree type, tem;
7129   tree context;
7130   extern int have_extern_spec;
7131   extern int used_extern_spec;
7132   tree attrlist;
7133
7134 #if 0
7135   /* See code below that used this.  */
7136   int init_written = initialized;
7137 #endif
7138
7139   /* This should only be done once on the top most decl.  */
7140   if (have_extern_spec && !used_extern_spec)
7141     {
7142       declspecs = decl_tree_cons (NULL_TREE, get_identifier ("extern"),
7143                                   declspecs);
7144       used_extern_spec = 1;
7145     }
7146
7147   if (attributes || prefix_attributes)
7148     attrlist = build_tree_list (attributes, prefix_attributes);
7149   else
7150     attrlist = NULL_TREE;
7151
7152   decl = grokdeclarator (declarator, declspecs, NORMAL, initialized,
7153                          attrlist);
7154
7155   if (decl == NULL_TREE || TREE_CODE (decl) == VOID_TYPE)
7156     return NULL_TREE;
7157
7158   type = TREE_TYPE (decl);
7159
7160   if (type == error_mark_node)
7161     return NULL_TREE;
7162
7163   context = DECL_CONTEXT (decl);
7164
7165   if (initialized && context && TREE_CODE (context) == NAMESPACE_DECL
7166       && context != current_namespace && TREE_CODE (decl) == VAR_DECL)
7167     {
7168       /* When parsing the initializer, lookup should use the object's
7169          namespace. */
7170       push_decl_namespace (context);
7171     }
7172
7173   /* We are only interested in class contexts, later. */
7174   if (context && TREE_CODE (context) == NAMESPACE_DECL)
7175     context = NULL_TREE;
7176
7177   if (initialized)
7178     /* Is it valid for this decl to have an initializer at all?
7179        If not, set INITIALIZED to zero, which will indirectly
7180        tell `cp_finish_decl' to ignore the initializer once it is parsed.  */
7181     switch (TREE_CODE (decl))
7182       {
7183       case TYPE_DECL:
7184         /* typedef foo = bar  means give foo the same type as bar.
7185            We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7186            Any other case of an initialization in a TYPE_DECL is an error.  */
7187         if (pedantic || list_length (declspecs) > 1)
7188           {
7189             cp_error ("typedef `%D' is initialized", decl);
7190             initialized = 0;
7191           }
7192         break;
7193
7194       case FUNCTION_DECL:
7195         cp_error ("function `%#D' is initialized like a variable", decl);
7196         initialized = 0;
7197         break;
7198
7199       default:
7200         break;
7201       }
7202
7203   if (initialized)
7204     {
7205       if (! toplevel_bindings_p ()
7206           && DECL_EXTERNAL (decl))
7207         cp_warning ("declaration of `%#D' has `extern' and is initialized",
7208                     decl);
7209       DECL_EXTERNAL (decl) = 0;
7210       if (toplevel_bindings_p ())
7211         TREE_STATIC (decl) = 1;
7212
7213       /* Tell `pushdecl' this is an initialized decl
7214          even though we don't yet have the initializer expression.
7215          Also tell `cp_finish_decl' it may store the real initializer.  */
7216       DECL_INITIAL (decl) = error_mark_node;
7217     }
7218
7219 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7220   SET_DEFAULT_DECL_ATTRIBUTES (decl, attributes);
7221 #endif
7222
7223   /* Set attributes here so if duplicate decl, will have proper attributes.  */
7224   cplus_decl_attributes (decl, attributes, prefix_attributes);
7225
7226   if (context && COMPLETE_TYPE_P (complete_type (context)))
7227     {
7228       push_nested_class (context, 2);
7229
7230       if (TREE_CODE (decl) == VAR_DECL)
7231         {
7232           tree field = lookup_field (context, DECL_NAME (decl), 0, 0);
7233           if (field == NULL_TREE || TREE_CODE (field) != VAR_DECL)
7234             cp_error ("`%#D' is not a static member of `%#T'", decl, context);
7235           else
7236             {
7237               if (DECL_CONTEXT (field) != context)
7238                 {
7239                   cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7240                               DECL_CONTEXT (field), DECL_NAME (decl),
7241                               context, DECL_NAME (decl));
7242                   DECL_CONTEXT (decl) = DECL_CONTEXT (field);
7243                 }
7244               /* Static data member are tricky; an in-class initialization
7245                  still doesn't provide a definition, so the in-class
7246                  declaration will have DECL_EXTERNAL set, but will have an
7247                  initialization.  Thus, duplicate_decls won't warn
7248                  about this situation, and so we check here.  */
7249               if (DECL_INITIAL (decl) && DECL_INITIAL (field))
7250                 cp_error ("duplicate initialization of %D", decl);
7251               if (duplicate_decls (decl, field))
7252                 decl = field;
7253             }
7254         }
7255       else
7256         {
7257           tree field = check_classfn (context, decl);
7258           if (field && duplicate_decls (decl, field))
7259             decl = field;
7260         }
7261
7262       /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set.  */
7263       DECL_IN_AGGR_P (decl) = 0;
7264       if ((DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl))
7265           || CLASSTYPE_TEMPLATE_INSTANTIATION (context))
7266         {
7267           SET_DECL_TEMPLATE_SPECIALIZATION (decl);
7268           /* [temp.expl.spec] An explicit specialization of a static data
7269              member of a template is a definition if the declaration
7270              includes an initializer; otherwise, it is a declaration.
7271
7272              We check for processing_specialization so this only applies
7273              to the new specialization syntax.  */
7274           if (DECL_INITIAL (decl) == NULL_TREE && processing_specialization)
7275             DECL_EXTERNAL (decl) = 1;
7276         }
7277
7278       if (DECL_EXTERNAL (decl) && ! DECL_TEMPLATE_SPECIALIZATION (decl))
7279         cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7280                     decl);
7281     }
7282
7283   /* Enter this declaration into the symbol table.  */
7284   tem = maybe_push_decl (decl);
7285
7286   if (processing_template_decl)
7287     tem = push_template_decl (tem);
7288
7289 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7290   /* Tell the back-end to use or not use .common as appropriate.  If we say
7291      -fconserve-space, we want this to save .data space, at the expense of
7292      wrong semantics.  If we say -fno-conserve-space, we want this to
7293      produce errors about redefs; to do this we force variables into the
7294      data segment.  */
7295   DECL_COMMON (tem) = flag_conserve_space || ! TREE_PUBLIC (tem);
7296 #endif
7297
7298   if (! processing_template_decl)
7299     start_decl_1 (tem);
7300
7301   return tem;
7302 }
7303
7304 void
7305 start_decl_1 (decl)
7306      tree decl;
7307 {
7308   tree type = TREE_TYPE (decl);
7309   int initialized = (DECL_INITIAL (decl) != NULL_TREE);
7310
7311   if (type == error_mark_node)
7312     return;
7313
7314   /* If this type of object needs a cleanup, but we're not allowed to
7315      add any more objects with cleanups to the current scope, create a
7316      new binding level.  */
7317   if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
7318       && current_binding_level->more_cleanups_ok == 0)
7319     {
7320       keep_next_level (2);
7321       pushlevel (1);
7322       clear_last_expr ();
7323       add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
7324     }
7325
7326   if (initialized)
7327     /* Is it valid for this decl to have an initializer at all?
7328        If not, set INITIALIZED to zero, which will indirectly
7329        tell `cp_finish_decl' to ignore the initializer once it is parsed.  */
7330     {
7331       /* Don't allow initializations for incomplete types except for
7332          arrays which might be completed by the initialization.  */
7333       if (COMPLETE_TYPE_P (complete_type (type)))
7334         ;                       /* A complete type is ok.  */
7335       else if (TREE_CODE (type) != ARRAY_TYPE)
7336         {
7337           cp_error ("variable `%#D' has initializer but incomplete type",
7338                     decl);
7339           initialized = 0;
7340           type = TREE_TYPE (decl) = error_mark_node;
7341         }
7342       else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type))))
7343         {
7344           if (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl))
7345             cp_error ("elements of array `%#D' have incomplete type", decl);
7346           /* else we already gave an error in start_decl.  */
7347           initialized = 0;
7348         }
7349     }
7350
7351   if (!initialized
7352       && TREE_CODE (decl) != TYPE_DECL
7353       && TREE_CODE (decl) != TEMPLATE_DECL
7354       && type != error_mark_node
7355       && IS_AGGR_TYPE (type)
7356       && ! DECL_EXTERNAL (decl))
7357     {
7358       if ((! processing_template_decl || ! uses_template_parms (type))
7359           && !COMPLETE_TYPE_P (complete_type (type)))
7360         {
7361           cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7362                  decl);
7363           /* Change the type so that assemble_variable will give
7364              DECL an rtl we can live with: (mem (const_int 0)).  */
7365           type = TREE_TYPE (decl) = error_mark_node;
7366         }
7367       else
7368         {
7369           /* If any base type in the hierarchy of TYPE needs a constructor,
7370              then we set initialized to 1.  This way any nodes which are
7371              created for the purposes of initializing this aggregate
7372              will live as long as it does.  This is necessary for global
7373              aggregates which do not have their initializers processed until
7374              the end of the file.  */
7375           initialized = TYPE_NEEDS_CONSTRUCTING (type);
7376         }
7377     }
7378
7379   if (! initialized)
7380     DECL_INITIAL (decl) = NULL_TREE;
7381 }
7382
7383 /* Handle initialization of references.
7384    These three arguments are from `cp_finish_decl', and have the
7385    same meaning here that they do there.
7386
7387    Quotes on semantics can be found in ARM 8.4.3.  */
7388
7389 static void
7390 grok_reference_init (decl, type, init)
7391      tree decl, type, init;
7392 {
7393   tree tmp;
7394
7395   if (init == NULL_TREE)
7396     {
7397       if ((DECL_LANG_SPECIFIC (decl) == 0
7398            || DECL_IN_AGGR_P (decl) == 0)
7399           && ! DECL_THIS_EXTERN (decl))
7400         cp_error ("`%D' declared as reference but not initialized", decl);
7401       return;
7402     }
7403
7404   if (init == error_mark_node)
7405     return;
7406
7407   if (TREE_CODE (init) == CONSTRUCTOR)
7408     {
7409       cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl);
7410       return;
7411     }
7412
7413   if (TREE_CODE (init) == TREE_LIST)
7414     init = build_compound_expr (init);
7415
7416   if (TREE_CODE (TREE_TYPE (init)) == REFERENCE_TYPE)
7417     init = convert_from_reference (init);
7418
7419   if (TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE
7420       && TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE)
7421     {
7422       /* Note: default conversion is only called in very special cases.  */
7423       init = default_conversion (init);
7424     }
7425
7426   /* Convert INIT to the reference type TYPE.  This may involve the
7427      creation of a temporary, whose lifetime must be the same as that
7428      of the reference.  If so, a DECL_STMT for the temporary will be
7429      added just after the DECL_STMT for DECL.  That's why we don't set
7430      DECL_INITIAL for local references (instead assigning to them
7431      explicitly); we need to allow the temporary to be initialized
7432      first.  */
7433   tmp = convert_to_reference
7434     (type, init, CONV_IMPLICIT,
7435      LOOKUP_ONLYCONVERTING|LOOKUP_SPECULATIVELY|LOOKUP_NORMAL|DIRECT_BIND,
7436      decl);
7437
7438   if (tmp == error_mark_node)
7439     return;
7440   else if (tmp != NULL_TREE)
7441     {
7442       init = tmp;
7443       tmp = save_expr (tmp);
7444       if (building_stmt_tree ())
7445         {
7446           /* Initialize the declaration.  */
7447           tmp = build (INIT_EXPR, TREE_TYPE (decl), decl, tmp);
7448           finish_expr_stmt (tmp);
7449         }
7450       else
7451         DECL_INITIAL (decl) = tmp;
7452     }
7453   else
7454     {
7455       cp_error ("cannot initialize `%T' from `%T'", type, TREE_TYPE (init));
7456       return;
7457     }
7458
7459   if (TREE_STATIC (decl) && ! TREE_CONSTANT (DECL_INITIAL (decl)))
7460     {
7461       expand_static_init (decl, DECL_INITIAL (decl));
7462       DECL_INITIAL (decl) = NULL_TREE;
7463     }
7464   return;
7465 }
7466
7467 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7468    mucking with forces it does not comprehend (i.e. initialization with a
7469    constructor).  If we are at global scope and won't go into COMMON, fill
7470    it in with a dummy CONSTRUCTOR to force the variable into .data;
7471    otherwise we can use error_mark_node.  */
7472
7473 static tree
7474 obscure_complex_init (decl, init)
7475      tree decl, init;
7476 {
7477   if (! flag_no_inline && TREE_STATIC (decl))
7478     {
7479       if (extract_init (decl, init))
7480         return NULL_TREE;
7481     }
7482
7483 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7484   if (toplevel_bindings_p () && ! DECL_COMMON (decl))
7485     DECL_INITIAL (decl) = build (CONSTRUCTOR, TREE_TYPE (decl), NULL_TREE,
7486                                  NULL_TREE);
7487   else
7488 #endif
7489     DECL_INITIAL (decl) = error_mark_node;
7490
7491   return init;
7492 }
7493
7494 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7495    array until we finish parsing the initializer.  If that's the
7496    situation we're in, update DECL accordingly.  */
7497
7498 static void
7499 maybe_deduce_size_from_array_init (decl, init)
7500      tree decl;
7501      tree init;
7502 {
7503   tree type = TREE_TYPE (decl);
7504
7505   if (TREE_CODE (type) == ARRAY_TYPE
7506       && TYPE_DOMAIN (type) == NULL_TREE
7507       && TREE_CODE (decl) != TYPE_DECL)
7508     {
7509       int do_default
7510         = (TREE_STATIC (decl)
7511            /* Even if pedantic, an external linkage array
7512               may have incomplete type at first.  */
7513            ? pedantic && ! DECL_EXTERNAL (decl)
7514            : !DECL_EXTERNAL (decl));
7515       tree initializer = init ? init : DECL_INITIAL (decl);
7516       int failure = complete_array_type (type, initializer, do_default);
7517
7518       if (failure == 1)
7519         cp_error ("initializer fails to determine size of `%D'", decl);
7520
7521       if (failure == 2)
7522         {
7523           if (do_default)
7524             cp_error ("array size missing in `%D'", decl);
7525           /* If a `static' var's size isn't known, make it extern as
7526              well as static, so it does not get allocated.  If it's not
7527              `static', then don't mark it extern; finish_incomplete_decl
7528              will give it a default size and it will get allocated.  */
7529           else if (!pedantic && TREE_STATIC (decl) && !TREE_PUBLIC (decl))
7530             DECL_EXTERNAL (decl) = 1;
7531         }
7532
7533       if (pedantic && TYPE_DOMAIN (type) != NULL_TREE
7534           && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type)),
7535                               integer_zero_node))
7536         cp_error ("zero-size array `%D'", decl);
7537
7538       layout_decl (decl, 0);
7539     }
7540 }
7541
7542 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7543    any appropriate error messages regarding the layout.  */
7544
7545 static void
7546 layout_var_decl (decl)
7547      tree decl;
7548 {
7549   tree type = TREE_TYPE (decl);
7550 #if 0
7551   tree ttype = target_type (type);
7552 #endif
7553
7554   /* If we haven't already layed out this declaration, do so now.
7555      Note that we must not call complete type for an external object
7556      because it's type might involve templates that we are not
7557      supposed to isntantiate yet.  (And it's perfectly legal to say
7558      `extern X x' for some incomplete type `X'.)  */
7559   if (!DECL_EXTERNAL (decl))
7560     complete_type (type);
7561   if (!DECL_SIZE (decl) && COMPLETE_TYPE_P (type))
7562     layout_decl (decl, 0);
7563
7564   if (!DECL_EXTERNAL (decl) && DECL_SIZE (decl) == NULL_TREE)
7565     {
7566       /* An automatic variable with an incomplete type: that is an error.
7567          Don't talk about array types here, since we took care of that
7568          message in grokdeclarator.  */
7569       cp_error ("storage size of `%D' isn't known", decl);
7570       TREE_TYPE (decl) = error_mark_node;
7571     }
7572 #if 0
7573   /* Keep this code around in case we later want to control debug info
7574      based on whether a type is "used".  (jason 1999-11-11) */
7575
7576   else if (!DECL_EXTERNAL (decl) && IS_AGGR_TYPE (ttype))
7577     /* Let debugger know it should output info for this type.  */
7578     note_debug_info_needed (ttype);
7579
7580   if (TREE_STATIC (decl) && DECL_CLASS_SCOPE_P (decl))
7581     note_debug_info_needed (DECL_CONTEXT (decl));
7582 #endif
7583
7584   if ((DECL_EXTERNAL (decl) || TREE_STATIC (decl))
7585       && DECL_SIZE (decl) != NULL_TREE
7586       && ! TREE_CONSTANT (DECL_SIZE (decl)))
7587     {
7588       if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST)
7589         constant_expression_warning (DECL_SIZE (decl));
7590       else
7591         cp_error ("storage size of `%D' isn't constant", decl);
7592     }
7593 }
7594
7595 /* If a local static variable is declared in an inline function, or if
7596    we have a weak definition, we must endeavor to create only one
7597    instance of the variable at link-time.  */
7598
7599 static void
7600 maybe_commonize_var (decl)
7601      tree decl;
7602 {
7603   /* Static data in a function with comdat linkage also has comdat
7604      linkage.  */
7605   if (TREE_STATIC (decl)
7606       /* Don't mess with __FUNCTION__.  */
7607       && ! DECL_ARTIFICIAL (decl)
7608       && current_function_decl
7609       && DECL_CONTEXT (decl) == current_function_decl
7610       && (DECL_THIS_INLINE (current_function_decl)
7611           || DECL_TEMPLATE_INSTANTIATION (current_function_decl))
7612       && TREE_PUBLIC (current_function_decl))
7613     {
7614       /* Rather than try to get this right with inlining, we suppress
7615          inlining of such functions.  */
7616       current_function_cannot_inline
7617         = "function with static variable cannot be inline";
7618
7619       /* If flag_weak, we don't need to mess with this, as we can just
7620          make the function weak, and let it refer to its unique local
7621          copy.  This works because we don't allow the function to be
7622          inlined.  */
7623       if (! flag_weak)
7624         {
7625           if (DECL_INTERFACE_KNOWN (current_function_decl))
7626             {
7627               TREE_PUBLIC (decl) = 1;
7628               DECL_EXTERNAL (decl) = DECL_EXTERNAL (current_function_decl);
7629             }
7630           else if (DECL_INITIAL (decl) == NULL_TREE
7631                    || DECL_INITIAL (decl) == error_mark_node)
7632             {
7633               TREE_PUBLIC (decl) = 1;
7634               DECL_COMMON (decl) = 1;
7635             }
7636           /* else we lose. We can only do this if we can use common,
7637              which we can't if it has been initialized.  */
7638
7639           if (TREE_PUBLIC (decl))
7640             DECL_ASSEMBLER_NAME (decl)
7641               = build_static_name (current_function_decl, DECL_NAME (decl));
7642           else
7643             {
7644               cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl);
7645               cp_warning_at ("  you can work around this by removing the initializer", decl);
7646             }
7647         }
7648     }
7649   else if (DECL_LANG_SPECIFIC (decl) && DECL_COMDAT (decl))
7650     /* Set it up again; we might have set DECL_INITIAL since the last
7651        time.  */
7652     comdat_linkage (decl);
7653 }
7654
7655 /* Issue an error message if DECL is an uninitialized const variable.  */
7656
7657 static void
7658 check_for_uninitialized_const_var (decl)
7659      tree decl;
7660 {
7661   tree type = TREE_TYPE (decl);
7662
7663   /* ``Unless explicitly declared extern, a const object does not have
7664      external linkage and must be initialized. ($8.4; $12.1)'' ARM
7665      7.1.6 */
7666   if (TREE_CODE (decl) == VAR_DECL
7667       && TREE_CODE (type) != REFERENCE_TYPE
7668       && CP_TYPE_CONST_P (type)
7669       && !TYPE_NEEDS_CONSTRUCTING (type)
7670       && !DECL_INITIAL (decl))
7671     cp_error ("uninitialized const `%D'", decl);
7672 }
7673
7674 /* Verify INIT (the initializer for DECL), and record the
7675    initialization in DECL_INITIAL, if appropriate.  Returns a new
7676    value for INIT.  */
7677
7678 static tree
7679 check_initializer (decl, init)
7680      tree decl;
7681      tree init;
7682 {
7683   tree type;
7684
7685   if (TREE_CODE (decl) == FIELD_DECL)
7686     return init;
7687
7688   type = TREE_TYPE (decl);
7689
7690   /* If `start_decl' didn't like having an initialization, ignore it now.  */
7691   if (init != NULL_TREE && DECL_INITIAL (decl) == NULL_TREE)
7692     init = NULL_TREE;
7693
7694   /* Check the initializer.  */
7695   if (init)
7696     {
7697       /* Things that are going to be initialized need to have complete
7698          type.  */
7699       TREE_TYPE (decl) = type = complete_type (TREE_TYPE (decl));
7700
7701       if (type == error_mark_node)
7702         /* We will have already complained.  */
7703         init = NULL_TREE;
7704       else if (COMPLETE_TYPE_P (type) && !TREE_CONSTANT (TYPE_SIZE (type)))
7705         {
7706           cp_error ("variable-sized object `%D' may not be initialized", decl);
7707           init = NULL_TREE;
7708         }
7709       else if (TREE_CODE (type) == ARRAY_TYPE
7710                && !COMPLETE_TYPE_P (TREE_TYPE (type)))
7711         {
7712           cp_error ("elements of array `%#D' have incomplete type", decl);
7713           init = NULL_TREE;
7714         }
7715       else if (!COMPLETE_TYPE_P (type))
7716         {
7717           cp_error ("`%D' has incomplete type", decl);
7718           TREE_TYPE (decl) = error_mark_node;
7719           init = NULL_TREE;
7720         }
7721     }
7722
7723   if (TREE_CODE (decl) == CONST_DECL)
7724     {
7725       my_friendly_assert (TREE_CODE (decl) != REFERENCE_TYPE, 148);
7726
7727       DECL_INITIAL (decl) = init;
7728
7729       /* This will keep us from needing to worry about our obstacks.  */
7730       my_friendly_assert (init != NULL_TREE, 149);
7731       init = NULL_TREE;
7732     }
7733   else if (!DECL_EXTERNAL (decl) && TREE_CODE (type) == REFERENCE_TYPE)
7734     {
7735       if (TREE_STATIC (decl))
7736         make_decl_rtl (decl, NULL_PTR, toplevel_bindings_p ());
7737       grok_reference_init (decl, type, init);
7738       init = NULL_TREE;
7739     }
7740   else if (init)
7741     {
7742       if (TYPE_HAS_CONSTRUCTOR (type) || TYPE_NEEDS_CONSTRUCTING (type))
7743         {
7744           if (TREE_CODE (type) == ARRAY_TYPE)
7745             init = digest_init (type, init, (tree *) 0);
7746           else if (TREE_CODE (init) == CONSTRUCTOR
7747                    && TREE_HAS_CONSTRUCTOR (init))
7748             {
7749               if (TYPE_NON_AGGREGATE_CLASS (type))
7750                 {
7751                   cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7752                             decl);
7753                   init = error_mark_node;
7754                 }
7755               else
7756                 goto dont_use_constructor;
7757             }
7758         }
7759       else
7760         {
7761         dont_use_constructor:
7762           if (TREE_CODE (init) != TREE_VEC)
7763             init = store_init_value (decl, init);
7764         }
7765
7766       if (init)
7767         /* We must hide the initializer so that expand_decl
7768            won't try to do something it does not understand.  */
7769         init = obscure_complex_init (decl, init);
7770     }
7771   else if (DECL_EXTERNAL (decl))
7772     ;
7773   else if (TYPE_P (type)
7774            && (IS_AGGR_TYPE (type) || TYPE_NEEDS_CONSTRUCTING (type)))
7775     {
7776       tree core_type = strip_array_types (type);
7777
7778       if (! TYPE_NEEDS_CONSTRUCTING (core_type))
7779         {
7780           if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type))
7781             cp_error ("structure `%D' with uninitialized const members", decl);
7782           if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type))
7783             cp_error ("structure `%D' with uninitialized reference members",
7784                       decl);
7785         }
7786
7787       check_for_uninitialized_const_var (decl);
7788
7789       if (COMPLETE_TYPE_P (type) && TYPE_NEEDS_CONSTRUCTING (type))
7790         init = obscure_complex_init (decl, NULL_TREE);
7791
7792     }
7793   else
7794     check_for_uninitialized_const_var (decl);
7795
7796   return init;
7797 }
7798
7799 /* If DECL is not a local variable, give it RTL.  */
7800
7801 static void
7802 make_rtl_for_nonlocal_decl (decl, init, asmspec)
7803      tree decl;
7804      tree init;
7805      const char *asmspec;
7806 {
7807   int toplev;
7808   tree type;
7809
7810   type = TREE_TYPE (decl);
7811   toplev = toplevel_bindings_p ();
7812
7813   /* Handle non-variables up front.  */
7814   if (TREE_CODE (decl) != VAR_DECL)
7815     {
7816       rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7817       return;
7818     }
7819
7820   /* Set the DECL_ASSEMBLER_NAME for the variable.  */
7821   if (asmspec)
7822     DECL_ASSEMBLER_NAME (decl) = get_identifier (asmspec);
7823
7824   if (DECL_VIRTUAL_P (decl))
7825     make_decl_rtl (decl, NULL_PTR, toplev);
7826   else if (TREE_READONLY (decl)
7827            && DECL_INITIAL (decl) != NULL_TREE
7828            && DECL_INITIAL (decl) != error_mark_node
7829            && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
7830     {
7831       DECL_INITIAL (decl) = save_expr (DECL_INITIAL (decl));
7832
7833       if (toplev && ! TREE_PUBLIC (decl))
7834         {
7835           /* If this is a static const, change its apparent linkage
7836              if it belongs to a #pragma interface.  */
7837           if (!interface_unknown)
7838             {
7839               TREE_PUBLIC (decl) = 1;
7840               DECL_EXTERNAL (decl) = interface_only;
7841             }
7842           make_decl_rtl (decl, asmspec, toplev);
7843         }
7844       else if (toplev)
7845         rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7846     }
7847   else if (DECL_LANG_SPECIFIC (decl) && DECL_IN_AGGR_P (decl))
7848     {
7849       my_friendly_assert (TREE_STATIC (decl), 19990828);
7850
7851       if (init == NULL_TREE
7852 #ifdef DEFAULT_STATIC_DEFS
7853           /* If this code is dead, then users must
7854              explicitly declare static member variables
7855              outside the class def'n as well.  */
7856           && TYPE_NEEDS_CONSTRUCTING (type)
7857 #endif
7858           )
7859         {
7860           DECL_EXTERNAL (decl) = 1;
7861           make_decl_rtl (decl, asmspec, 1);
7862         }
7863       else
7864         rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7865     }
7866   else if (TREE_CODE (CP_DECL_CONTEXT (decl)) == NAMESPACE_DECL
7867            || (TREE_CODE (decl) == VAR_DECL && TREE_STATIC (decl)))
7868     rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7869 }
7870
7871 /* Create RTL for the local static variable DECL.  */
7872
7873 void
7874 make_rtl_for_local_static (decl)
7875      tree decl;
7876 {
7877   const char *asmspec = NULL;
7878
7879   /* If we inlined this variable, we could see it's declaration
7880      again.  */
7881   if (DECL_RTL (decl))
7882     return;
7883
7884   if (DECL_ASSEMBLER_NAME (decl) != DECL_NAME (decl))
7885     {
7886       /* The only way this situaton can occur is if the
7887          user specified a name for this DECL using the
7888          `attribute' syntax.  */
7889       asmspec = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
7890       DECL_ASSEMBLER_NAME (decl) = DECL_NAME (decl);
7891     }
7892
7893   rest_of_decl_compilation (decl, asmspec, /*top_level=*/0, /*at_end=*/0);
7894 }
7895
7896 /* The old ARM scoping rules injected variables declared in the
7897    initialization statement of a for-statement into the surrounding
7898    scope.  We support this usage, in order to be backward-compatible.
7899    DECL is a just-declared VAR_DECL; if necessary inject its
7900    declaration into the surrounding scope.  */
7901
7902 void
7903 maybe_inject_for_scope_var (decl)
7904      tree decl;
7905 {
7906   if (current_binding_level->is_for_scope)
7907     {
7908       struct binding_level *outer
7909         = current_binding_level->level_chain;
7910
7911       /* Check to see if the same name is already bound at the outer
7912          level, either because it was directly declared, or because a
7913          dead for-decl got preserved.  In either case, the code would
7914          not have been valid under the ARM scope rules, so clear
7915          is_for_scope for the current_binding_level.
7916
7917          Otherwise, we need to preserve the temp slot for decl to last
7918          into the outer binding level.  */
7919
7920       tree outer_binding
7921         = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl)));
7922
7923       if (outer_binding && BINDING_LEVEL (outer_binding) == outer
7924           && (TREE_CODE (BINDING_VALUE (outer_binding))
7925               == VAR_DECL)
7926           && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding)))
7927         {
7928           BINDING_VALUE (outer_binding)
7929             = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding));
7930           current_binding_level->is_for_scope = 0;
7931         }
7932       else if (DECL_IN_MEMORY_P (decl))
7933         preserve_temp_slots (DECL_RTL (decl));
7934     }
7935 }
7936
7937 /* Generate code to initialize DECL (a local variable).  */
7938
7939 void
7940 initialize_local_var (decl, init, flags)
7941      tree decl;
7942      tree init;
7943      int flags;
7944 {
7945   tree type = TREE_TYPE (decl);
7946
7947   /* If the type is bogus, don't bother initializing the variable.  */
7948   if (type == error_mark_node)
7949     return;
7950
7951   if (DECL_SIZE (decl) == NULL_TREE && !TREE_STATIC (decl))
7952     {
7953       /* If we used it already as memory, it must stay in memory.  */
7954       DECL_INITIAL (decl) = NULL_TREE;
7955       TREE_ADDRESSABLE (decl) = TREE_USED (decl);
7956     }
7957
7958   /* Local statics are handled differently from ordinary automatic
7959      variables.  */
7960   if (TREE_STATIC (decl))
7961     {
7962       if (TYPE_NEEDS_CONSTRUCTING (type) || init != NULL_TREE
7963           || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
7964         expand_static_init (decl, init);
7965       return;
7966     }
7967
7968   if (DECL_SIZE (decl) && type != error_mark_node)
7969     {
7970       int already_used;
7971
7972       /* Compute and store the initial value.  */
7973       already_used = TREE_USED (decl) || TREE_USED (type);
7974
7975       if (init || TYPE_NEEDS_CONSTRUCTING (type))
7976         {
7977           int saved_stmts_are_full_exprs_p;
7978
7979           emit_line_note (DECL_SOURCE_FILE (decl),
7980                           DECL_SOURCE_LINE (decl));
7981           saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p;
7982           stmts_are_full_exprs_p = 1;
7983           finish_expr_stmt (build_aggr_init (decl, init, flags));
7984           stmts_are_full_exprs_p = saved_stmts_are_full_exprs_p;
7985         }
7986
7987       /* Set this to 0 so we can tell whether an aggregate which was
7988          initialized was ever used.  Don't do this if it has a
7989          destructor, so we don't complain about the 'resource
7990          allocation is initialization' idiom.  Now set
7991          attribute((unused)) on types so decls of that type will be
7992          marked used. (see TREE_USED, above.)  */
7993       if (TYPE_NEEDS_CONSTRUCTING (type)
7994           && ! already_used
7995           && TYPE_HAS_TRIVIAL_DESTRUCTOR (type)
7996           && DECL_NAME (decl))
7997         TREE_USED (decl) = 0;
7998       else if (already_used)
7999         TREE_USED (decl) = 1;
8000     }
8001 }
8002
8003 /* Generate code to destroy DECL (a local variable).  */
8004
8005 static void
8006 destroy_local_var (decl)
8007      tree decl;
8008 {
8009   tree type = TREE_TYPE (decl);
8010   tree cleanup;
8011
8012   /* Only variables get cleaned up.  */
8013   if (TREE_CODE (decl) != VAR_DECL)
8014     return;
8015
8016   /* And only things with destructors need cleaning up.  */
8017   if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
8018     return;
8019
8020   if (TREE_CODE (decl) == VAR_DECL &&
8021       (DECL_EXTERNAL (decl) || TREE_STATIC (decl)))
8022     /* We don't clean up things that aren't defined in this
8023        translation unit, or that need a static cleanup.  The latter
8024        are handled by finish_file.  */
8025     return;
8026
8027   /* Compute the cleanup.  */
8028   cleanup = maybe_build_cleanup (decl);
8029
8030   /* Record the cleanup required for this declaration.  */
8031   if (DECL_SIZE (decl) && TREE_TYPE (decl) != error_mark_node
8032       && cleanup)
8033     finish_decl_cleanup (decl, cleanup);
8034 }
8035
8036 /* Let the back-end know about DECL.  */
8037
8038 void
8039 emit_local_var (decl)
8040      tree decl;
8041 {
8042   /* Create RTL for this variable.  */
8043   if (DECL_RTL (decl))
8044     /* Only a RESULT_DECL should have non-NULL RTL when arriving here.
8045        All other local variables are assigned RTL in this function.  */
8046     my_friendly_assert (TREE_CODE (decl) == RESULT_DECL,
8047                         19990828);
8048   else
8049     {
8050       if (DECL_ASSEMBLER_NAME (decl) != DECL_NAME (decl))
8051         /* The user must have specified an assembler name for this
8052            variable.  Set that up now.  */
8053         rest_of_decl_compilation
8054           (decl, IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)),
8055            /*top_level=*/0, /*at_end=*/0);
8056       else
8057         expand_decl (decl);
8058     }
8059
8060   /* Actually do the initialization.  */
8061   if (stmts_are_full_exprs_p)
8062     expand_start_target_temps ();
8063
8064   expand_decl_init (decl);
8065
8066   if (stmts_are_full_exprs_p)
8067     expand_end_target_temps ();
8068 }
8069
8070 /* Finish processing of a declaration;
8071    install its line number and initial value.
8072    If the length of an array type is not known before,
8073    it must be determined now, from the initial value, or it is an error.
8074
8075    INIT0 holds the value of an initializer that should be allowed to escape
8076    the normal rules.
8077
8078    FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
8079    if the (init) syntax was used.  */
8080
8081 void
8082 cp_finish_decl (decl, init, asmspec_tree, flags)
8083      tree decl, init;
8084      tree asmspec_tree;
8085      int flags;
8086 {
8087   register tree type;
8088   tree ttype = NULL_TREE;
8089   const char *asmspec = NULL;
8090   int was_readonly = 0;
8091
8092   if (! decl)
8093     {
8094       if (init)
8095         error ("assignment (not initialization) in declaration");
8096       return;
8097     }
8098
8099   /* If a name was specified, get the string.  */
8100   if (asmspec_tree)
8101       asmspec = TREE_STRING_POINTER (asmspec_tree);
8102
8103   if (init && TREE_CODE (init) == NAMESPACE_DECL)
8104     {
8105       cp_error ("cannot initialize `%D' to namespace `%D'",
8106                 decl, init);
8107       init = NULL_TREE;
8108     }
8109
8110   if (current_class_type
8111       && CP_DECL_CONTEXT (decl) == current_class_type
8112       && TYPE_BEING_DEFINED (current_class_type)
8113       && (DECL_INITIAL (decl) || init))
8114     DECL_DEFINED_IN_CLASS_P (decl) = 1;
8115
8116   if (TREE_CODE (decl) == VAR_DECL
8117       && DECL_CONTEXT (decl)
8118       && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL
8119       && DECL_CONTEXT (decl) != current_namespace
8120       && init)
8121     {
8122       /* Leave the namespace of the object. */
8123       pop_decl_namespace ();
8124     }
8125
8126   type = TREE_TYPE (decl);
8127
8128   if (type == error_mark_node)
8129     return;
8130
8131   /* Add this declaration to the statement-tree.  */
8132   if (building_stmt_tree () && at_function_scope_p ())
8133     add_decl_stmt (decl);
8134
8135   if (TYPE_HAS_MUTABLE_P (type))
8136     TREE_READONLY (decl) = 0;
8137
8138   if (processing_template_decl)
8139     {
8140       if (init && DECL_INITIAL (decl))
8141         DECL_INITIAL (decl) = init;
8142       goto finish_end0;
8143     }
8144
8145   /* Parameters are handled by store_parm_decls, not cp_finish_decl.  */
8146   my_friendly_assert (TREE_CODE (decl) != PARM_DECL, 19990828);
8147
8148   /* Take care of TYPE_DECLs up front.  */
8149   if (TREE_CODE (decl) == TYPE_DECL)
8150     {
8151       if (init && DECL_INITIAL (decl))
8152         {
8153           /* typedef foo = bar; store the type of bar as the type of foo.  */
8154           TREE_TYPE (decl) = type = TREE_TYPE (init);
8155           DECL_INITIAL (decl) = init = NULL_TREE;
8156         }
8157       if (type != error_mark_node
8158           && IS_AGGR_TYPE (type) && DECL_NAME (decl))
8159         {
8160           if (TREE_TYPE (DECL_NAME (decl)) && TREE_TYPE (decl) != type)
8161             cp_warning ("shadowing previous type declaration of `%#D'", decl);
8162           set_identifier_type_value (DECL_NAME (decl), type);
8163           CLASSTYPE_GOT_SEMICOLON (type) = 1;
8164         }
8165       GNU_xref_decl (current_function_decl, decl);
8166
8167       /* If we have installed this as the canonical typedef for this
8168          type, and that type has not been defined yet, delay emitting
8169          the debug information for it, as we will emit it later.  */
8170       if (TYPE_MAIN_DECL (TREE_TYPE (decl)) == decl
8171           && !COMPLETE_TYPE_P (TREE_TYPE (decl)))
8172         TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
8173
8174       rest_of_decl_compilation (decl, NULL_PTR,
8175                                 DECL_CONTEXT (decl) == NULL_TREE, at_eof);
8176       goto finish_end;
8177     }
8178
8179   if (TREE_CODE (decl) != FUNCTION_DECL)
8180     ttype = target_type (type);
8181
8182   if (! DECL_EXTERNAL (decl) && TREE_READONLY (decl)
8183       && TYPE_NEEDS_CONSTRUCTING (type))
8184     {
8185       /* Currently, GNU C++ puts constants in text space, making them
8186          impossible to initialize.  In the future, one would hope for
8187          an operating system which understood the difference between
8188          initialization and the running of a program.  */
8189       was_readonly = 1;
8190       TREE_READONLY (decl) = 0;
8191     }
8192
8193   if (TREE_CODE (decl) == FIELD_DECL && asmspec)
8194     {
8195       /* This must override the asm specifier which was placed by
8196          grokclassfn.  Lay this out fresh.  */
8197       DECL_RTL (TREE_TYPE (decl)) = NULL_RTX;
8198       DECL_ASSEMBLER_NAME (decl) = get_identifier (asmspec);
8199       make_decl_rtl (decl, asmspec, 0);
8200     }
8201
8202   /* Deduce size of array from initialization, if not already known.  */
8203   maybe_deduce_size_from_array_init (decl, init);
8204   init = check_initializer (decl, init);
8205
8206   GNU_xref_decl (current_function_decl, decl);
8207
8208   if (TREE_CODE (decl) == VAR_DECL)
8209     layout_var_decl (decl);
8210
8211   /* Output the assembler code and/or RTL code for variables and functions,
8212      unless the type is an undefined structure or union.
8213      If not, it will get done when the type is completed.  */
8214   if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL
8215       || TREE_CODE (decl) == RESULT_DECL)
8216     {
8217       if (TREE_CODE (decl) == VAR_DECL)
8218         maybe_commonize_var (decl);
8219
8220       make_rtl_for_nonlocal_decl (decl, init, asmspec);
8221
8222       if (TREE_CODE (type) == FUNCTION_TYPE
8223           || TREE_CODE (type) == METHOD_TYPE)
8224         abstract_virtuals_error (decl,
8225                                  strip_array_types (TREE_TYPE (type)));
8226       else
8227         abstract_virtuals_error (decl, strip_array_types (type));
8228
8229       if (TREE_CODE (decl) == FUNCTION_DECL)
8230         ;
8231       else if (DECL_EXTERNAL (decl)
8232                && ! (DECL_LANG_SPECIFIC (decl)
8233                      && DECL_NOT_REALLY_EXTERN (decl)))
8234         {
8235           if (init)
8236             DECL_INITIAL (decl) = init;
8237         }
8238       else if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL)
8239         {
8240           /* This is a local declaration.  */
8241           if (doing_semantic_analysis_p ())
8242             maybe_inject_for_scope_var (decl);
8243           /* Initialize the local variable.  But, if we're building a
8244              statement-tree, we'll do the initialization when we
8245              expand the tree.  */
8246           if (processing_template_decl)
8247             {
8248               if (init || DECL_INITIAL (decl) == error_mark_node)
8249                 DECL_INITIAL (decl) = init;
8250             }
8251           else
8252             {
8253               /* If we're not building RTL, then we need to do so
8254                  now.  */
8255               if (!building_stmt_tree ())
8256                 emit_local_var (decl);
8257               /* Initialize the variable.  */
8258               initialize_local_var (decl, init, flags);
8259               /* Clean up the variable.  */
8260               destroy_local_var (decl);
8261             }
8262         }
8263       else if (TREE_STATIC (decl) && type != error_mark_node)
8264         {
8265           /* Cleanups for static variables are handled by `finish_file'.  */
8266           if (TYPE_NEEDS_CONSTRUCTING (type) || init != NULL_TREE
8267               || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
8268             expand_static_init (decl, init);
8269         }
8270     finish_end0:
8271
8272       /* Undo call to `pushclass' that was done in `start_decl'
8273          due to initialization of qualified member variable.
8274          I.e., Foo::x = 10;  */
8275       {
8276         tree context = CP_DECL_CONTEXT (decl);
8277         if (context
8278             && TYPE_P (context)
8279             && (TREE_CODE (decl) == VAR_DECL
8280                 /* We also have a pushclass done that we need to undo here
8281                    if we're at top level and declare a method.  */
8282                 || TREE_CODE (decl) == FUNCTION_DECL)
8283             /* If size hasn't been set, we're still defining it,
8284                and therefore inside the class body; don't pop
8285                the binding level..  */
8286             && COMPLETE_TYPE_P (context)
8287             && context == current_class_type)
8288           pop_nested_class ();
8289       }
8290     }
8291
8292  finish_end:
8293
8294   if (was_readonly)
8295     TREE_READONLY (decl) = 1;
8296 }
8297
8298 /* This is here for a midend callback from c-common.c */
8299
8300 void
8301 finish_decl (decl, init, asmspec_tree)
8302      tree decl, init;
8303      tree asmspec_tree;
8304 {
8305   cp_finish_decl (decl, init, asmspec_tree, 0);
8306 }
8307
8308 /* Returns a declaration for a VAR_DECL as if:
8309
8310      extern "C" TYPE NAME;
8311
8312    had been seen.  Used to create compiler-generated global
8313    variables.  */
8314
8315 tree
8316 declare_global_var (name, type)
8317      tree name;
8318      tree type;
8319 {
8320   tree decl;
8321
8322   push_to_top_level ();
8323   decl = build_decl (VAR_DECL, name, type);
8324   TREE_PUBLIC (decl) = 1;
8325   DECL_EXTERNAL (decl) = 1;
8326   DECL_ARTIFICIAL (decl) = 1;
8327   pushdecl (decl);
8328   cp_finish_decl (decl, NULL_TREE, NULL_TREE, 0);
8329   pop_from_top_level ();
8330
8331   return decl;
8332 }
8333
8334 /* Returns a pointer to the `atexit' function.  Note that if
8335    FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8336    `__cxa_atexit' function specified in the IA64 C++ ABI.  */
8337
8338 static tree
8339 get_atexit_node ()
8340 {
8341   tree atexit_fndecl;
8342   tree arg_types;
8343   tree fn_type;
8344   tree fn_ptr_type;
8345   const char *name;
8346
8347   if (atexit_node)
8348     return atexit_node;
8349
8350   if (flag_use_cxa_atexit)
8351     {
8352       /* The declaration for `__cxa_atexit' is:
8353
8354            int __cxa_atexit (void (*)(void *), void *, void *)
8355
8356          We build up the argument types and then then function type
8357          itself.  */
8358
8359       /* First, build the pointer-to-function type for the first
8360          argument.  */
8361       arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8362       fn_type = build_function_type (void_type_node, arg_types);
8363       fn_ptr_type = build_pointer_type (fn_type);
8364       /* Then, build the rest of the argument types.  */
8365       arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8366       arg_types = tree_cons (NULL_TREE, ptr_type_node, arg_types);
8367       arg_types = tree_cons (NULL_TREE, fn_ptr_type, arg_types);
8368       /* And the final __cxa_atexit type.  */
8369       fn_type = build_function_type (integer_type_node, arg_types);
8370       fn_ptr_type = build_pointer_type (fn_type);
8371       name = "__cxa_atexit";
8372     }
8373   else
8374     {
8375       /* The declaration for `atexit' is:
8376
8377            int atexit (void (*)());
8378
8379          We build up the argument types and then then function type
8380          itself.  */
8381       fn_type = build_function_type (void_type_node, void_list_node);
8382       fn_ptr_type = build_pointer_type (fn_type);
8383       arg_types = tree_cons (NULL_TREE, fn_ptr_type, void_list_node);
8384       /* Build the final atexit type.  */
8385       fn_type = build_function_type (integer_type_node, arg_types);
8386       name = "atexit";
8387     }
8388
8389   /* Now, build the function declaration.  */
8390   push_lang_context (lang_name_c);
8391   atexit_fndecl = build_library_fn_ptr (name, fn_type);
8392   mark_used (atexit_fndecl);
8393   pop_lang_context ();
8394   atexit_node = default_conversion (atexit_fndecl);
8395
8396   return atexit_node;
8397 }
8398
8399 /* Returns the __dso_handle VAR_DECL.  */
8400
8401 static tree
8402 get_dso_handle_node ()
8403 {
8404   if (dso_handle_node)
8405     return dso_handle_node;
8406
8407   /* Declare the variable.  */
8408   dso_handle_node = declare_global_var (get_identifier ("__dso_handle"),
8409                                         ptr_type_node);
8410
8411   return dso_handle_node;
8412 }
8413
8414 /* Begin a new function with internal linkage whose job will be simply
8415    to destroy some particular variable.  */
8416
8417 static tree
8418 start_cleanup_fn ()
8419 {
8420   static int counter = 0;
8421   int old_interface_unknown = interface_unknown;
8422   char name[32];
8423   tree parmtypes;
8424   tree fntype;
8425   tree fndecl;
8426
8427   push_to_top_level ();
8428
8429   /* No need to mangle this.  */
8430   push_lang_context (lang_name_c);
8431
8432   interface_unknown = 1;
8433
8434   /* Build the parameter-types.  */
8435   parmtypes = void_list_node;
8436   /* Functions passed to __cxa_atexit take an additional parameter.
8437      We'll just ignore it.  After we implement the new calling
8438      convention for destructors, we can eliminate the use of
8439      additional cleanup functions entirely in the -fnew-abi case.  */
8440   if (flag_use_cxa_atexit)
8441     parmtypes = tree_cons (NULL_TREE, ptr_type_node, parmtypes);
8442   /* Build the function type itself.  */
8443   fntype = build_function_type (void_type_node, parmtypes);
8444   /* Build the name of the function.  */
8445   sprintf (name, "__tcf_%d", counter++);
8446   /* Build the function declaration.  */
8447   fndecl = build_lang_decl (FUNCTION_DECL, get_identifier (name), fntype);
8448   /* It's a function with internal linkage, generated by the
8449      compiler.  */
8450   TREE_PUBLIC (fndecl) = 0;
8451   DECL_ARTIFICIAL (fndecl) = 1;
8452   /* Build the parameter.  */
8453   if (flag_use_cxa_atexit)
8454     {
8455       tree parmdecl;
8456
8457       parmdecl = build_decl (PARM_DECL, NULL_TREE, ptr_type_node);
8458       DECL_CONTEXT (parmdecl) = fndecl;
8459       DECL_ARG_TYPE (parmdecl) = ptr_type_node;
8460       TREE_USED (parmdecl) = 1;
8461       DECL_ARGUMENTS (fndecl) = parmdecl;
8462     }
8463
8464   pushdecl (fndecl);
8465   start_function (/*specs=*/NULL_TREE, fndecl, NULL_TREE, SF_PRE_PARSED);
8466   do_pushlevel ();
8467
8468   interface_unknown = old_interface_unknown;
8469
8470   pop_lang_context ();
8471
8472   return current_function_decl;
8473 }
8474
8475 /* Finish the cleanup function begun by start_cleanup_fn.  */
8476
8477 static void
8478 end_cleanup_fn ()
8479 {
8480   do_poplevel ();
8481
8482   expand_body (finish_function (0));
8483
8484   pop_from_top_level ();
8485 }
8486
8487 /* Generate code to handle the destruction of DECL, an object with
8488    static storage duration.  */
8489
8490 void
8491 register_dtor_fn (decl)
8492      tree decl;
8493 {
8494   tree cleanup;
8495   tree compound_stmt;
8496   tree args;
8497   tree fcall;
8498
8499   int saved_flag_access_control;
8500
8501   if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
8502     return;
8503
8504   /* Call build_cleanup before we enter the anonymous function so that
8505      any access checks will be done relative to the current scope,
8506      rather than the scope of the anonymous function.  */
8507   build_cleanup (decl);
8508
8509   /* Now start the function.  */
8510   cleanup = start_cleanup_fn ();
8511
8512   /* Now, recompute the cleanup.  It may contain SAVE_EXPRs that refer
8513      to the original function, rather than the anonymous one.  That
8514      will make the back-end think that nested functions are in use,
8515      which causes confusion.  */
8516   saved_flag_access_control = flag_access_control;
8517   flag_access_control = 0;
8518   fcall = build_cleanup (decl);
8519   flag_access_control = saved_flag_access_control;
8520
8521   /* Create the body of the anonymous function.  */
8522   compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
8523   finish_expr_stmt (fcall);
8524   finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
8525   end_cleanup_fn ();
8526
8527   /* Call atexit with the cleanup function.  */
8528   mark_addressable (cleanup);
8529   cleanup = build_unary_op (ADDR_EXPR, cleanup, 0);
8530   if (flag_use_cxa_atexit)
8531     {
8532       args = tree_cons (NULL_TREE, get_dso_handle_node (), NULL_TREE);
8533       args = tree_cons (NULL_TREE, null_pointer_node, args);
8534       args = tree_cons (NULL_TREE, cleanup, args);
8535     }
8536   else
8537     args = tree_cons (NULL_TREE, cleanup, NULL_TREE);
8538   finish_expr_stmt (build_function_call (get_atexit_node (), args));
8539 }
8540
8541 void
8542 expand_static_init (decl, init)
8543      tree decl;
8544      tree init;
8545 {
8546   tree oldstatic = value_member (decl, static_aggregates);
8547
8548   if (oldstatic)
8549     {
8550       if (TREE_PURPOSE (oldstatic) && init != NULL_TREE)
8551         cp_error ("multiple initializations given for `%D'", decl);
8552     }
8553   else if (! toplevel_bindings_p ())
8554     {
8555       /* Emit code to perform this initialization but once.  */
8556       tree temp;
8557       tree if_stmt;
8558       tree then_clause;
8559       tree assignment;
8560       tree temp_init;
8561
8562       /* Emit code to perform this initialization but once.  This code
8563          looks like:
8564
8565            static int temp = 0;
8566            if (!temp) {
8567              // Do initialization.
8568              temp = 1;
8569              // Register variable for destruction at end of program.
8570            }
8571
8572          Note that the `temp' variable is only set to 1 *after* the
8573          initialization is complete.  This ensures that an exception,
8574          thrown during the construction, will cause the variable to
8575          reinitialized when we pass through this code again, as per:
8576
8577            [stmt.dcl]
8578
8579            If the initialization exits by throwing an exception, the
8580            initialization is not complete, so it will be tried again
8581            the next time control enters the declaration.
8582
8583          In theory, this process should be thread-safe, too; multiple
8584          threads should not be able to initialize the variable more
8585          than once.  We don't yet attempt to ensure thread-safety.  */
8586       temp = get_temp_name (integer_type_node, 1);
8587       rest_of_decl_compilation (temp, NULL_PTR, 0, 0);
8588
8589       /* Begin the conditional initialization.  */
8590       if_stmt = begin_if_stmt ();
8591       finish_if_stmt_cond (build_binary_op (EQ_EXPR, temp,
8592                                             integer_zero_node),
8593                            if_stmt);
8594       then_clause = begin_compound_stmt (/*has_no_scope=*/0);
8595
8596       /* Do the initialization itself.  */
8597       if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl))
8598           || (init && TREE_CODE (init) == TREE_LIST))
8599         assignment = build_aggr_init (decl, init, 0);
8600       else if (init)
8601         /* The initialization we're doing here is just a bitwise
8602            copy.  */
8603         assignment = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
8604       else
8605         assignment = NULL_TREE;
8606
8607       /* Once the assignment is complete, set TEMP to 1.  Since the
8608          construction of the static object is complete at this point,
8609          we want to make sure TEMP is set to 1 even if a temporary
8610          constructed during the initialization throws an exception
8611          when it is destroyed.  So, we combine the initialization and
8612          the assignment to TEMP into a single expression, ensuring
8613          that when we call finish_expr_stmt the cleanups will not be
8614          run until after TEMP is set to 1.  */
8615       temp_init = build_modify_expr (temp, NOP_EXPR, integer_one_node);
8616       if (assignment)
8617         {
8618           assignment = tree_cons (NULL_TREE, assignment,
8619                                   build_tree_list (NULL_TREE,
8620                                                    temp_init));
8621           assignment = build_compound_expr (assignment);
8622         }
8623       else
8624         assignment = temp_init;
8625       finish_expr_stmt (assignment);
8626
8627       /* Use atexit to register a function for destroying this static
8628          variable.  */
8629       register_dtor_fn (decl);
8630
8631       finish_compound_stmt (/*has_no_scope=*/0, then_clause);
8632       finish_then_clause (if_stmt);
8633       finish_if_stmt ();
8634     }
8635   else
8636     static_aggregates = tree_cons (init, decl, static_aggregates);
8637 }
8638
8639 /* Finish the declaration of a catch-parameter.  */
8640
8641 tree
8642 start_handler_parms (declspecs, declarator)
8643      tree declspecs;
8644      tree declarator;
8645 {
8646   tree decl;
8647   if (declspecs)
8648     {
8649       decl = grokdeclarator (declarator, declspecs, CATCHPARM,
8650                              1, NULL_TREE);
8651       if (decl == NULL_TREE)
8652         error ("invalid catch parameter");
8653     }
8654   else
8655     decl = NULL_TREE;
8656
8657   return decl;
8658 }
8659
8660 \f
8661 /* Make TYPE a complete type based on INITIAL_VALUE.
8662    Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8663    2 if there was no information (in which case assume 0 if DO_DEFAULT).  */
8664
8665 int
8666 complete_array_type (type, initial_value, do_default)
8667      tree type, initial_value;
8668      int do_default;
8669 {
8670   register tree maxindex = NULL_TREE;
8671   int value = 0;
8672
8673   if (initial_value)
8674     {
8675       /* Note MAXINDEX  is really the maximum index,
8676          one less than the size.  */
8677       if (TREE_CODE (initial_value) == STRING_CST)
8678         {
8679           int eltsize
8680             = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
8681           maxindex = build_int_2 ((TREE_STRING_LENGTH (initial_value)
8682                                    / eltsize) - 1, 0);
8683         }
8684       else if (TREE_CODE (initial_value) == CONSTRUCTOR)
8685         {
8686           tree elts = CONSTRUCTOR_ELTS (initial_value);
8687
8688           maxindex = ssize_int (-1);
8689           for (; elts; elts = TREE_CHAIN (elts))
8690             {
8691               if (TREE_PURPOSE (elts))
8692                 maxindex = TREE_PURPOSE (elts);
8693               else
8694                 maxindex = size_binop (PLUS_EXPR, maxindex, ssize_int (1));
8695             }
8696           maxindex = copy_node (maxindex);
8697         }
8698       else
8699         {
8700           /* Make an error message unless that happened already.  */
8701           if (initial_value != error_mark_node)
8702             value = 1;
8703           else
8704             initial_value = NULL_TREE;
8705
8706           /* Prevent further error messages.  */
8707           maxindex = build_int_2 (0, 0);
8708         }
8709     }
8710
8711   if (!maxindex)
8712     {
8713       if (do_default)
8714         maxindex = build_int_2 (0, 0);
8715       value = 2;
8716     }
8717
8718   if (maxindex)
8719     {
8720       tree itype;
8721       tree domain;
8722
8723       domain = build_index_type (maxindex);
8724       TYPE_DOMAIN (type) = domain;
8725
8726       if (! TREE_TYPE (maxindex))
8727         TREE_TYPE (maxindex) = domain;
8728       if (initial_value)
8729         itype = TREE_TYPE (initial_value);
8730       else
8731         itype = NULL;
8732       if (itype && !TYPE_DOMAIN (itype))
8733         TYPE_DOMAIN (itype) = domain;
8734       /* The type of the main variant should never be used for arrays
8735          of different sizes.  It should only ever be completed with the
8736          size of the array.  */
8737       if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)))
8738         TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)) = domain;
8739     }
8740
8741   /* Lay out the type now that we can get the real answer.  */
8742
8743   layout_type (type);
8744
8745   return value;
8746 }
8747 \f
8748 /* Return zero if something is declared to be a member of type
8749    CTYPE when in the context of CUR_TYPE.  STRING is the error
8750    message to print in that case.  Otherwise, quietly return 1.  */
8751
8752 static int
8753 member_function_or_else (ctype, cur_type, flags)
8754      tree ctype, cur_type;
8755      enum overload_flags flags;
8756 {
8757   if (ctype && ctype != cur_type)
8758     {
8759       if (flags == DTOR_FLAG)
8760         error ("destructor for alien class `%s' cannot be a member",
8761                TYPE_NAME_STRING (ctype));
8762       else
8763         error ("constructor for alien class `%s' cannot be a member",
8764                TYPE_NAME_STRING (ctype));
8765       return 0;
8766     }
8767   return 1;
8768 }
8769 \f
8770 /* Subroutine of `grokdeclarator'.  */
8771
8772 /* Generate errors possibly applicable for a given set of specifiers.
8773    This is for ARM $7.1.2.  */
8774
8775 static void
8776 bad_specifiers (object, type, virtualp, quals, inlinep, friendp, raises)
8777      tree object;
8778      const char *type;
8779      int virtualp, quals, friendp, raises, inlinep;
8780 {
8781   if (virtualp)
8782     cp_error ("`%D' declared as a `virtual' %s", object, type);
8783   if (inlinep)
8784     cp_error ("`%D' declared as an `inline' %s", object, type);
8785   if (quals)
8786     cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8787               object, type);
8788   if (friendp)
8789     cp_error_at ("`%D' declared as a friend", object);
8790   if (raises)
8791     cp_error_at ("`%D' declared with an exception specification", object);
8792 }
8793
8794 /* CTYPE is class type, or null if non-class.
8795    TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8796    or METHOD_TYPE.
8797    DECLARATOR is the function's name.
8798    VIRTUALP is truthvalue of whether the function is virtual or not.
8799    FLAGS are to be passed through to `grokclassfn'.
8800    QUALS are qualifiers indicating whether the function is `const'
8801    or `volatile'.
8802    RAISES is a list of exceptions that this function can raise.
8803    CHECK is 1 if we must find this method in CTYPE, 0 if we should
8804    not look, and -1 if we should not call `grokclassfn' at all.
8805
8806    Returns `NULL_TREE' if something goes wrong, after issuing
8807    applicable error messages.  */
8808
8809 static tree
8810 grokfndecl (ctype, type, declarator, orig_declarator, virtualp, flags, quals,
8811             raises, check, friendp, publicp, inlinep, funcdef_flag,
8812             template_count, in_namespace)
8813      tree ctype, type;
8814      tree declarator;
8815      tree orig_declarator;
8816      int virtualp;
8817      enum overload_flags flags;
8818      tree quals, raises;
8819      int check, friendp, publicp, inlinep, funcdef_flag, template_count;
8820      tree in_namespace;
8821 {
8822   tree cname, decl;
8823   int staticp = ctype && TREE_CODE (type) == FUNCTION_TYPE;
8824   int has_default_arg = 0;
8825   tree t;
8826
8827   if (ctype)
8828     cname = TREE_CODE (TYPE_NAME (ctype)) == TYPE_DECL
8829       ? TYPE_IDENTIFIER (ctype) : TYPE_NAME (ctype);
8830   else
8831     cname = NULL_TREE;
8832
8833   if (raises)
8834     {
8835       type = build_exception_variant (type, raises);
8836     }
8837
8838   decl = build_lang_decl (FUNCTION_DECL, declarator, type);
8839   /* Propagate volatile out from type to decl. */
8840   if (TYPE_VOLATILE (type))
8841     TREE_THIS_VOLATILE (decl) = 1;
8842
8843   /* If this decl has namespace scope, set that up.  */
8844   if (in_namespace)
8845     set_decl_namespace (decl, in_namespace, friendp);
8846   else if (publicp && ! ctype)
8847     DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
8848
8849   /* `main' and builtins have implicit 'C' linkage.  */
8850   if ((MAIN_NAME_P (declarator)
8851        || (IDENTIFIER_LENGTH (declarator) > 10
8852            && IDENTIFIER_POINTER (declarator)[0] == '_'
8853            && IDENTIFIER_POINTER (declarator)[1] == '_'
8854            && strncmp (IDENTIFIER_POINTER (declarator)+2, "builtin_", 8) == 0))
8855       && current_lang_name == lang_name_cplusplus
8856       && ctype == NULL_TREE
8857       /* NULL_TREE means global namespace.  */
8858       && DECL_CONTEXT (decl) == NULL_TREE)
8859     DECL_LANGUAGE (decl) = lang_c;
8860
8861   /* Should probably propagate const out from type to decl I bet (mrs).  */
8862   if (staticp)
8863     {
8864       DECL_STATIC_FUNCTION_P (decl) = 1;
8865       DECL_CONTEXT (decl) = ctype;
8866     }
8867
8868   if (ctype)
8869     DECL_CONTEXT (decl) = ctype;
8870
8871   if (ctype == NULL_TREE && DECL_MAIN_P (decl))
8872     {
8873       if (processing_template_decl)
8874         error ("cannot declare `::main' to be a template");
8875       if (inlinep)
8876         error ("cannot declare `::main' to be inline");
8877       else if (! publicp)
8878         error ("cannot declare `::main' to be static");
8879       inlinep = 0;
8880       publicp = 1;
8881     }
8882
8883   /* Members of anonymous types and local classes have no linkage; make
8884      them internal.  */
8885   if (ctype && (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype))
8886                 || decl_function_context (TYPE_MAIN_DECL (ctype))))
8887     publicp = 0;
8888
8889   if (publicp)
8890     {
8891       /* [basic.link]: A name with no linkage (notably, the name of a class
8892          or enumeration declared in a local scope) shall not be used to
8893          declare an entity with linkage.
8894
8895          Only check this for public decls for now.  */
8896       t = no_linkage_check (TREE_TYPE (decl));
8897       if (t)
8898         {
8899           if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
8900             {
8901               if (DECL_EXTERN_C_P (decl))
8902                 /* Allow this; it's pretty common in C.  */;
8903               else
8904                 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8905                             decl);
8906             }
8907           else
8908             cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8909                         decl, t);
8910         }
8911     }
8912
8913   TREE_PUBLIC (decl) = publicp;
8914   if (! publicp)
8915     {
8916       DECL_INTERFACE_KNOWN (decl) = 1;
8917       DECL_NOT_REALLY_EXTERN (decl) = 1;
8918     }
8919
8920   if (inlinep)
8921     DECL_THIS_INLINE (decl) = DECL_INLINE (decl) = 1;
8922
8923   DECL_EXTERNAL (decl) = 1;
8924   if (quals != NULL_TREE && TREE_CODE (type) == FUNCTION_TYPE)
8925     {
8926       cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8927                 (ctype ? "static " : "non-"), decl, TREE_VALUE (quals));
8928       quals = NULL_TREE;
8929     }
8930
8931   if (IDENTIFIER_OPNAME_P (DECL_NAME (decl)))
8932     grok_op_properties (decl, virtualp, check < 0);
8933
8934   if (ctype && decl_function_context (decl))
8935     DECL_NO_STATIC_CHAIN (decl) = 1;
8936
8937   for (t = TYPE_ARG_TYPES (TREE_TYPE (decl)); t; t = TREE_CHAIN (t))
8938     if (TREE_PURPOSE (t)
8939         && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
8940       {
8941         has_default_arg = 1;
8942         break;
8943       }
8944
8945   if (friendp
8946       && TREE_CODE (orig_declarator) == TEMPLATE_ID_EXPR)
8947     {
8948       if (funcdef_flag)
8949         cp_error
8950           ("defining explicit specialization `%D' in friend declaration",
8951            orig_declarator);
8952       else
8953         {
8954           if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8955             {
8956               /* Something like `template <class T> friend void f<T>()'.  */
8957               cp_error ("invalid use of template-id `%D' in declaration of primary template",
8958                         orig_declarator);
8959               return NULL_TREE;
8960             }
8961
8962
8963           /* A friend declaration of the form friend void f<>().  Record
8964              the information in the TEMPLATE_ID_EXPR.  */
8965           SET_DECL_IMPLICIT_INSTANTIATION (decl);
8966           DECL_TEMPLATE_INFO (decl)
8967             = tree_cons (TREE_OPERAND (orig_declarator, 0),
8968                          TREE_OPERAND (orig_declarator, 1),
8969                          NULL_TREE);
8970
8971           if (has_default_arg)
8972             {
8973               cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8974                         decl);
8975               return NULL_TREE;
8976             }
8977
8978           if (inlinep)
8979             {
8980               cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8981                         decl);
8982               return NULL_TREE;
8983             }
8984         }
8985     }
8986
8987   if (has_default_arg)
8988     add_defarg_fn (decl);
8989
8990   /* Plain overloading: will not be grok'd by grokclassfn.  */
8991   if (! ctype && ! processing_template_decl
8992       && !DECL_EXTERN_C_P (decl)
8993       && (! DECL_USE_TEMPLATE (decl) || name_mangling_version < 1))
8994     set_mangled_name_for_decl (decl);
8995
8996   if (funcdef_flag)
8997     /* Make the init_value nonzero so pushdecl knows this is not
8998        tentative.  error_mark_node is replaced later with the BLOCK.  */
8999     DECL_INITIAL (decl) = error_mark_node;
9000
9001   if (TYPE_NOTHROW_P (type) || nothrow_libfn_p (decl))
9002     TREE_NOTHROW (decl) = 1;
9003
9004   /* Caller will do the rest of this.  */
9005   if (check < 0)
9006     return decl;
9007
9008   if (flags == NO_SPECIAL && ctype && constructor_name (cname) == declarator)
9009     DECL_CONSTRUCTOR_P (decl) = 1;
9010
9011   /* Function gets the ugly name, field gets the nice one.  This call
9012      may change the type of the function (because of default
9013      parameters)!  */
9014   if (ctype != NULL_TREE)
9015     grokclassfn (ctype, decl, flags, quals);
9016
9017   decl = check_explicit_specialization (orig_declarator, decl,
9018                                         template_count,
9019                                         2 * (funcdef_flag != 0) +
9020                                         4 * (friendp != 0));
9021   if (decl == error_mark_node)
9022     return NULL_TREE;
9023
9024   if (ctype != NULL_TREE
9025       && (! TYPE_FOR_JAVA (ctype) || check_java_method (decl))
9026       && check)
9027     {
9028       tree old_decl;
9029
9030       old_decl = check_classfn (ctype, decl);
9031
9032       if (old_decl && TREE_CODE (old_decl) == TEMPLATE_DECL)
9033         /* Because grokfndecl is always supposed to return a
9034            FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
9035            here.  We depend on our callers to figure out that its
9036            really a template that's being returned.  */
9037         old_decl = DECL_TEMPLATE_RESULT (old_decl);
9038
9039       if (old_decl && DECL_STATIC_FUNCTION_P (old_decl)
9040           && TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE)
9041         {
9042           /* Remove the `this' parm added by grokclassfn.
9043              XXX Isn't this done in start_function, too?  */
9044           revert_static_member_fn (decl);
9045           last_function_parms = TREE_CHAIN (last_function_parms);
9046         }
9047       if (old_decl && DECL_ARTIFICIAL (old_decl))
9048         cp_error ("definition of implicitly-declared `%D'", old_decl);
9049
9050       if (old_decl)
9051         {
9052           /* Since we've smashed OLD_DECL to its
9053              DECL_TEMPLATE_RESULT, we must do the same to DECL.  */
9054           if (TREE_CODE (decl) == TEMPLATE_DECL)
9055             decl = DECL_TEMPLATE_RESULT (decl);
9056
9057           /* Attempt to merge the declarations.  This can fail, in
9058              the case of some illegal specialization declarations.  */
9059           if (!duplicate_decls (decl, old_decl))
9060             cp_error ("no `%#D' member function declared in class `%T'",
9061                       decl, ctype);
9062           return old_decl;
9063         }
9064     }
9065
9066   if (DECL_CONSTRUCTOR_P (decl) && !grok_ctor_properties (ctype, decl))
9067     return NULL_TREE;
9068
9069   if (ctype == NULL_TREE || check)
9070     return decl;
9071
9072   if (virtualp)
9073     {
9074       DECL_VIRTUAL_P (decl) = 1;
9075       if (DECL_VINDEX (decl) == NULL_TREE)
9076         DECL_VINDEX (decl) = error_mark_node;
9077       IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1;
9078     }
9079
9080   return decl;
9081 }
9082
9083 static tree
9084 grokvardecl (type, declarator, specbits_in, initialized, constp, in_namespace)
9085      tree type;
9086      tree declarator;
9087      RID_BIT_TYPE *specbits_in;
9088      int initialized;
9089      int constp;
9090      tree in_namespace;
9091 {
9092   tree decl;
9093   RID_BIT_TYPE specbits;
9094
9095   specbits = *specbits_in;
9096
9097   if (TREE_CODE (type) == OFFSET_TYPE)
9098     {
9099       /* If you declare a static member so that it
9100          can be initialized, the code will reach here.  */
9101       tree basetype = TYPE_OFFSET_BASETYPE (type);
9102       type = TREE_TYPE (type);
9103       decl = build_lang_decl (VAR_DECL, declarator, type);
9104       DECL_CONTEXT (decl) = basetype;
9105       /* DECL_ASSEMBLER_NAME is needed only for full-instantiated
9106          templates.  */
9107       if (!uses_template_parms (decl))
9108         {
9109           if (flag_new_abi)
9110             DECL_ASSEMBLER_NAME (decl) = mangle_decl (decl);
9111           else
9112             DECL_ASSEMBLER_NAME (decl) = build_static_name (basetype,
9113                                                             declarator);
9114         }
9115     }
9116   else
9117     {
9118       tree context;
9119
9120       if (in_namespace)
9121         context = in_namespace;
9122       else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN, specbits))
9123         context = current_namespace;
9124       else
9125         context = NULL_TREE;
9126
9127       if (processing_template_decl && context)
9128         /* For global variables, declared in a template, we need the
9129            full lang_decl.  */
9130         decl = build_lang_decl (VAR_DECL, declarator, type);
9131       else
9132         decl = build_decl (VAR_DECL, declarator, type);
9133
9134       if (context)
9135         set_decl_namespace (decl, context, 0);
9136
9137       context = DECL_CONTEXT (decl);
9138       if (declarator && context && current_lang_name != lang_name_c)
9139         {
9140           if (flag_new_abi)
9141             DECL_ASSEMBLER_NAME (decl) = mangle_decl (decl);
9142           else
9143             DECL_ASSEMBLER_NAME (decl)
9144               = build_static_name (context, declarator);
9145         }
9146     }
9147
9148   if (in_namespace)
9149     set_decl_namespace (decl, in_namespace, 0);
9150
9151   if (RIDBIT_SETP (RID_EXTERN, specbits))
9152     {
9153       DECL_THIS_EXTERN (decl) = 1;
9154       DECL_EXTERNAL (decl) = !initialized;
9155     }
9156
9157   /* In class context, static means one per class,
9158      public access, and static storage.  */
9159   if (DECL_CLASS_SCOPE_P (decl))
9160     {
9161       TREE_PUBLIC (decl) = 1;
9162       TREE_STATIC (decl) = 1;
9163       DECL_EXTERNAL (decl) = 0;
9164     }
9165   /* At top level, either `static' or no s.c. makes a definition
9166      (perhaps tentative), and absence of `static' makes it public.  */
9167   else if (toplevel_bindings_p ())
9168     {
9169       TREE_PUBLIC (decl) = (RIDBIT_NOTSETP (RID_STATIC, specbits)
9170                             && (DECL_THIS_EXTERN (decl) || ! constp));
9171       TREE_STATIC (decl) = ! DECL_EXTERNAL (decl);
9172     }
9173   /* Not at top level, only `static' makes a static definition.  */
9174   else
9175     {
9176       TREE_STATIC (decl) = !! RIDBIT_SETP (RID_STATIC, specbits);
9177       TREE_PUBLIC (decl) = DECL_EXTERNAL (decl);
9178     }
9179
9180   if (TREE_PUBLIC (decl))
9181     {
9182       /* [basic.link]: A name with no linkage (notably, the name of a class
9183          or enumeration declared in a local scope) shall not be used to
9184          declare an entity with linkage.
9185
9186          Only check this for public decls for now.  */
9187       tree t = no_linkage_check (TREE_TYPE (decl));
9188       if (t)
9189         {
9190           if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
9191             /* Ignore for now; `enum { foo } e' is pretty common.  */;
9192           else
9193             cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9194                         decl, t);
9195         }
9196     }
9197
9198   return decl;
9199 }
9200
9201 /* Create and return a canonical pointer to member function type, for
9202    TYPE, which is a POINTER_TYPE to a METHOD_TYPE.  */
9203
9204 tree
9205 build_ptrmemfunc_type (type)
9206      tree type;
9207 {
9208   tree fields[4];
9209   tree t;
9210   tree u;
9211   tree unqualified_variant = NULL_TREE;
9212
9213   /* If a canonical type already exists for this type, use it.  We use
9214      this method instead of type_hash_canon, because it only does a
9215      simple equality check on the list of field members.  */
9216
9217   if ((t = TYPE_GET_PTRMEMFUNC_TYPE (type)))
9218     return t;
9219
9220   /* Make sure that we always have the unqualified pointer-to-member
9221      type first.  */
9222   if (CP_TYPE_QUALS (type) != TYPE_UNQUALIFIED)
9223     unqualified_variant
9224       = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type));
9225
9226   t = make_aggr_type (RECORD_TYPE);
9227   /* Let the front-end know this is a pointer to member function...  */
9228   TYPE_PTRMEMFUNC_FLAG (t) = 1;
9229   /* ... and not really an aggregate.  */
9230   SET_IS_AGGR_TYPE (t, 0);
9231
9232   if (!flag_new_abi)
9233     {
9234       u = make_aggr_type (UNION_TYPE);
9235       SET_IS_AGGR_TYPE (u, 0);
9236       fields[0] = build_decl (FIELD_DECL, pfn_identifier, type);
9237       fields[1] = build_decl (FIELD_DECL, delta2_identifier,
9238                               delta_type_node);
9239       finish_builtin_type (u, "__ptrmemfunc_type", fields, 1, ptr_type_node);
9240       TYPE_NAME (u) = NULL_TREE;
9241
9242       fields[0] = build_decl (FIELD_DECL, delta_identifier,
9243                               delta_type_node);
9244       fields[1] = build_decl (FIELD_DECL, index_identifier,
9245                               delta_type_node);
9246       fields[2] = build_decl (FIELD_DECL, pfn_or_delta2_identifier, u);
9247       finish_builtin_type (t, "__ptrmemfunc_type", fields, 2, ptr_type_node);
9248     }
9249   else
9250     {
9251       fields[0] = build_decl (FIELD_DECL, pfn_identifier, type);
9252       fields[1] = build_decl (FIELD_DECL, delta_identifier,
9253                               delta_type_node);
9254       finish_builtin_type (t, "__ptrmemfunc_type", fields, 1, ptr_type_node);
9255     }
9256
9257   /* Zap out the name so that the back-end will give us the debugging
9258      information for this anonymous RECORD_TYPE.  */
9259   TYPE_NAME (t) = NULL_TREE;
9260
9261   /* If this is not the unqualified form of this pointer-to-member
9262      type, set the TYPE_MAIN_VARIANT for this type to be the
9263      unqualified type.  Since they are actually RECORD_TYPEs that are
9264      not variants of each other, we must do this manually.  */
9265   if (CP_TYPE_QUALS (type) != TYPE_UNQUALIFIED)
9266     {
9267       t = build_qualified_type (t, CP_TYPE_QUALS (type));
9268       TYPE_MAIN_VARIANT (t) = unqualified_variant;
9269       TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (unqualified_variant);
9270       TYPE_NEXT_VARIANT (unqualified_variant) = t;
9271     }
9272
9273   /* Cache this pointer-to-member type so that we can find it again
9274      later.  */
9275   TYPE_SET_PTRMEMFUNC_TYPE (type, t);
9276
9277   /* Seems to be wanted.  */
9278   CLASSTYPE_GOT_SEMICOLON (t) = 1;
9279
9280   return t;
9281 }
9282
9283 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9284    Check to see that the definition is valid.  Issue appropriate error
9285    messages.  Return 1 if the definition is particularly bad, or 0
9286    otherwise.  */
9287
9288 int
9289 check_static_variable_definition (decl, type)
9290      tree decl;
9291      tree type;
9292 {
9293   /* Motion 10 at San Diego: If a static const integral data member is
9294      initialized with an integral constant expression, the initializer
9295      may appear either in the declaration (within the class), or in
9296      the definition, but not both.  If it appears in the class, the
9297      member is a member constant.  The file-scope definition is always
9298      required.  */
9299   if (CLASS_TYPE_P (type) || TREE_CODE (type) == REFERENCE_TYPE)
9300     {
9301       cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9302                 type);
9303       /* If we just return the declaration, crashes will sometimes
9304          occur.  We therefore return void_type_node, as if this was a
9305          friend declaration, to cause callers to completely ignore
9306          this declaration.  */
9307       return 1;
9308     }
9309   else if (!CP_TYPE_CONST_P (type))
9310     cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9311               decl);
9312   else if (pedantic && !INTEGRAL_TYPE_P (type))
9313     cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl, type);
9314
9315   return 0;
9316 }
9317
9318 /* Given the SIZE (i.e., number of elements) in an array, compute an
9319    appropriate index type for the array.  If non-NULL, NAME is the
9320    name of the thing being declared.  */
9321
9322 tree
9323 compute_array_index_type (name, size)
9324      tree name;
9325      tree size;
9326 {
9327   tree itype;
9328
9329   /* The size might be the result of a cast. */
9330   STRIP_TYPE_NOPS (size);
9331
9332   /* It might be a const variable or enumeration constant.  */
9333   size = decl_constant_value (size);
9334
9335   /* If this involves a template parameter, it will be a constant at
9336      instantiation time, but we don't know what the value is yet.
9337      Even if no template parameters are involved, we may an expression
9338      that is not a constant; we don't even simplify `1 + 2' when
9339      processing a template.  */
9340   if (processing_template_decl)
9341     {
9342       /* Resolve a qualified reference to an enumerator or static
9343          const data member of ours.  */
9344       if (TREE_CODE (size) == SCOPE_REF
9345           && TREE_OPERAND (size, 0) == current_class_type)
9346         {
9347           tree t = lookup_field (current_class_type,
9348                                  TREE_OPERAND (size, 1), 0, 0);
9349           if (t)
9350             size = t;
9351         }
9352
9353       return build_index_type (build_min (MINUS_EXPR, sizetype,
9354                                           size, integer_one_node));
9355     }
9356
9357   /* The array bound must be an integer type.  */
9358   if (TREE_CODE (TREE_TYPE (size)) != INTEGER_TYPE
9359       && TREE_CODE (TREE_TYPE (size)) != ENUMERAL_TYPE
9360       && TREE_CODE (TREE_TYPE (size)) != BOOLEAN_TYPE)
9361     {
9362       if (name)
9363         cp_error ("size of array `%D' has non-integer type", name);
9364       else
9365         cp_error ("size of array has non-integer type");
9366       size = integer_one_node;
9367     }
9368
9369   /* Normally, the array-bound will be a constant.  */
9370   if (TREE_CONSTANT (size))
9371     {
9372       /* Check to see if the array bound overflowed.  Make that an
9373          error, no matter how generous we're being.  */
9374       int old_flag_pedantic_errors = flag_pedantic_errors;
9375       int old_pedantic = pedantic;
9376       pedantic = flag_pedantic_errors = 1;
9377       constant_expression_warning (size);
9378       pedantic = old_pedantic;
9379       flag_pedantic_errors = old_flag_pedantic_errors;
9380
9381       /* An array must have a positive number of elements.  */
9382       if (INT_CST_LT (size, integer_zero_node))
9383         {
9384           if (name)
9385             cp_error ("size of array `%D' is negative", name);
9386           else
9387             cp_error ("size of array is negative");
9388           size = integer_one_node;
9389         }
9390       /* Except that an extension we allow zero-sized arrays.  We
9391          always allow them in system headers because glibc uses
9392          them.  */
9393       else if (integer_zerop (size) && pedantic && !in_system_header)
9394         {
9395           if (name)
9396             cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name);
9397           else
9398             cp_pedwarn ("ISO C++ forbids zero-size array");
9399         }
9400     }
9401
9402   /* Compute the index of the largest element in the array.  It is
9403      one less than the number of elements in the array.  */
9404   itype
9405     = fold (build_binary_op (MINUS_EXPR,
9406                              cp_convert (ssizetype, size),
9407                              cp_convert (ssizetype,
9408                                          integer_one_node)));
9409
9410   /* Check for variable-sized arrays.  We allow such things as an
9411      extension, even though they are not allowed in ANSI/ISO C++.  */
9412   if (!TREE_CONSTANT (itype))
9413     {
9414       if (pedantic)
9415         {
9416           if (name)
9417             cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9418                         name);
9419           else
9420             cp_pedwarn ("ISO C++ forbids variable-size array");
9421         }
9422
9423       /* Create a variable-sized array index type.  */
9424       itype = variable_size (itype);
9425     }
9426   /* Make sure that there was no overflow when creating to a signed
9427      index type.  (For example, on a 32-bit machine, an array with
9428      size 2^32 - 1 is too big.)  */
9429   else if (TREE_OVERFLOW (itype))
9430     {
9431       error ("overflow in array dimension");
9432       TREE_OVERFLOW (itype) = 0;
9433     }
9434
9435   /* Create and return the appropriate index type.  */
9436   return build_index_type (itype);
9437 }
9438
9439 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9440    indicated TYPE.  If non-NULL, NAME is the NAME of the declaration
9441    with this type.  */
9442
9443 static tree
9444 create_array_type_for_decl (name, type, size)
9445      tree name;
9446      tree type;
9447      tree size;
9448 {
9449   tree itype = NULL_TREE;
9450   const char* error_msg;
9451
9452   /* If things have already gone awry, bail now.  */
9453   if (type == error_mark_node || size == error_mark_node)
9454     return error_mark_node;
9455
9456   /* Assume that everything will go OK.  */
9457   error_msg = NULL;
9458
9459   /* There are some types which cannot be array elements.  */
9460   switch (TREE_CODE (type))
9461     {
9462     case VOID_TYPE:
9463       error_msg = "array of void";
9464       break;
9465
9466     case FUNCTION_TYPE:
9467       error_msg = "array of functions";
9468       break;
9469
9470     case REFERENCE_TYPE:
9471       error_msg = "array of references";
9472       break;
9473
9474     case OFFSET_TYPE:
9475       error_msg = "array of data members";
9476       break;
9477
9478     case METHOD_TYPE:
9479       error_msg = "array of function members";
9480       break;
9481
9482     default:
9483       break;
9484     }
9485
9486   /* If something went wrong, issue an error-message and return.  */
9487   if (error_msg)
9488     {
9489       if (name)
9490         cp_error ("declaration of `%D' as %s", name, error_msg);
9491       else
9492         cp_error ("creating %s", error_msg);
9493
9494       return error_mark_node;
9495     }
9496
9497   /* [dcl.array]
9498
9499      The constant expressions that specify the bounds of the arrays
9500      can be omitted only for the first member of the sequence.  */
9501   if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
9502     {
9503       cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9504                 name);
9505
9506       return error_mark_node;
9507     }
9508
9509   /* Figure out the index type for the array.  */
9510   if (size)
9511     itype = compute_array_index_type (name, size);
9512
9513   return build_cplus_array_type (type, itype);
9514 }
9515
9516 /* Check that it's OK to declare a function with the indicated TYPE.
9517    SFK indicates the kind of special function (if any) that this
9518    function is.  CTYPE is the class of which this function is a
9519    member.  OPTYPE is the type given in a conversion operator
9520    declaration.  Returns the actual return type of the function; that
9521    may be different than TYPE if an error occurs, or for certain
9522    special functions.  */
9523
9524 static tree
9525 check_special_function_return_type (sfk, type, ctype, optype)
9526      special_function_kind sfk;
9527      tree type;
9528      tree ctype;
9529      tree optype;
9530 {
9531   switch (sfk)
9532     {
9533     case sfk_constructor:
9534       if (type)
9535         cp_error ("return type specification for constructor invalid");
9536
9537       /* In the old ABI, we return `this'; in the new ABI we don't
9538          bother.  */
9539       type = flag_new_abi ? void_type_node : build_pointer_type (ctype);
9540       break;
9541
9542     case sfk_destructor:
9543       if (type)
9544         cp_error ("return type specification for destructor invalid");
9545       type = void_type_node;
9546       break;
9547
9548     case sfk_conversion:
9549       if (type && !same_type_p (type, optype))
9550         cp_error ("operator `%T' declared to return `%T'", optype, type);
9551       else if (type)
9552         cp_pedwarn ("return type specified for `operator %T'",  optype);
9553       type = optype;
9554       break;
9555
9556     default:
9557       my_friendly_abort (20000408);
9558       break;
9559     }
9560
9561   return type;
9562 }
9563
9564 /* Given declspecs and a declarator,
9565    determine the name and type of the object declared
9566    and construct a ..._DECL node for it.
9567    (In one case we can return a ..._TYPE node instead.
9568     For invalid input we sometimes return 0.)
9569
9570    DECLSPECS is a chain of tree_list nodes whose value fields
9571     are the storage classes and type specifiers.
9572
9573    DECL_CONTEXT says which syntactic context this declaration is in:
9574      NORMAL for most contexts.  Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9575      FUNCDEF for a function definition.  Like NORMAL but a few different
9576       error messages in each case.  Return value may be zero meaning
9577       this definition is too screwy to try to parse.
9578      MEMFUNCDEF for a function definition.  Like FUNCDEF but prepares to
9579       handle member functions (which have FIELD context).
9580       Return value may be zero meaning this definition is too screwy to
9581       try to parse.
9582      PARM for a parameter declaration (either within a function prototype
9583       or before a function body).  Make a PARM_DECL, or return void_type_node.
9584      CATCHPARM for a parameter declaration before a catch clause.
9585      TYPENAME if for a typename (in a cast or sizeof).
9586       Don't make a DECL node; just return the ..._TYPE node.
9587      FIELD for a struct or union field; make a FIELD_DECL.
9588      BITFIELD for a field with specified width.
9589    INITIALIZED is 1 if the decl has an initializer.
9590
9591    ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9592    normal attributes in TREE_PURPOSE, or NULL_TREE.
9593
9594    In the TYPENAME case, DECLARATOR is really an abstract declarator.
9595    It may also be so in the PARM case, for a prototype where the
9596    argument type is specified but not the name.
9597
9598    This function is where the complicated C meanings of `static'
9599    and `extern' are interpreted.
9600
9601    For C++, if there is any monkey business to do, the function which
9602    calls this one must do it, i.e., prepending instance variables,
9603    renaming overloaded function names, etc.
9604
9605    Note that for this C++, it is an error to define a method within a class
9606    which does not belong to that class.
9607
9608    Except in the case where SCOPE_REFs are implicitly known (such as
9609    methods within a class being redundantly qualified),
9610    declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9611    (class_name::decl_name).  The caller must also deal with this.
9612
9613    If a constructor or destructor is seen, and the context is FIELD,
9614    then the type gains the attribute TREE_HAS_x.  If such a declaration
9615    is erroneous, NULL_TREE is returned.
9616
9617    QUALS is used only for FUNCDEF and MEMFUNCDEF cases.  For a member
9618    function, these are the qualifiers to give to the `this' pointer. We
9619    apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9620
9621    May return void_type_node if the declarator turned out to be a friend.
9622    See grokfield for details.  */
9623
9624 tree
9625 grokdeclarator (declarator, declspecs, decl_context, initialized, attrlist)
9626      tree declspecs;
9627      tree declarator;
9628      enum decl_context decl_context;
9629      int initialized;
9630      tree attrlist;
9631 {
9632   RID_BIT_TYPE specbits;
9633   int nclasses = 0;
9634   tree spec;
9635   tree type = NULL_TREE;
9636   int longlong = 0;
9637   int constp;
9638   int restrictp;
9639   int volatilep;
9640   int type_quals;
9641   int virtualp, explicitp, friendp, inlinep, staticp;
9642   int explicit_int = 0;
9643   int explicit_char = 0;
9644   int defaulted_int = 0;
9645   tree typedef_decl = NULL_TREE;
9646   const char *name;
9647   tree typedef_type = NULL_TREE;
9648   int funcdef_flag = 0;
9649   enum tree_code innermost_code = ERROR_MARK;
9650   int bitfield = 0;
9651 #if 0
9652   /* See the code below that used this.  */
9653   tree decl_machine_attr = NULL_TREE;
9654 #endif
9655   /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9656      All FIELD_DECLs we build here have `init' put into their DECL_INITIAL.  */
9657   tree init = NULL_TREE;
9658
9659   /* Keep track of what sort of function is being processed
9660      so that we can warn about default return values, or explicit
9661      return values which do not match prescribed defaults.  */
9662   special_function_kind sfk = sfk_none;
9663
9664   tree dname = NULL_TREE;
9665   tree ctype = current_class_type;
9666   tree ctor_return_type = NULL_TREE;
9667   enum overload_flags flags = NO_SPECIAL;
9668   tree quals = NULL_TREE;
9669   tree raises = NULL_TREE;
9670   int template_count = 0;
9671   tree in_namespace = NULL_TREE;
9672   tree inner_attrs;
9673   int ignore_attrs;
9674
9675   RIDBIT_RESET_ALL (specbits);
9676   if (decl_context == FUNCDEF)
9677     funcdef_flag = 1, decl_context = NORMAL;
9678   else if (decl_context == MEMFUNCDEF)
9679     funcdef_flag = -1, decl_context = FIELD;
9680   else if (decl_context == BITFIELD)
9681     bitfield = 1, decl_context = FIELD;
9682
9683   /* Look inside a declarator for the name being declared
9684      and get it as a string, for an error message.  */
9685   {
9686     tree *next = &declarator;
9687     register tree decl;
9688     name = NULL;
9689
9690     while (next && *next)
9691       {
9692         decl = *next;
9693         switch (TREE_CODE (decl))
9694           {
9695           case TREE_LIST:
9696             /* For attributes.  */
9697             next = &TREE_VALUE (decl);
9698             break;
9699
9700           case COND_EXPR:
9701             ctype = NULL_TREE;
9702             next = &TREE_OPERAND (decl, 0);
9703             break;
9704
9705           case BIT_NOT_EXPR:    /* For C++ destructors!  */
9706             {
9707               tree name = TREE_OPERAND (decl, 0);
9708               tree rename = NULL_TREE;
9709
9710               my_friendly_assert (flags == NO_SPECIAL, 152);
9711               flags = DTOR_FLAG;
9712               sfk = sfk_destructor;
9713               if (TREE_CODE (name) == TYPE_DECL)
9714                 TREE_OPERAND (decl, 0) = name = constructor_name (name);
9715               my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 153);
9716               if (ctype == NULL_TREE)
9717                 {
9718                   if (current_class_type == NULL_TREE)
9719                     {
9720                       error ("destructors must be member functions");
9721                       flags = NO_SPECIAL;
9722                     }
9723                   else
9724                     {
9725                       tree t = constructor_name (current_class_name);
9726                       if (t != name)
9727                         rename = t;
9728                     }
9729                 }
9730               else
9731                 {
9732                   tree t = constructor_name (ctype);
9733                   if (t != name)
9734                     rename = t;
9735                 }
9736
9737               if (rename)
9738                 {
9739                   cp_error ("destructor `%T' must match class name `%T'",
9740                             name, rename);
9741                   TREE_OPERAND (decl, 0) = rename;
9742                 }
9743               next = &name;
9744             }
9745             break;
9746
9747           case ADDR_EXPR:       /* C++ reference declaration */
9748             /* Fall through. */
9749           case ARRAY_REF:
9750           case INDIRECT_REF:
9751             ctype = NULL_TREE;
9752             innermost_code = TREE_CODE (decl);
9753             next = &TREE_OPERAND (decl, 0);
9754             break;
9755
9756           case CALL_EXPR:
9757             if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl)))
9758               {
9759                 /* This is actually a variable declaration using
9760                    constructor syntax.  We need to call start_decl and
9761                    cp_finish_decl so we can get the variable
9762                    initialized...  */
9763
9764                 tree attributes, prefix_attributes;
9765
9766                 *next = TREE_OPERAND (decl, 0);
9767                 init = CALL_DECLARATOR_PARMS (decl);
9768
9769                 if (attrlist)
9770                   {
9771                     attributes = TREE_PURPOSE (attrlist);
9772                     prefix_attributes = TREE_VALUE (attrlist);
9773                   }
9774                 else
9775                   {
9776                     attributes = NULL_TREE;
9777                     prefix_attributes = NULL_TREE;
9778                   }
9779
9780                 decl = start_decl (declarator, declspecs, 1,
9781                                    attributes, prefix_attributes);
9782                 decl_type_access_control (decl);
9783                 if (decl)
9784                   {
9785                     /* Look for __unused__ attribute */
9786                     if (TREE_USED (TREE_TYPE (decl)))
9787                       TREE_USED (decl) = 1;
9788                     finish_decl (decl, init, NULL_TREE);
9789                   }
9790                 else
9791                   cp_error ("invalid declarator");
9792                 return 0;
9793               }
9794             innermost_code = TREE_CODE (decl);
9795             if (decl_context == FIELD && ctype == NULL_TREE)
9796               ctype = current_class_type;
9797             if (ctype
9798                 && TREE_OPERAND (decl, 0)
9799                 && (TREE_CODE (TREE_OPERAND (decl, 0)) == TYPE_DECL
9800                     && ((DECL_NAME (TREE_OPERAND (decl, 0))
9801                          == constructor_name_full (ctype))
9802                         || (DECL_NAME (TREE_OPERAND (decl, 0))
9803                             == constructor_name (ctype)))))
9804               TREE_OPERAND (decl, 0) = constructor_name (ctype);
9805             next = &TREE_OPERAND (decl, 0);
9806             decl = *next;
9807             if (ctype != NULL_TREE
9808                 && decl != NULL_TREE && flags != DTOR_FLAG
9809                 && decl == constructor_name (ctype))
9810               {
9811                 sfk = sfk_constructor;
9812                 ctor_return_type = ctype;
9813               }
9814             ctype = NULL_TREE;
9815             break;
9816
9817           case TEMPLATE_ID_EXPR:
9818               {
9819                 tree fns = TREE_OPERAND (decl, 0);
9820
9821                 if (TREE_CODE (fns) == LOOKUP_EXPR)
9822                   fns = TREE_OPERAND (fns, 0);
9823
9824                 dname = fns;
9825                 if (TREE_CODE (dname) == COMPONENT_REF)
9826                   dname = TREE_OPERAND (dname, 1);
9827                 if (TREE_CODE (dname) != IDENTIFIER_NODE)
9828                   {
9829                     my_friendly_assert (is_overloaded_fn (dname),
9830                                         19990331);
9831                     dname = DECL_NAME (get_first_fn (dname));
9832                   }
9833               }
9834           /* Fall through. */
9835
9836           case IDENTIFIER_NODE:
9837             if (TREE_CODE (decl) == IDENTIFIER_NODE)
9838               dname = decl;
9839
9840             next = 0;
9841
9842             if (is_rid (dname))
9843               {
9844                 cp_error ("declarator-id missing; using reserved word `%D'",
9845                           dname);
9846                 name = IDENTIFIER_POINTER (dname);
9847               }
9848             else if (!IDENTIFIER_TYPENAME_P (dname))
9849               name = IDENTIFIER_POINTER (dname);
9850             else
9851               {
9852                 my_friendly_assert (flags == NO_SPECIAL, 154);
9853                 flags = TYPENAME_FLAG;
9854                 ctor_return_type = TREE_TYPE (dname);
9855                 sfk = sfk_conversion;
9856                 if (IDENTIFIER_GLOBAL_VALUE (dname)
9857                     && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname))
9858                         == TYPE_DECL))
9859                   name = IDENTIFIER_POINTER (dname);
9860                 else
9861                   name = "<invalid operator>";
9862               }
9863             break;
9864
9865             /* C++ extension */
9866           case SCOPE_REF:
9867             {
9868               /* Perform error checking, and decide on a ctype.  */
9869               tree cname = TREE_OPERAND (decl, 0);
9870               if (cname == NULL_TREE)
9871                 ctype = NULL_TREE;
9872               else if (TREE_CODE (cname) == NAMESPACE_DECL)
9873                 {
9874                   ctype = NULL_TREE;
9875                   in_namespace = TREE_OPERAND (decl, 0);
9876                   TREE_OPERAND (decl, 0) = NULL_TREE;
9877                 }
9878               else if (! is_aggr_type (cname, 1))
9879                 TREE_OPERAND (decl, 0) = NULL_TREE;
9880               /* Must test TREE_OPERAND (decl, 1), in case user gives
9881                  us `typedef (class::memfunc)(int); memfunc *memfuncptr;'  */
9882               else if (TREE_OPERAND (decl, 1)
9883                        && TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF)
9884                 ctype = cname;
9885               else if (TREE_CODE (cname) == TEMPLATE_TYPE_PARM
9886                        || TREE_CODE (cname) == TEMPLATE_TEMPLATE_PARM)
9887                 {
9888                   cp_error ("`%T::%D' is not a valid declarator", cname,
9889                             TREE_OPERAND (decl, 1));
9890                   cp_error ("  perhaps you want `typename %T::%D' to make it a type",
9891                             cname, TREE_OPERAND (decl, 1));
9892                   return void_type_node;
9893                 }
9894               else if (ctype == NULL_TREE)
9895                 ctype = cname;
9896               else if (TREE_COMPLEXITY (decl) == current_class_depth)
9897                 TREE_OPERAND (decl, 0) = ctype;
9898               else
9899                 {
9900                   if (! UNIQUELY_DERIVED_FROM_P (cname, ctype))
9901                     {
9902                       cp_error ("type `%T' is not derived from type `%T'",
9903                                 cname, ctype);
9904                       TREE_OPERAND (decl, 0) = NULL_TREE;
9905                     }
9906                   else
9907                     ctype = cname;
9908                 }
9909
9910               if (ctype && TREE_CODE (TREE_OPERAND (decl, 1)) == TYPE_DECL
9911                   && ((DECL_NAME (TREE_OPERAND (decl, 1))
9912                        == constructor_name_full (ctype))
9913                       || (DECL_NAME (TREE_OPERAND (decl, 1))
9914                           == constructor_name (ctype))))
9915                 TREE_OPERAND (decl, 1) = constructor_name (ctype);
9916               next = &TREE_OPERAND (decl, 1);
9917               decl = *next;
9918               if (ctype)
9919                 {
9920                   if (TREE_CODE (decl) == IDENTIFIER_NODE
9921                       && constructor_name (ctype) == decl)
9922                     {
9923                       sfk = sfk_constructor;
9924                       ctor_return_type = ctype;
9925                     }
9926                   else if (TREE_CODE (decl) == BIT_NOT_EXPR
9927                            && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
9928                            && (constructor_name (ctype) == TREE_OPERAND (decl, 0)
9929                                || constructor_name_full (ctype) == TREE_OPERAND (decl, 0)))
9930                     {
9931                       sfk = sfk_destructor;
9932                       ctor_return_type = ctype;
9933                       flags = DTOR_FLAG;
9934                       TREE_OPERAND (decl, 0) = constructor_name (ctype);
9935                       next = &TREE_OPERAND (decl, 0);
9936                     }
9937                 }
9938             }
9939             break;
9940
9941           case ERROR_MARK:
9942             next = 0;
9943             break;
9944
9945           case TYPE_DECL:
9946             /* Parse error puts this typespec where
9947                a declarator should go.  */
9948             cp_error ("`%T' specified as declarator-id", DECL_NAME (decl));
9949             if (TREE_TYPE (decl) == current_class_type)
9950               cp_error ("  perhaps you want `%T' for a constructor",
9951                         current_class_name);
9952             dname = DECL_NAME (decl);
9953             name = IDENTIFIER_POINTER (dname);
9954
9955             /* Avoid giving two errors for this.  */
9956             IDENTIFIER_CLASS_VALUE (dname) = NULL_TREE;
9957
9958             declspecs = tree_cons (NULL_TREE, integer_type_node, declspecs);
9959             *next = dname;
9960             next = 0;
9961             break;
9962
9963           default:
9964             cp_compiler_error ("`%D' as declarator", decl);
9965             return 0; /* We used to do a 155 abort here.  */
9966           }
9967       }
9968   }
9969
9970   /* A function definition's declarator must have the form of
9971      a function declarator.  */
9972
9973   if (funcdef_flag && innermost_code != CALL_EXPR)
9974     return 0;
9975
9976   if (((dname && IDENTIFIER_OPNAME_P (dname)) || flags == TYPENAME_FLAG)
9977       && innermost_code != CALL_EXPR
9978       && ! (ctype && declspecs == NULL_TREE))
9979     {
9980       cp_error ("declaration of `%D' as non-function", dname);
9981       return void_type_node;
9982     }
9983
9984   /* Anything declared one level down from the top level
9985      must be one of the parameters of a function
9986      (because the body is at least two levels down).  */
9987
9988   /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9989      by not allowing C++ class definitions to specify their parameters
9990      with xdecls (must be spec.d in the parmlist).
9991
9992      Since we now wait to push a class scope until we are sure that
9993      we are in a legitimate method context, we must set oldcname
9994      explicitly (since current_class_name is not yet alive).
9995
9996      We also want to avoid calling this a PARM if it is in a namespace.  */
9997
9998   if (decl_context == NORMAL && !toplevel_bindings_p ())
9999     {
10000       struct binding_level *b = current_binding_level;
10001       current_binding_level = b->level_chain;
10002       if (current_binding_level != 0 && toplevel_bindings_p ())
10003         decl_context = PARM;
10004       current_binding_level = b;
10005     }
10006
10007   if (name == NULL)
10008     name = decl_context == PARM ? "parameter" : "type name";
10009
10010   /* Look through the decl specs and record which ones appear.
10011      Some typespecs are defined as built-in typenames.
10012      Others, the ones that are modifiers of other types,
10013      are represented by bits in SPECBITS: set the bits for
10014      the modifiers that appear.  Storage class keywords are also in SPECBITS.
10015
10016      If there is a typedef name or a type, store the type in TYPE.
10017      This includes builtin typedefs such as `int'.
10018
10019      Set EXPLICIT_INT if the type is `int' or `char' and did not
10020      come from a user typedef.
10021
10022      Set LONGLONG if `long' is mentioned twice.
10023
10024      For C++, constructors and destructors have their own fast treatment.  */
10025
10026   for (spec = declspecs; spec; spec = TREE_CHAIN (spec))
10027     {
10028       register int i;
10029       register tree id;
10030
10031       /* Certain parse errors slip through.  For example,
10032          `int class;' is not caught by the parser. Try
10033          weakly to recover here.  */
10034       if (TREE_CODE (spec) != TREE_LIST)
10035         return 0;
10036
10037       id = TREE_VALUE (spec);
10038
10039       if (TREE_CODE (id) == IDENTIFIER_NODE)
10040         {
10041           if (id == ridpointers[(int) RID_INT]
10042               || id == ridpointers[(int) RID_CHAR]
10043               || id == ridpointers[(int) RID_BOOL]
10044               || id == ridpointers[(int) RID_WCHAR])
10045             {
10046               if (type)
10047                 {
10048                   if (id == ridpointers[(int) RID_BOOL])
10049                     error ("`bool' is now a keyword");
10050                   else
10051                     cp_error ("extraneous `%T' ignored", id);
10052                 }
10053               else
10054                 {
10055                   if (id == ridpointers[(int) RID_INT])
10056                     explicit_int = 1;
10057                   else if (id == ridpointers[(int) RID_CHAR])
10058                     explicit_char = 1;
10059                   type = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id));
10060                 }
10061               goto found;
10062             }
10063           /* C++ aggregate types.  */
10064           if (IDENTIFIER_HAS_TYPE_VALUE (id))
10065             {
10066               if (type)
10067                 cp_error ("multiple declarations `%T' and `%T'", type, id);
10068               else
10069                 type = IDENTIFIER_TYPE_VALUE (id);
10070               goto found;
10071             }
10072
10073           for (i = (int) RID_FIRST_MODIFIER; i <= (int) RID_LAST_MODIFIER; i++)
10074             {
10075               if (ridpointers[i] == id)
10076                 {
10077                   if (i == (int) RID_LONG && RIDBIT_SETP (i, specbits))
10078                     {
10079                       if (pedantic && ! in_system_header && warn_long_long)
10080                         pedwarn ("ISO C++ does not support `long long'");
10081                       if (longlong)
10082                         error ("`long long long' is too long for GCC");
10083                       else
10084                         longlong = 1;
10085                     }
10086                   else if (RIDBIT_SETP (i, specbits))
10087                     pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id));
10088                   RIDBIT_SET (i, specbits);
10089                   goto found;
10090                 }
10091             }
10092         }
10093       /* C++ aggregate types.  */
10094       else if (TREE_CODE (id) == TYPE_DECL || TREE_CODE (id) == TEMPLATE_DECL)
10095         {
10096           if (type)
10097             cp_error ("multiple declarations `%T' and `%T'", type,
10098                       TREE_TYPE (id));
10099           else
10100             {
10101               type = TREE_TYPE (id);
10102               TREE_VALUE (spec) = type;
10103             }
10104           goto found;
10105         }
10106       if (type)
10107         error ("two or more data types in declaration of `%s'", name);
10108       else if (TREE_CODE (id) == IDENTIFIER_NODE)
10109         {
10110           register tree t = lookup_name (id, 1);
10111           if (!t || TREE_CODE (t) != TYPE_DECL)
10112             error ("`%s' fails to be a typedef or built in type",
10113                    IDENTIFIER_POINTER (id));
10114           else
10115             {
10116               type = TREE_TYPE (t);
10117 #if 0
10118               /* See the code below that used this.  */
10119               decl_machine_attr = DECL_MACHINE_ATTRIBUTES (id);
10120 #endif
10121               typedef_decl = t;
10122             }
10123         }
10124       else if (id != error_mark_node)
10125         /* Can't change CLASS nodes into RECORD nodes here!  */
10126         type = id;
10127
10128     found: ;
10129     }
10130
10131   typedef_type = type;
10132
10133   /* No type at all: default to `int', and set DEFAULTED_INT
10134      because it was not a user-defined typedef.  */
10135
10136   if (type == NULL_TREE
10137       && (RIDBIT_SETP (RID_SIGNED, specbits)
10138           || RIDBIT_SETP (RID_UNSIGNED, specbits)
10139           || RIDBIT_SETP (RID_LONG, specbits)
10140           || RIDBIT_SETP (RID_SHORT, specbits)))
10141     {
10142       /* These imply 'int'.  */
10143       type = integer_type_node;
10144       defaulted_int = 1;
10145     }
10146
10147   if (sfk != sfk_none)
10148     type = check_special_function_return_type (sfk, type,
10149                                                ctor_return_type,
10150                                                ctor_return_type);
10151   else if (type == NULL_TREE)
10152     {
10153       int is_main;
10154
10155       explicit_int = -1;
10156
10157           /* We handle `main' specially here, because 'main () { }' is so
10158              common.  With no options, it is allowed.  With -Wreturn-type,
10159              it is a warning.  It is only an error with -pedantic-errors.  */
10160       is_main = (funcdef_flag
10161                  && MAIN_NAME_P (dname)
10162                  && ctype == NULL_TREE
10163                  && in_namespace == NULL_TREE
10164                  && current_namespace == global_namespace);
10165
10166       if (in_system_header || flag_ms_extensions)
10167         /* Allow it, sigh.  */;
10168       else if (pedantic || ! is_main)
10169         cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10170                     name);
10171       else if (warn_return_type)
10172         cp_warning ("ISO C++ forbids declaration of `%s' with no type",
10173                     name);
10174
10175       type = integer_type_node;
10176     }
10177
10178   ctype = NULL_TREE;
10179
10180   /* Now process the modifiers that were specified
10181      and check for invalid combinations.  */
10182
10183   /* Long double is a special combination.  */
10184
10185   if (RIDBIT_SETP (RID_LONG, specbits)
10186       && TYPE_MAIN_VARIANT (type) == double_type_node)
10187     {
10188       RIDBIT_RESET (RID_LONG, specbits);
10189       type = build_qualified_type (long_double_type_node,
10190                                    CP_TYPE_QUALS (type));
10191     }
10192
10193   /* Check all other uses of type modifiers.  */
10194
10195   if (RIDBIT_SETP (RID_UNSIGNED, specbits)
10196       || RIDBIT_SETP (RID_SIGNED, specbits)
10197       || RIDBIT_SETP (RID_LONG, specbits)
10198       || RIDBIT_SETP (RID_SHORT, specbits))
10199     {
10200       int ok = 0;
10201
10202       if (TREE_CODE (type) == REAL_TYPE)
10203         error ("short, signed or unsigned invalid for `%s'", name);
10204       else if (TREE_CODE (type) != INTEGER_TYPE)
10205         error ("long, short, signed or unsigned invalid for `%s'", name);
10206       else if (RIDBIT_SETP (RID_LONG, specbits)
10207                && RIDBIT_SETP (RID_SHORT, specbits))
10208         error ("long and short specified together for `%s'", name);
10209       else if ((RIDBIT_SETP (RID_LONG, specbits)
10210                 || RIDBIT_SETP (RID_SHORT, specbits))
10211                && explicit_char)
10212         error ("long or short specified with char for `%s'", name);
10213       else if ((RIDBIT_SETP (RID_LONG, specbits)
10214                 || RIDBIT_SETP (RID_SHORT, specbits))
10215                && TREE_CODE (type) == REAL_TYPE)
10216         error ("long or short specified with floating type for `%s'", name);
10217       else if (RIDBIT_SETP (RID_SIGNED, specbits)
10218                && RIDBIT_SETP (RID_UNSIGNED, specbits))
10219         error ("signed and unsigned given together for `%s'", name);
10220       else
10221         {
10222           ok = 1;
10223           if (!explicit_int && !defaulted_int && !explicit_char && pedantic)
10224             {
10225               pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10226                        name);
10227               if (flag_pedantic_errors)
10228                 ok = 0;
10229             }
10230         }
10231
10232       /* Discard the type modifiers if they are invalid.  */
10233       if (! ok)
10234         {
10235           RIDBIT_RESET (RID_UNSIGNED, specbits);
10236           RIDBIT_RESET (RID_SIGNED, specbits);
10237           RIDBIT_RESET (RID_LONG, specbits);
10238           RIDBIT_RESET (RID_SHORT, specbits);
10239           longlong = 0;
10240         }
10241     }
10242
10243   if (RIDBIT_SETP (RID_COMPLEX, specbits)
10244       && TREE_CODE (type) != INTEGER_TYPE && TREE_CODE (type) != REAL_TYPE)
10245     {
10246       error ("complex invalid for `%s'", name);
10247       RIDBIT_RESET (RID_COMPLEX, specbits);
10248     }
10249
10250   /* Decide whether an integer type is signed or not.
10251      Optionally treat bitfields as signed by default.  */
10252   if (RIDBIT_SETP (RID_UNSIGNED, specbits)
10253       /* [class.bit]
10254
10255          It is implementation-defined whether a plain (neither
10256          explicitly signed or unsigned) char, short, int, or long
10257          bit-field is signed or unsigned.
10258
10259          Naturally, we extend this to long long as well.  Note that
10260          this does not include wchar_t.  */
10261       || (bitfield && !flag_signed_bitfields
10262           && RIDBIT_NOTSETP (RID_SIGNED, specbits)
10263           /* A typedef for plain `int' without `signed' can be
10264              controlled just like plain `int', but a typedef for
10265              `signed int' cannot be so controlled.  */
10266           && !(typedef_decl
10267                && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl))
10268           && (TREE_CODE (type) == INTEGER_TYPE
10269               || TREE_CODE (type) == CHAR_TYPE)
10270           && !same_type_p (TYPE_MAIN_VARIANT (type), wchar_type_node)))
10271     {
10272       if (longlong)
10273         type = long_long_unsigned_type_node;
10274       else if (RIDBIT_SETP (RID_LONG, specbits))
10275         type = long_unsigned_type_node;
10276       else if (RIDBIT_SETP (RID_SHORT, specbits))
10277         type = short_unsigned_type_node;
10278       else if (type == char_type_node)
10279         type = unsigned_char_type_node;
10280       else if (typedef_decl)
10281         type = unsigned_type (type);
10282       else
10283         type = unsigned_type_node;
10284     }
10285   else if (RIDBIT_SETP (RID_SIGNED, specbits)
10286            && type == char_type_node)
10287     type = signed_char_type_node;
10288   else if (longlong)
10289     type = long_long_integer_type_node;
10290   else if (RIDBIT_SETP (RID_LONG, specbits))
10291     type = long_integer_type_node;
10292   else if (RIDBIT_SETP (RID_SHORT, specbits))
10293     type = short_integer_type_node;
10294
10295   if (RIDBIT_SETP (RID_COMPLEX, specbits))
10296     {
10297       /* If we just have "complex", it is equivalent to
10298          "complex double", but if any modifiers at all are specified it is
10299          the complex form of TYPE.  E.g, "complex short" is
10300          "complex short int".  */
10301
10302       if (defaulted_int && ! longlong
10303           && ! (RIDBIT_SETP (RID_LONG, specbits)
10304                 || RIDBIT_SETP (RID_SHORT, specbits)
10305                 || RIDBIT_SETP (RID_SIGNED, specbits)
10306                 || RIDBIT_SETP (RID_UNSIGNED, specbits)))
10307         type = complex_double_type_node;
10308       else if (type == integer_type_node)
10309         type = complex_integer_type_node;
10310       else if (type == float_type_node)
10311         type = complex_float_type_node;
10312       else if (type == double_type_node)
10313         type = complex_double_type_node;
10314       else if (type == long_double_type_node)
10315         type = complex_long_double_type_node;
10316       else
10317         type = build_complex_type (type);
10318     }
10319
10320   if (sfk == sfk_conversion
10321       && (RIDBIT_SETP (RID_CONST, specbits)
10322           || RIDBIT_SETP (RID_VOLATILE, specbits)
10323           || RIDBIT_SETP (RID_RESTRICT, specbits)))
10324     cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10325               ctor_return_type);
10326
10327   /* Set CONSTP if this declaration is `const', whether by
10328      explicit specification or via a typedef.
10329      Likewise for VOLATILEP.  */
10330
10331   constp = !! RIDBIT_SETP (RID_CONST, specbits) + CP_TYPE_CONST_P (type);
10332   restrictp =
10333     !! RIDBIT_SETP (RID_RESTRICT, specbits) + CP_TYPE_RESTRICT_P (type);
10334   volatilep =
10335     !! RIDBIT_SETP (RID_VOLATILE, specbits) + CP_TYPE_VOLATILE_P (type);
10336   type_quals = ((constp ? TYPE_QUAL_CONST : 0)
10337                 | (restrictp ? TYPE_QUAL_RESTRICT : 0)
10338                 | (volatilep ? TYPE_QUAL_VOLATILE : 0));
10339   type = cp_build_qualified_type (type, type_quals);
10340   staticp = 0;
10341   inlinep = !! RIDBIT_SETP (RID_INLINE, specbits);
10342   virtualp = RIDBIT_SETP (RID_VIRTUAL, specbits);
10343   RIDBIT_RESET (RID_VIRTUAL, specbits);
10344   explicitp = RIDBIT_SETP (RID_EXPLICIT, specbits) != 0;
10345   RIDBIT_RESET (RID_EXPLICIT, specbits);
10346
10347   if (RIDBIT_SETP (RID_STATIC, specbits))
10348     staticp = 1 + (decl_context == FIELD);
10349
10350   if (virtualp && staticp == 2)
10351     {
10352       cp_error ("member `%D' cannot be declared both virtual and static",
10353                 dname);
10354       staticp = 0;
10355     }
10356   friendp = RIDBIT_SETP (RID_FRIEND, specbits);
10357   RIDBIT_RESET (RID_FRIEND, specbits);
10358
10359   /* Warn if two storage classes are given. Default to `auto'.  */
10360
10361   if (RIDBIT_ANY_SET (specbits))
10362     {
10363       if (RIDBIT_SETP (RID_STATIC, specbits)) nclasses++;
10364       if (RIDBIT_SETP (RID_EXTERN, specbits)) nclasses++;
10365       if (decl_context == PARM && nclasses > 0)
10366         error ("storage class specifiers invalid in parameter declarations");
10367       if (RIDBIT_SETP (RID_TYPEDEF, specbits))
10368         {
10369           if (decl_context == PARM)
10370             error ("typedef declaration invalid in parameter declaration");
10371           nclasses++;
10372         }
10373       if (RIDBIT_SETP (RID_AUTO, specbits)) nclasses++;
10374       if (RIDBIT_SETP (RID_REGISTER, specbits)) nclasses++;
10375     }
10376
10377   /* Give error if `virtual' is used outside of class declaration.  */
10378   if (virtualp
10379       && (current_class_name == NULL_TREE || decl_context != FIELD))
10380     {
10381       error ("virtual outside class declaration");
10382       virtualp = 0;
10383     }
10384
10385   /* Static anonymous unions are dealt with here.  */
10386   if (staticp && decl_context == TYPENAME
10387       && TREE_CODE (declspecs) == TREE_LIST
10388       && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs)))
10389     decl_context = FIELD;
10390
10391   /* Warn about storage classes that are invalid for certain
10392      kinds of declarations (parameters, typenames, etc.).  */
10393
10394   if (nclasses > 1)
10395     error ("multiple storage classes in declaration of `%s'", name);
10396   else if (decl_context != NORMAL && nclasses > 0)
10397     {
10398       if ((decl_context == PARM || decl_context == CATCHPARM)
10399           && (RIDBIT_SETP (RID_REGISTER, specbits)
10400               || RIDBIT_SETP (RID_AUTO, specbits)))
10401         ;
10402       else if (RIDBIT_SETP (RID_TYPEDEF, specbits))
10403         ;
10404       else if (decl_context == FIELD
10405                /* C++ allows static class elements  */
10406                && RIDBIT_SETP (RID_STATIC, specbits))
10407         /* C++ also allows inlines and signed and unsigned elements,
10408            but in those cases we don't come in here.  */
10409         ;
10410       else
10411         {
10412           if (decl_context == FIELD)
10413             {
10414               tree tmp = NULL_TREE;
10415               register int op = 0;
10416
10417               if (declarator)
10418                 {
10419                   /* Avoid trying to get an operand off an identifier node.  */
10420                   if (TREE_CODE (declarator) == IDENTIFIER_NODE)
10421                     tmp = declarator;
10422                   else
10423                     tmp = TREE_OPERAND (declarator, 0);
10424                   op = IDENTIFIER_OPNAME_P (tmp);
10425                   if (IDENTIFIER_TYPENAME_P (tmp))
10426                     {
10427                       if (IDENTIFIER_GLOBAL_VALUE (tmp)
10428                           && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp))
10429                               == TYPE_DECL))
10430                         name = IDENTIFIER_POINTER (tmp);
10431                       else
10432                         name = "<invalid operator>";
10433                     }
10434                 }
10435               error ("storage class specified for %s `%s'",
10436                      op ? "member operator" : "field",
10437                      name);
10438             }
10439           else
10440             {
10441               if (decl_context == PARM || decl_context == CATCHPARM)
10442                 error ("storage class specified for parameter `%s'", name);
10443               else
10444                 error ("storage class specified for typename");
10445             }
10446           RIDBIT_RESET (RID_REGISTER, specbits);
10447           RIDBIT_RESET (RID_AUTO, specbits);
10448           RIDBIT_RESET (RID_EXTERN, specbits);
10449         }
10450     }
10451   else if (RIDBIT_SETP (RID_EXTERN, specbits) && initialized && !funcdef_flag)
10452     {
10453       if (toplevel_bindings_p ())
10454         {
10455           /* It's common practice (and completely valid) to have a const
10456              be initialized and declared extern.  */
10457           if (!(type_quals & TYPE_QUAL_CONST))
10458             warning ("`%s' initialized and declared `extern'", name);
10459         }
10460       else
10461         error ("`%s' has both `extern' and initializer", name);
10462     }
10463   else if (RIDBIT_SETP (RID_EXTERN, specbits) && funcdef_flag
10464            && ! toplevel_bindings_p ())
10465     error ("nested function `%s' declared `extern'", name);
10466   else if (toplevel_bindings_p ())
10467     {
10468       if (RIDBIT_SETP (RID_AUTO, specbits))
10469         error ("top-level declaration of `%s' specifies `auto'", name);
10470     }
10471
10472   if (nclasses > 0 && friendp)
10473     error ("storage class specifiers invalid in friend function declarations");
10474
10475   /* Now figure out the structure of the declarator proper.
10476      Descend through it, creating more complex types, until we reach
10477      the declared identifier (or NULL_TREE, in an absolute declarator).  */
10478
10479   inner_attrs = NULL_TREE;
10480   ignore_attrs = 0;
10481
10482   while (declarator && TREE_CODE (declarator) != IDENTIFIER_NODE
10483          && TREE_CODE (declarator) != TEMPLATE_ID_EXPR)
10484     {
10485       /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10486          an INDIRECT_REF (for *...),
10487          a CALL_EXPR (for ...(...)),
10488          an identifier (for the name being declared)
10489          or a null pointer (for the place in an absolute declarator
10490          where the name was omitted).
10491          For the last two cases, we have just exited the loop.
10492
10493          For C++ it could also be
10494          a SCOPE_REF (for class :: ...).  In this case, we have converted
10495          sensible names to types, and those are the values we use to
10496          qualify the member name.
10497          an ADDR_EXPR (for &...),
10498          a BIT_NOT_EXPR (for destructors)
10499
10500          At this point, TYPE is the type of elements of an array,
10501          or for a function to return, or for a pointer to point to.
10502          After this sequence of ifs, TYPE is the type of the
10503          array or function or pointer, and DECLARATOR has had its
10504          outermost layer removed.  */
10505
10506       if (type == error_mark_node)
10507         {
10508           if (TREE_CODE (declarator) == SCOPE_REF)
10509             declarator = TREE_OPERAND (declarator, 1);
10510           else
10511             declarator = TREE_OPERAND (declarator, 0);
10512           continue;
10513         }
10514       if (quals != NULL_TREE
10515           && (declarator == NULL_TREE
10516               || TREE_CODE (declarator) != SCOPE_REF))
10517         {
10518           if (ctype == NULL_TREE && TREE_CODE (type) == METHOD_TYPE)
10519             ctype = TYPE_METHOD_BASETYPE (type);
10520           if (ctype != NULL_TREE)
10521             {
10522               tree dummy = build_decl (TYPE_DECL, NULL_TREE, type);
10523               grok_method_quals (ctype, dummy, quals);
10524               type = TREE_TYPE (dummy);
10525               ctype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type)));
10526               quals = NULL_TREE;
10527             }
10528         }
10529
10530       /* See the comment for the TREE_LIST case, below.  */
10531       if (ignore_attrs)
10532         ignore_attrs = 0;
10533       else if (inner_attrs)
10534         {
10535           decl_attributes (type, inner_attrs, NULL_TREE);
10536           inner_attrs = NULL_TREE;
10537         }
10538
10539       switch (TREE_CODE (declarator))
10540         {
10541         case TREE_LIST:
10542           {
10543             /* We encode a declarator with embedded attributes using
10544                a TREE_LIST.  The attributes apply to the declarator
10545                directly inside them, so we have to skip an iteration
10546                before applying them to the type.  If the declarator just
10547                inside is the declarator-id, we apply the attrs to the
10548                decl itself.  */
10549             inner_attrs = TREE_PURPOSE (declarator);
10550             ignore_attrs = 1;
10551             declarator = TREE_VALUE (declarator);
10552           }
10553           break;
10554
10555         case ARRAY_REF:
10556           {
10557             register tree size;
10558
10559             size = TREE_OPERAND (declarator, 1);
10560
10561             /* VC++ spells a zero-sized array with [].  */
10562             if (size == NULL_TREE && decl_context == FIELD && ! staticp
10563                 && ! RIDBIT_SETP (RID_TYPEDEF, specbits))
10564               size = integer_zero_node;
10565
10566             declarator = TREE_OPERAND (declarator, 0);
10567
10568             type = create_array_type_for_decl (dname, type, size);
10569
10570             /* VLAs never work as fields. */
10571             if (decl_context == FIELD && !processing_template_decl
10572                 && TREE_CODE (type) == ARRAY_TYPE
10573                 && TYPE_DOMAIN (type) != NULL_TREE
10574                 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))
10575               {
10576                 cp_error ("size of member `%D' is not constant", dname);
10577                 /* Proceed with arbitrary constant size, so that offset
10578                    computations don't get confused. */
10579                 type = create_array_type_for_decl (dname, TREE_TYPE (type),
10580                                                    integer_one_node);
10581               }
10582
10583             ctype = NULL_TREE;
10584           }
10585           break;
10586
10587         case CALL_EXPR:
10588           {
10589             tree arg_types;
10590             int funcdecl_p;
10591             tree inner_parms = CALL_DECLARATOR_PARMS (declarator);
10592             tree inner_decl = TREE_OPERAND (declarator, 0);
10593
10594             /* Declaring a function type.
10595                Make sure we have a valid type for the function to return.  */
10596
10597             /* We now know that the TYPE_QUALS don't apply to the
10598                decl, but to its return type.  */
10599             type_quals = TYPE_UNQUALIFIED;
10600
10601             /* Warn about some types functions can't return.  */
10602
10603             if (TREE_CODE (type) == FUNCTION_TYPE)
10604               {
10605                 error ("`%s' declared as function returning a function", name);
10606                 type = integer_type_node;
10607               }
10608             if (TREE_CODE (type) == ARRAY_TYPE)
10609               {
10610                 error ("`%s' declared as function returning an array", name);
10611                 type = integer_type_node;
10612               }
10613
10614             if (inner_decl && TREE_CODE (inner_decl) == SCOPE_REF)
10615               inner_decl = TREE_OPERAND (inner_decl, 1);
10616
10617             if (inner_decl && TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR)
10618               inner_decl = dname;
10619
10620             /* Pick up type qualifiers which should be applied to `this'.  */
10621             quals = CALL_DECLARATOR_QUALS (declarator);
10622
10623             /* Pick up the exception specifications.  */
10624             raises = CALL_DECLARATOR_EXCEPTION_SPEC (declarator);
10625
10626             /* Say it's a definition only for the CALL_EXPR
10627                closest to the identifier.  */
10628             funcdecl_p
10629               = inner_decl
10630               && (TREE_CODE (inner_decl) == IDENTIFIER_NODE
10631                   || TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR
10632                   || TREE_CODE (inner_decl) == BIT_NOT_EXPR);
10633
10634             if (ctype == NULL_TREE
10635                 && decl_context == FIELD
10636                 && funcdecl_p
10637                 && (friendp == 0 || dname == current_class_name))
10638               ctype = current_class_type;
10639
10640             if (ctype && sfk == sfk_conversion)
10641               TYPE_HAS_CONVERSION (ctype) = 1;
10642             if (ctype && constructor_name (ctype) == dname)
10643               {
10644                 /* We are within a class's scope. If our declarator name
10645                    is the same as the class name, and we are defining
10646                    a function, then it is a constructor/destructor, and
10647                    therefore returns a void type.  */
10648
10649                 if (flags == DTOR_FLAG)
10650                   {
10651                     /* ISO C++ 12.4/2.  A destructor may not be
10652                        declared const or volatile.  A destructor may
10653                        not be static.  */
10654                     if (staticp == 2)
10655                       error ("destructor cannot be static member function");
10656                     if (quals)
10657                       {
10658                         cp_error ("destructors may not be `%s'",
10659                                   IDENTIFIER_POINTER (TREE_VALUE (quals)));
10660                         quals = NULL_TREE;
10661                       }
10662                     if (decl_context == FIELD)
10663                       {
10664                         if (! member_function_or_else (ctype,
10665                                                        current_class_type,
10666                                                        flags))
10667                           return void_type_node;
10668                       }
10669                   }
10670                 else            /* It's a constructor.  */
10671                   {
10672                     if (explicitp == 1)
10673                       explicitp = 2;
10674                     /* ISO C++ 12.1.  A constructor may not be
10675                        declared const or volatile.  A constructor may
10676                        not be virtual.  A constructor may not be
10677                        static.  */
10678                     if (staticp == 2)
10679                       error ("constructor cannot be static member function");
10680                     if (virtualp)
10681                       {
10682                         pedwarn ("constructors cannot be declared virtual");
10683                         virtualp = 0;
10684                       }
10685                     if (quals)
10686                       {
10687                         cp_error ("constructors may not be `%s'",
10688                                   IDENTIFIER_POINTER (TREE_VALUE (quals)));
10689                         quals = NULL_TREE;
10690                       }
10691                     {
10692                       RID_BIT_TYPE tmp_bits;
10693                       bcopy ((void*)&specbits, (void*)&tmp_bits, sizeof (RID_BIT_TYPE));
10694                       RIDBIT_RESET (RID_INLINE, tmp_bits);
10695                       RIDBIT_RESET (RID_STATIC, tmp_bits);
10696                       if (RIDBIT_ANY_SET (tmp_bits))
10697                         error ("return value type specifier for constructor ignored");
10698                     }
10699                     if (decl_context == FIELD)
10700                       {
10701                         if (! member_function_or_else (ctype,
10702                                                        current_class_type,
10703                                                        flags))
10704                           return void_type_node;
10705                         TYPE_HAS_CONSTRUCTOR (ctype) = 1;
10706                         if (sfk != sfk_constructor)
10707                           return NULL_TREE;
10708                       }
10709                   }
10710                 if (decl_context == FIELD)
10711                   staticp = 0;
10712               }
10713             else if (friendp)
10714               {
10715                 if (initialized)
10716                   error ("can't initialize friend function `%s'", name);
10717                 if (virtualp)
10718                   {
10719                     /* Cannot be both friend and virtual.  */
10720                     error ("virtual functions cannot be friends");
10721                     RIDBIT_RESET (RID_FRIEND, specbits);
10722                     friendp = 0;
10723                   }
10724                 if (decl_context == NORMAL)
10725                   error ("friend declaration not in class definition");
10726                 if (current_function_decl && funcdef_flag)
10727                   cp_error ("can't define friend function `%s' in a local class definition",
10728                             name);
10729               }
10730
10731             /* Construct the function type and go to the next
10732                inner layer of declarator.  */
10733
10734             declarator = TREE_OPERAND (declarator, 0);
10735
10736             /* FIXME: This is where default args should be fully
10737                processed.  */
10738
10739             arg_types = grokparms (inner_parms, funcdecl_p ? funcdef_flag : 0);
10740
10741             if (declarator && flags == DTOR_FLAG)
10742               {
10743                 /* A destructor declared in the body of a class will
10744                    be represented as a BIT_NOT_EXPR.  But, we just
10745                    want the underlying IDENTIFIER.  */
10746                 if (TREE_CODE (declarator) == BIT_NOT_EXPR)
10747                   declarator = TREE_OPERAND (declarator, 0);
10748
10749                 if (strict_prototype == 0 && arg_types == NULL_TREE)
10750                   arg_types = void_list_node;
10751                 else if (arg_types == NULL_TREE
10752                          || arg_types != void_list_node)
10753                   {
10754                     cp_error ("destructors may not have parameters");
10755                     arg_types = void_list_node;
10756                     last_function_parms = NULL_TREE;
10757                   }
10758               }
10759
10760             /* ANSI says that `const int foo ();'
10761                does not make the function foo const.  */
10762             type = build_function_type (type, arg_types);
10763
10764             {
10765               tree t;
10766               for (t = arg_types; t; t = TREE_CHAIN (t))
10767                 if (TREE_PURPOSE (t)
10768                     && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
10769                   {
10770                     add_defarg_fn (type);
10771                     break;
10772                   }
10773             }
10774           }
10775           break;
10776
10777         case ADDR_EXPR:
10778         case INDIRECT_REF:
10779           /* Filter out pointers-to-references and references-to-references.
10780              We can get these if a TYPE_DECL is used.  */
10781
10782           if (TREE_CODE (type) == REFERENCE_TYPE)
10783             {
10784               error ("cannot declare %s to references",
10785                      TREE_CODE (declarator) == ADDR_EXPR
10786                      ? "references" : "pointers");
10787               declarator = TREE_OPERAND (declarator, 0);
10788               continue;
10789             }
10790
10791           if (TREE_CODE (type) == OFFSET_TYPE
10792               && (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE
10793                   || TREE_CODE (TREE_TYPE (type)) == REFERENCE_TYPE))
10794             {
10795               cp_error ("cannot declare pointer to `%#T' member",
10796                         TREE_TYPE (type));
10797               type = TREE_TYPE (type);
10798             }
10799
10800           /* Merge any constancy or volatility into the target type
10801              for the pointer.  */
10802
10803           /* We now know that the TYPE_QUALS don't apply to the decl,
10804              but to the target of the pointer.  */
10805           type_quals = TYPE_UNQUALIFIED;
10806
10807           if (TREE_CODE (declarator) == ADDR_EXPR)
10808             {
10809               if (TREE_CODE (type) == VOID_TYPE)
10810                 error ("invalid type: `void &'");
10811               else
10812                 type = build_reference_type (type);
10813             }
10814           else if (TREE_CODE (type) == METHOD_TYPE)
10815             type = build_ptrmemfunc_type (build_pointer_type (type));
10816           else
10817             type = build_pointer_type (type);
10818
10819           /* Process a list of type modifier keywords (such as
10820              const or volatile) that were given inside the `*' or `&'.  */
10821
10822           if (TREE_TYPE (declarator))
10823             {
10824               register tree typemodlist;
10825               int erred = 0;
10826
10827               constp = 0;
10828               volatilep = 0;
10829               restrictp = 0;
10830               for (typemodlist = TREE_TYPE (declarator); typemodlist;
10831                    typemodlist = TREE_CHAIN (typemodlist))
10832                 {
10833                   tree qualifier = TREE_VALUE (typemodlist);
10834
10835                   if (qualifier == ridpointers[(int) RID_CONST])
10836                     constp++;
10837                   else if (qualifier == ridpointers[(int) RID_VOLATILE])
10838                     volatilep++;
10839                   else if (qualifier == ridpointers[(int) RID_RESTRICT])
10840                     restrictp++;
10841                   else if (!erred)
10842                     {
10843                       erred = 1;
10844                       error ("invalid type modifier within pointer declarator");
10845                     }
10846                 }
10847               if (constp > 1)
10848                 pedwarn ("duplicate `const'");
10849               if (volatilep > 1)
10850                 pedwarn ("duplicate `volatile'");
10851               if (restrictp > 1)
10852                 pedwarn ("duplicate `restrict'");
10853
10854               type_quals = ((constp ? TYPE_QUAL_CONST : 0)
10855                             | (restrictp ? TYPE_QUAL_RESTRICT : 0)
10856                             | (volatilep ? TYPE_QUAL_VOLATILE : 0));
10857               if (TREE_CODE (declarator) == ADDR_EXPR
10858                   && (constp || volatilep))
10859                 {
10860                   if (constp)
10861                     pedwarn ("discarding `const' applied to a reference");
10862                   if (volatilep)
10863                     pedwarn ("discarding `volatile' applied to a reference");
10864                   type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
10865                 }
10866               type = cp_build_qualified_type (type, type_quals);
10867             }
10868           declarator = TREE_OPERAND (declarator, 0);
10869           ctype = NULL_TREE;
10870           break;
10871
10872         case SCOPE_REF:
10873           {
10874             /* We have converted type names to NULL_TREE if the
10875                name was bogus, or to a _TYPE node, if not.
10876
10877                The variable CTYPE holds the type we will ultimately
10878                resolve to.  The code here just needs to build
10879                up appropriate member types.  */
10880             tree sname = TREE_OPERAND (declarator, 1);
10881             tree t;
10882
10883             /* Destructors can have their visibilities changed as well.  */
10884             if (TREE_CODE (sname) == BIT_NOT_EXPR)
10885               sname = TREE_OPERAND (sname, 0);
10886
10887             if (TREE_COMPLEXITY (declarator) == 0)
10888               /* This needs to be here, in case we are called
10889                  multiple times.  */ ;
10890             else if (TREE_COMPLEXITY (declarator) == -1)
10891               /* Namespace member. */
10892               pop_decl_namespace ();
10893             else if (friendp && (TREE_COMPLEXITY (declarator) < 2))
10894               /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10895             else if (! IS_AGGR_TYPE_CODE
10896                      (TREE_CODE (TREE_OPERAND (declarator, 0))))
10897               ;
10898             else if (TREE_COMPLEXITY (declarator) == current_class_depth)
10899               {
10900                 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10901                    that refer to ctype.  They couldn't be resolved earlier
10902                    because we hadn't pushed into the class yet.
10903                    Example: resolve 'B<T>::type' in
10904                    'B<typename B<T>::type> B<T>::f () { }'.  */
10905                 if (current_template_parms
10906                     && uses_template_parms (type)
10907                     && uses_template_parms (current_class_type))
10908                   {
10909                     tree args = current_template_args ();
10910                     type = tsubst (type, args, /*complain=*/1, NULL_TREE);
10911                   }
10912
10913                 /* This pop_nested_class corresponds to the
10914                    push_nested_class used to push into class scope for
10915                    parsing the argument list of a function decl, in
10916                    qualified_id.  */
10917                 pop_nested_class ();
10918                 TREE_COMPLEXITY (declarator) = current_class_depth;
10919               }
10920             else
10921               my_friendly_abort (16);
10922
10923             if (TREE_OPERAND (declarator, 0) == NULL_TREE)
10924               {
10925                 /* We had a reference to a global decl, or
10926                    perhaps we were given a non-aggregate typedef,
10927                    in which case we cleared this out, and should just
10928                    keep going as though it wasn't there.  */
10929                 declarator = sname;
10930                 continue;
10931               }
10932             ctype = TREE_OPERAND (declarator, 0);
10933
10934             t = ctype;
10935             while (t != NULL_TREE && CLASS_TYPE_P (t))
10936               {
10937                 /* You're supposed to have one `template <...>'
10938                    for every template class, but you don't need one
10939                    for a full specialization.  For example:
10940
10941                      template <class T> struct S{};
10942                      template <> struct S<int> { void f(); };
10943                      void S<int>::f () {}
10944
10945                    is correct; there shouldn't be a `template <>' for
10946                    the definition of `S<int>::f'.  */
10947                 if (CLASSTYPE_TEMPLATE_INFO (t)
10948                     && (CLASSTYPE_TEMPLATE_INSTANTIATION (t)
10949                         || uses_template_parms (CLASSTYPE_TI_ARGS (t))))
10950                   template_count += 1;
10951
10952                 t = TYPE_MAIN_DECL (t);
10953                 if (DECL_LANG_SPECIFIC (t))
10954                   t = DECL_CONTEXT (t);
10955                 else
10956                   t = NULL_TREE;
10957               }
10958
10959             if (sname == NULL_TREE)
10960               goto done_scoping;
10961
10962             if (TREE_CODE (sname) == IDENTIFIER_NODE)
10963               {
10964                 /* This is the `standard' use of the scoping operator:
10965                    basetype :: member .  */
10966
10967                 if (ctype == current_class_type)
10968                   {
10969                     /* class A {
10970                          void A::f ();
10971                        };
10972
10973                        Is this ill-formed?  */
10974
10975                     if (pedantic)
10976                       cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10977                                   ctype, name);
10978                   }
10979                 else if (TREE_CODE (type) == FUNCTION_TYPE)
10980                   {
10981                     if (current_class_type == NULL_TREE
10982                         || friendp)
10983                       type = build_cplus_method_type (ctype, TREE_TYPE (type),
10984                                                       TYPE_ARG_TYPES (type));
10985                     else
10986                       {
10987                         cp_error ("cannot declare member function `%T::%s' within `%T'",
10988                                   ctype, name, current_class_type);
10989                         return void_type_node;
10990                       }
10991                   }
10992                 else if (RIDBIT_SETP (RID_TYPEDEF, specbits)
10993                          || COMPLETE_TYPE_P (complete_type (ctype)))
10994                   {
10995                     /* Have to move this code elsewhere in this function.
10996                        this code is used for i.e., typedef int A::M; M *pm;
10997
10998                        It is?  How? jason 10/2/94 */
10999
11000                     if (current_class_type)
11001                       {
11002                         cp_error ("cannot declare member `%T::%s' within `%T'",
11003                                   ctype, name, current_class_type);
11004                         return void_type_node;
11005                       }
11006                     type = build_offset_type (ctype, type);
11007                   }
11008                 else if (uses_template_parms (ctype))
11009                   {
11010                     if (TREE_CODE (type) == FUNCTION_TYPE)
11011                       type
11012                         = build_cplus_method_type (ctype, TREE_TYPE (type),
11013                                                    TYPE_ARG_TYPES (type));
11014                   }
11015                 else
11016                   {
11017                     cp_error ("structure `%T' not yet defined", ctype);
11018                     return error_mark_node;
11019                   }
11020
11021                 declarator = sname;
11022               }
11023             else if (TREE_CODE (sname) == SCOPE_REF)
11024               my_friendly_abort (17);
11025             else
11026               {
11027               done_scoping:
11028                 declarator = TREE_OPERAND (declarator, 1);
11029                 if (declarator && TREE_CODE (declarator) == CALL_EXPR)
11030                   /* In this case, we will deal with it later.  */
11031                   ;
11032                 else
11033                   {
11034                     if (TREE_CODE (type) == FUNCTION_TYPE)
11035                       type = build_cplus_method_type (ctype, TREE_TYPE (type),
11036                                                       TYPE_ARG_TYPES (type));
11037                     else
11038                       type = build_offset_type (ctype, type);
11039                   }
11040               }
11041           }
11042           break;
11043
11044         case BIT_NOT_EXPR:
11045           declarator = TREE_OPERAND (declarator, 0);
11046           break;
11047
11048         case RECORD_TYPE:
11049         case UNION_TYPE:
11050         case ENUMERAL_TYPE:
11051           declarator = NULL_TREE;
11052           break;
11053
11054         case ERROR_MARK:
11055           declarator = NULL_TREE;
11056           break;
11057
11058         default:
11059           my_friendly_abort (158);
11060         }
11061     }
11062
11063   /* See the comment for the TREE_LIST case, above.  */
11064   if (inner_attrs)
11065     {
11066       if (! ignore_attrs)
11067         decl_attributes (type, inner_attrs, NULL_TREE);
11068       else if (attrlist)
11069         TREE_VALUE (attrlist) = chainon (inner_attrs, TREE_VALUE (attrlist));
11070       else
11071         attrlist = build_decl_list (NULL_TREE, inner_attrs);
11072     }
11073
11074   /* Now TYPE has the actual type.  */
11075
11076   if (explicitp == 1 || (explicitp && friendp))
11077     {
11078       /* [dcl.fct.spec] The explicit specifier shall only be used in
11079          declarations of constructors within a class definition.  */
11080       error ("only declarations of constructors can be `explicit'");
11081       explicitp = 0;
11082     }
11083
11084   if (RIDBIT_SETP (RID_MUTABLE, specbits))
11085     {
11086       if (current_class_name == NULL_TREE || decl_context == PARM || friendp)
11087         {
11088           error ("non-member `%s' cannot be declared `mutable'", name);
11089           RIDBIT_RESET (RID_MUTABLE, specbits);
11090         }
11091       else if (decl_context == TYPENAME || RIDBIT_SETP (RID_TYPEDEF, specbits))
11092         {
11093           error ("non-object member `%s' cannot be declared `mutable'", name);
11094           RIDBIT_RESET (RID_MUTABLE, specbits);
11095         }
11096       else if (TREE_CODE (type) == FUNCTION_TYPE
11097                || TREE_CODE (type) == METHOD_TYPE)
11098         {
11099           error ("function `%s' cannot be declared `mutable'", name);
11100           RIDBIT_RESET (RID_MUTABLE, specbits);
11101         }
11102       else if (staticp)
11103         {
11104           error ("static `%s' cannot be declared `mutable'", name);
11105           RIDBIT_RESET (RID_MUTABLE, specbits);
11106         }
11107       else if (type_quals & TYPE_QUAL_CONST)
11108         {
11109           error ("const `%s' cannot be declared `mutable'", name);
11110           RIDBIT_RESET (RID_MUTABLE, specbits);
11111         }
11112     }
11113
11114   if (declarator == NULL_TREE
11115       || TREE_CODE (declarator) == IDENTIFIER_NODE
11116       || (TREE_CODE (declarator) == TEMPLATE_ID_EXPR
11117           && (TREE_CODE (type) == FUNCTION_TYPE
11118               || TREE_CODE (type) == METHOD_TYPE)))
11119     /* OK */;
11120   else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
11121     {
11122       cp_error ("template-id `%D' used as a declarator", declarator);
11123       declarator = dname;
11124     }
11125   else
11126     /* Unexpected declarator format.  */
11127     my_friendly_abort (990210);
11128
11129   /* If this is declaring a typedef name, return a TYPE_DECL.  */
11130
11131   if (RIDBIT_SETP (RID_TYPEDEF, specbits) && decl_context != TYPENAME)
11132     {
11133       tree decl;
11134
11135       /* Note that the grammar rejects storage classes
11136          in typenames, fields or parameters.  */
11137       if (current_lang_name == lang_name_java)
11138         TYPE_FOR_JAVA (type) = 1;
11139
11140       if (decl_context == FIELD)
11141         {
11142           if (declarator == constructor_name (current_class_type))
11143             cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
11144                         declarator);
11145           decl = build_lang_decl (TYPE_DECL, declarator, type);
11146         }
11147       else
11148         decl = build_decl (TYPE_DECL, declarator, type);
11149
11150       /* If the user declares "typedef struct {...} foo" then the
11151          struct will have an anonymous name.  Fill that name in now.
11152          Nothing can refer to it, so nothing needs know about the name
11153          change.  */
11154       if (type != error_mark_node
11155           && declarator
11156           && TYPE_NAME (type)
11157           && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
11158           && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type))
11159           && CP_TYPE_QUALS (type) == TYPE_UNQUALIFIED)
11160         {
11161           tree oldname = TYPE_NAME (type);
11162           tree t;
11163
11164           /* Replace the anonymous name with the real name everywhere.  */
11165           lookup_tag_reverse (type, declarator);
11166           for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
11167             if (TYPE_NAME (t) == oldname)
11168               TYPE_NAME (t) = decl;
11169
11170           if (TYPE_LANG_SPECIFIC (type))
11171             TYPE_WAS_ANONYMOUS (type) = 1;
11172
11173           /* If this is a typedef within a template class, the nested
11174              type is a (non-primary) template.  The name for the
11175              template needs updating as well.  */
11176           if (TYPE_LANG_SPECIFIC (type) && CLASSTYPE_TEMPLATE_INFO (type))
11177             DECL_NAME (CLASSTYPE_TI_TEMPLATE (type))
11178               = TYPE_IDENTIFIER (type);
11179
11180           if (flag_new_abi)
11181             DECL_ASSEMBLER_NAME (decl) = mangle_type (type);
11182           else
11183             {
11184               /* XXX Temporarily set the scope.
11185                  When returning, start_decl expects it as NULL_TREE,
11186                  and will then then set it using pushdecl. */
11187               my_friendly_assert (DECL_CONTEXT (decl) == NULL_TREE, 980404);
11188               if (current_class_type)
11189                 DECL_CONTEXT (decl) = current_class_type;
11190               else
11191                 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
11192
11193               DECL_ASSEMBLER_NAME (decl) = DECL_NAME (decl);
11194               DECL_ASSEMBLER_NAME (decl)
11195                 = get_identifier (build_overload_name (type, 1, 1));
11196               DECL_CONTEXT (decl) = NULL_TREE;
11197             }
11198
11199           /* FIXME remangle member functions; member functions of a
11200              type with external linkage have external linkage.  */
11201         }
11202
11203       if (TREE_CODE (type) == OFFSET_TYPE || TREE_CODE (type) == METHOD_TYPE)
11204         {
11205           cp_error_at ("typedef name may not be class-qualified", decl);
11206           return NULL_TREE;
11207         }
11208       else if (quals)
11209         {
11210           if (ctype == NULL_TREE)
11211             {
11212               if (TREE_CODE (type) != METHOD_TYPE)
11213                 cp_error_at ("invalid type qualifier for non-member function type", decl);
11214               else
11215                 ctype = TYPE_METHOD_BASETYPE (type);
11216             }
11217           if (ctype != NULL_TREE)
11218             grok_method_quals (ctype, decl, quals);
11219         }
11220
11221       if (RIDBIT_SETP (RID_SIGNED, specbits)
11222           || (typedef_decl && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl)))
11223         C_TYPEDEF_EXPLICITLY_SIGNED (decl) = 1;
11224
11225       bad_specifiers (decl, "type", virtualp, quals != NULL_TREE,
11226                       inlinep, friendp, raises != NULL_TREE);
11227
11228       if (initialized)
11229         error ("typedef declaration includes an initializer");
11230
11231       return decl;
11232     }
11233
11234   /* Detect the case of an array type of unspecified size
11235      which came, as such, direct from a typedef name.
11236      We must copy the type, so that each identifier gets
11237      a distinct type, so that each identifier's size can be
11238      controlled separately by its own initializer.  */
11239
11240   if (type == typedef_type && TREE_CODE (type) == ARRAY_TYPE
11241       && TYPE_DOMAIN (type) == NULL_TREE)
11242     {
11243       type = build_cplus_array_type (TREE_TYPE (type), TYPE_DOMAIN (type));
11244     }
11245
11246   /* If this is a type name (such as, in a cast or sizeof),
11247      compute the type and return it now.  */
11248
11249   if (decl_context == TYPENAME)
11250     {
11251       /* Note that the grammar rejects storage classes
11252          in typenames, fields or parameters.  */
11253       if (type_quals != TYPE_UNQUALIFIED)
11254         type_quals = TYPE_UNQUALIFIED;
11255
11256       /* Special case: "friend class foo" looks like a TYPENAME context.  */
11257       if (friendp)
11258         {
11259           if (type_quals != TYPE_UNQUALIFIED)
11260             {
11261               cp_error ("type qualifiers specified for friend class declaration");
11262               type_quals = TYPE_UNQUALIFIED;
11263             }
11264           if (inlinep)
11265             {
11266               cp_error ("`inline' specified for friend class declaration");
11267               inlinep = 0;
11268             }
11269
11270           /* Only try to do this stuff if we didn't already give up.  */
11271           if (type != integer_type_node)
11272             {
11273               /* A friendly class?  */
11274               if (current_class_type)
11275                 make_friend_class (current_class_type, TYPE_MAIN_VARIANT (type));
11276               else
11277                 error ("trying to make class `%s' a friend of global scope",
11278                        TYPE_NAME_STRING (type));
11279               type = void_type_node;
11280             }
11281         }
11282       else if (quals)
11283         {
11284           if (ctype == NULL_TREE)
11285             {
11286               if (TREE_CODE (type) != METHOD_TYPE)
11287                 cp_error ("invalid qualifiers on non-member function type");
11288               else
11289                 ctype = TYPE_METHOD_BASETYPE (type);
11290             }
11291           if (ctype)
11292             {
11293               tree dummy = build_decl (TYPE_DECL, declarator, type);
11294               grok_method_quals (ctype, dummy, quals);
11295               type = TREE_TYPE (dummy);
11296             }
11297         }
11298
11299       return type;
11300     }
11301   else if (declarator == NULL_TREE && decl_context != PARM
11302            && decl_context != CATCHPARM
11303            && TREE_CODE (type) != UNION_TYPE
11304            && ! bitfield)
11305     {
11306       cp_error ("abstract declarator `%T' used as declaration", type);
11307       declarator = make_anon_name ();
11308     }
11309
11310   /* `void' at top level (not within pointer)
11311      is allowed only in typedefs or type names.
11312      We don't complain about parms either, but that is because
11313      a better error message can be made later.  */
11314
11315   if (TREE_CODE (type) == VOID_TYPE && decl_context != PARM)
11316     {
11317       if (! declarator)
11318         error ("unnamed variable or field declared void");
11319       else if (TREE_CODE (declarator) == IDENTIFIER_NODE)
11320         {
11321           if (IDENTIFIER_OPNAME_P (declarator))
11322             my_friendly_abort (356);
11323           else
11324             error ("variable or field `%s' declared void", name);
11325         }
11326       else
11327         error ("variable or field declared void");
11328       type = integer_type_node;
11329     }
11330
11331   /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11332      or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE.  */
11333
11334   if (decl_context == PARM || decl_context == CATCHPARM)
11335     {
11336       if (ctype || in_namespace)
11337         error ("cannot use `::' in parameter declaration");
11338
11339       /* A parameter declared as an array of T is really a pointer to T.
11340          One declared as a function is really a pointer to a function.
11341          One declared as a member is really a pointer to member.  */
11342
11343       if (TREE_CODE (type) == ARRAY_TYPE)
11344         {
11345           /* Transfer const-ness of array into that of type pointed to.  */
11346           type = build_pointer_type (TREE_TYPE (type));
11347           type_quals = TYPE_UNQUALIFIED;
11348         }
11349       else if (TREE_CODE (type) == FUNCTION_TYPE)
11350         type = build_pointer_type (type);
11351       else if (TREE_CODE (type) == OFFSET_TYPE)
11352         type = build_pointer_type (type);
11353       else if (TREE_CODE (type) == VOID_TYPE && declarator)
11354         {
11355           error ("declaration of `%s' as void", name);
11356           return NULL_TREE;
11357         }
11358     }
11359
11360   {
11361     register tree decl;
11362
11363     if (decl_context == PARM)
11364       {
11365         decl = build_decl (PARM_DECL, declarator, type);
11366
11367         bad_specifiers (decl, "parameter", virtualp, quals != NULL_TREE,
11368                         inlinep, friendp, raises != NULL_TREE);
11369
11370         /* Compute the type actually passed in the parmlist,
11371            for the case where there is no prototype.
11372            (For example, shorts and chars are passed as ints.)
11373            When there is a prototype, this is overridden later.  */
11374
11375         DECL_ARG_TYPE (decl) = type_promotes_to (type);
11376       }
11377     else if (decl_context == FIELD)
11378       {
11379         if (type == error_mark_node)
11380           {
11381             /* Happens when declaring arrays of sizes which
11382                are error_mark_node, for example.  */
11383             decl = NULL_TREE;
11384           }
11385         else if (in_namespace && !friendp)
11386           {
11387             /* Something like struct S { int N::j; };  */
11388             cp_error ("invalid use of `::'");
11389             decl = NULL_TREE;
11390           }
11391         else if (TREE_CODE (type) == FUNCTION_TYPE)
11392           {
11393             int publicp = 0;
11394             tree function_context;
11395
11396             /* We catch the others as conflicts with the builtin
11397                typedefs.  */
11398             if (friendp && declarator == ridpointers[(int) RID_SIGNED])
11399               {
11400                 cp_error ("function `%D' cannot be declared friend",
11401                           declarator);
11402                 friendp = 0;
11403               }
11404
11405             if (friendp == 0)
11406               {
11407                 if (ctype == NULL_TREE)
11408                   ctype = current_class_type;
11409
11410                 if (ctype == NULL_TREE)
11411                   {
11412                     cp_error ("can't make `%D' into a method -- not in a class",
11413                               declarator);
11414                     return void_type_node;
11415                   }
11416
11417                 /* ``A union may [ ... ] not [ have ] virtual functions.''
11418                    ARM 9.5 */
11419                 if (virtualp && TREE_CODE (ctype) == UNION_TYPE)
11420                   {
11421                     cp_error ("function `%D' declared virtual inside a union",
11422                               declarator);
11423                     return void_type_node;
11424                   }
11425
11426                 if (declarator == ansi_opname (NEW_EXPR)
11427                     || declarator == ansi_opname (VEC_NEW_EXPR)
11428                     || declarator == ansi_opname (DELETE_EXPR)
11429                     || declarator == ansi_opname (VEC_DELETE_EXPR))
11430                   {
11431                     if (virtualp)
11432                       {
11433                         cp_error ("`%D' cannot be declared virtual, since it is always static",
11434                                   declarator);
11435                         virtualp = 0;
11436                       }
11437                   }
11438                 else if (staticp < 2)
11439                   type = build_cplus_method_type (ctype, TREE_TYPE (type),
11440                                                   TYPE_ARG_TYPES (type));
11441               }
11442
11443             /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node.  */
11444             function_context = (ctype != NULL_TREE) ?
11445               decl_function_context (TYPE_MAIN_DECL (ctype)) : NULL_TREE;
11446             publicp = (! friendp || ! staticp)
11447               && function_context == NULL_TREE;
11448             decl = grokfndecl (ctype, type,
11449                                TREE_CODE (declarator) != TEMPLATE_ID_EXPR
11450                                ? declarator : dname,
11451                                declarator,
11452                                virtualp, flags, quals, raises,
11453                                friendp ? -1 : 0, friendp, publicp, inlinep,
11454                                funcdef_flag, template_count, in_namespace);
11455             if (decl == NULL_TREE)
11456               return decl;
11457 #if 0
11458             /* This clobbers the attrs stored in `decl' from `attrlist'.  */
11459             /* The decl and setting of decl_machine_attr is also turned off.  */
11460             decl = build_decl_attribute_variant (decl, decl_machine_attr);
11461 #endif
11462
11463             /* [class.conv.ctor]
11464
11465                A constructor declared without the function-specifier
11466                explicit that can be called with a single parameter
11467                specifies a conversion from the type of its first
11468                parameter to the type of its class.  Such a constructor
11469                is called a converting constructor.  */
11470             if (explicitp == 2)
11471               DECL_NONCONVERTING_P (decl) = 1;
11472             else if (DECL_CONSTRUCTOR_P (decl))
11473               {
11474                 /* The constructor can be called with exactly one
11475                    parameter if there is at least one parameter, and
11476                    any subsequent parameters have default arguments.
11477                    We don't look at the first parameter, which is
11478                    really just the `this' parameter for the new
11479                    object.  */
11480                 tree arg_types =
11481                   TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl)));
11482
11483                 /* Skip the `in_chrg' argument too, if present.  */
11484                 if (DECL_HAS_IN_CHARGE_PARM_P (decl))
11485                   arg_types = TREE_CHAIN (arg_types);
11486
11487                 if (arg_types == void_list_node
11488                     || (arg_types
11489                         && TREE_CHAIN (arg_types)
11490                         && TREE_CHAIN (arg_types) != void_list_node
11491                         && !TREE_PURPOSE (TREE_CHAIN (arg_types))))
11492                   DECL_NONCONVERTING_P (decl) = 1;
11493               }
11494           }
11495         else if (TREE_CODE (type) == METHOD_TYPE)
11496           {
11497             /* We only get here for friend declarations of
11498                members of other classes.  */
11499             /* All method decls are public, so tell grokfndecl to set
11500                TREE_PUBLIC, also.  */
11501             decl = grokfndecl (ctype, type, declarator, declarator,
11502                                virtualp, flags, quals, raises,
11503                                friendp ? -1 : 0, friendp, 1, 0, funcdef_flag,
11504                                template_count, in_namespace);
11505             if (decl == NULL_TREE)
11506               return NULL_TREE;
11507           }
11508         else if (!staticp && ! processing_template_decl
11509                  && !COMPLETE_TYPE_P (complete_type (type))
11510                  && (TREE_CODE (type) != ARRAY_TYPE || initialized == 0))
11511           {
11512             if (declarator)
11513               cp_error ("field `%D' has incomplete type", declarator);
11514             else
11515               cp_error ("name `%T' has incomplete type", type);
11516
11517             /* If we're instantiating a template, tell them which
11518                instantiation made the field's type be incomplete.  */
11519             if (current_class_type
11520                 && TYPE_NAME (current_class_type)
11521                 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type))
11522                 && declspecs && TREE_VALUE (declspecs)
11523                 && TREE_TYPE (TREE_VALUE (declspecs)) == type)
11524               cp_error ("  in instantiation of template `%T'",
11525                         current_class_type);
11526
11527             type = error_mark_node;
11528             decl = NULL_TREE;
11529           }
11530         else
11531           {
11532             if (friendp)
11533               {
11534                 error ("`%s' is neither function nor member function; cannot be declared friend",
11535                        IDENTIFIER_POINTER (declarator));
11536                 friendp = 0;
11537               }
11538             decl = NULL_TREE;
11539           }
11540
11541         if (friendp)
11542           {
11543             /* Friends are treated specially.  */
11544             if (ctype == current_class_type)
11545               warning ("member functions are implicitly friends of their class");
11546             else
11547               {
11548                 tree t = NULL_TREE;
11549                 if (decl && DECL_NAME (decl))
11550                   {
11551                     if (template_class_depth (current_class_type) == 0)
11552                       {
11553                         decl
11554                           = check_explicit_specialization
11555                           (declarator, decl,
11556                            template_count, 2 * (funcdef_flag != 0) + 4);
11557                         if (decl == error_mark_node)
11558                           return error_mark_node;
11559                       }
11560
11561                     t = do_friend (ctype, declarator, decl,
11562                                    last_function_parms, attrlist, flags, quals,
11563                                    funcdef_flag);
11564                   }
11565                 if (t && funcdef_flag)
11566                   return t;
11567
11568                 return void_type_node;
11569               }
11570           }
11571
11572         /* Structure field.  It may not be a function, except for C++ */
11573
11574         if (decl == NULL_TREE)
11575           {
11576             if (initialized)
11577               {
11578                 if (!staticp)
11579                   {
11580                     /* An attempt is being made to initialize a non-static
11581                        member.  But, from [class.mem]:
11582
11583                        4 A member-declarator can contain a
11584                        constant-initializer only if it declares a static
11585                        member (_class.static_) of integral or enumeration
11586                        type, see _class.static.data_.
11587
11588                        This used to be relatively common practice, but
11589                        the rest of the compiler does not correctly
11590                        handle the initialization unless the member is
11591                        static so we make it static below.  */
11592                     cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11593                                 declarator);
11594                     cp_pedwarn ("making `%D' static", declarator);
11595                     staticp = 1;
11596                   }
11597
11598                 if (uses_template_parms (type))
11599                   /* We'll check at instantiation time.  */
11600                   ;
11601                 else if (check_static_variable_definition (declarator,
11602                                                            type))
11603                   /* If we just return the declaration, crashes
11604                      will sometimes occur.  We therefore return
11605                      void_type_node, as if this was a friend
11606                      declaration, to cause callers to completely
11607                      ignore this declaration.  */
11608                   return void_type_node;
11609               }
11610
11611             /* 9.2p13 [class.mem] */
11612             if (declarator == constructor_name (current_class_type)
11613                 /* The standard does not allow non-static data members
11614                    here either, but we agreed at the 10/99 meeting
11615                    to change that in TC 1 so that they are allowed in
11616                    classes with no user-defined constructors.  */
11617                 && staticp)
11618               cp_pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11619                           declarator);
11620
11621             if (staticp)
11622               {
11623                 /* C++ allows static class members.  All other work
11624                    for this is done by grokfield.  */
11625                 decl = build_lang_decl (VAR_DECL, declarator, type);
11626                 TREE_STATIC (decl) = 1;
11627                 /* In class context, 'static' means public access.  */
11628                 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl) = 1;
11629               }
11630             else
11631               {
11632                 decl = build_decl (FIELD_DECL, declarator, type);
11633                 DECL_NONADDRESSABLE_P (decl) = bitfield;
11634                 if (RIDBIT_SETP (RID_MUTABLE, specbits))
11635                   {
11636                     DECL_MUTABLE_P (decl) = 1;
11637                     RIDBIT_RESET (RID_MUTABLE, specbits);
11638                   }
11639               }
11640
11641             bad_specifiers (decl, "field", virtualp, quals != NULL_TREE,
11642                             inlinep, friendp, raises != NULL_TREE);
11643           }
11644       }
11645     else if (TREE_CODE (type) == FUNCTION_TYPE || TREE_CODE (type) == METHOD_TYPE)
11646       {
11647         tree original_name;
11648         int publicp = 0;
11649
11650         if (! declarator)
11651           return NULL_TREE;
11652
11653         if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
11654           original_name = dname;
11655         else
11656           original_name = declarator;
11657
11658         if (RIDBIT_SETP (RID_AUTO, specbits))
11659           error ("storage class `auto' invalid for function `%s'", name);
11660         else if (RIDBIT_SETP (RID_REGISTER, specbits))
11661           error ("storage class `register' invalid for function `%s'", name);
11662
11663         /* Function declaration not at top level.
11664            Storage classes other than `extern' are not allowed
11665            and `extern' makes no difference.  */
11666         if (! toplevel_bindings_p ()
11667             && (RIDBIT_SETP (RID_STATIC, specbits)
11668                 || RIDBIT_SETP (RID_INLINE, specbits))
11669             && pedantic)
11670           {
11671             if (RIDBIT_SETP (RID_STATIC, specbits))
11672               pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name);
11673             else
11674               pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name);
11675           }
11676
11677         if (ctype == NULL_TREE)
11678           {
11679             if (virtualp)
11680               {
11681                 error ("virtual non-class function `%s'", name);
11682                 virtualp = 0;
11683               }
11684           }
11685         else if (TREE_CODE (type) == FUNCTION_TYPE && staticp < 2)
11686           type = build_cplus_method_type (ctype, TREE_TYPE (type),
11687                                           TYPE_ARG_TYPES (type));
11688
11689         /* Record presence of `static'.  */
11690         publicp = (ctype != NULL_TREE
11691                    || RIDBIT_SETP (RID_EXTERN, specbits)
11692                    || !RIDBIT_SETP (RID_STATIC, specbits));
11693
11694         decl = grokfndecl (ctype, type, original_name, declarator,
11695                            virtualp, flags, quals, raises,
11696                            1, friendp,
11697                            publicp, inlinep, funcdef_flag,
11698                            template_count, in_namespace);
11699         if (decl == NULL_TREE)
11700           return NULL_TREE;
11701
11702         if (staticp == 1)
11703           {
11704             int illegal_static = 0;
11705
11706             /* Don't allow a static member function in a class, and forbid
11707                declaring main to be static.  */
11708             if (TREE_CODE (type) == METHOD_TYPE)
11709               {
11710                 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl);
11711                 illegal_static = 1;
11712               }
11713             else if (current_function_decl)
11714               {
11715                 /* FIXME need arm citation */
11716                 error ("cannot declare static function inside another function");
11717                 illegal_static = 1;
11718               }
11719
11720             if (illegal_static)
11721               {
11722                 staticp = 0;
11723                 RIDBIT_RESET (RID_STATIC, specbits);
11724               }
11725           }
11726       }
11727     else
11728       {
11729         /* It's a variable.  */
11730
11731         /* An uninitialized decl with `extern' is a reference.  */
11732         decl = grokvardecl (type, declarator, &specbits,
11733                             initialized,
11734                             (type_quals & TYPE_QUAL_CONST) != 0,
11735                             in_namespace);
11736         bad_specifiers (decl, "variable", virtualp, quals != NULL_TREE,
11737                         inlinep, friendp, raises != NULL_TREE);
11738
11739         if (ctype)
11740           {
11741             DECL_CONTEXT (decl) = ctype;
11742             if (staticp == 1)
11743               {
11744                 cp_pedwarn ("static member `%D' re-declared as static", decl);
11745                 staticp = 0;
11746                 RIDBIT_RESET (RID_STATIC, specbits);
11747               }
11748             if (RIDBIT_SETP (RID_REGISTER, specbits) && TREE_STATIC (decl))
11749               {
11750                 cp_error ("static member `%D' declared `register'", decl);
11751                 RIDBIT_RESET (RID_REGISTER, specbits);
11752               }
11753             if (RIDBIT_SETP (RID_EXTERN, specbits) && pedantic)
11754               {
11755                 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11756                             decl);
11757                 RIDBIT_RESET (RID_EXTERN, specbits);
11758               }
11759           }
11760       }
11761
11762     my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE, specbits), 19990927);
11763
11764     /* Record `register' declaration for warnings on &
11765        and in case doing stupid register allocation.  */
11766
11767     if (RIDBIT_SETP (RID_REGISTER, specbits))
11768       DECL_REGISTER (decl) = 1;
11769
11770     if (RIDBIT_SETP (RID_EXTERN, specbits))
11771       DECL_THIS_EXTERN (decl) = 1;
11772
11773     if (RIDBIT_SETP (RID_STATIC, specbits))
11774       DECL_THIS_STATIC (decl) = 1;
11775
11776     /* Record constancy and volatility.  There's no need to do this
11777        when processing a template; we'll do this for the instantiated
11778        declaration based on the type of DECL.  */
11779     if (!processing_template_decl)
11780       c_apply_type_quals_to_decl (type_quals, decl);
11781
11782     return decl;
11783   }
11784 }
11785 \f
11786 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11787    An empty exprlist is a parmlist.  An exprlist which
11788    contains only identifiers at the global level
11789    is a parmlist.  Otherwise, it is an exprlist.  */
11790
11791 int
11792 parmlist_is_exprlist (exprs)
11793      tree exprs;
11794 {
11795   if (exprs == NULL_TREE || TREE_PARMLIST (exprs))
11796     return 0;
11797
11798   if (toplevel_bindings_p ())
11799     {
11800       /* At the global level, if these are all identifiers,
11801          then it is a parmlist.  */
11802       while (exprs)
11803         {
11804           if (TREE_CODE (TREE_VALUE (exprs)) != IDENTIFIER_NODE)
11805             return 1;
11806           exprs = TREE_CHAIN (exprs);
11807         }
11808       return 0;
11809     }
11810   return 1;
11811 }
11812
11813 /* Subroutine of start_function.  Ensure that each of the parameter
11814    types (as listed in PARMS) is complete, as is required for a
11815    function definition.  */
11816
11817 static void
11818 require_complete_types_for_parms (parms)
11819      tree parms;
11820 {
11821   for (; parms; parms = TREE_CHAIN (parms))
11822     {
11823       tree type = TREE_TYPE (parms);
11824
11825       /* Try to complete the TYPE.  */
11826       type = complete_type (type);
11827
11828       if (type == error_mark_node)
11829         continue;
11830
11831       if (!COMPLETE_TYPE_P (type))
11832         {
11833           if (DECL_NAME (parms))
11834             error ("parameter `%s' has incomplete type",
11835                    IDENTIFIER_POINTER (DECL_NAME (parms)));
11836           else
11837             error ("parameter has incomplete type");
11838           TREE_TYPE (parms) = error_mark_node;
11839         }
11840       else
11841         layout_decl (parms, 0);
11842     }
11843 }
11844
11845 /* Returns non-zero if T is a local variable.  */
11846
11847 int
11848 local_variable_p (t)
11849      tree t;
11850 {
11851   if ((TREE_CODE (t) == VAR_DECL
11852        /* A VAR_DECL with a context that is a _TYPE is a static data
11853           member.  */
11854        && !TYPE_P (CP_DECL_CONTEXT (t))
11855        /* Any other non-local variable must be at namespace scope.  */
11856        && !DECL_NAMESPACE_SCOPE_P (t))
11857       || (TREE_CODE (t) == PARM_DECL))
11858     return 1;
11859
11860   return 0;
11861 }
11862
11863 /* Returns non-zero if T is an automatic local variable or a label.
11864    (These are the declarations that need to be remapped when the code
11865    containing them is duplicated.)  */
11866
11867 int
11868 nonstatic_local_decl_p (t)
11869      tree t;
11870 {
11871   return ((local_variable_p (t) && !TREE_STATIC (t))
11872           || TREE_CODE (t) == LABEL_DECL
11873           || TREE_CODE (t) == RESULT_DECL);
11874 }
11875
11876 /* Like local_variable_p, but suitable for use as a tree-walking
11877    function.  */
11878
11879 static tree
11880 local_variable_p_walkfn (tp, walk_subtrees, data)
11881      tree *tp;
11882      int *walk_subtrees ATTRIBUTE_UNUSED;
11883      void *data ATTRIBUTE_UNUSED;
11884 {
11885   return ((local_variable_p (*tp) && !DECL_ARTIFICIAL (*tp))
11886           ? *tp : NULL_TREE);
11887 }
11888
11889 /* Check that ARG, which is a default-argument expression for a
11890    parameter DECL, is legal.  Returns ARG, or ERROR_MARK_NODE, if
11891    something goes wrong.  DECL may also be a _TYPE node, rather than a
11892    DECL, if there is no DECL available.  */
11893
11894 tree
11895 check_default_argument (decl, arg)
11896      tree decl;
11897      tree arg;
11898 {
11899   tree var;
11900   tree decl_type;
11901
11902   if (TREE_CODE (arg) == DEFAULT_ARG)
11903     /* We get a DEFAULT_ARG when looking at an in-class declaration
11904        with a default argument.  Ignore the argument for now; we'll
11905        deal with it after the class is complete.  */
11906     return arg;
11907
11908   if (processing_template_decl || uses_template_parms (arg))
11909     /* We don't do anything checking until instantiation-time.  Note
11910        that there may be uninstantiated arguments even for an
11911        instantiated function, since default arguments are not
11912        instantiated until they are needed.  */
11913     return arg;
11914
11915   if (TYPE_P (decl))
11916     {
11917       decl_type = decl;
11918       decl = NULL_TREE;
11919     }
11920   else
11921     decl_type = TREE_TYPE (decl);
11922
11923   if (arg == error_mark_node
11924       || decl == error_mark_node
11925       || TREE_TYPE (arg) == error_mark_node
11926       || decl_type == error_mark_node)
11927     /* Something already went wrong.  There's no need to check
11928        further.  */
11929     return error_mark_node;
11930
11931   /* [dcl.fct.default]
11932
11933      A default argument expression is implicitly converted to the
11934      parameter type.  */
11935   if (!TREE_TYPE (arg)
11936       || !can_convert_arg (decl_type, TREE_TYPE (arg), arg))
11937     {
11938       if (decl)
11939         cp_error ("default argument for `%#D' has type `%T'",
11940                   decl, TREE_TYPE (arg));
11941       else
11942         cp_error ("default argument for parameter of type `%T' has type `%T'",
11943                   decl_type, TREE_TYPE (arg));
11944
11945       return error_mark_node;
11946     }
11947
11948   /* [dcl.fct.default]
11949
11950      Local variables shall not be used in default argument
11951      expressions.
11952
11953      The keyword `this' shall not be used in a default argument of a
11954      member function.  */
11955   var = walk_tree (&arg, local_variable_p_walkfn, NULL);
11956   if (var)
11957     {
11958       cp_error ("default argument `%E' uses local variable `%D'",
11959                 arg, var);
11960       return error_mark_node;
11961     }
11962
11963   /* All is well.  */
11964   return arg;
11965 }
11966
11967 /* Decode the list of parameter types for a function type.
11968    Given the list of things declared inside the parens,
11969    return a list of types.
11970
11971    The list we receive can have three kinds of elements:
11972    an IDENTIFIER_NODE for names given without types,
11973    a TREE_LIST node for arguments given as typespecs or names with typespecs,
11974    or void_type_node, to mark the end of an argument list
11975    when additional arguments are not permitted (... was not used).
11976
11977    FUNCDEF_FLAG is nonzero for a function definition, 0 for
11978    a mere declaration.  A nonempty identifier-list gets an error message
11979    when FUNCDEF_FLAG is zero.
11980    If FUNCDEF_FLAG is 1, then parameter types must be complete.
11981    If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11982
11983    If all elements of the input list contain types,
11984    we return a list of the types.
11985    If all elements contain no type (except perhaps a void_type_node
11986    at the end), we return a null list.
11987    If some have types and some do not, it is an error, and we
11988    return a null list.
11989
11990    Also set last_function_parms to either
11991    a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11992    A list of names is converted to a chain of PARM_DECLs
11993    by store_parm_decls so that ultimately it is always a chain of decls.
11994
11995    Note that in C++, parameters can take default values.  These default
11996    values are in the TREE_PURPOSE field of the TREE_LIST.  It is
11997    an error to specify default values which are followed by parameters
11998    that have no default values, or an ELLIPSES.  For simplicities sake,
11999    only parameters which are specified with their types can take on
12000    default values.  */
12001
12002 static tree
12003 grokparms (first_parm, funcdef_flag)
12004      tree first_parm;
12005      int funcdef_flag;
12006 {
12007   tree result = NULL_TREE;
12008   tree decls = NULL_TREE;
12009
12010   if (first_parm != NULL_TREE
12011       && TREE_CODE (TREE_VALUE (first_parm)) == IDENTIFIER_NODE)
12012     {
12013       if (! funcdef_flag)
12014         pedwarn ("parameter names (without types) in function declaration");
12015       last_function_parms = first_parm;
12016       return NULL_TREE;
12017     }
12018   else if (first_parm != NULL_TREE
12019            && TREE_CODE (TREE_VALUE (first_parm)) != TREE_LIST
12020            && TREE_CODE (TREE_VALUE (first_parm)) != VOID_TYPE)
12021     my_friendly_abort (145);
12022   else
12023     {
12024       /* Types were specified.  This is a list of declarators
12025          each represented as a TREE_LIST node.  */
12026       register tree parm, chain;
12027       int any_init = 0, any_error = 0;
12028
12029       if (first_parm != NULL_TREE)
12030         {
12031           tree last_result = NULL_TREE;
12032           tree last_decl = NULL_TREE;
12033
12034           for (parm = first_parm; parm != NULL_TREE; parm = chain)
12035             {
12036               tree type = NULL_TREE, list_node = parm;
12037               register tree decl = TREE_VALUE (parm);
12038               tree init = TREE_PURPOSE (parm);
12039
12040               chain = TREE_CHAIN (parm);
12041               /* @@ weak defense against parse errors.  */
12042               if (TREE_CODE (decl) != VOID_TYPE
12043                   && TREE_CODE (decl) != TREE_LIST)
12044                 {
12045                   /* Give various messages as the need arises.  */
12046                   if (TREE_CODE (decl) == STRING_CST)
12047                     cp_error ("invalid string constant `%E'", decl);
12048                   else if (TREE_CODE (decl) == INTEGER_CST)
12049                     error ("invalid integer constant in parameter list, did you forget to give parameter name?");
12050                   continue;
12051                 }
12052
12053               if (TREE_CODE (decl) != VOID_TYPE)
12054                 {
12055                   decl = grokdeclarator (TREE_VALUE (decl),
12056                                          TREE_PURPOSE (decl),
12057                                          PARM, init != NULL_TREE,
12058                                          NULL_TREE);
12059                   if (! decl || TREE_TYPE (decl) == error_mark_node)
12060                     continue;
12061
12062                   /* Top-level qualifiers on the parameters are
12063                      ignored for function types.  */
12064                   type = TYPE_MAIN_VARIANT (TREE_TYPE (decl));
12065
12066                   if (TREE_CODE (type) == VOID_TYPE)
12067                     decl = void_type_node;
12068                   else if (TREE_CODE (type) == METHOD_TYPE)
12069                     {
12070                       if (DECL_NAME (decl))
12071                         /* Cannot use the decl here because
12072                            we don't have DECL_CONTEXT set up yet.  */
12073                         cp_error ("parameter `%D' invalidly declared method type",
12074                                   DECL_NAME (decl));
12075                       else
12076                         error ("parameter invalidly declared method type");
12077                       type = build_pointer_type (type);
12078                       TREE_TYPE (decl) = type;
12079                     }
12080                   else if (TREE_CODE (type) == OFFSET_TYPE)
12081                     {
12082                       if (DECL_NAME (decl))
12083                         cp_error ("parameter `%D' invalidly declared offset type",
12084                                   DECL_NAME (decl));
12085                       else
12086                         error ("parameter invalidly declared offset type");
12087                       type = build_pointer_type (type);
12088                       TREE_TYPE (decl) = type;
12089                     }
12090                   else if (abstract_virtuals_error (decl, type))
12091                     any_error = 1;  /* Seems like a good idea. */
12092                   else if (POINTER_TYPE_P (type))
12093                     {
12094                       tree t = type;
12095                       while (POINTER_TYPE_P (t)
12096                              || (TREE_CODE (t) == ARRAY_TYPE
12097                                  && TYPE_DOMAIN (t) != NULL_TREE))
12098                         t = TREE_TYPE (t);
12099                       if (TREE_CODE (t) == ARRAY_TYPE)
12100                         cp_error ("parameter type `%T' includes %s to array of unknown bound",
12101                                   type,
12102                                   TYPE_PTR_P (type) ? "pointer" : "reference");
12103                     }
12104                 }
12105
12106               if (TREE_CODE (decl) == VOID_TYPE)
12107                 {
12108                   if (result == NULL_TREE)
12109                     {
12110                       result = void_list_node;
12111                       last_result = result;
12112                     }
12113                   else
12114                     {
12115                       TREE_CHAIN (last_result) = void_list_node;
12116                       last_result = void_list_node;
12117                     }
12118                   if (chain
12119                       && (chain != void_list_node || TREE_CHAIN (chain)))
12120                     error ("`void' in parameter list must be entire list");
12121                   break;
12122                 }
12123
12124               /* Since there is a prototype, args are passed in their own types.  */
12125               DECL_ARG_TYPE (decl) = TREE_TYPE (decl);
12126               if (PROMOTE_PROTOTYPES
12127                   && (TREE_CODE (type) == INTEGER_TYPE
12128                       || TREE_CODE (type) == ENUMERAL_TYPE)
12129                   && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node))
12130                 DECL_ARG_TYPE (decl) = integer_type_node;
12131               if (!any_error && init)
12132                 {
12133                   any_init++;
12134                   init = check_default_argument (decl, init);
12135                 }
12136               else
12137                 init = NULL_TREE;
12138
12139               if (decls == NULL_TREE)
12140                 {
12141                   decls = decl;
12142                   last_decl = decls;
12143                 }
12144               else
12145                 {
12146                   TREE_CHAIN (last_decl) = decl;
12147                   last_decl = decl;
12148                 }
12149               list_node = tree_cons (init, type, NULL_TREE);
12150               if (result == NULL_TREE)
12151                 {
12152                   result = list_node;
12153                   last_result = result;
12154                 }
12155               else
12156                 {
12157                   TREE_CHAIN (last_result) = list_node;
12158                   last_result = list_node;
12159                 }
12160             }
12161           if (last_result)
12162             TREE_CHAIN (last_result) = NULL_TREE;
12163           /* If there are no parameters, and the function does not end
12164              with `...', then last_decl will be NULL_TREE.  */
12165           if (last_decl != NULL_TREE)
12166             TREE_CHAIN (last_decl) = NULL_TREE;
12167         }
12168     }
12169
12170   last_function_parms = decls;
12171
12172   return result;
12173 }
12174
12175 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
12176    FUNCTION_TYPE with the newly parsed version of its default argument, which
12177    was previously digested as text.  See snarf_defarg et al in lex.c.  */
12178
12179 void
12180 replace_defarg (arg, init)
12181      tree arg, init;
12182 {
12183   if (! processing_template_decl
12184       && ! can_convert_arg (TREE_VALUE (arg), TREE_TYPE (init), init))
12185     cp_pedwarn ("invalid type `%T' for default argument to `%T'",
12186                 TREE_TYPE (init), TREE_VALUE (arg));
12187   TREE_PURPOSE (arg) = init;
12188 }
12189 \f
12190 /* D is a constructor or overloaded `operator='.  Returns non-zero if
12191    D's arguments allow it to be a copy constructor, or copy assignment
12192    operator.  */
12193
12194 int
12195 copy_args_p (d)
12196      tree d;
12197 {
12198   tree t;
12199
12200   if (!DECL_FUNCTION_MEMBER_P (d))
12201     return 0;
12202
12203   t = FUNCTION_ARG_CHAIN (d);
12204   if (DECL_CONSTRUCTOR_P (d) && DECL_HAS_IN_CHARGE_PARM_P (d))
12205     t = TREE_CHAIN (t);
12206   if (t && TREE_CODE (TREE_VALUE (t)) == REFERENCE_TYPE
12207       && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t)))
12208           == DECL_CONTEXT (d))
12209       && (TREE_CHAIN (t) == NULL_TREE
12210           || TREE_CHAIN (t) == void_list_node
12211           || TREE_PURPOSE (TREE_CHAIN (t))))
12212     return 1;
12213   return 0;
12214 }
12215
12216 /* These memoizing functions keep track of special properties which
12217    a class may have.  `grok_ctor_properties' notices whether a class
12218    has a constructor of the form X(X&), and also complains
12219    if the class has a constructor of the form X(X).
12220    `grok_op_properties' takes notice of the various forms of
12221    operator= which are defined, as well as what sorts of type conversion
12222    may apply.  Both functions take a FUNCTION_DECL as an argument.  */
12223
12224 int
12225 grok_ctor_properties (ctype, decl)
12226      tree ctype, decl;
12227 {
12228   tree parmtypes = FUNCTION_ARG_CHAIN (decl);
12229   tree parmtype = parmtypes ? TREE_VALUE (parmtypes) : void_type_node;
12230
12231   /* When a type has virtual baseclasses, a magical first int argument is
12232      added to any ctor so we can tell if the class has been initialized
12233      yet.  This could screw things up in this function, so we deliberately
12234      ignore the leading int if we're in that situation.  */
12235   if (DECL_HAS_IN_CHARGE_PARM_P (decl))
12236     {
12237       my_friendly_assert (parmtypes
12238                           && TREE_VALUE (parmtypes) == integer_type_node,
12239                           980529);
12240       parmtypes = TREE_CHAIN (parmtypes);
12241       parmtype = TREE_VALUE (parmtypes);
12242     }
12243
12244   /* [class.copy]
12245
12246      A non-template constructor for class X is a copy constructor if
12247      its first parameter is of type X&, const X&, volatile X& or const
12248      volatile X&, and either there are no other parameters or else all
12249      other parameters have default arguments.  */
12250   if (TREE_CODE (parmtype) == REFERENCE_TYPE
12251       && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype)) == ctype
12252       && (TREE_CHAIN (parmtypes) == NULL_TREE
12253           || TREE_CHAIN (parmtypes) == void_list_node
12254           || TREE_PURPOSE (TREE_CHAIN (parmtypes)))
12255       && !(DECL_TEMPLATE_INSTANTIATION (decl)
12256            && is_member_template (DECL_TI_TEMPLATE (decl))))
12257     {
12258       TYPE_HAS_INIT_REF (ctype) = 1;
12259       if (CP_TYPE_CONST_P (TREE_TYPE (parmtype)))
12260         TYPE_HAS_CONST_INIT_REF (ctype) = 1;
12261     }
12262   /* [class.copy]
12263
12264      A declaration of a constructor for a class X is ill-formed if its
12265      first parameter is of type (optionally cv-qualified) X and either
12266      there are no other parameters or else all other parameters have
12267      default arguments.
12268
12269      We *don't* complain about member template instantiations that
12270      have this form, though; they can occur as we try to decide what
12271      constructor to use during overload resolution.  Since overload
12272      resolution will never prefer such a constructor to the
12273      non-template copy constructor (which is either explicitly or
12274      implicitly defined), there's no need to worry about their
12275      existence.  Theoretically, they should never even be
12276      instantiated, but that's hard to forestall.  */
12277   else if (TYPE_MAIN_VARIANT (parmtype) == ctype
12278            && (TREE_CHAIN (parmtypes) == NULL_TREE
12279                || TREE_CHAIN (parmtypes) == void_list_node
12280                || TREE_PURPOSE (TREE_CHAIN (parmtypes)))
12281            && !(DECL_TEMPLATE_INSTANTIATION (decl)
12282                 && is_member_template (DECL_TI_TEMPLATE (decl))))
12283     {
12284       cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
12285                 ctype, ctype);
12286       SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl), ctype);
12287       return 0;
12288     }
12289   else if (TREE_CODE (parmtype) == VOID_TYPE
12290            || TREE_PURPOSE (parmtypes) != NULL_TREE)
12291     TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype) = 1;
12292
12293   return 1;
12294 }
12295
12296 /* An operator with this code is unary, but can also be binary.  */
12297
12298 static int
12299 ambi_op_p (code)
12300      enum tree_code code;
12301 {
12302   return (code == INDIRECT_REF
12303           || code == ADDR_EXPR
12304           || code == CONVERT_EXPR
12305           || code == NEGATE_EXPR
12306           || code == PREINCREMENT_EXPR
12307           || code == PREDECREMENT_EXPR);
12308 }
12309
12310 /* An operator with this name can only be unary.  */
12311
12312 static int
12313 unary_op_p (code)
12314      enum tree_code code;
12315 {
12316   return (code == TRUTH_NOT_EXPR
12317           || code == BIT_NOT_EXPR
12318           || code == COMPONENT_REF
12319           || code == TYPE_EXPR);
12320 }
12321
12322 /* Do a little sanity-checking on how they declared their operator.  */
12323
12324 void
12325 grok_op_properties (decl, virtualp, friendp)
12326      tree decl;
12327      int virtualp, friendp;
12328 {
12329   tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl));
12330   tree argtype;
12331   int methodp = (TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE);
12332   tree name = DECL_NAME (decl);
12333   enum tree_code operator_code;
12334   int arity;
12335
12336   /* Count the number of arguments.  */
12337   for (argtype = argtypes, arity = 0;
12338        argtype && argtype != void_list_node;
12339        argtype = TREE_CHAIN (argtype))
12340     ++arity;
12341
12342   if (current_class_type == NULL_TREE)
12343     friendp = 1;
12344
12345   if (DECL_CONV_FN_P (decl))
12346     operator_code = TYPE_EXPR;
12347   else
12348     do
12349       {
12350 #define DEF_OPERATOR(NAME, CODE, NEW_MANGLING, OLD_MANGING, ARITY, ASSN_P)  \
12351         if (ansi_opname (CODE) == name)                                     \
12352           {                                                                 \
12353             operator_code = CODE;                                           \
12354             break;                                                          \
12355           }                                                                 \
12356         else if (ansi_assopname (CODE) == name)                             \
12357           {                                                                 \
12358             operator_code = CODE;                                           \
12359             DECL_ASSIGNMENT_OPERATOR_P (decl) = 1;                          \
12360             break;                                                          \
12361           }
12362
12363 #include "operators.def"
12364 #undef DEF_OPERATOR
12365
12366         my_friendly_abort (20000527);
12367       }
12368     while (0);
12369   my_friendly_assert (operator_code != LAST_CPLUS_TREE_CODE, 20000526);
12370   SET_OVERLOADED_OPERATOR_CODE (decl, operator_code);
12371
12372   if (! friendp)
12373     {
12374       switch (operator_code)
12375         {
12376         case CALL_EXPR:
12377           TYPE_OVERLOADS_CALL_EXPR (current_class_type) = 1;
12378           break;
12379
12380         case ARRAY_REF:
12381           TYPE_OVERLOADS_ARRAY_REF (current_class_type) = 1;
12382           break;
12383
12384         case COMPONENT_REF:
12385         case MEMBER_REF:
12386           TYPE_OVERLOADS_ARROW (current_class_type) = 1;
12387           break;
12388
12389         case NEW_EXPR:
12390           TYPE_HAS_NEW_OPERATOR (current_class_type) = 1;
12391           break;
12392
12393         case DELETE_EXPR:
12394           TYPE_GETS_DELETE (current_class_type) |= 1;
12395           break;
12396
12397         case VEC_NEW_EXPR:
12398           TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type) = 1;
12399           break;
12400
12401         case VEC_DELETE_EXPR:
12402           TYPE_GETS_DELETE (current_class_type) |= 2;
12403           break;
12404
12405         default:
12406           break;
12407         }
12408     }
12409
12410   if (operator_code == NEW_EXPR || operator_code == VEC_NEW_EXPR)
12411     {
12412       /* When the compiler encounters the definition of A::operator new, it
12413          doesn't look at the class declaration to find out if it's static.  */
12414       if (methodp)
12415         revert_static_member_fn (decl);
12416
12417       /* Take care of function decl if we had syntax errors.  */
12418       if (argtypes == NULL_TREE)
12419         TREE_TYPE (decl)
12420           = build_function_type (ptr_type_node,
12421                                  hash_tree_chain (integer_type_node,
12422                                                   void_list_node));
12423       else
12424         TREE_TYPE (decl) = coerce_new_type (TREE_TYPE (decl));
12425     }
12426   else if (operator_code == DELETE_EXPR || operator_code == VEC_DELETE_EXPR)
12427     {
12428       if (methodp)
12429         revert_static_member_fn (decl);
12430
12431       if (argtypes == NULL_TREE)
12432         TREE_TYPE (decl)
12433           = build_function_type (void_type_node,
12434                                  hash_tree_chain (ptr_type_node,
12435                                                   void_list_node));
12436       else
12437         TREE_TYPE (decl) = coerce_delete_type (TREE_TYPE (decl));
12438     }
12439   else
12440     {
12441       /* An operator function must either be a non-static member function
12442          or have at least one parameter of a class, a reference to a class,
12443          an enumeration, or a reference to an enumeration.  13.4.0.6 */
12444       if (! methodp || DECL_STATIC_FUNCTION_P (decl))
12445         {
12446           if (operator_code == TYPE_EXPR
12447               || operator_code == CALL_EXPR
12448               || operator_code == COMPONENT_REF
12449               || operator_code == ARRAY_REF
12450               || operator_code == NOP_EXPR)
12451             cp_error ("`%D' must be a nonstatic member function", decl);
12452           else
12453             {
12454               tree p = argtypes;
12455
12456               if (DECL_STATIC_FUNCTION_P (decl))
12457                 cp_error ("`%D' must be either a non-static member function or a non-member function", decl);
12458
12459               if (p)
12460                 for (; TREE_CODE (TREE_VALUE (p)) != VOID_TYPE ; p = TREE_CHAIN (p))
12461                   {
12462                     tree arg = TREE_VALUE (p);
12463                     if (TREE_CODE (arg) == REFERENCE_TYPE)
12464                       arg = TREE_TYPE (arg);
12465
12466                     /* This lets bad template code slip through.  */
12467                     if (IS_AGGR_TYPE (arg)
12468                         || TREE_CODE (arg) == ENUMERAL_TYPE
12469                         || TREE_CODE (arg) == TEMPLATE_TYPE_PARM
12470                         || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
12471                       goto foundaggr;
12472                   }
12473               cp_error
12474                 ("`%D' must have an argument of class or enumerated type",
12475                  decl);
12476             foundaggr:
12477               ;
12478             }
12479         }
12480
12481       if (operator_code == CALL_EXPR)
12482         return;                 /* No restrictions on args. */
12483
12484       if (IDENTIFIER_TYPENAME_P (name) && ! DECL_TEMPLATE_INFO (decl))
12485         {
12486           tree t = TREE_TYPE (name);
12487           if (! friendp)
12488             {
12489               int ref = (TREE_CODE (t) == REFERENCE_TYPE);
12490               const char *what = 0;
12491
12492               if (ref)
12493                 t = TYPE_MAIN_VARIANT (TREE_TYPE (t));
12494
12495               if (TREE_CODE (t) == VOID_TYPE)
12496                 what = "void";
12497               else if (t == current_class_type)
12498                 what = "the same type";
12499               /* Don't force t to be complete here.  */
12500               else if (IS_AGGR_TYPE (t)
12501                        && COMPLETE_TYPE_P (t)
12502                        && DERIVED_FROM_P (t, current_class_type))
12503                 what = "a base class";
12504
12505               if (what)
12506                 warning ("conversion to %s%s will never use a type conversion operator",
12507                          ref ? "a reference to " : "", what);
12508             }
12509         }
12510
12511       if (DECL_ASSIGNMENT_OPERATOR_P (decl)
12512           && operator_code == NOP_EXPR)
12513         {
12514           tree parmtype;
12515
12516           if (arity != 2 && methodp)
12517             {
12518               cp_error ("`%D' must take exactly one argument", decl);
12519               return;
12520             }
12521           parmtype = TREE_VALUE (TREE_CHAIN (argtypes));
12522
12523           /* [class.copy]
12524
12525              A user-declared copy assignment operator X::operator= is
12526              a non-static non-template member function of class X with
12527              exactly one parameter of type X, X&, const X&, volatile
12528              X& or const volatile X&.  */
12529           if (copy_assignment_arg_p (parmtype, virtualp)
12530               && !(DECL_TEMPLATE_INSTANTIATION (decl)
12531                    && is_member_template (DECL_TI_TEMPLATE (decl)))
12532               && ! friendp)
12533             {
12534               TYPE_HAS_ASSIGN_REF (current_class_type) = 1;
12535               if (TREE_CODE (parmtype) != REFERENCE_TYPE
12536                   || CP_TYPE_CONST_P (TREE_TYPE (parmtype)))
12537                 TYPE_HAS_CONST_ASSIGN_REF (current_class_type) = 1;
12538             }
12539         }
12540       else if (operator_code == COND_EXPR)
12541         {
12542           /* 13.4.0.3 */
12543           cp_error ("ISO C++ prohibits overloading operator ?:");
12544         }
12545       else if (ambi_op_p (operator_code))
12546         {
12547           if (arity == 1)
12548             /* We pick the one-argument operator codes by default, so
12549                we don't have to change anything.  */
12550             ;
12551           else if (arity == 2)
12552             {
12553               /* If we thought this was a unary operator, we now know
12554                  it to be a binary operator.  */
12555               switch (operator_code)
12556                 {
12557                 case INDIRECT_REF:
12558                   operator_code = MULT_EXPR;
12559                   break;
12560
12561                 case ADDR_EXPR:
12562                   operator_code = BIT_AND_EXPR;
12563                   break;
12564
12565                 case CONVERT_EXPR:
12566                   operator_code = PLUS_EXPR;
12567                   break;
12568
12569                 case NEGATE_EXPR:
12570                   operator_code = MINUS_EXPR;
12571                   break;
12572
12573                 case PREINCREMENT_EXPR:
12574                   operator_code = POSTINCREMENT_EXPR;
12575                   break;
12576
12577                 case PREDECREMENT_EXPR:
12578                   operator_code = PREDECREMENT_EXPR;
12579                   break;
12580
12581                 default:
12582                   my_friendly_abort (20000527);
12583                 }
12584
12585               SET_OVERLOADED_OPERATOR_CODE (decl, operator_code);
12586
12587               if ((operator_code == POSTINCREMENT_EXPR
12588                    || operator_code == POSTDECREMENT_EXPR)
12589                   && ! processing_template_decl
12590                   && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes)), integer_type_node))
12591                 {
12592                   if (methodp)
12593                     cp_error ("postfix `%D' must take `int' as its argument",
12594                               decl);
12595                   else
12596                     cp_error
12597                       ("postfix `%D' must take `int' as its second argument",
12598                        decl);
12599                 }
12600             }
12601           else
12602             {
12603               if (methodp)
12604                 cp_error ("`%D' must take either zero or one argument", decl);
12605               else
12606                 cp_error ("`%D' must take either one or two arguments", decl);
12607             }
12608
12609           /* More Effective C++ rule 6.  */
12610           if (warn_ecpp
12611               && (operator_code == POSTINCREMENT_EXPR
12612                   || operator_code == POSTDECREMENT_EXPR
12613                   || operator_code == PREINCREMENT_EXPR
12614                   || operator_code == PREDECREMENT_EXPR))
12615             {
12616               tree arg = TREE_VALUE (argtypes);
12617               tree ret = TREE_TYPE (TREE_TYPE (decl));
12618               if (methodp || TREE_CODE (arg) == REFERENCE_TYPE)
12619                 arg = TREE_TYPE (arg);
12620               arg = TYPE_MAIN_VARIANT (arg);
12621               if (operator_code == PREINCREMENT_EXPR
12622                   || operator_code == PREDECREMENT_EXPR)
12623                 {
12624                   if (TREE_CODE (ret) != REFERENCE_TYPE
12625                       || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret)),
12626                                        arg))
12627                     cp_warning ("prefix `%D' should return `%T'", decl,
12628                                 build_reference_type (arg));
12629                 }
12630               else
12631                 {
12632                   if (!same_type_p (TYPE_MAIN_VARIANT (ret), arg))
12633                     cp_warning ("postfix `%D' should return `%T'", decl, arg);
12634                 }
12635             }
12636         }
12637       else if (unary_op_p (operator_code))
12638         {
12639           if (arity != 1)
12640             {
12641               if (methodp)
12642                 cp_error ("`%D' must take `void'", decl);
12643               else
12644                 cp_error ("`%D' must take exactly one argument", decl);
12645             }
12646         }
12647       else /* if (binary_op_p (operator_code)) */
12648         {
12649           if (arity != 2)
12650             {
12651               if (methodp)
12652                 cp_error ("`%D' must take exactly one argument", decl);
12653               else
12654                 cp_error ("`%D' must take exactly two arguments", decl);
12655             }
12656
12657           /* More Effective C++ rule 7.  */
12658           if (warn_ecpp
12659               && (operator_code == TRUTH_ANDIF_EXPR
12660                   || operator_code == TRUTH_ORIF_EXPR
12661                   || operator_code == COMPOUND_EXPR))
12662             cp_warning ("user-defined `%D' always evaluates both arguments",
12663                         decl);
12664         }
12665
12666       /* Effective C++ rule 23.  */
12667       if (warn_ecpp
12668           && arity == 2
12669           && (operator_code == PLUS_EXPR
12670               || operator_code == MINUS_EXPR
12671               || operator_code == TRUNC_DIV_EXPR
12672               || operator_code == MULT_EXPR)
12673           && TREE_CODE (TREE_TYPE (TREE_TYPE (decl))) == REFERENCE_TYPE)
12674         cp_warning ("`%D' should return by value", decl);
12675
12676       /* 13.4.0.8 */
12677       for (; argtypes && argtypes != void_list_node;
12678           argtypes = TREE_CHAIN (argtypes))
12679         if (TREE_PURPOSE (argtypes))
12680           {
12681             TREE_PURPOSE (argtypes) = NULL_TREE;
12682             if (operator_code == POSTINCREMENT_EXPR
12683                 || operator_code == POSTDECREMENT_EXPR)
12684               {
12685                 if (pedantic)
12686                   cp_pedwarn ("`%D' cannot have default arguments", decl);
12687               }
12688             else
12689               cp_error ("`%D' cannot have default arguments", decl);
12690           }
12691
12692     }
12693 }
12694 \f
12695 static const char *
12696 tag_name (code)
12697      enum tag_types code;
12698 {
12699   switch (code)
12700     {
12701     case record_type:
12702       return "struct";
12703     case class_type:
12704       return "class";
12705     case union_type:
12706       return "union ";
12707     case enum_type:
12708       return "enum";
12709     default:
12710       my_friendly_abort (981122);
12711     }
12712 }
12713
12714 /* Get the struct, enum or union (CODE says which) with tag NAME.
12715    Define the tag as a forward-reference if it is not defined.
12716
12717    C++: If a class derivation is given, process it here, and report
12718    an error if multiple derivation declarations are not identical.
12719
12720    If this is a definition, come in through xref_tag and only look in
12721    the current frame for the name (since C++ allows new names in any
12722    scope.)  */
12723
12724 tree
12725 xref_tag (code_type_node, name, globalize)
12726      tree code_type_node;
12727      tree name;
12728      int globalize;
12729 {
12730   enum tag_types tag_code;
12731   enum tree_code code;
12732   register tree ref, t;
12733   struct binding_level *b = current_binding_level;
12734   int got_type = 0;
12735   tree attributes = NULL_TREE;
12736   tree context = NULL_TREE;
12737
12738   /* If we are called from the parser, code_type_node will sometimes be a
12739      TREE_LIST.  This indicates that the user wrote
12740      "class __attribute__ ((foo)) bar".  Extract the attributes so we can
12741      use them later.  */
12742   if (TREE_CODE (code_type_node) == TREE_LIST)
12743     {
12744       attributes = TREE_PURPOSE (code_type_node);
12745       code_type_node = TREE_VALUE (code_type_node);
12746     }
12747
12748   tag_code = (enum tag_types) tree_low_cst (code_type_node, 1);
12749   switch (tag_code)
12750     {
12751     case record_type:
12752     case class_type:
12753       code = RECORD_TYPE;
12754       break;
12755     case union_type:
12756       code = UNION_TYPE;
12757       break;
12758     case enum_type:
12759       code = ENUMERAL_TYPE;
12760       break;
12761     default:
12762       my_friendly_abort (18);
12763     }
12764
12765   /* If a cross reference is requested, look up the type
12766      already defined for this tag and return it.  */
12767   if (TYPE_P (name))
12768     {
12769       t = name;
12770       name = TYPE_IDENTIFIER (t);
12771       got_type = 1;
12772     }
12773   else
12774     t = IDENTIFIER_TYPE_VALUE (name);
12775
12776   if (t && TREE_CODE (t) != code && TREE_CODE (t) != TEMPLATE_TYPE_PARM
12777       && TREE_CODE (t) != TEMPLATE_TEMPLATE_PARM)
12778     t = NULL_TREE;
12779
12780   if (! globalize)
12781     {
12782       /* If we know we are defining this tag, only look it up in
12783          this scope and don't try to find it as a type.  */
12784       ref = lookup_tag (code, name, b, 1);
12785     }
12786   else
12787     {
12788       if (t)
12789         {
12790           /* [dcl.type.elab] If the identifier resolves to a
12791              typedef-name or a template type-parameter, the
12792              elaborated-type-specifier is ill-formed.  */
12793           if (t != TYPE_MAIN_VARIANT (t)
12794               || (CLASS_TYPE_P (t) && TYPE_WAS_ANONYMOUS (t)))
12795             cp_pedwarn ("using typedef-name `%D' after `%s'",
12796                         TYPE_NAME (t), tag_name (tag_code));
12797           else if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
12798             cp_error ("using template type parameter `%T' after `%s'",
12799                       t, tag_name (tag_code));
12800
12801           ref = t;
12802         }
12803       else
12804         ref = lookup_tag (code, name, b, 0);
12805
12806       if (! ref)
12807         {
12808           /* Try finding it as a type declaration.  If that wins,
12809              use it.  */
12810           ref = lookup_name (name, 1);
12811
12812           if (ref != NULL_TREE
12813               && processing_template_decl
12814               && DECL_CLASS_TEMPLATE_P (ref)
12815               && template_class_depth (current_class_type) == 0)
12816             /* Since GLOBALIZE is true, we're declaring a global
12817                template, so we want this type.  */
12818             ref = DECL_TEMPLATE_RESULT (ref);
12819
12820           if (ref && TREE_CODE (ref) == TYPE_DECL
12821               && TREE_CODE (TREE_TYPE (ref)) == code)
12822             ref = TREE_TYPE (ref);
12823           else
12824             ref = NULL_TREE;
12825         }
12826
12827       if (ref && current_class_type
12828           && template_class_depth (current_class_type)
12829           && PROCESSING_REAL_TEMPLATE_DECL_P ())
12830         {
12831           /* Since GLOBALIZE is non-zero, we are not looking at a
12832              definition of this tag.  Since, in addition, we are currently
12833              processing a (member) template declaration of a template
12834              class, we must be very careful; consider:
12835
12836                template <class X>
12837                struct S1
12838
12839                template <class U>
12840                struct S2
12841                { template <class V>
12842                friend struct S1; };
12843
12844              Here, the S2::S1 declaration should not be confused with the
12845              outer declaration.  In particular, the inner version should
12846              have a template parameter of level 2, not level 1.  This
12847              would be particularly important if the member declaration
12848              were instead:
12849
12850                template <class V = U> friend struct S1;
12851
12852              say, when we should tsubst into `U' when instantiating
12853              S2.  On the other hand, when presented with:
12854
12855                  template <class T>
12856                  struct S1 {
12857                    template <class U>
12858                    struct S2 {};
12859                    template <class U>
12860                    friend struct S2;
12861                  };
12862
12863               we must find the inner binding eventually.  We
12864               accomplish this by making sure that the new type we
12865               create to represent this declaration has the right
12866               TYPE_CONTEXT.  */
12867           context = TYPE_CONTEXT (ref);
12868           ref = NULL_TREE;
12869         }
12870     }
12871
12872   if (! ref)
12873     {
12874       /* If no such tag is yet defined, create a forward-reference node
12875          and record it as the "definition".
12876          When a real declaration of this type is found,
12877          the forward-reference will be altered into a real type.  */
12878       if (code == ENUMERAL_TYPE)
12879         {
12880           cp_error ("use of enum `%#D' without previous declaration", name);
12881
12882           ref = make_node (ENUMERAL_TYPE);
12883
12884           /* Give the type a default layout like unsigned int
12885              to avoid crashing if it does not get defined.  */
12886           TYPE_MODE (ref) = TYPE_MODE (unsigned_type_node);
12887           TYPE_ALIGN (ref) = TYPE_ALIGN (unsigned_type_node);
12888           TYPE_USER_ALIGN (ref) = 0;
12889           TREE_UNSIGNED (ref) = 1;
12890           TYPE_PRECISION (ref) = TYPE_PRECISION (unsigned_type_node);
12891           TYPE_MIN_VALUE (ref) = TYPE_MIN_VALUE (unsigned_type_node);
12892           TYPE_MAX_VALUE (ref) = TYPE_MAX_VALUE (unsigned_type_node);
12893
12894           /* Enable us to recognize when a type is created in class context.
12895              To do nested classes correctly, this should probably be cleared
12896              out when we leave this classes scope.  Currently this in only
12897              done in `start_enum'.  */
12898
12899           pushtag (name, ref, globalize);
12900         }
12901       else
12902         {
12903           struct binding_level *old_b = class_binding_level;
12904
12905           ref = make_aggr_type (code);
12906           TYPE_CONTEXT (ref) = context;
12907
12908 #ifdef NONNESTED_CLASSES
12909           /* Class types don't nest the way enums do.  */
12910           class_binding_level = (struct binding_level *)0;
12911 #endif
12912           pushtag (name, ref, globalize);
12913           class_binding_level = old_b;
12914         }
12915     }
12916   else
12917     {
12918       if (!globalize && processing_template_decl && IS_AGGR_TYPE (ref))
12919         redeclare_class_template (ref, current_template_parms);
12920     }
12921
12922   /* Until the type is defined, tentatively accept whatever
12923      structure tag the user hands us.  */
12924   if (!COMPLETE_TYPE_P (ref)
12925       && ref != current_class_type
12926       /* Have to check this, in case we have contradictory tag info.  */
12927       && IS_AGGR_TYPE_CODE (TREE_CODE (ref)))
12928     {
12929       if (tag_code == class_type)
12930         CLASSTYPE_DECLARED_CLASS (ref) = 1;
12931       else if (tag_code == record_type)
12932         CLASSTYPE_DECLARED_CLASS (ref) = 0;
12933     }
12934
12935   TREE_TYPE (ref) = attributes;
12936
12937   return ref;
12938 }
12939
12940 tree
12941 xref_tag_from_type (old, id, globalize)
12942      tree old, id;
12943      int globalize;
12944 {
12945   tree code_type_node;
12946
12947   if (TREE_CODE (old) == RECORD_TYPE)
12948     code_type_node = (CLASSTYPE_DECLARED_CLASS (old)
12949                       ? class_type_node : record_type_node);
12950   else
12951     code_type_node = union_type_node;
12952
12953   if (id == NULL_TREE)
12954     id = TYPE_IDENTIFIER (old);
12955
12956   return xref_tag (code_type_node, id, globalize);
12957 }
12958
12959 /* REF is a type (named NAME), for which we have just seen some
12960    baseclasses.  BINFO is a list of those baseclasses; the
12961    TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12962    the base-class.  CODE_TYPE_NODE indicates whether REF is a class,
12963    struct, or union.  */
12964
12965 void
12966 xref_basetypes (code_type_node, name, ref, binfo)
12967      tree code_type_node;
12968      tree name, ref;
12969      tree binfo;
12970 {
12971   /* In the declaration `A : X, Y, ... Z' we mark all the types
12972      (A, X, Y, ..., Z) so we can check for duplicates.  */
12973   tree binfos;
12974   tree base;
12975
12976   int i, len;
12977   enum tag_types tag_code = (enum tag_types) tree_low_cst (code_type_node, 1);
12978
12979   if (tag_code == union_type)
12980     {
12981       cp_error ("derived union `%T' invalid", ref);
12982       return;
12983     }
12984
12985   len = list_length (binfo);
12986
12987   /* First, make sure that any templates in base-classes are
12988      instantiated.  This ensures that if we call ourselves recursively
12989      we do not get confused about which classes are marked and which
12990      are not.  */
12991   for (base = binfo; base; base = TREE_CHAIN (base))
12992     complete_type (TREE_VALUE (base));
12993
12994   SET_CLASSTYPE_MARKED (ref);
12995   BINFO_BASETYPES (TYPE_BINFO (ref)) = binfos = make_tree_vec (len);
12996
12997   for (i = 0; binfo; binfo = TREE_CHAIN (binfo))
12998     {
12999       /* The base of a derived struct is public by default.  */
13000       int via_public
13001         = (TREE_PURPOSE (binfo) == access_public_node
13002            || TREE_PURPOSE (binfo) == access_public_virtual_node
13003            || (tag_code != class_type
13004                && (TREE_PURPOSE (binfo) == access_default_node
13005                    || TREE_PURPOSE (binfo) == access_default_virtual_node)));
13006       int via_protected
13007         = (TREE_PURPOSE (binfo) == access_protected_node
13008            || TREE_PURPOSE (binfo) == access_protected_virtual_node);
13009       int via_virtual
13010         = (TREE_PURPOSE (binfo) == access_private_virtual_node
13011            || TREE_PURPOSE (binfo) == access_protected_virtual_node
13012            || TREE_PURPOSE (binfo) == access_public_virtual_node
13013            || TREE_PURPOSE (binfo) == access_default_virtual_node);
13014       tree basetype = TREE_VALUE (binfo);
13015       tree base_binfo;
13016
13017       if (basetype && TREE_CODE (basetype) == TYPE_DECL)
13018         basetype = TREE_TYPE (basetype);
13019       if (!basetype
13020           || (TREE_CODE (basetype) != RECORD_TYPE
13021               && TREE_CODE (basetype) != TYPENAME_TYPE
13022               && TREE_CODE (basetype) != TEMPLATE_TYPE_PARM
13023               && TREE_CODE (basetype) != TEMPLATE_TEMPLATE_PARM))
13024         {
13025           cp_error ("base type `%T' fails to be a struct or class type",
13026                     TREE_VALUE (binfo));
13027           continue;
13028         }
13029
13030       GNU_xref_hier (name, basetype, via_public, via_virtual, 0);
13031
13032       /* This code replaces similar code in layout_basetypes.
13033          We put the complete_type first for implicit `typename'.  */
13034       if (!COMPLETE_TYPE_P (basetype)
13035           && ! (current_template_parms && uses_template_parms (basetype)))
13036         {
13037           cp_error ("base class `%T' has incomplete type", basetype);
13038           continue;
13039         }
13040       else
13041         {
13042           if (CLASSTYPE_MARKED (basetype))
13043             {
13044               if (basetype == ref)
13045                 cp_error ("recursive type `%T' undefined", basetype);
13046               else
13047                 cp_error ("duplicate base type `%T' invalid", basetype);
13048               continue;
13049             }
13050
13051           if (TYPE_FOR_JAVA (basetype)
13052               && (current_lang_stack
13053                   == &VARRAY_TREE (current_lang_base, 0)))
13054             TYPE_FOR_JAVA (ref) = 1;
13055
13056           /* Note that the BINFO records which describe individual
13057              inheritances are *not* shared in the lattice!  They
13058              cannot be shared because a given baseclass may be
13059              inherited with different `accessibility' by different
13060              derived classes.  (Each BINFO record describing an
13061              individual inheritance contains flags which say what
13062              the `accessibility' of that particular inheritance is.)  */
13063
13064           base_binfo
13065             = make_binfo (size_zero_node, basetype,
13066                           CLASS_TYPE_P (basetype)
13067                           ? TYPE_BINFO_VTABLE (basetype) : NULL_TREE,
13068                           CLASS_TYPE_P (basetype)
13069                           ? TYPE_BINFO_VIRTUALS (basetype) : NULL_TREE);
13070
13071           TREE_VEC_ELT (binfos, i) = base_binfo;
13072           TREE_VIA_PUBLIC (base_binfo) = via_public;
13073           TREE_VIA_PROTECTED (base_binfo) = via_protected;
13074           TREE_VIA_VIRTUAL (base_binfo) = via_virtual;
13075           BINFO_INHERITANCE_CHAIN (base_binfo) = TYPE_BINFO (ref);
13076
13077           /* We need to unshare the binfos now so that lookups during class
13078              definition work.  */
13079           unshare_base_binfos (base_binfo);
13080
13081           SET_CLASSTYPE_MARKED (basetype);
13082
13083           /* We are free to modify these bits because they are meaningless
13084              at top level, and BASETYPE is a top-level type.  */
13085           if (via_virtual || TYPE_USES_VIRTUAL_BASECLASSES (basetype))
13086             {
13087               TYPE_USES_VIRTUAL_BASECLASSES (ref) = 1;
13088               /* Converting to a virtual base class requires looking
13089                  up the offset of the virtual base.  */
13090               TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref) = 1;
13091             }
13092
13093           if (CLASS_TYPE_P (basetype))
13094             {
13095               TYPE_HAS_NEW_OPERATOR (ref)
13096                 |= TYPE_HAS_NEW_OPERATOR (basetype);
13097               TYPE_HAS_ARRAY_NEW_OPERATOR (ref)
13098                 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype);
13099               TYPE_GETS_DELETE (ref) |= TYPE_GETS_DELETE (basetype);
13100               /* If the base-class uses multiple inheritance, so do we.  */
13101               TYPE_USES_MULTIPLE_INHERITANCE (ref)
13102                 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype);
13103               /* Likewise, if converting to a base of the base may require
13104                  code, then we may need to generate code to convert to a
13105                  base as well.  */
13106               TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref)
13107                 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype);
13108             }
13109
13110           i += 1;
13111         }
13112     }
13113   if (i)
13114     TREE_VEC_LENGTH (binfos) = i;
13115   else
13116     BINFO_BASETYPES (TYPE_BINFO (ref)) = NULL_TREE;
13117
13118   if (i > 1)
13119     {
13120       TYPE_USES_MULTIPLE_INHERITANCE (ref) = 1;
13121       /* If there is more than one non-empty they cannot be at the same
13122          address.  */
13123       TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref) = 1;
13124     }
13125
13126   /* Unmark all the types.  */
13127   while (--i >= 0)
13128     CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos, i)));
13129   CLEAR_CLASSTYPE_MARKED (ref);
13130
13131   /* Now that we know all the base-classes, set up the list of virtual
13132      bases.  */
13133   get_vbase_types (ref);
13134 }
13135
13136 \f
13137 /* Begin compiling the definition of an enumeration type.
13138    NAME is its name (or null if anonymous).
13139    Returns the type object, as yet incomplete.
13140    Also records info about it so that build_enumerator
13141    may be used to declare the individual values as they are read.  */
13142
13143 tree
13144 start_enum (name)
13145      tree name;
13146 {
13147   register tree enumtype = NULL_TREE;
13148   struct binding_level *b = current_binding_level;
13149
13150   /* If this is the real definition for a previous forward reference,
13151      fill in the contents in the same object that used to be the
13152      forward reference.  */
13153
13154   if (name != NULL_TREE)
13155     enumtype = lookup_tag (ENUMERAL_TYPE, name, b, 1);
13156
13157   if (enumtype != NULL_TREE && TREE_CODE (enumtype) == ENUMERAL_TYPE)
13158     {
13159       cp_error ("multiple definition of `%#T'", enumtype);
13160       cp_error_at ("previous definition here", enumtype);
13161       /* Clear out TYPE_VALUES, and start again.  */
13162       TYPE_VALUES (enumtype) = NULL_TREE;
13163     }
13164   else
13165     {
13166       enumtype = make_node (ENUMERAL_TYPE);
13167       pushtag (name, enumtype, 0);
13168     }
13169
13170   if (current_class_type)
13171     TREE_ADDRESSABLE (b->tags) = 1;
13172
13173   GNU_xref_decl (current_function_decl, enumtype);
13174   return enumtype;
13175 }
13176
13177 /* After processing and defining all the values of an enumeration type,
13178    install their decls in the enumeration type and finish it off.
13179    ENUMTYPE is the type object and VALUES a list of name-value pairs.
13180    Returns ENUMTYPE.  */
13181
13182 tree
13183 finish_enum (enumtype)
13184      tree enumtype;
13185 {
13186   register tree minnode = NULL_TREE, maxnode = NULL_TREE;
13187   /* Calculate the maximum value of any enumerator in this type.  */
13188
13189   tree values = TYPE_VALUES (enumtype);
13190   if (values)
13191     {
13192       tree pair;
13193
13194       for (pair = values; pair; pair = TREE_CHAIN (pair))
13195         {
13196           tree decl;
13197           tree value;
13198
13199           /* The TREE_VALUE is a CONST_DECL for this enumeration
13200              constant.  */
13201           decl = TREE_VALUE (pair);
13202
13203           /* [dcl.enum]
13204
13205              Following the closing brace of an enum-specifier, each
13206              enumerator has the type of its enumeration.  Prior to the
13207              closing brace, the type of each enumerator is the type of
13208              its initializing value.  */
13209           TREE_TYPE (decl) = enumtype;
13210
13211           /* The DECL_INITIAL will be NULL if we are processing a
13212              template declaration and this enumeration constant had no
13213              explicit initializer.  */
13214           value = DECL_INITIAL (decl);
13215           if (value && !processing_template_decl)
13216             {
13217               /* Set the TREE_TYPE for the VALUE as well.  That's so
13218                  that when we call decl_constant_value we get an
13219                  entity of the right type (but with the constant
13220                  value).  Since we shouldn't ever call
13221                  decl_constant_value on a template type, there's no
13222                  reason to do that when processing_template_decl.
13223                  And, if the expression is something like a
13224                  TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
13225                  wreak havoc on the intended type of the expression.
13226
13227                  Of course, there's also no point in trying to compute
13228                  minimum or maximum values if we're in a template.  */
13229               TREE_TYPE (value) = enumtype;
13230
13231               if (!minnode)
13232                 minnode = maxnode = value;
13233               else if (tree_int_cst_lt (maxnode, value))
13234                 maxnode = value;
13235               else if (tree_int_cst_lt (value, minnode))
13236                 minnode = value;
13237             }
13238
13239           if (processing_template_decl)
13240             /* If this is just a template, leave the CONST_DECL
13241                alone.  That way tsubst_copy will find CONST_DECLs for
13242                CONST_DECLs, and not INTEGER_CSTs.  */
13243             ;
13244           else
13245             /* In the list we're building up, we want the enumeration
13246                values, not the CONST_DECLs.  */
13247             TREE_VALUE (pair) = value;
13248         }
13249     }
13250   else
13251     maxnode = minnode = integer_zero_node;
13252
13253   TYPE_VALUES (enumtype) = nreverse (values);
13254
13255   if (processing_template_decl)
13256     {
13257       tree scope = current_scope ();
13258       if (scope && TREE_CODE (scope) == FUNCTION_DECL)
13259         add_tree (build_min (TAG_DEFN, enumtype));
13260     }
13261   else
13262     {
13263       int unsignedp = tree_int_cst_sgn (minnode) >= 0;
13264       int lowprec = min_precision (minnode, unsignedp);
13265       int highprec = min_precision (maxnode, unsignedp);
13266       int precision = MAX (lowprec, highprec);
13267       tree tem;
13268
13269       TYPE_SIZE (enumtype) = NULL_TREE;
13270
13271       /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'.  */
13272
13273       TYPE_PRECISION (enumtype) = precision;
13274       if (unsignedp)
13275         fixup_unsigned_type (enumtype);
13276       else
13277         fixup_signed_type (enumtype);
13278
13279       if (flag_short_enums || (precision > TYPE_PRECISION (integer_type_node)))
13280         /* Use the width of the narrowest normal C type which is wide
13281            enough.  */
13282         TYPE_PRECISION (enumtype) = TYPE_PRECISION (type_for_size
13283                                                     (precision, 1));
13284       else
13285         TYPE_PRECISION (enumtype) = TYPE_PRECISION (integer_type_node);
13286
13287       TYPE_SIZE (enumtype) = 0;
13288       layout_type (enumtype);
13289
13290       /* Fix up all variant types of this enum type.  */
13291       for (tem = TYPE_MAIN_VARIANT (enumtype); tem;
13292            tem = TYPE_NEXT_VARIANT (tem))
13293         {
13294           TYPE_VALUES (tem) = TYPE_VALUES (enumtype);
13295           TYPE_MIN_VALUE (tem) = TYPE_MIN_VALUE (enumtype);
13296           TYPE_MAX_VALUE (tem) = TYPE_MAX_VALUE (enumtype);
13297           TYPE_SIZE (tem) = TYPE_SIZE (enumtype);
13298           TYPE_SIZE_UNIT (tem) = TYPE_SIZE_UNIT (enumtype);
13299           TYPE_MODE (tem) = TYPE_MODE (enumtype);
13300           TYPE_PRECISION (tem) = TYPE_PRECISION (enumtype);
13301           TYPE_ALIGN (tem) = TYPE_ALIGN (enumtype);
13302           TYPE_USER_ALIGN (tem) = TYPE_USER_ALIGN (enumtype);
13303           TREE_UNSIGNED (tem) = TREE_UNSIGNED (enumtype);
13304         }
13305
13306       /* Finish debugging output for this type.  */
13307       rest_of_type_compilation (enumtype, namespace_bindings_p ());
13308     }
13309
13310   return enumtype;
13311 }
13312
13313 /* Build and install a CONST_DECL for an enumeration constant of the
13314    enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13315    Assignment of sequential values by default is handled here.  */
13316
13317 void
13318 build_enumerator (name, value, enumtype)
13319      tree name;
13320      tree value;
13321      tree enumtype;
13322 {
13323   tree decl;
13324   tree context;
13325   tree type;
13326   tree values;
13327
13328   /* Remove no-op casts from the value.  */
13329   if (value)
13330     STRIP_TYPE_NOPS (value);
13331
13332   if (! processing_template_decl)
13333     {
13334       /* Validate and default VALUE.  */
13335       if (value != NULL_TREE)
13336         {
13337           value = decl_constant_value (value);
13338
13339           if (TREE_CODE (value) == INTEGER_CST)
13340             {
13341               value = default_conversion (value);
13342               constant_expression_warning (value);
13343             }
13344           else
13345             {
13346               cp_error ("enumerator value for `%D' not integer constant", name);
13347               value = NULL_TREE;
13348             }
13349         }
13350
13351       /* Default based on previous value.  */
13352       if (value == NULL_TREE && ! processing_template_decl)
13353         {
13354           tree prev_value;
13355
13356           if (TYPE_VALUES (enumtype))
13357             {
13358               /* The next value is the previous value ... */
13359               prev_value = DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype)));
13360               /* ... plus one.  */
13361               value = build_binary_op (PLUS_EXPR,
13362                                        prev_value,
13363                                        integer_one_node);
13364
13365               if (tree_int_cst_lt (value, prev_value))
13366                 cp_error ("overflow in enumeration values at `%D'", name);
13367             }
13368           else
13369             value = integer_zero_node;
13370         }
13371
13372       /* Remove no-op casts from the value.  */
13373       if (value)
13374         STRIP_TYPE_NOPS (value);
13375 #if 0
13376       /* To fix MAX_VAL enum consts. (bkoz)  */
13377       TREE_TYPE (value) = integer_type_node;
13378 #endif
13379     }
13380
13381   /* We always have to copy here; not all INTEGER_CSTs are unshared.
13382      Even in other cases, we will later (in finish_enum) be setting
13383      the type of VALUE.  But, we don't need to make a copy if this
13384      VALUE is one of the enumeration constants for this same
13385      enumeration type.  */
13386   for (values = TYPE_VALUES (enumtype); values; values = TREE_CHAIN (values))
13387     if (TREE_VALUE (values) == value)
13388       break;
13389   /* If we didn't break out of the loop, then we do need a copy.  */
13390   if (!values && value)
13391     value = copy_node (value);
13392
13393   /* C++ associates enums with global, function, or class declarations.  */
13394   context = current_scope ();
13395
13396   /* Build the actual enumeration constant.  Note that the enumeration
13397     constants have the type of their initializers until the
13398     enumeration is complete:
13399
13400       [ dcl.enum ]
13401
13402       Following the closing brace of an enum-specifier, each enumer-
13403       ator has the type of its enumeration.  Prior to the closing
13404       brace, the type of each enumerator is the type of its
13405       initializing value.
13406
13407     In finish_enum we will reset the type.  Of course, if we're
13408     processing a template, there may be no value.   */
13409   type = value ? TREE_TYPE (value) : NULL_TREE;
13410
13411   if (context && context == current_class_type)
13412     /* This enum declaration is local to the class.  We need the full
13413       lang_decl so that we can record DECL_CLASS_CONTEXT, for example.  */
13414     decl = build_lang_decl (CONST_DECL, name, type);
13415   else
13416     /* It's a global enum, or it's local to a function.  (Note local to
13417       a function could mean local to a class method.  */
13418     decl = build_decl (CONST_DECL, name, type);
13419
13420   DECL_CONTEXT (decl) = FROB_CONTEXT (context);
13421   DECL_INITIAL (decl) = value;
13422   TREE_READONLY (decl) = 1;
13423
13424   if (context && context == current_class_type)
13425     /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13426       on the TYPE_FIELDS list for `S'.  (That's so that you can say
13427       things like `S::i' later.)  */
13428     finish_member_declaration (decl);
13429   else
13430     {
13431       pushdecl (decl);
13432       GNU_xref_decl (current_function_decl, decl);
13433     }
13434
13435   /* Add this enumeration constant to the list for this type.  */
13436   TYPE_VALUES (enumtype) = tree_cons (name, decl, TYPE_VALUES (enumtype));
13437 }
13438
13439 \f
13440 static int function_depth;
13441
13442 /* We're defining DECL.  Make sure that it's type is OK.  */
13443
13444 static void
13445 check_function_type (decl)
13446      tree decl;
13447 {
13448   tree fntype = TREE_TYPE (decl);
13449   tree return_type = complete_type (TREE_TYPE (fntype));
13450
13451   /* In a function definition, arg types must be complete.  */
13452   require_complete_types_for_parms (current_function_parms);
13453
13454   if (!COMPLETE_OR_VOID_TYPE_P (return_type))
13455     {
13456       cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype));
13457
13458       /* Make it return void instead, but don't change the
13459          type of the DECL_RESULT, in case we have a named return value.  */
13460       if (TREE_CODE (fntype) == METHOD_TYPE)
13461         {
13462           tree ctype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype)));
13463           TREE_TYPE (decl)
13464             = build_cplus_method_type (ctype,
13465                                        void_type_node,
13466                                        FUNCTION_ARG_CHAIN (decl));
13467         }
13468       else
13469         TREE_TYPE (decl)
13470           = build_function_type (void_type_node,
13471                                  TYPE_ARG_TYPES (TREE_TYPE (decl)));
13472       TREE_TYPE (decl)
13473         = build_exception_variant (fntype,
13474                                    TYPE_RAISES_EXCEPTIONS (fntype));
13475     }
13476   else
13477     abstract_virtuals_error (decl, TREE_TYPE (fntype));
13478 }
13479
13480 /* Create the FUNCTION_DECL for a function definition.
13481    DECLSPECS and DECLARATOR are the parts of the declaration;
13482    they describe the function's name and the type it returns,
13483    but twisted together in a fashion that parallels the syntax of C.
13484
13485    FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13486    DECLARATOR is really the DECL for the function we are about to
13487    process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13488    indicating that the function is an inline defined in-class, and
13489    SF_EXPAND indicating that we should generate RTL for this
13490    function.
13491
13492    This function creates a binding context for the function body
13493    as well as setting up the FUNCTION_DECL in current_function_decl.
13494
13495    Returns 1 on success.  If the DECLARATOR is not suitable for a function
13496    (it defines a datum instead), we return 0, which tells
13497    yyparse to report a parse error.
13498
13499    For C++, we must first check whether that datum makes any sense.
13500    For example, "class A local_a(1,2);" means that variable local_a
13501    is an aggregate of type A, which should have a constructor
13502    applied to it with the argument list [1, 2].  */
13503
13504 int
13505 start_function (declspecs, declarator, attrs, flags)
13506      tree declspecs, declarator, attrs;
13507      int flags;
13508 {
13509   tree decl1;
13510   tree ctype = NULL_TREE;
13511   tree fntype;
13512   tree restype;
13513   extern int have_extern_spec;
13514   extern int used_extern_spec;
13515   int doing_friend = 0;
13516   struct binding_level *bl;
13517
13518   /* Sanity check.  */
13519   my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node)) == VOID_TYPE, 160);
13520   my_friendly_assert (TREE_CHAIN (void_list_node) == NULL_TREE, 161);
13521
13522   /* This should only be done once on the top most decl.  */
13523   if (have_extern_spec && !used_extern_spec)
13524     {
13525       declspecs = decl_tree_cons (NULL_TREE, get_identifier ("extern"), declspecs);
13526       used_extern_spec = 1;
13527     }
13528
13529   if (flags & SF_PRE_PARSED)
13530     {
13531       decl1 = declarator;
13532
13533       fntype = TREE_TYPE (decl1);
13534       if (TREE_CODE (fntype) == METHOD_TYPE)
13535         ctype = TYPE_METHOD_BASETYPE (fntype);
13536
13537       /* ISO C++ 11.4/5.  A friend function defined in a class is in
13538          the (lexical) scope of the class in which it is defined.  */
13539       if (!ctype && DECL_FRIEND_P (decl1))
13540         {
13541           ctype = DECL_FRIEND_CONTEXT (decl1);
13542
13543           /* CTYPE could be null here if we're dealing with a template;
13544              for example, `inline friend float foo()' inside a template
13545              will have no CTYPE set.  */
13546           if (ctype && TREE_CODE (ctype) != RECORD_TYPE)
13547             ctype = NULL_TREE;
13548           else
13549             doing_friend = 1;
13550         }
13551
13552       last_function_parms = DECL_ARGUMENTS (decl1);
13553       last_function_parm_tags = NULL_TREE;
13554     }
13555   else
13556     {
13557       decl1 = grokdeclarator (declarator, declspecs, FUNCDEF, 1, NULL_TREE);
13558       /* If the declarator is not suitable for a function definition,
13559          cause a syntax error.  */
13560       if (decl1 == NULL_TREE || TREE_CODE (decl1) != FUNCTION_DECL) return 0;
13561
13562       fntype = TREE_TYPE (decl1);
13563
13564       restype = TREE_TYPE (fntype);
13565       if (CLASS_TYPE_P (restype) && !CLASSTYPE_GOT_SEMICOLON (restype))
13566         {
13567           cp_error ("semicolon missing after declaration of `%#T'", restype);
13568           shadow_tag (build_tree_list (NULL_TREE, restype));
13569           CLASSTYPE_GOT_SEMICOLON (restype) = 1;
13570           if (TREE_CODE (fntype) == FUNCTION_TYPE)
13571             fntype = build_function_type (integer_type_node,
13572                                           TYPE_ARG_TYPES (fntype));
13573           else
13574             fntype = build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype), TREE_READONLY (decl1), TREE_SIDE_EFFECTS (decl1)),
13575                                               integer_type_node,
13576                                               TYPE_ARG_TYPES (fntype));
13577           TREE_TYPE (decl1) = fntype;
13578         }
13579
13580       if (TREE_CODE (fntype) == METHOD_TYPE)
13581         ctype = TYPE_METHOD_BASETYPE (fntype);
13582       else if (DECL_MAIN_P (decl1))
13583         {
13584           /* If this doesn't return integer_type, complain.  */
13585           if (TREE_TYPE (TREE_TYPE (decl1)) != integer_type_node)
13586             {
13587               if (pedantic || warn_return_type)
13588                 pedwarn ("return type for `main' changed to `int'");
13589               TREE_TYPE (decl1) = fntype = default_function_type;
13590             }
13591         }
13592     }
13593
13594   /* Sometimes we don't notice that a function is a static member, and
13595      build a METHOD_TYPE for it.  Fix that up now.  */
13596   if (ctype != NULL_TREE && DECL_STATIC_FUNCTION_P (decl1)
13597       && TREE_CODE (TREE_TYPE (decl1)) == METHOD_TYPE)
13598     {
13599       revert_static_member_fn (decl1);
13600       last_function_parms = TREE_CHAIN (last_function_parms);
13601       ctype = NULL_TREE;
13602     }
13603
13604   /* Warn if function was previously implicitly declared
13605      (but not if we warned then).  */
13606   if (! warn_implicit
13607       && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)) != NULL_TREE)
13608     cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)));
13609
13610   /* Set up current_class_type, and enter the scope of the class, if
13611      appropriate.  */
13612   if (ctype)
13613     push_nested_class (ctype, 1);
13614   else if (DECL_STATIC_FUNCTION_P (decl1))
13615     push_nested_class (DECL_CONTEXT (decl1), 2);
13616
13617   /* Now that we have entered the scope of the class, we must restore
13618      the bindings for any template parameters surrounding DECL1, if it
13619      is an inline member template.  (Order is important; consider the
13620      case where a template parameter has the same name as a field of
13621      the class.)  It is not until after this point that
13622      PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly.  */
13623   if (flags & SF_INCLASS_INLINE)
13624     maybe_begin_member_template_processing (decl1);
13625
13626   /* Effective C++ rule 15.  See also c_expand_return.  */
13627   if (warn_ecpp
13628       && DECL_OVERLOADED_OPERATOR_P (decl1) == NOP_EXPR
13629       && TREE_CODE (TREE_TYPE (fntype)) == VOID_TYPE)
13630     cp_warning ("`operator=' should return a reference to `*this'");
13631
13632   /* Make the init_value nonzero so pushdecl knows this is not tentative.
13633      error_mark_node is replaced below (in poplevel) with the BLOCK.  */
13634   if (!DECL_INITIAL (decl1))
13635     DECL_INITIAL (decl1) = error_mark_node;
13636
13637 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13638   SET_DEFAULT_DECL_ATTRIBUTES (decl1, attrs);
13639 #endif
13640
13641   /* This function exists in static storage.
13642      (This does not mean `static' in the C sense!)  */
13643   TREE_STATIC (decl1) = 1;
13644
13645   /* We must call push_template_decl after current_class_type is set
13646      up.  (If we are processing inline definitions after exiting a
13647      class scope, current_class_type will be NULL_TREE until set above
13648      by push_nested_class.)  */
13649   if (processing_template_decl)
13650     decl1 = push_template_decl (decl1);
13651
13652   /* We are now in the scope of the function being defined.  */
13653   current_function_decl = decl1;
13654
13655   /* Save the parm names or decls from this function's declarator
13656      where store_parm_decls will find them.  */
13657   current_function_parms = last_function_parms;
13658   current_function_parm_tags = last_function_parm_tags;
13659
13660   /* Make sure the parameter and return types are reasonable.  When
13661      you declare a function, these types can be incomplete, but they
13662      must be complete when you define the function.  */
13663   if (! processing_template_decl)
13664     check_function_type (decl1);
13665
13666   /* Build the return declaration for the function.  */
13667   restype = TREE_TYPE (fntype);
13668   if (!processing_template_decl)
13669     {
13670       if (!DECL_RESULT (decl1))
13671         {
13672           DECL_RESULT (decl1)
13673             = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype));
13674           c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype),
13675                                       DECL_RESULT (decl1));
13676         }
13677     }
13678   else
13679     /* Just use `void'.  Nobody will ever look at this anyhow.  */
13680     DECL_RESULT (decl1) = build_decl (RESULT_DECL, 0, void_type_node);
13681
13682   /* Initialize RTL machinery.  We cannot do this until
13683      CURRENT_FUNCTION_DECL and DECL_RESULT are set up.  We do this
13684      even when processing a template; this is how we get
13685      CFUN set up, and our per-function variables initialized.  */
13686   bl = current_binding_level;
13687   init_function_start (decl1, input_filename, lineno);
13688   current_binding_level = bl;
13689   expanding_p = (flags & SF_EXPAND) != 0;
13690
13691   /* Even though we're inside a function body, we still don't want to
13692      call expand_expr to calculate the size of a variable-sized array.
13693      We haven't necessarily assigned RTL to all variables yet, so it's
13694      not safe to try to expand expressions involving them.  */
13695   immediate_size_expand = 0;
13696   cfun->x_dont_save_pending_sizes_p = 1;
13697
13698   /* If we're building a statement-tree, start the tree now.  */
13699   if (processing_template_decl || !expanding_p)
13700     begin_stmt_tree (&DECL_SAVED_TREE (decl1));
13701
13702   /* Let the user know we're compiling this function.  */
13703   announce_function (decl1);
13704
13705   /* Record the decl so that the function name is defined.
13706      If we already have a decl for this name, and it is a FUNCTION_DECL,
13707      use the old decl.  */
13708   if (!processing_template_decl && !(flags & SF_PRE_PARSED))
13709     {
13710       /* A specialization is not used to guide overload resolution.  */
13711       if (!DECL_TEMPLATE_SPECIALIZATION (decl1)
13712           && ! DECL_FUNCTION_MEMBER_P (decl1))
13713         decl1 = pushdecl (decl1);
13714       else
13715         {
13716           /* We need to set the DECL_CONTEXT. */
13717           if (!DECL_CONTEXT (decl1) && DECL_TEMPLATE_INFO (decl1))
13718             DECL_CONTEXT (decl1) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1));
13719           /* And make sure we have enough default args.  */
13720           check_default_args (decl1);
13721         }
13722       fntype = TREE_TYPE (decl1);
13723     }
13724
13725   /* Reset these in case the call to pushdecl changed them.  */
13726   current_function_decl = decl1;
13727   cfun->decl = decl1;
13728
13729   /* Initialize the per-function data.  */
13730   if (!DECL_PENDING_INLINE_P (decl1) && DECL_SAVED_FUNCTION_DATA (decl1))
13731     {
13732       /* If we already parsed this function, and we're just expanding it
13733          now, restore saved state.  */
13734       struct binding_level *bl = current_binding_level;
13735       *cp_function_chain = *DECL_SAVED_FUNCTION_DATA (decl1);
13736       current_binding_level = bl;
13737
13738       /* This function is being processed in whole-function mode; we
13739          already did semantic analysis.  */
13740       cfun->x_whole_function_mode_p = 1;
13741
13742       /* If we decided that we didn't want to inline this function,
13743          make sure the back-end knows that.  */
13744       if (!current_function_cannot_inline)
13745         current_function_cannot_inline = cp_function_chain->cannot_inline;
13746
13747       /* We don't need the saved data anymore.  */
13748       free (DECL_SAVED_FUNCTION_DATA (decl1));
13749       DECL_SAVED_FUNCTION_DATA (decl1) = NULL;
13750     }
13751   else if (ctype && !doing_friend && !DECL_STATIC_FUNCTION_P (decl1))
13752     {
13753       /* We know that this was set up by `grokclassfn'.  We do not
13754          wait until `store_parm_decls', since evil parse errors may
13755          never get us to that point.  Here we keep the consistency
13756          between `current_class_type' and `current_class_ptr'.  */
13757       tree t = DECL_ARGUMENTS (decl1);
13758
13759       my_friendly_assert (t != NULL_TREE && TREE_CODE (t) == PARM_DECL,
13760                           162);
13761       my_friendly_assert (TREE_CODE (TREE_TYPE (t)) == POINTER_TYPE,
13762                           19990811);
13763
13764       cp_function_chain->x_current_class_ref
13765         = build_indirect_ref (t, NULL_PTR);
13766       cp_function_chain->x_current_class_ptr = t;
13767
13768       /* Constructors and destructors need to know whether they're "in
13769          charge" of initializing virtual base classes.  */
13770       if (DECL_HAS_IN_CHARGE_PARM_P (decl1))
13771         current_in_charge_parm = TREE_CHAIN (t);
13772     }
13773
13774   if (DECL_INTERFACE_KNOWN (decl1))
13775     {
13776       tree ctx = decl_function_context (decl1);
13777
13778       if (DECL_NOT_REALLY_EXTERN (decl1))
13779         DECL_EXTERNAL (decl1) = 0;
13780
13781       if (ctx != NULL_TREE && DECL_THIS_INLINE (ctx)
13782           && TREE_PUBLIC (ctx))
13783         /* This is a function in a local class in an extern inline
13784            function.  */
13785         comdat_linkage (decl1);
13786     }
13787   /* If this function belongs to an interface, it is public.
13788      If it belongs to someone else's interface, it is also external.
13789      This only affects inlines and template instantiations.  */
13790   else if (interface_unknown == 0
13791            && (! DECL_TEMPLATE_INSTANTIATION (decl1)
13792                || flag_alt_external_templates))
13793     {
13794       if (DECL_THIS_INLINE (decl1) || DECL_TEMPLATE_INSTANTIATION (decl1)
13795           || processing_template_decl)
13796         {
13797           DECL_EXTERNAL (decl1)
13798             = (interface_only
13799                || (DECL_THIS_INLINE (decl1) && ! flag_implement_inlines
13800                    && !DECL_VINDEX (decl1)));
13801
13802           /* For WIN32 we also want to put these in linkonce sections.  */
13803           maybe_make_one_only (decl1);
13804         }
13805       else
13806         DECL_EXTERNAL (decl1) = 0;
13807       DECL_NOT_REALLY_EXTERN (decl1) = 0;
13808       DECL_INTERFACE_KNOWN (decl1) = 1;
13809     }
13810   else if (interface_unknown && interface_only
13811            && (! DECL_TEMPLATE_INSTANTIATION (decl1)
13812                || flag_alt_external_templates))
13813     {
13814       /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13815          interface, we will have interface_only set but not
13816          interface_known.  In that case, we don't want to use the normal
13817          heuristics because someone will supply a #pragma implementation
13818          elsewhere, and deducing it here would produce a conflict.  */
13819       comdat_linkage (decl1);
13820       DECL_EXTERNAL (decl1) = 0;
13821       DECL_INTERFACE_KNOWN (decl1) = 1;
13822       DECL_DEFER_OUTPUT (decl1) = 1;
13823     }
13824   else
13825     {
13826       /* This is a definition, not a reference.
13827          So clear DECL_EXTERNAL.  */
13828       DECL_EXTERNAL (decl1) = 0;
13829
13830       if ((DECL_THIS_INLINE (decl1) || DECL_TEMPLATE_INSTANTIATION (decl1))
13831           && ! DECL_INTERFACE_KNOWN (decl1)
13832           /* Don't try to defer nested functions for now.  */
13833           && ! decl_function_context (decl1))
13834         DECL_DEFER_OUTPUT (decl1) = 1;
13835       else
13836         DECL_INTERFACE_KNOWN (decl1) = 1;
13837     }
13838
13839   if (doing_semantic_analysis_p ())
13840     {
13841       pushlevel (0);
13842       current_binding_level->parm_flag = 1;
13843     }
13844
13845   if (attrs)
13846     cplus_decl_attributes (decl1, NULL_TREE, attrs);
13847
13848   if (!building_stmt_tree ())
13849     {
13850       GNU_xref_function (decl1, current_function_parms);
13851       make_function_rtl (decl1);
13852     }
13853
13854   /* Promote the value to int before returning it.  */
13855   if (C_PROMOTING_INTEGER_TYPE_P (restype))
13856     restype = type_promotes_to (restype);
13857
13858   /* If this fcn was already referenced via a block-scope `extern' decl
13859      (or an implicit decl), propagate certain information about the usage.  */
13860   if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1)))
13861     TREE_ADDRESSABLE (decl1) = 1;
13862
13863   if (DECL_RESULT (decl1) == NULL_TREE)
13864     {
13865       DECL_RESULT (decl1)
13866         = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype));
13867       TREE_READONLY (DECL_RESULT (decl1)) = CP_TYPE_CONST_P (restype);
13868       TREE_THIS_VOLATILE (DECL_RESULT (decl1)) = CP_TYPE_VOLATILE_P (restype);
13869     }
13870
13871   ++function_depth;
13872
13873   if (DECL_DESTRUCTOR_P (decl1))
13874     {
13875       dtor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13876       DECL_CONTEXT (dtor_label) = current_function_decl;
13877     }
13878   /* Under the old ABI we return `this' from constructors, so we make
13879      ordinary `return' statements in constructors jump to CTOR_LABEL;
13880      from there we return `this'.  Under the new ABI, we don't bother
13881      with any of this.  By not setting CTOR_LABEL the remainder of the
13882      machinery is automatically disabled.  */
13883   else if (!flag_new_abi && DECL_CONSTRUCTOR_P (decl1))
13884     {
13885       ctor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13886       DECL_CONTEXT (ctor_label) = current_function_decl;
13887     }
13888
13889   return 1;
13890 }
13891 \f
13892 /* Called after store_parm_decls for a function-try-block.  */
13893
13894 void
13895 expand_start_early_try_stmts ()
13896 {
13897   expand_start_try_stmts ();
13898 }
13899
13900 /* Store the parameter declarations into the current function declaration.
13901    This is called after parsing the parameter declarations, before
13902    digesting the body of the function.
13903
13904    Also install to binding contour return value identifier, if any.  */
13905
13906 void
13907 store_parm_decls ()
13908 {
13909   register tree fndecl = current_function_decl;
13910   register tree parm;
13911   int parms_have_cleanups = 0;
13912   tree cleanups = NULL_TREE;
13913
13914   /* This is a list of types declared among parms in a prototype.  */
13915   tree parmtags = current_function_parm_tags;
13916
13917   /* This is a chain of any other decls that came in among the parm
13918      declarations.  If a parm is declared with  enum {foo, bar} x;
13919      then CONST_DECLs for foo and bar are put here.  */
13920   tree nonparms = NULL_TREE;
13921
13922   /* Create a binding level for the parms.  */
13923   if (!building_stmt_tree ())
13924     expand_start_bindings (2);
13925
13926   if (current_function_parms)
13927     {
13928       /* This case is when the function was defined with an ANSI prototype.
13929          The parms already have decls, so we need not do anything here
13930          except record them as in effect
13931          and complain if any redundant old-style parm decls were written.  */
13932
13933       tree specparms = current_function_parms;
13934       tree next;
13935
13936       if (doing_semantic_analysis_p ())
13937         {
13938           /* Must clear this because it might contain TYPE_DECLs declared
13939              at class level.  */
13940           storedecls (NULL_TREE);
13941
13942           /* If we're doing semantic analysis, then we'll call pushdecl
13943              for each of these.  We must do them in reverse order so that
13944              they end in the correct forward order.  */
13945           specparms = nreverse (specparms);
13946         }
13947
13948       for (parm = specparms; parm; parm = next)
13949         {
13950           next = TREE_CHAIN (parm);
13951           if (TREE_CODE (parm) == PARM_DECL)
13952             {
13953               tree type = TREE_TYPE (parm);
13954
13955               if (doing_semantic_analysis_p ())
13956                 {
13957                   tree cleanup;
13958
13959                   if (DECL_NAME (parm) == NULL_TREE
13960                       || TREE_CODE (parm) != VOID_TYPE)
13961                     pushdecl (parm);
13962                   else
13963                     cp_error ("parameter `%D' declared void", parm);
13964
13965                   cleanup = (processing_template_decl
13966                              ? NULL_TREE
13967                              : maybe_build_cleanup (parm));
13968
13969                   if (cleanup)
13970                     cleanups = tree_cons (parm, cleanup, cleanups);
13971                 }
13972               else if (type != error_mark_node
13973                        && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
13974                 parms_have_cleanups = 1;
13975             }
13976           else
13977             {
13978               /* If we find an enum constant or a type tag,
13979                  put it aside for the moment.  */
13980               TREE_CHAIN (parm) = NULL_TREE;
13981               nonparms = chainon (nonparms, parm);
13982             }
13983         }
13984
13985       if (doing_semantic_analysis_p ())
13986         {
13987           /* Get the decls in their original chain order
13988              and record in the function.  This is all and only the
13989              PARM_DECLs that were pushed into scope by the loop above.  */
13990           DECL_ARGUMENTS (fndecl) = getdecls ();
13991           storetags (chainon (parmtags, gettags ()));
13992         }
13993     }
13994   else
13995     DECL_ARGUMENTS (fndecl) = NULL_TREE;
13996
13997   /* Now store the final chain of decls for the arguments
13998      as the decl-chain of the current lexical scope.
13999      Put the enumerators in as well, at the front so that
14000      DECL_ARGUMENTS is not modified.  */
14001   if (doing_semantic_analysis_p ())
14002     storedecls (chainon (nonparms, DECL_ARGUMENTS (fndecl)));
14003
14004   /* Initialize the RTL code for the function.  */
14005   DECL_SAVED_INSNS (fndecl) = 0;
14006   if (! building_stmt_tree ())
14007     expand_function_start (fndecl, parms_have_cleanups);
14008
14009   current_function_parms_stored = 1;
14010
14011   /* If this function is `main', emit a call to `__main'
14012      to run global initializers, etc.  */
14013   if (DECL_MAIN_P (fndecl) && !building_stmt_tree ())
14014     expand_main_function ();
14015
14016   /* Now that we have initialized the parms, we can start their
14017      cleanups.  We cannot do this before, since expand_decl_cleanup
14018      should not be called before the parm can be used.  */
14019   while (cleanups)
14020     {
14021       finish_decl_cleanup (TREE_PURPOSE (cleanups),
14022                            TREE_VALUE (cleanups));
14023       cleanups = TREE_CHAIN (cleanups);
14024     }
14025
14026   /* Create a binding contour which can be used to catch
14027      cleanup-generated temporaries.  Also, if the return value needs or
14028      has initialization, deal with that now.  */
14029   if (parms_have_cleanups)
14030     {
14031       pushlevel (0);
14032       if (!building_stmt_tree ())
14033         expand_start_bindings (2);
14034     }
14035
14036   /* Do the starting of the exception specifications, if we have any.  */
14037   if (flag_exceptions && !processing_template_decl
14038       && flag_enforce_eh_specs
14039       && building_stmt_tree ()
14040       && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl)))
14041     current_eh_spec_try_block = expand_start_eh_spec ();
14042 }
14043
14044 /* Bind a name and initialization to the return value of
14045    the current function.  */
14046
14047 void
14048 store_return_init (decl)
14049      tree decl;
14050 {
14051   /* If this named return value comes in a register, put it in a
14052      pseudo-register.  */
14053   if (DECL_REGISTER (decl))
14054     {
14055       original_result_rtx = DECL_RTL (decl);
14056       /* Note that the mode of the old DECL_RTL may be wider than the
14057          mode of DECL_RESULT, depending on the calling conventions for
14058          the processor.  For example, on the Alpha, a 32-bit integer
14059          is returned in a DImode register -- the DECL_RESULT has
14060          SImode but the DECL_RTL for the DECL_RESULT has DImode.  So,
14061          here, we use the mode the back-end has already assigned for
14062          the return value.  */
14063       DECL_RTL (decl) = gen_reg_rtx (GET_MODE (original_result_rtx));
14064       if (TREE_ADDRESSABLE (decl))
14065         put_var_into_stack (decl);
14066     }
14067 }
14068
14069 \f
14070 /* We have finished doing semantic analysis on DECL, but have not yet
14071    generated RTL for its body.  Save away our current state, so that
14072    when we want to generate RTL later we know what to do.  */
14073
14074 static void
14075 save_function_data (decl)
14076      tree decl;
14077 {
14078   struct language_function *f;
14079
14080   /* Save the language-specific per-function data so that we can
14081      get it back when we really expand this function.  */
14082   my_friendly_assert (!DECL_PENDING_INLINE_P (decl),
14083                       19990908);
14084
14085   /* Make a copy.  */
14086   f = ((struct language_function *)
14087        xmalloc (sizeof (struct language_function)));
14088   bcopy ((char *) cp_function_chain, (char *) f,
14089          sizeof (struct language_function));
14090   DECL_SAVED_FUNCTION_DATA (decl) = f;
14091
14092   /* Clear out the bits we don't need.  */
14093   f->x_stmt_tree.x_last_stmt = NULL_TREE;
14094   f->x_stmt_tree.x_last_expr_type = NULL_TREE;
14095   f->x_result_rtx = NULL_RTX;
14096   f->x_named_label_uses = NULL;
14097   f->bindings = NULL;
14098
14099   /* When we get back here again, we will be expanding.  */
14100   f->x_expanding_p = 1;
14101
14102   /* If we've already decided that we cannot inline this function, we
14103      must remember that fact when we actually go to expand the
14104      function.  */
14105   f->cannot_inline = current_function_cannot_inline;
14106 }
14107
14108 /* At the end of every constructor we generate to code to return
14109    `this'.  Do that now.  */
14110
14111 static void
14112 finish_constructor_body ()
14113 {
14114   /* Any return from a constructor will end up here.  */
14115   if (ctor_label)
14116     add_tree (build_min_nt (LABEL_STMT, ctor_label));
14117
14118   /* Clear CTOR_LABEL so that finish_return_stmt knows to really
14119      generate the return, rather than a goto to CTOR_LABEL.  */
14120   ctor_label = NULL_TREE;
14121   /* In check_return_expr we translate an empty return from a
14122      constructor to a return of `this'.  */
14123   finish_return_stmt (NULL_TREE);
14124   /* Mark the end of the constructor.  */
14125   add_tree (build_min_nt (CTOR_STMT));
14126 }
14127
14128 /* At the end of every destructor we generate code to restore virtual
14129    function tables to the values desired by base classes and to call
14130    to base class destructors.  Do that now.  */
14131
14132 static void
14133 finish_destructor_body ()
14134 {
14135   tree compound_stmt;
14136   tree virtual_size;
14137   tree exprstmt;
14138   tree if_stmt;
14139
14140   /* Create a block to contain all the extra code.  */
14141   compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
14142
14143   /* Any return from a destructor will end up here.  */
14144   add_tree (build_min_nt (LABEL_STMT, dtor_label));
14145
14146   /* Generate the code to call destructor on base class.  If this
14147      destructor belongs to a class with virtual functions, then set
14148      the virtual function table pointer to represent the type of our
14149      base class.  */
14150
14151   /* This side-effect makes call to `build_delete' generate the code
14152      we have to have at the end of this destructor.  `build_delete'
14153      will set the flag again.  */
14154   TYPE_HAS_DESTRUCTOR (current_class_type) = 0;
14155
14156   exprstmt = build_delete (current_class_type,
14157                            current_class_ref,
14158                            sfk_base_destructor,
14159                            LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
14160                            0);
14161
14162   if (exprstmt != error_mark_node
14163       && (TREE_CODE (exprstmt) != NOP_EXPR
14164           || TREE_OPERAND (exprstmt, 0) != integer_zero_node
14165           || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type)))
14166     {
14167       if (exprstmt != void_zero_node)
14168         /* Don't call `expand_expr_stmt' if we're not going to do
14169            anything, since -Wall will give a diagnostic.  */
14170         finish_expr_stmt (exprstmt);
14171
14172       /* Run destructors for all virtual baseclasses.  */
14173       if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
14174         {
14175           tree vbases;
14176           tree if_stmt;
14177
14178           if_stmt = begin_if_stmt ();
14179           finish_if_stmt_cond (build (BIT_AND_EXPR, integer_type_node,
14180                                       current_in_charge_parm,
14181                                       integer_two_node),
14182                                if_stmt);
14183
14184           vbases = CLASSTYPE_VBASECLASSES (current_class_type);
14185           /* The CLASSTYPE_VBASECLASSES list is in initialization
14186              order, so we have to march through it in reverse order.  */
14187           for (vbases = nreverse (copy_list (vbases));
14188                vbases;
14189                vbases = TREE_CHAIN (vbases))
14190             {
14191               tree vbase = TREE_VALUE (vbases);
14192
14193               if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (vbase)))
14194                 {
14195                   tree vb = get_vbase
14196                     (BINFO_TYPE (vbase),
14197                      TYPE_BINFO (current_class_type));
14198                   finish_expr_stmt
14199                     (build_scoped_method_call
14200                      (current_class_ref, vb, base_dtor_identifier,
14201                       NULL_TREE));
14202                 }
14203             }
14204
14205           finish_then_clause (if_stmt);
14206           finish_if_stmt ();
14207         }
14208     }
14209
14210   virtual_size = c_sizeof (current_class_type);
14211
14212   /* At the end, call delete if that's what's requested.  */
14213
14214   /* FDIS sez: At the point of definition of a virtual destructor
14215      (including an implicit definition), non-placement operator delete
14216      shall be looked up in the scope of the destructor's class and if
14217      found shall be accessible and unambiguous.
14218
14219      This is somewhat unclear, but I take it to mean that if the class
14220      only defines placement deletes we don't do anything here.  So we
14221      pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
14222      they ever try to delete one of these.  */
14223   exprstmt = build_op_delete_call
14224     (DELETE_EXPR, current_class_ptr, virtual_size,
14225      LOOKUP_NORMAL | LOOKUP_SPECULATIVELY, NULL_TREE);
14226
14227   if_stmt = begin_if_stmt ();
14228   finish_if_stmt_cond (build (BIT_AND_EXPR, integer_type_node,
14229                               current_in_charge_parm,
14230                               integer_one_node),
14231                        if_stmt);
14232   finish_expr_stmt (exprstmt);
14233   finish_then_clause (if_stmt);
14234   finish_if_stmt ();
14235
14236   /* Close the block we started above.  */
14237   finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
14238 }
14239
14240 /* Finish up a function declaration and compile that function
14241    all the way to assembler language output.  The free the storage
14242    for the function definition.
14243
14244    FLAGS is a bitwise or of the following values:
14245      1 - CALL_POPLEVEL
14246        An extra call to poplevel (and expand_end_bindings) must be
14247        made to take care of the binding contour for the base
14248        initializers.  This is only relevant for constructors.
14249      2 - INCLASS_INLINE
14250        We just finished processing the body of an in-class inline
14251        function definition.  (This processing will have taken place
14252        after the class definition is complete.)  */
14253
14254 tree
14255 finish_function (flags)
14256      int flags;
14257 {
14258   register tree fndecl = current_function_decl;
14259   tree fntype, ctype = NULL_TREE;
14260   /* Label to use if this function is supposed to return a value.  */
14261   tree no_return_label = NULL_TREE;
14262   int call_poplevel = (flags & 1) != 0;
14263   int inclass_inline = (flags & 2) != 0;
14264   int expand_p;
14265   int nested;
14266   int current_line = lineno;
14267
14268   /* When we get some parse errors, we can end up without a
14269      current_function_decl, so cope.  */
14270   if (fndecl == NULL_TREE)
14271     return error_mark_node;
14272
14273   nested = function_depth > 1;
14274   fntype = TREE_TYPE (fndecl);
14275
14276   /*  TREE_READONLY (fndecl) = 1;
14277       This caused &foo to be of type ptr-to-const-function
14278       which then got a warning when stored in a ptr-to-function variable.  */
14279
14280   /* This happens on strange parse errors.  */
14281   if (! current_function_parms_stored)
14282     {
14283       call_poplevel = 0;
14284       store_parm_decls ();
14285     }
14286
14287   /* For a cloned function, we've already got all the code we need;
14288      there's no need to add any extra bits.  */
14289   if (building_stmt_tree () && DECL_CLONED_FUNCTION_P (fndecl))
14290     ;
14291   else if (building_stmt_tree ())
14292     {
14293       if (DECL_CONSTRUCTOR_P (fndecl))
14294         {
14295           finish_constructor_body ();
14296           if (call_poplevel)
14297             do_poplevel ();
14298         }
14299       else if (DECL_DESTRUCTOR_P (fndecl) && !processing_template_decl)
14300         finish_destructor_body ();
14301       else if (DECL_MAIN_P (fndecl))
14302         {
14303           /* Make it so that `main' always returns 0 by default.  */
14304 #ifdef VMS
14305           finish_return_stmt (integer_one_node);
14306 #else
14307           finish_return_stmt (integer_zero_node);
14308 #endif
14309         }
14310
14311       /* Finish dealing with exception specifiers.  */
14312       if (flag_exceptions && !processing_template_decl
14313           && flag_enforce_eh_specs
14314           && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl)))
14315         expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
14316                             (TREE_TYPE (current_function_decl)),
14317                             current_eh_spec_try_block);
14318     }
14319   else
14320     {
14321 #if 0
14322       if (write_symbols != NO_DEBUG /*&& TREE_CODE (fntype) != METHOD_TYPE*/)
14323         {
14324           /* Keep this code around in case we later want to control debug info
14325              based on whether a type is "used".  (jason 1999-11-11) */
14326
14327           tree ttype = target_type (fntype);
14328           tree parmdecl;
14329
14330           if (IS_AGGR_TYPE (ttype))
14331             /* Let debugger know it should output info for this type.  */
14332             note_debug_info_needed (ttype);
14333
14334           for (parmdecl = DECL_ARGUMENTS (fndecl); parmdecl; parmdecl = TREE_CHAIN (parmdecl))
14335             {
14336               ttype = target_type (TREE_TYPE (parmdecl));
14337               if (IS_AGGR_TYPE (ttype))
14338                 /* Let debugger know it should output info for this type.  */
14339                 note_debug_info_needed (ttype);
14340             }
14341         }
14342 #endif
14343
14344       /* Clean house because we will need to reorder insns here.  */
14345       do_pending_stack_adjust ();
14346
14347       if (dtor_label)
14348         ;
14349       else if (DECL_CONSTRUCTOR_P (fndecl))
14350         {
14351           if (call_poplevel)
14352             do_poplevel ();
14353         }
14354       else if (return_label != NULL_RTX
14355                && flag_this_is_variable <= 0
14356                && current_function_return_value == NULL_TREE
14357                && ! DECL_NAME (DECL_RESULT (current_function_decl)))
14358         no_return_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
14359
14360       if (flag_exceptions)
14361         expand_exception_blocks ();
14362
14363       /* If this function is supposed to return a value, ensure that
14364          we do not fall into the cleanups by mistake.  The end of our
14365          function will look like this:
14366
14367          user code (may have return stmt somewhere)
14368          goto no_return_label
14369          cleanup_label:
14370          cleanups
14371          goto return_label
14372          no_return_label:
14373          NOTE_INSN_FUNCTION_END
14374          return_label:
14375          things for return
14376
14377          If the user omits a return stmt in the USER CODE section, we
14378          will have a control path which reaches NOTE_INSN_FUNCTION_END.
14379          Otherwise, we won't.  */
14380       if (no_return_label)
14381         {
14382           DECL_CONTEXT (no_return_label) = fndecl;
14383           DECL_INITIAL (no_return_label) = error_mark_node;
14384           DECL_SOURCE_FILE (no_return_label) = input_filename;
14385           DECL_SOURCE_LINE (no_return_label) = current_line;
14386           expand_goto (no_return_label);
14387         }
14388
14389       if (cleanup_label)
14390         {
14391           /* Remove the binding contour which is used
14392              to catch cleanup-generated temporaries.  */
14393           expand_end_bindings (0, 0, 0);
14394           poplevel (0, 0, 0);
14395
14396           /* Emit label at beginning of cleanup code for parameters.  */
14397           emit_label (cleanup_label);
14398         }
14399
14400       /* Get return value into register if that's where it's supposed
14401          to be.  */
14402       if (original_result_rtx)
14403         fixup_result_decl (DECL_RESULT (fndecl), original_result_rtx);
14404
14405       /* Finish building code that will trigger warnings if users forget
14406          to make their functions return values.  */
14407       if (no_return_label || cleanup_label)
14408         emit_jump (return_label);
14409       if (no_return_label)
14410         {
14411           /* We don't need to call `expand_*_return' here because we
14412              don't need any cleanups here--this path of code is only
14413              for error checking purposes.  */
14414           expand_label (no_return_label);
14415         }
14416
14417       /* We hard-wired immediate_size_expand to zero in
14418          start_function.  Expand_function_end will decrement this
14419          variable.  So, we set the variable to one here, so that after
14420          the decrement it will remain zero.  */
14421       immediate_size_expand = 1;
14422
14423       /* Generate rtl for function exit.  */
14424       expand_function_end (input_filename, current_line, 1);
14425     }
14426
14427   /* We have to save this value here in case
14428      maybe_end_member_template_processing decides to pop all the
14429      template parameters.  */
14430   expand_p = !building_stmt_tree ();
14431
14432   /* If we're saving up tree structure, tie off the function now.  */
14433   if (!expand_p)
14434     finish_stmt_tree (&DECL_SAVED_TREE (fndecl));
14435
14436   /* This must come after expand_function_end because cleanups might
14437      have declarations (from inline functions) that need to go into
14438      this function's blocks.  */
14439   if (doing_semantic_analysis_p ())
14440     {
14441       if (current_binding_level->parm_flag != 1)
14442         my_friendly_abort (122);
14443       poplevel (1, 0, 1);
14444     }
14445
14446   /* Remember that we were in class scope.  */
14447   if (current_class_name)
14448     ctype = current_class_type;
14449
14450   /* Must mark the RESULT_DECL as being in this function.  */
14451   DECL_CONTEXT (DECL_RESULT (fndecl)) = fndecl;
14452
14453   /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14454      to the FUNCTION_DECL node itself.  */
14455   BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl;
14456
14457   /* Save away current state, if appropriate.  */
14458   if (!expanding_p && !processing_template_decl)
14459     save_function_data (fndecl);
14460
14461   /* If this function calls `setjmp' it cannot be inlined.  When
14462      `longjmp' is called it is not guaranteed to restore the value of
14463      local variables that have been modified since the call to
14464      `setjmp'.  So, if were to inline this function into some caller
14465      `c', then when we `longjmp', we might not restore all variables
14466      in `c'.  (It might seem, at first blush, that there's no way for
14467      this function to modify local variables in `c', but their
14468      addresses may have been stored somewhere accessible to this
14469      function.)  */
14470   if (!expanding_p && !processing_template_decl && calls_setjmp_p (fndecl))
14471     DECL_UNINLINABLE (fndecl) = 1;
14472
14473   if (expand_p)
14474     {
14475       int returns_null;
14476       int returns_value;
14477
14478       /* So we can tell if jump_optimize sets it to 1.  */
14479       can_reach_end = 0;
14480
14481       /* Before we call rest_of_compilation (which will pop the
14482          CURRENT_FUNCTION), we must save these values.  */
14483       returns_null = current_function_returns_null;
14484       returns_value = current_function_returns_value;
14485
14486       /* If this is a nested function (like a template instantiation
14487          that we're compiling in the midst of compiling something
14488          else), push a new GC context.  That will keep local variables
14489          on the stack from being collected while we're doing the
14490          compilation of this function.  */
14491       if (function_depth > 1)
14492         ggc_push_context ();
14493
14494       /* Run the optimizers and output the assembler code for this
14495          function.  */
14496       rest_of_compilation (fndecl);
14497
14498       /* Undo the call to ggc_push_context above.  */
14499       if (function_depth > 1)
14500         ggc_pop_context ();
14501
14502       if (DECL_SAVED_INSNS (fndecl) && ! TREE_ASM_WRITTEN (fndecl))
14503         {
14504           /* Set DECL_EXTERNAL so that assemble_external will be called as
14505              necessary.  We'll clear it again in finish_file.  */
14506           if (! DECL_EXTERNAL (fndecl))
14507             DECL_NOT_REALLY_EXTERN (fndecl) = 1;
14508           DECL_EXTERNAL (fndecl) = 1;
14509           defer_fn (fndecl);
14510         }
14511
14512 #if 0
14513       /* Keep this code around in case we later want to control debug info
14514          based on whether a type is "used".  (jason 1999-11-11) */
14515
14516       if (ctype && TREE_ASM_WRITTEN (fndecl))
14517         note_debug_info_needed (ctype);
14518 #endif
14519
14520       returns_null |= can_reach_end;
14521
14522       /* Since we don't normally go through c_expand_return for constructors,
14523          this normally gets the wrong value.
14524          Also, named return values have their return codes emitted after
14525          NOTE_INSN_FUNCTION_END, confusing jump.c.  */
14526       if (DECL_CONSTRUCTOR_P (fndecl)
14527           || DECL_NAME (DECL_RESULT (fndecl)) != NULL_TREE)
14528         returns_null = 0;
14529
14530       if (TREE_THIS_VOLATILE (fndecl) && returns_null)
14531         cp_warning ("`noreturn' function `%D' does return", fndecl);
14532       else if ((warn_return_type || pedantic)
14533                && returns_null
14534                && TREE_CODE (TREE_TYPE (fntype)) != VOID_TYPE)
14535         {
14536           /* If this function returns non-void and control can drop through,
14537              complain.  */
14538           cp_warning ("control reaches end of non-void function `%D'", fndecl);
14539         }
14540       /* With just -W, complain only if function returns both with
14541          and without a value.  */
14542       else if (extra_warnings && returns_value && returns_null)
14543         warning ("this function may return with or without a value");
14544     }
14545   else
14546     {
14547       /* Clear out memory we no longer need.  */
14548       free_after_parsing (cfun);
14549       /* Since we never call rest_of_compilation, we never clear
14550          CFUN.  Do so explicitly.  */
14551       free_after_compilation (cfun);
14552       cfun = NULL;
14553     }
14554
14555   /* If this is a in-class inline definition, we may have to pop the
14556      bindings for the template parameters that we added in
14557      maybe_begin_member_template_processing when start_function was
14558      called.  */
14559   if (inclass_inline)
14560     maybe_end_member_template_processing ();
14561
14562   /* Leave the scope of the class.  */
14563   if (ctype)
14564     pop_nested_class ();
14565
14566   --function_depth;
14567
14568   if (!DECL_SAVED_INSNS (fndecl) && !DECL_SAVED_FUNCTION_DATA (fndecl)
14569       && !(flag_inline_trees && DECL_INLINE (fndecl)))
14570     {
14571       tree t;
14572
14573       /* Stop pointing to the local nodes about to be freed.  */
14574       /* But DECL_INITIAL must remain nonzero so we know this
14575          was an actual function definition.  */
14576       DECL_INITIAL (fndecl) = error_mark_node;
14577       for (t = DECL_ARGUMENTS (fndecl); t; t = TREE_CHAIN (t))
14578         DECL_RTL (t) = DECL_INCOMING_RTL (t) = NULL_RTX;
14579     }
14580
14581   if (DECL_STATIC_CONSTRUCTOR (fndecl))
14582     static_ctors = tree_cons (NULL_TREE, fndecl, static_ctors);
14583   if (DECL_STATIC_DESTRUCTOR (fndecl))
14584     static_dtors = tree_cons (NULL_TREE, fndecl, static_dtors);
14585
14586   /* Clean up.  */
14587   if (! nested)
14588     {
14589       /* Let the error reporting routines know that we're outside a
14590          function.  For a nested function, this value is used in
14591          pop_cp_function_context and then reset via pop_function_context.  */
14592       current_function_decl = NULL_TREE;
14593       /* We don't really care about obstacks, but the middle-end
14594          sometimes cares on what obstck things are located.  */
14595       permanent_allocation (1);
14596     }
14597
14598   return fndecl;
14599 }
14600 \f
14601 /* Create the FUNCTION_DECL for a function definition.
14602    DECLSPECS and DECLARATOR are the parts of the declaration;
14603    they describe the return type and the name of the function,
14604    but twisted together in a fashion that parallels the syntax of C.
14605
14606    This function creates a binding context for the function body
14607    as well as setting up the FUNCTION_DECL in current_function_decl.
14608
14609    Returns a FUNCTION_DECL on success.
14610
14611    If the DECLARATOR is not suitable for a function (it defines a datum
14612    instead), we return 0, which tells yyparse to report a parse error.
14613
14614    May return void_type_node indicating that this method is actually
14615    a friend.  See grokfield for more details.
14616
14617    Came here with a `.pushlevel' .
14618
14619    DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14620    CHANGES TO CODE IN `grokfield'.  */
14621
14622 tree
14623 start_method (declspecs, declarator, attrlist)
14624      tree declarator, declspecs, attrlist;
14625 {
14626   tree fndecl = grokdeclarator (declarator, declspecs, MEMFUNCDEF, 0,
14627                                 attrlist);
14628
14629   /* Something too ugly to handle.  */
14630   if (fndecl == NULL_TREE)
14631     return NULL_TREE;
14632
14633   /* Pass friends other than inline friend functions back.  */
14634   if (fndecl == void_type_node)
14635     return fndecl;
14636
14637   if (TREE_CODE (fndecl) != FUNCTION_DECL)
14638     /* Not a function, tell parser to report parse error.  */
14639     return NULL_TREE;
14640
14641   if (DECL_IN_AGGR_P (fndecl))
14642     {
14643       if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl)) != current_class_type)
14644         {
14645           if (DECL_CONTEXT (fndecl)
14646               && TREE_CODE( DECL_CONTEXT (fndecl)) != NAMESPACE_DECL)
14647             cp_error ("`%D' is already defined in class %s", fndecl,
14648                              TYPE_NAME_STRING (DECL_CONTEXT (fndecl)));
14649         }
14650       return void_type_node;
14651     }
14652
14653   check_template_shadow (fndecl);
14654
14655   DECL_THIS_INLINE (fndecl) = 1;
14656
14657   if (flag_default_inline)
14658     DECL_INLINE (fndecl) = 1;
14659
14660   /* We process method specializations in finish_struct_1.  */
14661   if (processing_template_decl && !DECL_TEMPLATE_SPECIALIZATION (fndecl))
14662     fndecl = push_template_decl (fndecl);
14663
14664   if (! DECL_FRIEND_P (fndecl))
14665     {
14666       if (TREE_CHAIN (fndecl))
14667         {
14668           fndecl = copy_node (fndecl);
14669           TREE_CHAIN (fndecl) = NULL_TREE;
14670         }
14671
14672       if (DECL_CONSTRUCTOR_P (fndecl))
14673         {
14674           if (! grok_ctor_properties (current_class_type, fndecl))
14675             return void_type_node;
14676         }
14677       else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl)))
14678         grok_op_properties (fndecl, DECL_VIRTUAL_P (fndecl), 0);
14679     }
14680
14681   cp_finish_decl (fndecl, NULL_TREE, NULL_TREE, 0);
14682
14683   /* Make a place for the parms */
14684   pushlevel (0);
14685   current_binding_level->parm_flag = 1;
14686
14687   DECL_IN_AGGR_P (fndecl) = 1;
14688   return fndecl;
14689 }
14690
14691 /* Go through the motions of finishing a function definition.
14692    We don't compile this method until after the whole class has
14693    been processed.
14694
14695    FINISH_METHOD must return something that looks as though it
14696    came from GROKFIELD (since we are defining a method, after all).
14697
14698    This is called after parsing the body of the function definition.
14699    STMTS is the chain of statements that makes up the function body.
14700
14701    DECL is the ..._DECL that `start_method' provided.  */
14702
14703 tree
14704 finish_method (decl)
14705      tree decl;
14706 {
14707   register tree fndecl = decl;
14708   tree old_initial;
14709
14710   register tree link;
14711
14712   if (decl == void_type_node)
14713     return decl;
14714
14715   old_initial = DECL_INITIAL (fndecl);
14716
14717   /* Undo the level for the parms (from start_method).
14718      This is like poplevel, but it causes nothing to be
14719      saved.  Saving information here confuses symbol-table
14720      output routines.  Besides, this information will
14721      be correctly output when this method is actually
14722      compiled.  */
14723
14724   /* Clear out the meanings of the local variables of this level;
14725      also record in each decl which block it belongs to.  */
14726
14727   for (link = current_binding_level->names; link; link = TREE_CHAIN (link))
14728     {
14729       if (DECL_NAME (link) != NULL_TREE)
14730         pop_binding (DECL_NAME (link), link);
14731       my_friendly_assert (TREE_CODE (link) != FUNCTION_DECL, 163);
14732       DECL_CONTEXT (link) = NULL_TREE;
14733     }
14734
14735   GNU_xref_end_scope ((HOST_WIDE_INT) current_binding_level,
14736                       (HOST_WIDE_INT) current_binding_level->level_chain,
14737                       current_binding_level->parm_flag,
14738                       current_binding_level->keep);
14739
14740   poplevel (0, 0, 0);
14741
14742   DECL_INITIAL (fndecl) = old_initial;
14743
14744   /* We used to check if the context of FNDECL was different from
14745      current_class_type as another way to get inside here.  This didn't work
14746      for String.cc in libg++.  */
14747   if (DECL_FRIEND_P (fndecl))
14748     {
14749       CLASSTYPE_INLINE_FRIENDS (current_class_type)
14750         = tree_cons (NULL_TREE, fndecl, CLASSTYPE_INLINE_FRIENDS (current_class_type));
14751       decl = void_type_node;
14752     }
14753
14754   return decl;
14755 }
14756 \f
14757 /* Called when a new struct TYPE is defined.
14758    If this structure or union completes the type of any previous
14759    variable declaration, lay it out and output its rtl.  */
14760
14761 void
14762 hack_incomplete_structures (type)
14763      tree type;
14764 {
14765   tree *list;
14766   struct binding_level *level;
14767
14768   if (!type) /* Don't do this for class templates.  */
14769     return;
14770
14771   if (namespace_bindings_p ())
14772     {
14773       level = 0;
14774       list = &namespace_scope_incomplete;
14775     }
14776   else
14777     {
14778       level = innermost_nonclass_level ();
14779       list = &level->incomplete;
14780     }
14781
14782   while (1)
14783     {
14784       while (*list)
14785         {
14786           tree decl = TREE_VALUE (*list);
14787           if ((decl && TREE_TYPE (decl) == type)
14788               || (TREE_TYPE (decl)
14789                   && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
14790                   && TREE_TYPE (TREE_TYPE (decl)) == type))
14791             {
14792               int toplevel = toplevel_bindings_p ();
14793               if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
14794                   && TREE_TYPE (TREE_TYPE (decl)) == type)
14795                 layout_type (TREE_TYPE (decl));
14796               layout_decl (decl, 0);
14797               rest_of_decl_compilation (decl, NULL_PTR, toplevel, 0);
14798               if (! toplevel)
14799                 {
14800                   tree cleanup;
14801                   expand_decl (decl);
14802                   cleanup = maybe_build_cleanup (decl);
14803                   expand_decl_init (decl);
14804                   if (! expand_decl_cleanup (decl, cleanup))
14805                     cp_error ("parser lost in parsing declaration of `%D'",
14806                               decl);
14807                 }
14808               *list = TREE_CHAIN (*list);
14809             }
14810           else
14811             list = &TREE_CHAIN (*list);
14812         }
14813
14814       /* Keep looking through artificial binding levels generated
14815          for local variables.  */
14816       if (level && level->keep == 2)
14817         {
14818           level = level->level_chain;
14819           list = &level->incomplete;
14820         }
14821       else
14822         break;
14823     }
14824 }
14825
14826 /* If DECL is of a type which needs a cleanup, build that cleanup
14827    here.  */
14828
14829 tree
14830 maybe_build_cleanup (decl)
14831      tree decl;
14832 {
14833   tree type = TREE_TYPE (decl);
14834
14835   if (type != error_mark_node && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
14836     {
14837       int flags = LOOKUP_NORMAL|LOOKUP_DESTRUCTOR;
14838       tree rval;
14839
14840       if (TREE_CODE (type) == ARRAY_TYPE)
14841         rval = decl;
14842       else
14843         {
14844           mark_addressable (decl);
14845           rval = build_unary_op (ADDR_EXPR, decl, 0);
14846         }
14847
14848       /* Optimize for space over speed here.  */
14849       if (! TYPE_USES_VIRTUAL_BASECLASSES (type)
14850           || flag_expensive_optimizations)
14851         flags |= LOOKUP_NONVIRTUAL;
14852
14853       rval = build_delete (TREE_TYPE (rval), rval,
14854                            sfk_complete_destructor, flags, 0);
14855
14856       if (TYPE_USES_VIRTUAL_BASECLASSES (type)
14857           && ! TYPE_HAS_DESTRUCTOR (type))
14858         rval = build_compound_expr (tree_cons (NULL_TREE, rval,
14859                                                build_tree_list (NULL_TREE, build_vbase_delete (type, decl))));
14860
14861       return rval;
14862     }
14863   return 0;
14864 }
14865 \f
14866 /* Expand a C++ expression at the statement level.
14867    This is needed to ferret out nodes which have UNKNOWN_TYPE.
14868    The C++ type checker should get all of these out when
14869    expressions are combined with other, type-providing, expressions,
14870    leaving only orphan expressions, such as:
14871
14872    &class::bar;         / / takes its address, but does nothing with it.  */
14873
14874 void
14875 cplus_expand_expr_stmt (exp)
14876      tree exp;
14877 {
14878 #if 0
14879   /* We should do this eventually, but right now this causes regex.o from
14880      libg++ to miscompile, and tString to core dump.  */
14881   exp = build1 (CLEANUP_POINT_EXPR, TREE_TYPE (exp), exp);
14882 #endif
14883
14884   /* If we don't do this, we end up down inside expand_expr
14885      trying to do TYPE_MODE on the ERROR_MARK, and really
14886      go outside the bounds of the type.  */
14887   if (exp != error_mark_node)
14888     expand_expr_stmt (exp);
14889 }
14890
14891 /* When a stmt has been parsed, this function is called.  */
14892
14893 void
14894 finish_stmt ()
14895 {
14896   /* Always assume this statement was not an expression statement.  If
14897      it actually was an expression statement, its our callers
14898      responsibility to fix this up.  */
14899   last_expr_type = NULL_TREE;
14900 }
14901
14902 /* DECL was originally constructed as a non-static member function,
14903    but turned out to be static.  Update it accordingly.  */
14904
14905 void
14906 revert_static_member_fn (decl)
14907      tree decl;
14908 {
14909   tree tmp;
14910   tree function = TREE_TYPE (decl);
14911   tree args = TYPE_ARG_TYPES (function);
14912
14913   if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args)))
14914       != TYPE_UNQUALIFIED)
14915     cp_error ("static member function `%#D' declared with type qualifiers",
14916               *decl);
14917
14918   args = TREE_CHAIN (args);
14919   tmp = build_function_type (TREE_TYPE (function), args);
14920   tmp = build_qualified_type (tmp, CP_TYPE_QUALS (function));
14921   tmp = build_exception_variant (tmp,
14922                                  TYPE_RAISES_EXCEPTIONS (function));
14923   TREE_TYPE (decl) = tmp;
14924   if (DECL_ARGUMENTS (decl))
14925     DECL_ARGUMENTS (decl) = TREE_CHAIN (DECL_ARGUMENTS (decl));
14926   DECL_STATIC_FUNCTION_P (decl) = 1;
14927 }
14928
14929 /* Initialize the variables used during compilation of a C++
14930    function.  */
14931
14932 static void
14933 push_cp_function_context (f)
14934      struct function *f;
14935 {
14936   struct language_function *p
14937     = ((struct language_function *)
14938        xcalloc (1, sizeof (struct language_function)));
14939   f->language = p;
14940
14941   /* It takes an explicit call to expand_body to generate RTL for a
14942      function.  */
14943   expanding_p = 0;
14944
14945   /* Whenever we start a new function, we destroy temporaries in the
14946      usual way.  */
14947   stmts_are_full_exprs_p = 1;
14948 }
14949
14950 /* Free the language-specific parts of F, now that we've finished
14951    compiling the function.  */
14952
14953 static void
14954 pop_cp_function_context (f)
14955      struct function *f;
14956 {
14957   if (f->language)
14958     free (f->language);
14959   f->language = 0;
14960 }
14961
14962 /* Mark P for GC.  */
14963
14964 static void
14965 mark_lang_function (p)
14966      struct language_function *p;
14967 {
14968   if (!p)
14969     return;
14970
14971   ggc_mark_tree (p->x_ctor_label);
14972   ggc_mark_tree (p->x_dtor_label);
14973   ggc_mark_tree (p->x_current_class_ptr);
14974   ggc_mark_tree (p->x_current_class_ref);
14975   ggc_mark_tree (p->x_eh_spec_try_block);
14976   ggc_mark_tree (p->x_scope_stmt_stack);
14977
14978   ggc_mark_rtx (p->x_result_rtx);
14979
14980   mark_named_label_lists (&p->x_named_labels, &p->x_named_label_uses);
14981   mark_stmt_tree (&p->x_stmt_tree);
14982   mark_binding_level (&p->bindings);
14983 }
14984
14985 /* Mark the language-specific data in F for GC.  */
14986
14987 static void
14988 mark_cp_function_context (f)
14989      struct function *f;
14990 {
14991   mark_lang_function (f->language);
14992 }
14993
14994 void
14995 lang_mark_false_label_stack (l)
14996      struct label_node *l;
14997 {
14998   /* C++ doesn't use false_label_stack.  It better be NULL.  */
14999   my_friendly_assert (l == NULL, 19990904);
15000 }
15001
15002 void
15003 lang_mark_tree (t)
15004      tree t;
15005 {
15006   enum tree_code code = TREE_CODE (t);
15007   if (code == IDENTIFIER_NODE)
15008     {
15009       struct lang_identifier *li = (struct lang_identifier *) t;
15010       struct lang_id2 *li2 = li->x;
15011       ggc_mark_tree (li->namespace_bindings);
15012       ggc_mark_tree (li->bindings);
15013       ggc_mark_tree (li->class_value);
15014       ggc_mark_tree (li->class_template_info);
15015
15016       if (li2)
15017         {
15018           ggc_mark_tree (li2->label_value);
15019           ggc_mark_tree (li2->implicit_decl);
15020           ggc_mark_tree (li2->error_locus);
15021         }
15022     }
15023   else if (code == CPLUS_BINDING)
15024     {
15025       if (BINDING_HAS_LEVEL_P (t))
15026         mark_binding_level (&BINDING_LEVEL (t));
15027       else
15028         ggc_mark_tree (BINDING_SCOPE (t));
15029       ggc_mark_tree (BINDING_VALUE (t));
15030     }
15031   else if (code == OVERLOAD)
15032     ggc_mark_tree (OVL_FUNCTION (t));
15033   else if (code == TEMPLATE_PARM_INDEX)
15034     ggc_mark_tree (TEMPLATE_PARM_DECL (t));
15035   else if (TREE_CODE_CLASS (code) == 'd')
15036     {
15037       struct lang_decl *ld = DECL_LANG_SPECIFIC (t);
15038
15039       if (ld)
15040         {
15041           ggc_mark (ld);
15042           if (!DECL_GLOBAL_CTOR_P (t)
15043               && !DECL_GLOBAL_DTOR_P (t)
15044               && !DECL_THUNK_P (t))
15045             ggc_mark_tree (ld->decl_flags.u2.access);
15046           ggc_mark_tree (ld->decl_flags.context);
15047           if (TREE_CODE (t) != NAMESPACE_DECL)
15048             ggc_mark_tree (ld->decl_flags.u.template_info);
15049           else
15050             mark_binding_level (&NAMESPACE_LEVEL (t));
15051           if (CAN_HAVE_FULL_LANG_DECL_P (t))
15052             {
15053               ggc_mark_tree (ld->befriending_classes);
15054               ggc_mark_tree (ld->saved_tree);
15055               ggc_mark_tree (ld->cloned_function);
15056               if (!DECL_OVERLOADED_OPERATOR_P (t))
15057                 ggc_mark_tree (ld->u2.vtt_parm);
15058               if (TREE_CODE (t) == TYPE_DECL)
15059                 ggc_mark_tree (ld->u.sorted_fields);
15060               else if (TREE_CODE (t) == FUNCTION_DECL
15061                        && !DECL_PENDING_INLINE_P (t))
15062                 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t));
15063             }
15064         }
15065     }
15066   else if (TREE_CODE_CLASS (code) == 't')
15067     {
15068       struct lang_type *lt = TYPE_LANG_SPECIFIC (t);
15069
15070       if (lt && !(TREE_CODE (t) == POINTER_TYPE
15071                   && TREE_CODE (TREE_TYPE (t)) == METHOD_TYPE))
15072         {
15073           ggc_mark (lt);
15074           ggc_mark_tree (lt->vfields);
15075           ggc_mark_tree (lt->vbases);
15076           ggc_mark_tree (lt->tags);
15077           ggc_mark_tree (lt->size);
15078           ggc_mark_tree (lt->pure_virtuals);
15079           ggc_mark_tree (lt->friend_classes);
15080           ggc_mark_tree (lt->rtti);
15081           ggc_mark_tree (lt->methods);
15082           ggc_mark_tree (lt->template_info);
15083           ggc_mark_tree (lt->befriending_classes);
15084         }
15085       else if (lt)
15086         /* In the case of pointer-to-member function types, the
15087            TYPE_LANG_SPECIFIC is really just a tree.  */
15088         ggc_mark_tree ((tree) lt);
15089     }
15090 }