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           DECL_CONTEXT (d) = FROB_CONTEXT (current_namespace);
2373           d = pushdecl (d);
2374           pushlevel (0);
2375           declare_namespace_level ();
2376           NAMESPACE_LEVEL (d) = current_binding_level;
2377         }
2378     }
2379   else
2380     resume_binding_level (NAMESPACE_LEVEL (d));
2381
2382   if (implicit_use)
2383     do_using_directive (d);
2384   /* Enter the name space. */
2385   current_namespace = d;
2386 }
2387
2388 /* Pop from the scope of the current namespace.  */
2389
2390 void
2391 pop_namespace ()
2392 {
2393   if (current_namespace == global_namespace)
2394     {
2395       my_friendly_assert (in_std>0, 980421);
2396       in_std--;
2397       return;
2398     }
2399   current_namespace = CP_DECL_CONTEXT (current_namespace);
2400   /* The binding level is not popped, as it might be re-opened later.  */
2401   suspend_binding_level ();
2402 }
2403
2404 /* Push into the scope of the namespace NS, even if it is deeply
2405    nested within another namespace.  */
2406
2407 void
2408 push_nested_namespace (ns)
2409      tree ns;
2410 {
2411   if (ns == global_namespace)
2412     push_to_top_level ();
2413   else
2414     {
2415       push_nested_namespace (CP_DECL_CONTEXT (ns));
2416       push_namespace (DECL_NAME (ns));
2417     }
2418 }
2419
2420 /* Pop back from the scope of the namespace NS, which was previously
2421    entered with push_nested_namespace.  */
2422
2423 void
2424 pop_nested_namespace (ns)
2425      tree ns;
2426 {
2427   while (ns != global_namespace)
2428     {
2429       pop_namespace ();
2430       ns = CP_DECL_CONTEXT (ns);
2431     }
2432
2433   pop_from_top_level ();
2434 }
2435
2436 \f
2437 /* Subroutines for reverting temporarily to top-level for instantiation
2438    of templates and such.  We actually need to clear out the class- and
2439    local-value slots of all identifiers, so that only the global values
2440    are at all visible.  Simply setting current_binding_level to the global
2441    scope isn't enough, because more binding levels may be pushed.  */
2442 struct saved_scope *scope_chain;
2443
2444 /* Mark ST for GC.  */
2445
2446 static void
2447 mark_stmt_tree (st)
2448      struct stmt_tree *st;
2449 {
2450   ggc_mark_tree (st->x_last_stmt);
2451   ggc_mark_tree (st->x_last_expr_type);
2452 }
2453
2454 /* Mark ARG (which is really a struct saved_scope **) for GC.  */
2455
2456 static void
2457 mark_saved_scope (arg)
2458      void *arg;
2459 {
2460   struct saved_scope *t = *(struct saved_scope **)arg;
2461   while (t)
2462     {
2463       mark_binding_level (&t->class_bindings);
2464       ggc_mark_tree (t->old_bindings);
2465       ggc_mark_tree (t->old_namespace);
2466       ggc_mark_tree (t->class_name);
2467       ggc_mark_tree (t->class_type);
2468       ggc_mark_tree (t->access_specifier);
2469       ggc_mark_tree (t->function_decl);
2470       if (t->lang_base)
2471         ggc_mark_tree_varray (t->lang_base);
2472       ggc_mark_tree (t->lang_name);
2473       ggc_mark_tree (t->x_function_parms);
2474       ggc_mark_tree (t->template_parms);
2475       ggc_mark_tree (t->x_previous_class_type);
2476       ggc_mark_tree (t->x_previous_class_values);
2477       ggc_mark_tree (t->x_saved_tree);
2478       ggc_mark_tree (t->incomplete);
2479       ggc_mark_tree (t->lookups);
2480
2481       mark_stmt_tree (&t->x_stmt_tree);
2482       mark_binding_level (&t->bindings);
2483       t = t->prev;
2484     }
2485 }
2486
2487 static tree
2488 store_bindings (names, old_bindings)
2489      tree names, old_bindings;
2490 {
2491   tree t;
2492   for (t = names; t; t = TREE_CHAIN (t))
2493     {
2494       tree binding, t1, id;
2495
2496       if (TREE_CODE (t) == TREE_LIST)
2497         id = TREE_PURPOSE (t);
2498       else
2499         id = DECL_NAME (t);
2500
2501       if (!id
2502           /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2503              we have no IDENTIFIER_BINDING if we have left the class
2504              scope, but cached the class-level declarations.  */
2505           || !(IDENTIFIER_BINDING (id) || IDENTIFIER_CLASS_VALUE (id)))
2506         continue;
2507
2508       for (t1 = old_bindings; t1; t1 = TREE_CHAIN (t1))
2509         if (TREE_VEC_ELT (t1, 0) == id)
2510           goto skip_it;
2511
2512       binding = make_tree_vec (4);
2513
2514       if (id)
2515         {
2516           my_friendly_assert (TREE_CODE (id) == IDENTIFIER_NODE, 135);
2517           TREE_VEC_ELT (binding, 0) = id;
2518           TREE_VEC_ELT (binding, 1) = REAL_IDENTIFIER_TYPE_VALUE (id);
2519           TREE_VEC_ELT (binding, 2) = IDENTIFIER_BINDING (id);
2520           TREE_VEC_ELT (binding, 3) = IDENTIFIER_CLASS_VALUE (id);
2521           IDENTIFIER_BINDING (id) = NULL_TREE;
2522           IDENTIFIER_CLASS_VALUE (id) = NULL_TREE;
2523         }
2524       TREE_CHAIN (binding) = old_bindings;
2525       old_bindings = binding;
2526     skip_it:
2527       ;
2528     }
2529   return old_bindings;
2530 }
2531
2532 void
2533 maybe_push_to_top_level (pseudo)
2534      int pseudo;
2535 {
2536   struct saved_scope *s;
2537   struct binding_level *b;
2538   tree old_bindings;
2539   int need_pop;
2540
2541   s = (struct saved_scope *) xcalloc (1, sizeof (struct saved_scope));
2542
2543   b = scope_chain ? current_binding_level : 0;
2544
2545   /* If we're in the middle of some function, save our state.  */
2546   if (cfun)
2547     {
2548       need_pop = 1;
2549       push_function_context_to (NULL_TREE);
2550     }
2551   else
2552     need_pop = 0;
2553
2554   old_bindings = NULL_TREE;
2555   if (scope_chain && previous_class_type)
2556     old_bindings = store_bindings (previous_class_values, old_bindings);
2557
2558   /* Have to include global_binding_level, because class-level decls
2559      aren't listed anywhere useful.  */
2560   for (; b; b = b->level_chain)
2561     {
2562       tree t;
2563
2564       /* Template IDs are inserted into the global level. If they were
2565          inserted into namespace level, finish_file wouldn't find them
2566          when doing pending instantiations. Therefore, don't stop at
2567          namespace level, but continue until :: .  */
2568       if (b == global_binding_level || (pseudo && b->template_parms_p))
2569         break;
2570
2571       old_bindings = store_bindings (b->names, old_bindings);
2572       /* We also need to check class_shadowed to save class-level type
2573          bindings, since pushclass doesn't fill in b->names.  */
2574       if (b->parm_flag == 2)
2575         old_bindings = store_bindings (b->class_shadowed, old_bindings);
2576
2577       /* Unwind type-value slots back to top level.  */
2578       for (t = b->type_shadowed; t; t = TREE_CHAIN (t))
2579         SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t), TREE_VALUE (t));
2580     }
2581   s->prev = scope_chain;
2582   s->old_bindings = old_bindings;
2583   s->bindings = b;
2584   s->need_pop_function_context = need_pop;
2585   s->function_decl = current_function_decl;
2586
2587   scope_chain = s;
2588   current_function_decl = NULL_TREE;
2589   VARRAY_TREE_INIT (current_lang_base, 10, "current_lang_base");
2590   current_lang_stack = &VARRAY_TREE (current_lang_base, 0);
2591   current_lang_name = lang_name_cplusplus;
2592   strict_prototype = strict_prototypes_lang_cplusplus;
2593   current_namespace = global_namespace;
2594 }
2595
2596 void
2597 push_to_top_level ()
2598 {
2599   maybe_push_to_top_level (0);
2600 }
2601
2602 void
2603 pop_from_top_level ()
2604 {
2605   struct saved_scope *s = scope_chain;
2606   tree t;
2607
2608   /* Clear out class-level bindings cache.  */
2609   if (previous_class_type)
2610     invalidate_class_lookup_cache ();
2611
2612   VARRAY_FREE (current_lang_base);
2613
2614   scope_chain = s->prev;
2615   for (t = s->old_bindings; t; t = TREE_CHAIN (t))
2616     {
2617       tree id = TREE_VEC_ELT (t, 0);
2618       if (id)
2619         {
2620           SET_IDENTIFIER_TYPE_VALUE (id, TREE_VEC_ELT (t, 1));
2621           IDENTIFIER_BINDING (id) = TREE_VEC_ELT (t, 2);
2622           IDENTIFIER_CLASS_VALUE (id) = TREE_VEC_ELT (t, 3);
2623         }
2624     }
2625
2626   if (current_lang_name == lang_name_cplusplus)
2627     strict_prototype = strict_prototypes_lang_cplusplus;
2628   else if (current_lang_name == lang_name_c)
2629     strict_prototype = strict_prototypes_lang_c;
2630
2631   /* If we were in the middle of compiling a function, restore our
2632      state.  */
2633   if (s->need_pop_function_context)
2634     pop_function_context_from (NULL_TREE);
2635   current_function_decl = s->function_decl;
2636
2637   free (s);
2638 }
2639 \f
2640 /* Push a definition of struct, union or enum tag "name".
2641    into binding_level "b".   "type" should be the type node,
2642    We assume that the tag "name" is not already defined.
2643
2644    Note that the definition may really be just a forward reference.
2645    In that case, the TYPE_SIZE will be a NULL_TREE.
2646
2647    C++ gratuitously puts all these tags in the name space.  */
2648
2649 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2650    record the shadowed value for this binding contour.  TYPE is
2651    the type that ID maps to.  */
2652
2653 static void
2654 set_identifier_type_value_with_scope (id, type, b)
2655      tree id;
2656      tree type;
2657      struct binding_level *b;
2658 {
2659   if (!b->namespace_p)
2660     {
2661       /* Shadow the marker, not the real thing, so that the marker
2662          gets restored later. */
2663       tree old_type_value = REAL_IDENTIFIER_TYPE_VALUE (id);
2664       b->type_shadowed
2665         = tree_cons (id, old_type_value, b->type_shadowed);
2666     }
2667   else
2668     {
2669       tree binding = binding_for_name (id, current_namespace);
2670       BINDING_TYPE (binding) = type;
2671       /* Store marker instead of real type. */
2672       type = global_type_node;
2673     }
2674   SET_IDENTIFIER_TYPE_VALUE (id, type);
2675 }
2676
2677 /* As set_identifier_type_value_with_scope, but using current_binding_level.  */
2678
2679 void
2680 set_identifier_type_value (id, type)
2681      tree id;
2682      tree type;
2683 {
2684   set_identifier_type_value_with_scope (id, type, current_binding_level);
2685 }
2686
2687 /* Return the type associated with id. */
2688
2689 tree
2690 identifier_type_value (id)
2691      tree id;
2692 {
2693   /* There is no type with that name, anywhere. */
2694   if (REAL_IDENTIFIER_TYPE_VALUE (id) == NULL_TREE)
2695     return NULL_TREE;
2696   /* This is not the type marker, but the real thing. */
2697   if (REAL_IDENTIFIER_TYPE_VALUE (id) != global_type_node)
2698     return REAL_IDENTIFIER_TYPE_VALUE (id);
2699   /* Have to search for it. It must be on the global level, now.
2700      Ask lookup_name not to return non-types. */
2701   id = lookup_name_real (id, 2, 1, 0);
2702   if (id)
2703     return TREE_TYPE (id);
2704   return NULL_TREE;
2705 }
2706
2707 /* Pop off extraneous binding levels left over due to syntax errors.
2708
2709    We don't pop past namespaces, as they might be valid.  */
2710
2711 void
2712 pop_everything ()
2713 {
2714 #ifdef DEBUG_CP_BINDING_LEVELS
2715   fprintf (stderr, "XXX entering pop_everything ()\n");
2716 #endif
2717   while (!toplevel_bindings_p ())
2718     {
2719       if (current_binding_level->parm_flag == 2)
2720         pop_nested_class ();
2721       else
2722         poplevel (0, 0, 0);
2723     }
2724 #ifdef DEBUG_CP_BINDING_LEVELS
2725   fprintf (stderr, "XXX leaving pop_everything ()\n");
2726 #endif
2727 }
2728
2729 /* The type TYPE is being declared.  If it is a class template, or a
2730    specialization of a class template, do any processing required and
2731    perform error-checking.  If IS_FRIEND is non-zero, this TYPE is
2732    being declared a friend.  B is the binding level at which this TYPE
2733    should be bound.
2734
2735    Returns the TYPE_DECL for TYPE, which may have been altered by this
2736    processing.  */
2737
2738 static tree
2739 maybe_process_template_type_declaration (type, globalize, b)
2740      tree type;
2741      int globalize;
2742      struct binding_level* b;
2743 {
2744   tree decl = TYPE_NAME (type);
2745
2746   if (processing_template_parmlist)
2747     /* You can't declare a new template type in a template parameter
2748        list.  But, you can declare a non-template type:
2749
2750          template <class A*> struct S;
2751
2752        is a forward-declaration of `A'.  */
2753     ;
2754   else
2755     {
2756       maybe_check_template_type (type);
2757
2758       my_friendly_assert (IS_AGGR_TYPE (type)
2759                           || TREE_CODE (type) == ENUMERAL_TYPE, 0);
2760
2761
2762       if (processing_template_decl)
2763         {
2764           /* This may change after the call to
2765              push_template_decl_real, but we want the original value.  */
2766           tree name = DECL_NAME (decl);
2767
2768           decl = push_template_decl_real (decl, globalize);
2769           /* If the current binding level is the binding level for the
2770              template parameters (see the comment in
2771              begin_template_parm_list) and the enclosing level is a class
2772              scope, and we're not looking at a friend, push the
2773              declaration of the member class into the class scope.  In the
2774              friend case, push_template_decl will already have put the
2775              friend into global scope, if appropriate.  */
2776           if (TREE_CODE (type) != ENUMERAL_TYPE
2777               && !globalize && b->template_parms_p
2778               && b->level_chain->parm_flag == 2)
2779             {
2780               finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type));
2781               /* Put this tag on the list of tags for the class, since
2782                  that won't happen below because B is not the class
2783                  binding level, but is instead the pseudo-global level.  */
2784               b->level_chain->tags =
2785                 tree_cons (name, type, b->level_chain->tags);
2786               if (!COMPLETE_TYPE_P (current_class_type))
2787                 CLASSTYPE_TAGS (current_class_type) = b->level_chain->tags;
2788             }
2789         }
2790     }
2791
2792   return decl;
2793 }
2794
2795 /* In C++, you don't have to write `struct S' to refer to `S'; you
2796    can just use `S'.  We accomplish this by creating a TYPE_DECL as
2797    if the user had written `typedef struct S S'.  Create and return
2798    the TYPE_DECL for TYPE.  */
2799
2800 tree
2801 create_implicit_typedef (name, type)
2802      tree name;
2803      tree type;
2804 {
2805   tree decl;
2806
2807   decl = build_decl (TYPE_DECL, name, type);
2808   DECL_ARTIFICIAL (decl) = 1;
2809   /* There are other implicit type declarations, like the one *within*
2810      a class that allows you to write `S::S'.  We must distinguish
2811      amongst these.  */
2812   SET_DECL_IMPLICIT_TYPEDEF_P (decl);
2813   TYPE_NAME (type) = decl;
2814
2815   return decl;
2816 }
2817
2818 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2819    Normally put it into the inner-most non-tag-transparent scope,
2820    but if GLOBALIZE is true, put it in the inner-most non-class scope.
2821    The latter is needed for implicit declarations.  */
2822
2823 void
2824 pushtag (name, type, globalize)
2825      tree name, type;
2826      int globalize;
2827 {
2828   register struct binding_level *b;
2829
2830   b = current_binding_level;
2831   while (b->tag_transparent
2832          || (globalize && b->parm_flag == 2))
2833     b = b->level_chain;
2834
2835   b->tags = tree_cons (name, type, b->tags);
2836
2837   if (name)
2838     {
2839       /* Do C++ gratuitous typedefing.  */
2840       if (IDENTIFIER_TYPE_VALUE (name) != type)
2841         {
2842           register tree d = NULL_TREE;
2843           int in_class = 0;
2844           tree context = TYPE_CONTEXT (type);
2845
2846           if (! context)
2847             {
2848               tree cs = current_scope ();
2849
2850               if (! globalize)
2851                 context = cs;
2852               else if (cs != NULL_TREE && TYPE_P (cs))
2853                 /* When declaring a friend class of a local class, we want
2854                    to inject the newly named class into the scope
2855                    containing the local class, not the namespace scope.  */
2856                 context = decl_function_context (get_type_decl (cs));
2857             }
2858           if (!context)
2859             context = current_namespace;
2860
2861           if ((b->template_parms_p && b->level_chain->parm_flag == 2)
2862               || b->parm_flag == 2)
2863             in_class = 1;
2864
2865           if (current_lang_name == lang_name_java)
2866             TYPE_FOR_JAVA (type) = 1;
2867
2868           d = create_implicit_typedef (name, type);
2869           DECL_CONTEXT (d) = FROB_CONTEXT (context);
2870           if (! in_class)
2871             set_identifier_type_value_with_scope (name, type, b);
2872
2873           d = maybe_process_template_type_declaration (type,
2874                                                        globalize, b);
2875
2876           if (b->parm_flag == 2)
2877             {
2878               if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2879                 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2880                    class.  But if it's a member template class, we
2881                    want the TEMPLATE_DECL, not the TYPE_DECL, so this
2882                    is done later.  */
2883                 finish_member_declaration (d);
2884               else
2885                 pushdecl_class_level (d);
2886             }
2887           else
2888             d = pushdecl_with_scope (d, b);
2889
2890           if (ANON_AGGRNAME_P (name))
2891             DECL_IGNORED_P (d) = 1;
2892
2893           TYPE_CONTEXT (type) = DECL_CONTEXT (d);
2894           DECL_ASSEMBLER_NAME (d) = DECL_NAME (d);
2895
2896           /* If this is a local class, keep track of it.  We need this
2897              information for name-mangling, and so that it is possible to find
2898              all function definitions in a translation unit in a convenient
2899              way.  (It's otherwise tricky to find a member function definition
2900              it's only pointed to from within a local class.)  */
2901           if (TYPE_CONTEXT (type)
2902               && TREE_CODE (TYPE_CONTEXT (type)) == FUNCTION_DECL)
2903             VARRAY_PUSH_TREE (local_classes, type);
2904
2905           if (!uses_template_parms (type))
2906             {
2907               if (flag_new_abi)
2908                 DECL_ASSEMBLER_NAME (d) = mangle_type (type);
2909               else
2910                 DECL_ASSEMBLER_NAME (d)
2911                   = get_identifier (build_overload_name (type, 1, 1));
2912             }
2913         }
2914       if (b->parm_flag == 2)
2915         {
2916           if (!COMPLETE_TYPE_P (current_class_type))
2917             CLASSTYPE_TAGS (current_class_type) = b->tags;
2918         }
2919     }
2920
2921   if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL)
2922     /* Use the canonical TYPE_DECL for this node.  */
2923     TYPE_STUB_DECL (type) = TYPE_NAME (type);
2924   else
2925     {
2926       /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2927          will be the tagged type we just added to the current
2928          binding level.  This fake NULL-named TYPE_DECL node helps
2929          dwarfout.c to know when it needs to output a
2930          representation of a tagged type, and it also gives us a
2931          convenient place to record the "scope start" address for
2932          the tagged type.  */
2933
2934       tree d = build_decl (TYPE_DECL, NULL_TREE, type);
2935       TYPE_STUB_DECL (type) = pushdecl_with_scope (d, b);
2936     }
2937 }
2938
2939 /* Counter used to create anonymous type names.  */
2940
2941 static int anon_cnt = 0;
2942
2943 /* Return an IDENTIFIER which can be used as a name for
2944    anonymous structs and unions.  */
2945
2946 tree
2947 make_anon_name ()
2948 {
2949   char buf[32];
2950
2951   sprintf (buf, ANON_AGGRNAME_FORMAT, anon_cnt++);
2952   return get_identifier (buf);
2953 }
2954
2955 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2956    This keeps dbxout from getting confused.  */
2957
2958 void
2959 clear_anon_tags ()
2960 {
2961   register struct binding_level *b;
2962   register tree tags;
2963   static int last_cnt = 0;
2964
2965   /* Fast out if no new anon names were declared.  */
2966   if (last_cnt == anon_cnt)
2967     return;
2968
2969   b = current_binding_level;
2970   while (b->tag_transparent)
2971     b = b->level_chain;
2972   tags = b->tags;
2973   while (tags)
2974     {
2975       /* A NULL purpose means we have already processed all tags
2976          from here to the end of the list.  */
2977       if (TREE_PURPOSE (tags) == NULL_TREE)
2978         break;
2979       if (ANON_AGGRNAME_P (TREE_PURPOSE (tags)))
2980         TREE_PURPOSE (tags) = NULL_TREE;
2981       tags = TREE_CHAIN (tags);
2982     }
2983   last_cnt = anon_cnt;
2984 }
2985 \f
2986 /* Subroutine of duplicate_decls: return truthvalue of whether
2987    or not types of these decls match.
2988
2989    For C++, we must compare the parameter list so that `int' can match
2990    `int&' in a parameter position, but `int&' is not confused with
2991    `const int&'.  */
2992
2993 int
2994 decls_match (newdecl, olddecl)
2995      tree newdecl, olddecl;
2996 {
2997   int types_match;
2998
2999   if (newdecl == olddecl)
3000     return 1;
3001
3002   if (TREE_CODE (newdecl) != TREE_CODE (olddecl))
3003     /* If the two DECLs are not even the same kind of thing, we're not
3004        interested in their types.  */
3005     return 0;
3006
3007   if (TREE_CODE (newdecl) == FUNCTION_DECL)
3008     {
3009       tree f1 = TREE_TYPE (newdecl);
3010       tree f2 = TREE_TYPE (olddecl);
3011       tree p1 = TYPE_ARG_TYPES (f1);
3012       tree p2 = TYPE_ARG_TYPES (f2);
3013
3014       if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl)
3015           && ! (DECL_EXTERN_C_P (newdecl)
3016                 && DECL_EXTERN_C_P (olddecl)))
3017         return 0;
3018
3019       if (TREE_CODE (f1) != TREE_CODE (f2))
3020         return 0;
3021
3022       if (same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
3023         {
3024           if ((! strict_prototypes_lang_c || DECL_BUILT_IN (olddecl))
3025               && DECL_EXTERN_C_P (olddecl)
3026               && p2 == NULL_TREE)
3027             {
3028               types_match = self_promoting_args_p (p1);
3029               if (p1 == void_list_node)
3030                 TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
3031             }
3032           else if (!strict_prototypes_lang_c
3033                    && DECL_EXTERN_C_P (olddecl)
3034                    && DECL_EXTERN_C_P (newdecl)
3035                    && p1 == NULL_TREE)
3036             {
3037               types_match = self_promoting_args_p (p2);
3038               TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
3039             }
3040           else
3041             types_match = compparms (p1, p2);
3042         }
3043       else
3044         types_match = 0;
3045     }
3046   else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3047     {
3048       if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
3049                                 DECL_TEMPLATE_PARMS (olddecl)))
3050         return 0;
3051
3052       if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
3053         types_match = 1;
3054       else
3055         types_match = decls_match (DECL_TEMPLATE_RESULT (olddecl),
3056                                    DECL_TEMPLATE_RESULT (newdecl));
3057     }
3058   else
3059     {
3060       if (TREE_TYPE (newdecl) == error_mark_node)
3061         types_match = TREE_TYPE (olddecl) == error_mark_node;
3062       else if (TREE_TYPE (olddecl) == NULL_TREE)
3063         types_match = TREE_TYPE (newdecl) == NULL_TREE;
3064       else if (TREE_TYPE (newdecl) == NULL_TREE)
3065         types_match = 0;
3066       else
3067         types_match = comptypes (TREE_TYPE (newdecl),
3068                                  TREE_TYPE (olddecl),
3069                                  COMPARE_REDECLARATION);
3070     }
3071
3072   return types_match;
3073 }
3074
3075 /* If NEWDECL is `static' and an `extern' was seen previously,
3076    warn about it.  OLDDECL is the previous declaration.
3077
3078    Note that this does not apply to the C++ case of declaring
3079    a variable `extern const' and then later `const'.
3080
3081    Don't complain about built-in functions, since they are beyond
3082    the user's control.  */
3083
3084 static void
3085 warn_extern_redeclared_static (newdecl, olddecl)
3086      tree newdecl, olddecl;
3087 {
3088   static const char *explicit_extern_static_warning
3089     = "`%D' was declared `extern' and later `static'";
3090   static const char *implicit_extern_static_warning
3091     = "`%D' was declared implicitly `extern' and later `static'";
3092
3093   tree name;
3094
3095   if (TREE_CODE (newdecl) == TYPE_DECL
3096       || TREE_CODE (newdecl) == TEMPLATE_DECL
3097       || TREE_CODE (newdecl) == CONST_DECL)
3098     return;
3099
3100   /* Don't get confused by static member functions; that's a different
3101      use of `static'.  */
3102   if (TREE_CODE (newdecl) == FUNCTION_DECL
3103       && DECL_STATIC_FUNCTION_P (newdecl))
3104     return;
3105
3106   /* If the old declaration was `static', or the new one isn't, then
3107      then everything is OK.  */
3108   if (DECL_THIS_STATIC (olddecl) || !DECL_THIS_STATIC (newdecl))
3109     return;
3110
3111   /* It's OK to declare a builtin function as `static'.  */
3112   if (TREE_CODE (olddecl) == FUNCTION_DECL
3113       && DECL_ARTIFICIAL (olddecl))
3114     return;
3115
3116   name = DECL_ASSEMBLER_NAME (newdecl);
3117   cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name)
3118               ? implicit_extern_static_warning
3119               : explicit_extern_static_warning, newdecl);
3120   cp_pedwarn_at ("previous declaration of `%D'", olddecl);
3121 }
3122
3123 /* Handle when a new declaration NEWDECL has the same name as an old
3124    one OLDDECL in the same binding contour.  Prints an error message
3125    if appropriate.
3126
3127    If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3128    Otherwise, return 0.  */
3129
3130 int
3131 duplicate_decls (newdecl, olddecl)
3132      tree newdecl, olddecl;
3133 {
3134   unsigned olddecl_uid = DECL_UID (olddecl);
3135   int olddecl_friend = 0, types_match = 0;
3136   int new_defines_function = 0;
3137
3138   if (newdecl == olddecl)
3139     return 1;
3140
3141   types_match = decls_match (newdecl, olddecl);
3142
3143   /* If either the type of the new decl or the type of the old decl is an
3144      error_mark_node, then that implies that we have already issued an
3145      error (earlier) for some bogus type specification, and in that case,
3146      it is rather pointless to harass the user with yet more error message
3147      about the same declaration, so just pretend the types match here.  */
3148   if (TREE_TYPE (newdecl) == error_mark_node
3149       || TREE_TYPE (olddecl) == error_mark_node)
3150     types_match = 1;
3151
3152   /* Check for redeclaration and other discrepancies. */
3153   if (TREE_CODE (olddecl) == FUNCTION_DECL
3154       && DECL_ARTIFICIAL (olddecl))
3155     {
3156       if (TREE_CODE (newdecl) != FUNCTION_DECL)
3157         {
3158           /* If you declare a built-in or predefined function name as static,
3159              the old definition is overridden, but optionally warn this was a
3160              bad choice of name.  */
3161           if (! TREE_PUBLIC (newdecl))
3162             {
3163               if (warn_shadow)
3164                 cp_warning ("shadowing %s function `%#D'",
3165                             DECL_BUILT_IN (olddecl) ? "built-in" : "library",
3166                             olddecl);
3167               /* Discard the old built-in function.  */
3168               return 0;
3169             }
3170           /* If the built-in is not ansi, then programs can override
3171              it even globally without an error.  */
3172           else if (! DECL_BUILT_IN (olddecl))
3173             cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3174                         olddecl, newdecl);
3175           else
3176             {
3177               cp_error ("declaration of `%#D'", newdecl);
3178               cp_error ("conflicts with built-in declaration `%#D'",
3179                         olddecl);
3180             }
3181           return 0;
3182         }
3183       else if (!types_match)
3184         {
3185           if ((DECL_EXTERN_C_P (newdecl)
3186                && DECL_EXTERN_C_P (olddecl))
3187               || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
3188                             TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
3189             {
3190               /* A near match; override the builtin.  */
3191
3192               if (TREE_PUBLIC (newdecl))
3193                 {
3194                   cp_warning ("new declaration `%#D'", newdecl);
3195                   cp_warning ("ambiguates built-in declaration `%#D'",
3196                               olddecl);
3197                 }
3198               else if (warn_shadow)
3199                 cp_warning ("shadowing %s function `%#D'",
3200                             DECL_BUILT_IN (olddecl) ? "built-in" : "library",
3201                             olddecl);
3202             }
3203           else
3204             /* Discard the old built-in function.  */
3205             return 0;
3206         }
3207
3208       if (DECL_THIS_STATIC (newdecl) && !DECL_THIS_STATIC (olddecl))
3209         {
3210           /* If a builtin function is redeclared as `static', merge
3211              the declarations, but make the original one static.  */
3212           DECL_THIS_STATIC (olddecl) = 1;
3213           TREE_PUBLIC (olddecl) = 0;
3214
3215           /* Make the old declaration consistent with the new one so
3216              that all remnants of the builtin-ness of this function
3217              will be banished.  */
3218           DECL_LANGUAGE (olddecl) = DECL_LANGUAGE (newdecl);
3219           DECL_RTL (olddecl) = DECL_RTL (newdecl);
3220           DECL_ASSEMBLER_NAME (olddecl) = DECL_ASSEMBLER_NAME (newdecl);
3221           SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl),
3222                                        newdecl);
3223         }
3224     }
3225   else if (TREE_CODE (olddecl) != TREE_CODE (newdecl))
3226     {
3227       if ((TREE_CODE (olddecl) == TYPE_DECL && DECL_ARTIFICIAL (olddecl)
3228            && TREE_CODE (newdecl) != TYPE_DECL
3229            && ! (TREE_CODE (newdecl) == TEMPLATE_DECL
3230                  && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL))
3231           || (TREE_CODE (newdecl) == TYPE_DECL && DECL_ARTIFICIAL (newdecl)
3232               && TREE_CODE (olddecl) != TYPE_DECL
3233               && ! (TREE_CODE (olddecl) == TEMPLATE_DECL
3234                     && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl))
3235                         == TYPE_DECL))))
3236         {
3237           /* We do nothing special here, because C++ does such nasty
3238              things with TYPE_DECLs.  Instead, just let the TYPE_DECL
3239              get shadowed, and know that if we need to find a TYPE_DECL
3240              for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3241              slot of the identifier.  */
3242           return 0;
3243         }
3244
3245       if ((TREE_CODE (newdecl) == FUNCTION_DECL
3246            && DECL_FUNCTION_TEMPLATE_P (olddecl))
3247           || (TREE_CODE (olddecl) == FUNCTION_DECL
3248               && DECL_FUNCTION_TEMPLATE_P (newdecl)))
3249         return 0;
3250
3251       cp_error ("`%#D' redeclared as different kind of symbol", newdecl);
3252       if (TREE_CODE (olddecl) == TREE_LIST)
3253         olddecl = TREE_VALUE (olddecl);
3254       cp_error_at ("previous declaration of `%#D'", olddecl);
3255
3256       /* New decl is completely inconsistent with the old one =>
3257          tell caller to replace the old one.  */
3258
3259       return 0;
3260     }
3261   else if (!types_match)
3262     {
3263       if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl))
3264         /* These are certainly not duplicate declarations; they're
3265            from different scopes.  */
3266         return 0;
3267
3268       if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3269         {
3270           /* The name of a class template may not be declared to refer to
3271              any other template, class, function, object, namespace, value,
3272              or type in the same scope.  */
3273           if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == TYPE_DECL
3274               || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
3275             {
3276               cp_error ("declaration of template `%#D'", newdecl);
3277               cp_error_at ("conflicts with previous declaration `%#D'",
3278                            olddecl);
3279             }
3280           else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == FUNCTION_DECL
3281                    && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
3282                    && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl))),
3283                                  TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl))))
3284                    && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
3285                                            DECL_TEMPLATE_PARMS (olddecl)))
3286             {
3287               cp_error ("new declaration `%#D'", newdecl);
3288               cp_error_at ("ambiguates old declaration `%#D'", olddecl);
3289             }
3290           return 0;
3291         }
3292       if (TREE_CODE (newdecl) == FUNCTION_DECL)
3293         {
3294           if (DECL_EXTERN_C_P (newdecl) && DECL_EXTERN_C_P (olddecl))
3295             {
3296               cp_error ("declaration of C function `%#D' conflicts with",
3297                         newdecl);
3298               cp_error_at ("previous declaration `%#D' here", olddecl);
3299             }
3300           else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
3301                               TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
3302             {
3303               cp_error ("new declaration `%#D'", newdecl);
3304               cp_error_at ("ambiguates old declaration `%#D'", olddecl);
3305             }
3306           else
3307             return 0;
3308         }
3309
3310       /* Already complained about this, so don't do so again.  */
3311       else if (current_class_type == NULL_TREE
3312           || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl)) != current_class_type)
3313         {
3314           cp_error ("conflicting types for `%#D'", newdecl);
3315           cp_error_at ("previous declaration as `%#D'", olddecl);
3316         }
3317     }
3318   else if (TREE_CODE (newdecl) == FUNCTION_DECL
3319             && ((DECL_TEMPLATE_SPECIALIZATION (olddecl)
3320                  && (!DECL_TEMPLATE_INFO (newdecl)
3321                      || (DECL_TI_TEMPLATE (newdecl)
3322                          != DECL_TI_TEMPLATE (olddecl))))
3323                 || (DECL_TEMPLATE_SPECIALIZATION (newdecl)
3324                     && (!DECL_TEMPLATE_INFO (olddecl)
3325                         || (DECL_TI_TEMPLATE (olddecl)
3326                             != DECL_TI_TEMPLATE (newdecl))))))
3327     /* It's OK to have a template specialization and a non-template
3328        with the same type, or to have specializations of two
3329        different templates with the same type.  Note that if one is a
3330        specialization, and the other is an instantiation of the same
3331        template, that we do not exit at this point.  That situation
3332        can occur if we instantiate a template class, and then
3333        specialize one of its methods.  This situation is legal, but
3334        the declarations must be merged in the usual way.  */
3335     return 0;
3336   else if (TREE_CODE (newdecl) == FUNCTION_DECL
3337            && ((DECL_TEMPLATE_INSTANTIATION (olddecl)
3338                 && !DECL_USE_TEMPLATE (newdecl))
3339                || (DECL_TEMPLATE_INSTANTIATION (newdecl)
3340                    && !DECL_USE_TEMPLATE (olddecl))))
3341     /* One of the declarations is a template instantiation, and the
3342        other is not a template at all.  That's OK.  */
3343     return 0;
3344   else if (TREE_CODE (newdecl) == NAMESPACE_DECL
3345            && DECL_NAMESPACE_ALIAS (newdecl)
3346            && DECL_NAMESPACE_ALIAS (newdecl) == DECL_NAMESPACE_ALIAS (olddecl))
3347     /* Redeclaration of namespace alias, ignore it. */
3348     return 1;
3349   else
3350     {
3351       const char *errmsg = redeclaration_error_message (newdecl, olddecl);
3352       if (errmsg)
3353         {
3354           cp_error (errmsg, newdecl);
3355           if (DECL_NAME (olddecl) != NULL_TREE)
3356             cp_error_at ((DECL_INITIAL (olddecl)
3357                           && namespace_bindings_p ())
3358                          ? "`%#D' previously defined here"
3359                          : "`%#D' previously declared here", olddecl);
3360         }
3361       else if (TREE_CODE (olddecl) == FUNCTION_DECL
3362                && DECL_INITIAL (olddecl) != NULL_TREE
3363                && TYPE_ARG_TYPES (TREE_TYPE (olddecl)) == NULL_TREE
3364                && TYPE_ARG_TYPES (TREE_TYPE (newdecl)) != NULL_TREE)
3365         {
3366           /* Prototype decl follows defn w/o prototype.  */
3367           cp_warning_at ("prototype for `%#D'", newdecl);
3368           cp_warning_at ("follows non-prototype definition here", olddecl);
3369         }
3370       else if (TREE_CODE (olddecl) == FUNCTION_DECL
3371                && DECL_LANGUAGE (newdecl) != DECL_LANGUAGE (olddecl))
3372         {
3373           /* extern "C" int foo ();
3374              int foo () { bar (); }
3375              is OK.  */
3376           if (current_lang_stack
3377               == &VARRAY_TREE (current_lang_base, 0))
3378             DECL_LANGUAGE (newdecl) = DECL_LANGUAGE (olddecl);
3379           else
3380             {
3381               cp_error_at ("previous declaration of `%#D' with %L linkage",
3382                            olddecl, DECL_LANGUAGE (olddecl));
3383               cp_error ("conflicts with new declaration with %L linkage",
3384                         DECL_LANGUAGE (newdecl));
3385             }
3386         }
3387
3388       if (DECL_LANG_SPECIFIC (olddecl) && DECL_USE_TEMPLATE (olddecl))
3389         ;
3390       else if (TREE_CODE (olddecl) == FUNCTION_DECL)
3391         {
3392           tree t1 = TYPE_ARG_TYPES (TREE_TYPE (olddecl));
3393           tree t2 = TYPE_ARG_TYPES (TREE_TYPE (newdecl));
3394           int i = 1;
3395
3396           if (TREE_CODE (TREE_TYPE (newdecl)) == METHOD_TYPE)
3397             t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2);
3398
3399           for (; t1 && t1 != void_list_node;
3400                t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2), i++)
3401             if (TREE_PURPOSE (t1) && TREE_PURPOSE (t2))
3402               {
3403                 if (1 == simple_cst_equal (TREE_PURPOSE (t1),
3404                                            TREE_PURPOSE (t2)))
3405                   {
3406                     if (pedantic)
3407                       {
3408                         cp_pedwarn ("default argument given for parameter %d of `%#D'",
3409                                     i, newdecl);
3410                         cp_pedwarn_at ("after previous specification in `%#D'",
3411                                        olddecl);
3412                       }
3413                   }
3414                 else
3415                   {
3416                     cp_error ("default argument given for parameter %d of `%#D'",
3417                               i, newdecl);
3418                     cp_error_at ("after previous specification in `%#D'",
3419                                  olddecl);
3420                   }
3421               }
3422
3423           if (DECL_THIS_INLINE (newdecl) && ! DECL_THIS_INLINE (olddecl)
3424               && TREE_ADDRESSABLE (olddecl) && warn_inline)
3425             {
3426               cp_warning ("`%#D' was used before it was declared inline",
3427                           newdecl);
3428               cp_warning_at ("previous non-inline declaration here",
3429                              olddecl);
3430             }
3431         }
3432     }
3433
3434   /* If new decl is `static' and an `extern' was seen previously,
3435      warn about it.  */
3436   warn_extern_redeclared_static (newdecl, olddecl);
3437
3438   /* We have committed to returning 1 at this point.  */
3439   if (TREE_CODE (newdecl) == FUNCTION_DECL)
3440     {
3441       /* Now that functions must hold information normally held
3442          by field decls, there is extra work to do so that
3443          declaration information does not get destroyed during
3444          definition.  */
3445       if (DECL_VINDEX (olddecl))
3446         DECL_VINDEX (newdecl) = DECL_VINDEX (olddecl);
3447       if (DECL_VIRTUAL_CONTEXT (olddecl))
3448         DECL_VIRTUAL_CONTEXT (newdecl) = DECL_VIRTUAL_CONTEXT (olddecl);
3449       if (DECL_CONTEXT (olddecl))
3450         DECL_CONTEXT (newdecl) = DECL_CONTEXT (olddecl);
3451       if (DECL_PENDING_INLINE_INFO (newdecl) == (struct pending_inline *)0)
3452         DECL_PENDING_INLINE_INFO (newdecl) = DECL_PENDING_INLINE_INFO (olddecl);
3453       DECL_STATIC_CONSTRUCTOR (newdecl) |= DECL_STATIC_CONSTRUCTOR (olddecl);
3454       DECL_STATIC_DESTRUCTOR (newdecl) |= DECL_STATIC_DESTRUCTOR (olddecl);
3455       DECL_PURE_VIRTUAL_P (newdecl) |= DECL_PURE_VIRTUAL_P (olddecl);
3456       DECL_VIRTUAL_P (newdecl) |= DECL_VIRTUAL_P (olddecl);
3457       DECL_NEEDS_FINAL_OVERRIDER_P (newdecl) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl);
3458       DECL_THIS_STATIC (newdecl) |= DECL_THIS_STATIC (olddecl);
3459       DECL_LANG_SPECIFIC (newdecl)->u2 = DECL_LANG_SPECIFIC (olddecl)->u2;
3460       new_defines_function = DECL_INITIAL (newdecl) != NULL_TREE;
3461
3462       /* Optionally warn about more than one declaration for the same
3463          name, but don't warn about a function declaration followed by a
3464          definition.  */
3465       if (warn_redundant_decls && ! DECL_ARTIFICIAL (olddecl)
3466           && !(new_defines_function && DECL_INITIAL (olddecl) == NULL_TREE)
3467           /* Don't warn about extern decl followed by definition. */
3468           && !(DECL_EXTERNAL (olddecl) && ! DECL_EXTERNAL (newdecl))
3469           /* Don't warn about friends, let add_friend take care of it. */
3470           && ! DECL_FRIEND_P (newdecl))
3471         {
3472           cp_warning ("redundant redeclaration of `%D' in same scope", newdecl);
3473           cp_warning_at ("previous declaration of `%D'", olddecl);
3474         }
3475     }
3476
3477   /* Deal with C++: must preserve virtual function table size.  */
3478   if (TREE_CODE (olddecl) == TYPE_DECL)
3479     {
3480       register tree newtype = TREE_TYPE (newdecl);
3481       register tree oldtype = TREE_TYPE (olddecl);
3482
3483       if (newtype != error_mark_node && oldtype != error_mark_node
3484           && TYPE_LANG_SPECIFIC (newtype) && TYPE_LANG_SPECIFIC (oldtype))
3485         {
3486           CLASSTYPE_VSIZE (newtype) = CLASSTYPE_VSIZE (oldtype);
3487           CLASSTYPE_FRIEND_CLASSES (newtype)
3488             = CLASSTYPE_FRIEND_CLASSES (oldtype);
3489         }
3490     }
3491
3492   /* Copy all the DECL_... slots specified in the new decl
3493      except for any that we copy here from the old type.  */
3494   DECL_MACHINE_ATTRIBUTES (newdecl)
3495     = merge_machine_decl_attributes (olddecl, newdecl);
3496
3497   if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3498     {
3499       if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl),
3500                              DECL_TEMPLATE_RESULT (olddecl)))
3501         cp_error ("invalid redeclaration of %D", newdecl);
3502       TREE_TYPE (olddecl) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl));
3503       DECL_TEMPLATE_SPECIALIZATIONS (olddecl)
3504         = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl),
3505                    DECL_TEMPLATE_SPECIALIZATIONS (newdecl));
3506
3507       return 1;
3508     }
3509
3510   if (types_match)
3511     {
3512       /* Automatically handles default parameters.  */
3513       tree oldtype = TREE_TYPE (olddecl);
3514       tree newtype;
3515
3516       /* Merge the data types specified in the two decls.  */
3517       newtype = common_type (TREE_TYPE (newdecl), TREE_TYPE (olddecl));
3518
3519       if (TREE_CODE (newdecl) == VAR_DECL)
3520         DECL_THIS_EXTERN (newdecl) |= DECL_THIS_EXTERN (olddecl);
3521       /* Do this after calling `common_type' so that default
3522          parameters don't confuse us.  */
3523       else if (TREE_CODE (newdecl) == FUNCTION_DECL
3524           && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl))
3525               != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl))))
3526         {
3527           TREE_TYPE (newdecl) = build_exception_variant (newtype,
3528                                                          TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)));
3529           TREE_TYPE (olddecl) = build_exception_variant (newtype,
3530                                                          TYPE_RAISES_EXCEPTIONS (oldtype));
3531
3532           if ((pedantic || ! DECL_IN_SYSTEM_HEADER (olddecl))
3533               && DECL_SOURCE_LINE (olddecl) != 0
3534               && flag_exceptions
3535               && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)),
3536                                      TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl)), 1))
3537             {
3538               cp_error ("declaration of `%F' throws different exceptions",
3539                         newdecl);
3540               cp_error_at ("than previous declaration `%F'", olddecl);
3541             }
3542         }
3543       TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = newtype;
3544
3545       /* Lay the type out, unless already done.  */
3546       if (! same_type_p (newtype, oldtype)
3547           && TREE_TYPE (newdecl) != error_mark_node
3548           && !(processing_template_decl && uses_template_parms (newdecl)))
3549         layout_type (TREE_TYPE (newdecl));
3550
3551       if ((TREE_CODE (newdecl) == VAR_DECL
3552            || TREE_CODE (newdecl) == PARM_DECL
3553            || TREE_CODE (newdecl) == RESULT_DECL
3554            || TREE_CODE (newdecl) == FIELD_DECL
3555            || TREE_CODE (newdecl) == TYPE_DECL)
3556           && !(processing_template_decl && uses_template_parms (newdecl)))
3557         layout_decl (newdecl, 0);
3558
3559       /* Merge the type qualifiers.  */
3560       if (TREE_READONLY (newdecl))
3561         TREE_READONLY (olddecl) = 1;
3562       if (TREE_THIS_VOLATILE (newdecl))
3563         TREE_THIS_VOLATILE (olddecl) = 1;
3564
3565       /* Merge the initialization information.  */
3566       if (DECL_INITIAL (newdecl) == NULL_TREE
3567           && DECL_INITIAL (olddecl) != NULL_TREE)
3568         {
3569           DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
3570           DECL_SOURCE_FILE (newdecl) = DECL_SOURCE_FILE (olddecl);
3571           DECL_SOURCE_LINE (newdecl) = DECL_SOURCE_LINE (olddecl);
3572           if (CAN_HAVE_FULL_LANG_DECL_P (newdecl)
3573               && DECL_LANG_SPECIFIC (newdecl)
3574               && DECL_LANG_SPECIFIC (olddecl))
3575             DECL_SAVED_TREE (newdecl) = DECL_SAVED_TREE (olddecl);
3576         }
3577
3578       /* Merge the section attribute.
3579          We want to issue an error if the sections conflict but that must be
3580          done later in decl_attributes since we are called before attributes
3581          are assigned.  */
3582       if (DECL_SECTION_NAME (newdecl) == NULL_TREE)
3583         DECL_SECTION_NAME (newdecl) = DECL_SECTION_NAME (olddecl);
3584
3585       /* Keep the old rtl since we can safely use it.  */
3586       DECL_RTL (newdecl) = DECL_RTL (olddecl);
3587
3588       if (TREE_CODE (newdecl) == FUNCTION_DECL)
3589         {
3590           DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl)
3591             |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl);
3592           DECL_NO_CHECK_MEMORY_USAGE (newdecl)
3593             |= DECL_NO_CHECK_MEMORY_USAGE (olddecl);
3594           DECL_NO_LIMIT_STACK (newdecl)
3595             |= DECL_NO_LIMIT_STACK (olddecl);
3596         }
3597     }
3598   /* If cannot merge, then use the new type and qualifiers,
3599      and don't preserve the old rtl.  */
3600   else
3601     {
3602       /* Clean out any memory we had of the old declaration.  */
3603       tree oldstatic = value_member (olddecl, static_aggregates);
3604       if (oldstatic)
3605         TREE_VALUE (oldstatic) = error_mark_node;
3606
3607       TREE_TYPE (olddecl) = TREE_TYPE (newdecl);
3608       TREE_READONLY (olddecl) = TREE_READONLY (newdecl);
3609       TREE_THIS_VOLATILE (olddecl) = TREE_THIS_VOLATILE (newdecl);
3610       TREE_SIDE_EFFECTS (olddecl) = TREE_SIDE_EFFECTS (newdecl);
3611     }
3612
3613   /* Merge the storage class information.  */
3614   DECL_WEAK (newdecl) |= DECL_WEAK (olddecl);
3615   DECL_ONE_ONLY (newdecl) |= DECL_ONE_ONLY (olddecl);
3616   DECL_DEFER_OUTPUT (newdecl) |= DECL_DEFER_OUTPUT (olddecl);
3617   TREE_PUBLIC (newdecl) = TREE_PUBLIC (olddecl);
3618   TREE_STATIC (olddecl) = TREE_STATIC (newdecl) |= TREE_STATIC (olddecl);
3619   if (! DECL_EXTERNAL (olddecl))
3620     DECL_EXTERNAL (newdecl) = 0;
3621
3622   if (DECL_LANG_SPECIFIC (newdecl) && DECL_LANG_SPECIFIC (olddecl))
3623     {
3624       DECL_INTERFACE_KNOWN (newdecl) |= DECL_INTERFACE_KNOWN (olddecl);
3625       DECL_NOT_REALLY_EXTERN (newdecl) |= DECL_NOT_REALLY_EXTERN (olddecl);
3626       DECL_COMDAT (newdecl) |= DECL_COMDAT (olddecl);
3627       DECL_TEMPLATE_INSTANTIATED (newdecl)
3628         |= DECL_TEMPLATE_INSTANTIATED (olddecl);
3629       /* Don't really know how much of the language-specific
3630          values we should copy from old to new.  */
3631       DECL_IN_AGGR_P (newdecl) = DECL_IN_AGGR_P (olddecl);
3632       DECL_ACCESS (newdecl) = DECL_ACCESS (olddecl);
3633       DECL_NONCONVERTING_P (newdecl) = DECL_NONCONVERTING_P (olddecl);
3634       DECL_TEMPLATE_INFO (newdecl) = DECL_TEMPLATE_INFO (olddecl);
3635       olddecl_friend = DECL_FRIEND_P (olddecl);
3636
3637       /* Only functions have DECL_BEFRIENDING_CLASSES.  */
3638       if (TREE_CODE (newdecl) == FUNCTION_DECL
3639           || DECL_FUNCTION_TEMPLATE_P (newdecl))
3640         DECL_BEFRIENDING_CLASSES (newdecl)
3641           = chainon (DECL_BEFRIENDING_CLASSES (newdecl),
3642                      DECL_BEFRIENDING_CLASSES (olddecl));
3643     }
3644
3645   if (TREE_CODE (newdecl) == FUNCTION_DECL)
3646     {
3647       if (DECL_TEMPLATE_INSTANTIATION (olddecl)
3648           && !DECL_TEMPLATE_INSTANTIATION (newdecl))
3649         {
3650           /* If newdecl is not a specialization, then it is not a
3651              template-related function at all.  And that means that we
3652              shoud have exited above, returning 0.  */
3653           my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl),
3654                               0);
3655
3656           if (TREE_USED (olddecl))
3657             /* From [temp.expl.spec]:
3658
3659                If a template, a member template or the member of a class
3660                template is explicitly specialized then that
3661                specialization shall be declared before the first use of
3662                that specialization that would cause an implicit
3663                instantiation to take place, in every translation unit in
3664                which such a use occurs.  */
3665             cp_error ("explicit specialization of %D after first use",
3666                       olddecl);
3667
3668           SET_DECL_TEMPLATE_SPECIALIZATION (olddecl);
3669         }
3670       DECL_THIS_INLINE (newdecl) |= DECL_THIS_INLINE (olddecl);
3671
3672       /* If either decl says `inline', this fn is inline, unless its
3673          definition was passed already.  */
3674       if (DECL_INLINE (newdecl) && DECL_INITIAL (olddecl) == NULL_TREE)
3675         DECL_INLINE (olddecl) = 1;
3676       DECL_INLINE (newdecl) = DECL_INLINE (olddecl);
3677
3678       if (! types_match)
3679         {
3680           DECL_LANGUAGE (olddecl) = DECL_LANGUAGE (newdecl);
3681           DECL_ASSEMBLER_NAME (olddecl) = DECL_ASSEMBLER_NAME (newdecl);
3682           DECL_RTL (olddecl) = DECL_RTL (newdecl);
3683         }
3684       if (! types_match || new_defines_function)
3685         {
3686           /* These need to be copied so that the names are available.
3687              Note that if the types do match, we'll preserve inline
3688              info and other bits, but if not, we won't.  */
3689           DECL_ARGUMENTS (olddecl) = DECL_ARGUMENTS (newdecl);
3690           DECL_RESULT (olddecl) = DECL_RESULT (newdecl);
3691         }
3692       if (new_defines_function)
3693         /* If defining a function declared with other language
3694            linkage, use the previously declared language linkage.  */
3695         DECL_LANGUAGE (newdecl) = DECL_LANGUAGE (olddecl);
3696       else if (types_match)
3697         {
3698           /* If redeclaring a builtin function, and not a definition,
3699              it stays built in.  */
3700           if (DECL_BUILT_IN (olddecl))
3701             {
3702               DECL_BUILT_IN_CLASS (newdecl) = DECL_BUILT_IN_CLASS (olddecl);
3703               DECL_FUNCTION_CODE (newdecl) = DECL_FUNCTION_CODE (olddecl);
3704               /* If we're keeping the built-in definition, keep the rtl,
3705                  regardless of declaration matches.  */
3706               DECL_RTL (newdecl) = DECL_RTL (olddecl);
3707             }
3708           else
3709             DECL_FRAME_SIZE (newdecl) = DECL_FRAME_SIZE (olddecl);
3710
3711           DECL_RESULT (newdecl) = DECL_RESULT (olddecl);
3712           if ((DECL_SAVED_INSNS (newdecl) = DECL_SAVED_INSNS (olddecl)))
3713             /* Previously saved insns go together with
3714                the function's previous definition.  */
3715             DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
3716           /* Don't clear out the arguments if we're redefining a function.  */
3717           if (DECL_ARGUMENTS (olddecl))
3718             DECL_ARGUMENTS (newdecl) = DECL_ARGUMENTS (olddecl);
3719         }
3720     }
3721
3722   if (TREE_CODE (newdecl) == NAMESPACE_DECL)
3723     {
3724       NAMESPACE_LEVEL (newdecl) = NAMESPACE_LEVEL (olddecl);
3725     }
3726
3727   /* Now preserve various other info from the definition.  */
3728   TREE_ADDRESSABLE (newdecl) = TREE_ADDRESSABLE (olddecl);
3729   TREE_ASM_WRITTEN (newdecl) = TREE_ASM_WRITTEN (olddecl);
3730   DECL_COMMON (newdecl) = DECL_COMMON (olddecl);
3731   DECL_ASSEMBLER_NAME (newdecl) = DECL_ASSEMBLER_NAME (olddecl);
3732
3733   if (TREE_CODE (newdecl) == FUNCTION_DECL)
3734     {
3735       int function_size;
3736
3737       function_size = sizeof (struct tree_decl);
3738
3739       bcopy ((char *) newdecl + sizeof (struct tree_common),
3740              (char *) olddecl + sizeof (struct tree_common),
3741              function_size - sizeof (struct tree_common));
3742
3743       if (DECL_TEMPLATE_INSTANTIATION (newdecl))
3744         {
3745           /* If newdecl is a template instantiation, it is possible that
3746              the following sequence of events has occurred:
3747
3748              o A friend function was declared in a class template.  The
3749              class template was instantiated.
3750
3751              o The instantiation of the friend declaration was
3752              recorded on the instantiation list, and is newdecl.
3753
3754              o Later, however, instantiate_class_template called pushdecl
3755              on the newdecl to perform name injection.  But, pushdecl in
3756              turn called duplicate_decls when it discovered that another
3757              declaration of a global function with the same name already
3758              existed.
3759
3760              o Here, in duplicate_decls, we decided to clobber newdecl.
3761
3762              If we're going to do that, we'd better make sure that
3763              olddecl, and not newdecl, is on the list of
3764              instantiations so that if we try to do the instantiation
3765              again we won't get the clobbered declaration.  */
3766
3767           tree tmpl = DECL_TI_TEMPLATE (newdecl);
3768           tree decls = DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
3769
3770           for (; decls; decls = TREE_CHAIN (decls))
3771             if (TREE_VALUE (decls) == newdecl)
3772               TREE_VALUE (decls) = olddecl;
3773         }
3774     }
3775   else
3776     {
3777       bcopy ((char *) newdecl + sizeof (struct tree_common),
3778              (char *) olddecl + sizeof (struct tree_common),
3779              sizeof (struct tree_decl) - sizeof (struct tree_common)
3780              + tree_code_length [(int)TREE_CODE (newdecl)] * sizeof (char *));
3781     }
3782
3783   DECL_UID (olddecl) = olddecl_uid;
3784   if (olddecl_friend)
3785     DECL_FRIEND_P (olddecl) = 1;
3786
3787   /* NEWDECL contains the merged attribute lists.
3788      Update OLDDECL to be the same.  */
3789   DECL_MACHINE_ATTRIBUTES (olddecl) = DECL_MACHINE_ATTRIBUTES (newdecl);
3790
3791   return 1;
3792 }
3793
3794 /* Record a decl-node X as belonging to the current lexical scope.
3795    Check for errors (such as an incompatible declaration for the same
3796    name already seen in the same scope).
3797
3798    Returns either X or an old decl for the same name.
3799    If an old decl is returned, it may have been smashed
3800    to agree with what X says.  */
3801
3802 tree
3803 pushdecl (x)
3804      tree x;
3805 {
3806   register tree t;
3807   register tree name;
3808   int need_new_binding;
3809
3810   /* We shouldn't be calling pushdecl when we're generating RTL for a
3811      function that we already did semantic analysis on previously.  */
3812   my_friendly_assert (!cfun || doing_semantic_analysis_p (),
3813                       19990913);
3814
3815   need_new_binding = 1;
3816
3817   if (DECL_TEMPLATE_PARM_P (x))
3818     /* Template parameters have no context; they are not X::T even
3819        when declared within a class or namespace.  */
3820     ;
3821   else
3822     {
3823       if (current_function_decl && x != current_function_decl
3824           /* A local declaration for a function doesn't constitute
3825              nesting.  */
3826           && !(TREE_CODE (x) == FUNCTION_DECL && !DECL_INITIAL (x))
3827           /* A local declaration for an `extern' variable is in the
3828              scoped of the current namespace, not the current
3829              function.  */
3830           && !(TREE_CODE (x) == VAR_DECL && DECL_EXTERNAL (x))
3831           && !DECL_CONTEXT (x))
3832         DECL_CONTEXT (x) = current_function_decl;
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)
3867         {
3868           tree match;
3869
3870           if (TREE_CODE (x) == FUNCTION_DECL)
3871             for (match = t; match; match = OVL_NEXT (match))
3872               {
3873                 if (DECL_ASSEMBLER_NAME (OVL_CURRENT (t))
3874                     == DECL_ASSEMBLER_NAME (x))
3875                   break;
3876               }
3877           else
3878             /* Just choose one.  */
3879             match = t;
3880
3881           if (match)
3882             t = OVL_CURRENT (match);
3883           else
3884             t = NULL_TREE;
3885         }
3886
3887       if (t == error_mark_node)
3888         {
3889           /* error_mark_node is 0 for a while during initialization!  */
3890           t = NULL_TREE;
3891           cp_error_at ("`%#D' used prior to declaration", x);
3892         }
3893       else if (t != NULL_TREE)
3894         {
3895           if (TREE_CODE (t) == PARM_DECL)
3896             {
3897               if (DECL_CONTEXT (t) == NULL_TREE)
3898                 fatal ("parse errors have confused me too much");
3899
3900               /* Check for duplicate params.  */
3901               if (duplicate_decls (x, t))
3902                 return t;
3903             }
3904           else if ((DECL_EXTERN_C_FUNCTION_P (x)
3905                     || DECL_FUNCTION_TEMPLATE_P (x))
3906                    && is_overloaded_fn (t))
3907             /* Don't do anything just yet. */;
3908           else if (t == wchar_decl_node)
3909             {
3910               if (pedantic && ! DECL_IN_SYSTEM_HEADER (x))
3911                 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x));
3912
3913               /* Throw away the redeclaration.  */
3914               return t;
3915             }
3916           else if (TREE_CODE (t) != TREE_CODE (x))
3917             {
3918               if (duplicate_decls (x, t))
3919                 return t;
3920             }
3921           else if (duplicate_decls (x, t))
3922             {
3923               if (TREE_CODE (t) == TYPE_DECL)
3924                 SET_IDENTIFIER_TYPE_VALUE (name, TREE_TYPE (t));
3925               else if (TREE_CODE (t) == FUNCTION_DECL)
3926                 check_default_args (t);
3927
3928               return t;
3929             }
3930           else if (DECL_MAIN_P (x))
3931             {
3932               /* A redeclaration of main, but not a duplicate of the
3933                  previous one.
3934
3935                  [basic.start.main]
3936
3937                  This function shall not be overloaded.  */
3938               cp_error_at ("invalid redeclaration of `%D'", t);
3939               cp_error ("as `%D'", x);
3940               /* We don't try to push this declaration since that
3941                  causes a crash.  */
3942               return x;
3943             }
3944         }
3945
3946       check_template_shadow (x);
3947
3948       /* If this is a function conjured up by the backend, massage it
3949          so it looks friendly.  */
3950       if (DECL_NON_THUNK_FUNCTION_P (x) && ! DECL_LANG_SPECIFIC (x))
3951         {
3952           retrofit_lang_decl (x);
3953           DECL_LANGUAGE (x) = lang_c;
3954         }
3955
3956       if (DECL_NON_THUNK_FUNCTION_P (x) && ! DECL_FUNCTION_MEMBER_P (x))
3957         {
3958           t = push_overloaded_decl (x, PUSH_LOCAL);
3959           if (t != x)
3960             return t;
3961           if (!namespace_bindings_p ())
3962             /* We do not need to create a binding for this name;
3963                push_overloaded_decl will have already done so if
3964                necessary.  */
3965             need_new_binding = 0;
3966         }
3967       else if (DECL_FUNCTION_TEMPLATE_P (x) && DECL_NAMESPACE_SCOPE_P (x))
3968         {
3969           t = push_overloaded_decl (x, PUSH_GLOBAL);
3970           if (t == x)
3971             add_decl_to_level (x, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t)));
3972           return t;
3973         }
3974
3975       /* If declaring a type as a typedef, copy the type (unless we're
3976          at line 0), and install this TYPE_DECL as the new type's typedef
3977          name.  See the extensive comment in ../c-decl.c (pushdecl). */
3978       if (TREE_CODE (x) == TYPE_DECL)
3979         {
3980           tree type = TREE_TYPE (x);
3981           if (DECL_SOURCE_LINE (x) == 0)
3982             {
3983               if (TYPE_NAME (type) == 0)
3984                 TYPE_NAME (type) = x;
3985             }
3986           else if (type != error_mark_node && TYPE_NAME (type) != x
3987                    /* We don't want to copy the type when all we're
3988                       doing is making a TYPE_DECL for the purposes of
3989                       inlining.  */
3990                    && (!TYPE_NAME (type)
3991                        || TYPE_NAME (type) != DECL_ABSTRACT_ORIGIN (x)))
3992             {
3993               DECL_ORIGINAL_TYPE (x) = type;
3994               type = build_type_copy (type);
3995               TYPE_STUB_DECL (type) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x));
3996               TYPE_NAME (type) = x;
3997               TREE_TYPE (x) = type;
3998             }
3999
4000           if (type != error_mark_node
4001               && TYPE_NAME (type)
4002               && TYPE_IDENTIFIER (type))
4003             set_identifier_type_value_with_scope (DECL_NAME (x), type,
4004                                                   current_binding_level);
4005
4006         }
4007
4008       /* Multiple external decls of the same identifier ought to match.
4009
4010          We get warnings about inline functions where they are defined.
4011          We get warnings about other functions from push_overloaded_decl.
4012
4013          Avoid duplicate warnings where they are used.  */
4014       if (TREE_PUBLIC (x) && TREE_CODE (x) != FUNCTION_DECL)
4015         {
4016           tree decl;
4017
4018           if (IDENTIFIER_NAMESPACE_VALUE (name) != NULL_TREE
4019               && IDENTIFIER_NAMESPACE_VALUE (name) != error_mark_node
4020               && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name))
4021                   || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name))))
4022             decl = IDENTIFIER_NAMESPACE_VALUE (name);
4023           else
4024             decl = NULL_TREE;
4025
4026           if (decl
4027               /* If different sort of thing, we already gave an error.  */
4028               && TREE_CODE (decl) == TREE_CODE (x)
4029               && !same_type_p (TREE_TYPE (x), TREE_TYPE (decl)))
4030             {
4031               cp_pedwarn ("type mismatch with previous external decl", x);
4032               cp_pedwarn_at ("previous external decl of `%#D'", decl);
4033             }
4034         }
4035
4036       /* This name is new in its binding level.
4037          Install the new declaration and return it.  */
4038       if (namespace_bindings_p ())
4039         {
4040           /* Install a global value.  */
4041
4042           /* If the first global decl has external linkage,
4043              warn if we later see static one.  */
4044           if (IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE && TREE_PUBLIC (x))
4045             TREE_PUBLIC (name) = 1;
4046
4047           /* Bind the mangled name for the entity.  In the future, we
4048              should not need to do this; mangled names are an
4049              implementation detail of which the front-end should not
4050              need to be aware.  */
4051           if (!(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)
4052                 && t != NULL_TREE)
4053               /* For an ordinary function, we create a binding from
4054                  the mangled name (i.e., NAME) to the DECL.  But, for
4055                  an `extern "C"' function, the mangled name and the
4056                  ordinary name are the same so we need not do this.  */
4057               && !DECL_EXTERN_C_FUNCTION_P (x))
4058             {
4059               tree mangled_name;
4060
4061               if (TREE_CODE (x) == TYPE_DECL || TREE_CODE (x) == VAR_DECL
4062                   || TREE_CODE (x) == NAMESPACE_DECL)
4063                 mangled_name = name;
4064               else
4065                 mangled_name = DECL_ASSEMBLER_NAME (x);
4066
4067               if (TREE_CODE (x) == FUNCTION_DECL)
4068                 my_friendly_assert
4069                   ((IDENTIFIER_GLOBAL_VALUE (mangled_name) == NULL_TREE)
4070                   || (IDENTIFIER_GLOBAL_VALUE (mangled_name) == x), 378);
4071               SET_IDENTIFIER_NAMESPACE_VALUE (mangled_name, x);
4072             }
4073
4074           /* Don't forget if the function was used via an implicit decl.  */
4075           if (IDENTIFIER_IMPLICIT_DECL (name)
4076               && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name)))
4077             TREE_USED (x) = 1;
4078
4079           /* Don't forget if its address was taken in that way.  */
4080           if (IDENTIFIER_IMPLICIT_DECL (name)
4081               && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name)))
4082             TREE_ADDRESSABLE (x) = 1;
4083
4084           /* Warn about mismatches against previous implicit decl.  */
4085           if (IDENTIFIER_IMPLICIT_DECL (name) != NULL_TREE
4086               /* If this real decl matches the implicit, don't complain.  */
4087               && ! (TREE_CODE (x) == FUNCTION_DECL
4088                     && TREE_TYPE (TREE_TYPE (x)) == integer_type_node))
4089             cp_warning
4090               ("`%D' was previously implicitly declared to return `int'", x);
4091
4092           /* If new decl is `static' and an `extern' was seen previously,
4093              warn about it.  */
4094           if (x != NULL_TREE && t != NULL_TREE && decls_match (x, t))
4095             warn_extern_redeclared_static (x, t);
4096         }
4097       else
4098         {
4099           /* Here to install a non-global value.  */
4100           tree oldlocal = IDENTIFIER_VALUE (name);
4101           tree oldglobal = IDENTIFIER_NAMESPACE_VALUE (name);
4102
4103           if (need_new_binding)
4104             {
4105               push_local_binding (name, x, 0);
4106               /* Because push_local_binding will hook X on to the
4107                  current_binding_level's name list, we don't want to
4108                  do that again below.  */
4109               need_new_binding = 0;
4110             }
4111
4112           /* If this is a TYPE_DECL, push it into the type value slot.  */
4113           if (TREE_CODE (x) == TYPE_DECL)
4114             set_identifier_type_value_with_scope (name, TREE_TYPE (x),
4115                                                   current_binding_level);
4116
4117           /* Clear out any TYPE_DECL shadowed by a namespace so that
4118              we won't think this is a type.  The C struct hack doesn't
4119              go through namespaces.  */
4120           if (TREE_CODE (x) == NAMESPACE_DECL)
4121             set_identifier_type_value_with_scope (name, NULL_TREE,
4122                                                   current_binding_level);
4123
4124           if (oldlocal)
4125             {
4126               tree d = oldlocal;
4127
4128               while (oldlocal
4129                      && TREE_CODE (oldlocal) == VAR_DECL
4130                      && DECL_DEAD_FOR_LOCAL (oldlocal))
4131                 oldlocal = DECL_SHADOWED_FOR_VAR (oldlocal);
4132
4133               if (oldlocal == NULL_TREE)
4134                 oldlocal = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d));
4135             }
4136
4137           /* If this is an extern function declaration, see if we
4138              have a global definition or declaration for the function.  */
4139           if (oldlocal == NULL_TREE
4140               && DECL_EXTERNAL (x)
4141               && oldglobal != NULL_TREE
4142               && TREE_CODE (x) == FUNCTION_DECL
4143               && TREE_CODE (oldglobal) == FUNCTION_DECL)
4144             {
4145               /* We have one.  Their types must agree.  */
4146               if (decls_match (x, oldglobal))
4147                 /* OK */;
4148               else
4149                 {
4150                   cp_warning ("extern declaration of `%#D' doesn't match", x);
4151                   cp_warning_at ("global declaration `%#D'", oldglobal);
4152                 }
4153             }
4154           /* If we have a local external declaration,
4155              and no file-scope declaration has yet been seen,
4156              then if we later have a file-scope decl it must not be static.  */
4157           if (oldlocal == NULL_TREE
4158               && oldglobal == NULL_TREE
4159               && DECL_EXTERNAL (x)
4160               && TREE_PUBLIC (x))
4161             TREE_PUBLIC (name) = 1;
4162
4163           /* Warn if shadowing an argument at the top level of the body.  */
4164           if (oldlocal != NULL_TREE && !DECL_EXTERNAL (x)
4165               /* Inline decls shadow nothing.  */
4166               && !DECL_FROM_INLINE (x)
4167               && TREE_CODE (oldlocal) == PARM_DECL
4168               /* Don't complain if it's from an enclosing function.  */
4169               && DECL_CONTEXT (oldlocal) == current_function_decl
4170               && TREE_CODE (x) != PARM_DECL)
4171             {
4172               /* Go to where the parms should be and see if we
4173                  find them there.  */
4174               struct binding_level *b = current_binding_level->level_chain;
4175
4176               if (cleanup_label)
4177                 b = b->level_chain;
4178
4179               /* ARM $8.3 */
4180               if (b->parm_flag == 1)
4181                 cp_error ("declaration of `%#D' shadows a parameter", name);
4182             }
4183
4184           /* Maybe warn if shadowing something else.  */
4185           if (warn_shadow && !DECL_EXTERNAL (x)
4186               /* Inline decls shadow nothing.  */
4187               && !DECL_FROM_INLINE (x)
4188               /* No shadow warnings for internally generated vars.  */
4189               && ! DECL_ARTIFICIAL (x)
4190               /* No shadow warnings for vars made for inlining.  */
4191               && ! DECL_FROM_INLINE (x))
4192             {
4193               if (oldlocal != NULL_TREE && TREE_CODE (oldlocal) == PARM_DECL)
4194                 warning ("declaration of `%s' shadows a parameter",
4195                         IDENTIFIER_POINTER (name));
4196               else if (IDENTIFIER_CLASS_VALUE (name) != NULL_TREE
4197                        && current_class_ptr
4198                        && !TREE_STATIC (name))
4199                 warning ("declaration of `%s' shadows a member of `this'",
4200                         IDENTIFIER_POINTER (name));
4201               else if (oldlocal != NULL_TREE)
4202                 warning ("declaration of `%s' shadows previous local",
4203                         IDENTIFIER_POINTER (name));
4204               else if (oldglobal != NULL_TREE)
4205                 /* XXX shadow warnings in outer-more namespaces */
4206                 warning ("declaration of `%s' shadows global declaration",
4207                         IDENTIFIER_POINTER (name));
4208             }
4209         }
4210
4211       if (TREE_CODE (x) == FUNCTION_DECL)
4212         check_default_args (x);
4213
4214       /* Keep count of variables in this level with incomplete type.  */
4215       if (TREE_CODE (x) == VAR_DECL
4216           && TREE_TYPE (x) != error_mark_node
4217           && ((!COMPLETE_TYPE_P (TREE_TYPE (x))
4218                && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x), ARRAY_TYPE))
4219               /* RTTI TD entries are created while defining the type_info.  */
4220               || (TYPE_LANG_SPECIFIC (TREE_TYPE (x))
4221                   && TYPE_BEING_DEFINED (TREE_TYPE (x)))))
4222         {
4223           if (namespace_bindings_p ())
4224             namespace_scope_incomplete
4225               = tree_cons (NULL_TREE, x, namespace_scope_incomplete);
4226           else
4227             current_binding_level->incomplete
4228               = tree_cons (NULL_TREE, x, current_binding_level->incomplete);
4229         }
4230     }
4231
4232   if (need_new_binding)
4233     add_decl_to_level (x,
4234                        DECL_NAMESPACE_SCOPE_P (x)
4235                        ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x))
4236                        : current_binding_level);
4237
4238   return x;
4239 }
4240
4241 /* Same as pushdecl, but define X in binding-level LEVEL.  We rely on the
4242    caller to set DECL_CONTEXT properly.  */
4243
4244 static tree
4245 pushdecl_with_scope (x, level)
4246      tree x;
4247      struct binding_level *level;
4248 {
4249   register struct binding_level *b;
4250   tree function_decl = current_function_decl;
4251
4252   current_function_decl = NULL_TREE;
4253   if (level->parm_flag == 2)
4254     {
4255       b = class_binding_level;
4256       class_binding_level = level;
4257       pushdecl_class_level (x);
4258       class_binding_level = b;
4259     }
4260   else
4261     {
4262       b = current_binding_level;
4263       current_binding_level = level;
4264       x = pushdecl (x);
4265       current_binding_level = b;
4266     }
4267   current_function_decl = function_decl;
4268   return x;
4269 }
4270
4271 /* Like pushdecl, only it places X in the current namespace,
4272    if appropriate.  */
4273
4274 tree
4275 pushdecl_namespace_level (x)
4276      tree x;
4277 {
4278   register struct binding_level *b = current_binding_level;
4279   register tree t;
4280
4281   t = pushdecl_with_scope (x, NAMESPACE_LEVEL (current_namespace));
4282
4283   /* Now, the type_shadowed stack may screw us.  Munge it so it does
4284      what we want.  */
4285   if (TREE_CODE (x) == TYPE_DECL)
4286     {
4287       tree name = DECL_NAME (x);
4288       tree newval;
4289       tree *ptr = (tree *)0;
4290       for (; b != global_binding_level; b = b->level_chain)
4291         {
4292           tree shadowed = b->type_shadowed;
4293           for (; shadowed; shadowed = TREE_CHAIN (shadowed))
4294             if (TREE_PURPOSE (shadowed) == name)
4295               {
4296                 ptr = &TREE_VALUE (shadowed);
4297                 /* Can't break out of the loop here because sometimes
4298                    a binding level will have duplicate bindings for
4299                    PT names.  It's gross, but I haven't time to fix it.  */
4300               }
4301         }
4302       newval = TREE_TYPE (x);
4303       if (ptr == (tree *)0)
4304         {
4305           /* @@ This shouldn't be needed.  My test case "zstring.cc" trips
4306              up here if this is changed to an assertion.  --KR  */
4307           SET_IDENTIFIER_TYPE_VALUE (name, newval);
4308         }
4309       else
4310         {
4311           *ptr = newval;
4312         }
4313     }
4314   return t;
4315 }
4316
4317 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4318    if appropriate.  */
4319
4320 tree
4321 pushdecl_top_level (x)
4322      tree x;
4323 {
4324   push_to_top_level ();
4325   x = pushdecl_namespace_level (x);
4326   pop_from_top_level ();
4327   return x;
4328 }
4329
4330 /* Make the declaration of X appear in CLASS scope.  */
4331
4332 void
4333 pushdecl_class_level (x)
4334      tree x;
4335 {
4336   /* Don't use DECL_ASSEMBLER_NAME here!  Everything that looks in class
4337      scope looks for the pre-mangled name.  */
4338   register tree name;
4339
4340   if (TREE_CODE (x) == OVERLOAD)
4341     x = OVL_CURRENT (x);
4342   name = DECL_NAME (x);
4343
4344   if (name)
4345     {
4346       push_class_level_binding (name, x);
4347       if (TREE_CODE (x) == TYPE_DECL)
4348         set_identifier_type_value (name, TREE_TYPE (x));
4349     }
4350   else if (ANON_AGGR_TYPE_P (TREE_TYPE (x)))
4351     {
4352       tree f;
4353
4354       for (f = TYPE_FIELDS (TREE_TYPE (x));
4355            f;
4356            f = TREE_CHAIN (f))
4357         pushdecl_class_level (f);
4358     }
4359 }
4360
4361 /* Enter DECL into the symbol table, if that's appropriate.  Returns
4362    DECL, or a modified version thereof.  */
4363
4364 tree
4365 maybe_push_decl (decl)
4366      tree decl;
4367 {
4368   tree type = TREE_TYPE (decl);
4369
4370   /* Add this decl to the current binding level, but not if it comes
4371      from another scope, e.g. a static member variable.  TEM may equal
4372      DECL or it may be a previous decl of the same name.  */
4373   if (decl == error_mark_node
4374       || (TREE_CODE (decl) != PARM_DECL
4375           && DECL_CONTEXT (decl) != NULL_TREE
4376           /* Definitions of namespace members outside their namespace are
4377              possible. */
4378           && TREE_CODE (DECL_CONTEXT (decl)) != NAMESPACE_DECL)
4379       || (TREE_CODE (decl) == TEMPLATE_DECL && !namespace_bindings_p ())
4380       || TREE_CODE (type) == UNKNOWN_TYPE
4381       /* The declaration of a template specialization does not affect
4382          the functions available for overload resolution, so we do not
4383          call pushdecl.  */
4384       || (TREE_CODE (decl) == FUNCTION_DECL
4385           && DECL_TEMPLATE_SPECIALIZATION (decl)))
4386     return decl;
4387   else
4388     return pushdecl (decl);
4389 }
4390
4391 /* Make the declaration(s) of X appear in CLASS scope
4392    under the name NAME.  */
4393
4394 void
4395 push_class_level_binding (name, x)
4396      tree name;
4397      tree x;
4398 {
4399   tree binding;
4400   /* The class_binding_level will be NULL if x is a template
4401      parameter name in a member template.  */
4402   if (!class_binding_level)
4403     return;
4404
4405   /* Make sure that this new member does not have the same name
4406      as a template parameter.  */
4407   if (TYPE_BEING_DEFINED (current_class_type))
4408     check_template_shadow (x);
4409
4410   /* If this declaration shadows a declaration from an enclosing
4411      class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4412      we leave this class.  Record the shadowed declaration here.  */
4413   binding = IDENTIFIER_BINDING (name);
4414   if (binding
4415       && ((TREE_CODE (x) == OVERLOAD
4416            && BINDING_VALUE (binding)
4417            && is_overloaded_fn (BINDING_VALUE (binding)))
4418           || INHERITED_VALUE_BINDING_P (binding)))
4419     {
4420       tree shadow;
4421       tree old_decl;
4422
4423       /* If the old binding was from a base class, and was for a tag
4424          name, slide it over to make room for the new binding.  The
4425          old binding is still visible if explicitly qualified with a
4426          class-key.  */
4427       if (INHERITED_VALUE_BINDING_P (binding)
4428           && BINDING_VALUE (binding)
4429           && TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
4430           && DECL_ARTIFICIAL (BINDING_VALUE (binding))
4431           && !(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)))
4432         {
4433           old_decl = BINDING_TYPE (binding);
4434           BINDING_TYPE (binding) = BINDING_VALUE (binding);
4435           BINDING_VALUE (binding) = NULL_TREE;
4436           INHERITED_VALUE_BINDING_P (binding) = 0;
4437         }
4438       else
4439         old_decl = BINDING_VALUE (binding);
4440
4441       /* There was already a binding for X containing fewer
4442          functions than are named in X.  Find the previous
4443          declaration of X on the class-shadowed list, and update it.  */
4444       for (shadow = class_binding_level->class_shadowed;
4445            shadow;
4446            shadow = TREE_CHAIN (shadow))
4447         if (TREE_PURPOSE (shadow) == name
4448             && TREE_TYPE (shadow) == old_decl)
4449           {
4450             BINDING_VALUE (binding) = x;
4451             INHERITED_VALUE_BINDING_P (binding) = 0;
4452             TREE_TYPE (shadow) = x;
4453             return;
4454           }
4455     }
4456
4457   /* If we didn't replace an existing binding, put the binding on the
4458      stack of bindings for the identifier, and update
4459      IDENTIFIER_CLASS_VALUE.  */
4460   if (push_class_binding (name, x))
4461     {
4462       class_binding_level->class_shadowed
4463         = tree_cons (name, IDENTIFIER_CLASS_VALUE (name),
4464                      class_binding_level->class_shadowed);
4465       /* Record the value we are binding NAME to so that we can know
4466          what to pop later.  */
4467       TREE_TYPE (class_binding_level->class_shadowed) = x;
4468     }
4469 }
4470
4471 /* Insert another USING_DECL into the current binding level, returning
4472    this declaration. If this is a redeclaration, do nothing, and
4473    return NULL_TREE if this not in namespace scope (in namespace
4474    scope, a using decl might extend any previous bindings).  */
4475
4476 tree
4477 push_using_decl (scope, name)
4478      tree scope;
4479      tree name;
4480 {
4481   tree decl;
4482
4483   my_friendly_assert (TREE_CODE (scope) == NAMESPACE_DECL, 383);
4484   my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 384);
4485   for (decl = current_binding_level->usings; decl; decl = TREE_CHAIN (decl))
4486     if (DECL_INITIAL (decl) == scope && DECL_NAME (decl) == name)
4487       break;
4488   if (decl)
4489     return namespace_bindings_p () ? decl : NULL_TREE;
4490   decl = build_lang_decl (USING_DECL, name, void_type_node);
4491   DECL_INITIAL (decl) = scope;
4492   TREE_CHAIN (decl) = current_binding_level->usings;
4493   current_binding_level->usings = decl;
4494   return decl;
4495 }
4496
4497 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4498    changed (i.e. there was already a directive), or the fresh
4499    TREE_LIST otherwise.  */
4500
4501 tree
4502 push_using_directive (used)
4503      tree used;
4504 {
4505   tree ud = current_binding_level->using_directives;
4506   tree iter, ancestor;
4507
4508   /* Check if we already have this. */
4509   if (purpose_member (used, ud) != NULL_TREE)
4510     return NULL_TREE;
4511
4512   /* Recursively add all namespaces used. */
4513   for (iter = DECL_NAMESPACE_USING (used); iter; iter = TREE_CHAIN (iter))
4514     push_using_directive (TREE_PURPOSE (iter));
4515
4516   ancestor = namespace_ancestor (current_decl_namespace (), used);
4517   ud = current_binding_level->using_directives;
4518   ud = tree_cons (used, ancestor, ud);
4519   current_binding_level->using_directives = ud;
4520   return ud;
4521 }
4522
4523 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4524    other definitions already in place.  We get around this by making
4525    the value of the identifier point to a list of all the things that
4526    want to be referenced by that name.  It is then up to the users of
4527    that name to decide what to do with that list.
4528
4529    DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4530    DECL_TEMPLATE_RESULT.  It is dealt with the same way.
4531
4532    FLAGS is a bitwise-or of the following values:
4533      PUSH_LOCAL: Bind DECL in the current scope, rather than at
4534                  namespace scope.
4535      PUSH_USING: DECL is being pushed as the result of a using
4536                  declaration.
4537
4538    The value returned may be a previous declaration if we guessed wrong
4539    about what language DECL should belong to (C or C++).  Otherwise,
4540    it's always DECL (and never something that's not a _DECL).  */
4541
4542 tree
4543 push_overloaded_decl (decl, flags)
4544      tree decl;
4545      int flags;
4546 {
4547   tree name = DECL_NAME (decl);
4548   tree old;
4549   tree new_binding;
4550   int doing_global = (namespace_bindings_p () || !(flags & PUSH_LOCAL));
4551
4552   if (doing_global)
4553     old = namespace_binding (name, DECL_CONTEXT (decl));
4554   else
4555     old = lookup_name_current_level (name);
4556
4557   if (old)
4558     {
4559       if (TREE_CODE (old) == TYPE_DECL && DECL_ARTIFICIAL (old))
4560         {
4561           tree t = TREE_TYPE (old);
4562           if (IS_AGGR_TYPE (t) && warn_shadow
4563               && (! DECL_IN_SYSTEM_HEADER (decl)
4564                   || ! DECL_IN_SYSTEM_HEADER (old)))
4565             cp_warning ("`%#D' hides constructor for `%#T'", decl, t);
4566           old = NULL_TREE;
4567         }
4568       else if (is_overloaded_fn (old))
4569         {
4570           tree tmp;
4571
4572           for (tmp = old; tmp; tmp = OVL_NEXT (tmp))
4573             {
4574               tree fn = OVL_CURRENT (tmp);
4575
4576               if (TREE_CODE (tmp) == OVERLOAD && OVL_USED (tmp)
4577                   && !(flags & PUSH_USING)
4578                   && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
4579                                 TYPE_ARG_TYPES (TREE_TYPE (decl))))
4580                 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4581                           decl, fn);
4582
4583               if (duplicate_decls (decl, fn))
4584                 return fn;
4585             }
4586         }
4587       else if (old == error_mark_node)
4588         /* Ignore the undefined symbol marker.  */
4589         old = NULL_TREE;
4590       else
4591         {
4592           cp_error_at ("previous non-function declaration `%#D'", old);
4593           cp_error ("conflicts with function declaration `%#D'", decl);
4594           return decl;
4595         }
4596     }
4597
4598   if (old || TREE_CODE (decl) == TEMPLATE_DECL)
4599     {
4600       if (old && TREE_CODE (old) != OVERLOAD)
4601         new_binding = ovl_cons (decl, ovl_cons (old, NULL_TREE));
4602       else
4603         new_binding = ovl_cons (decl, old);
4604       if (flags & PUSH_USING)
4605         OVL_USED (new_binding) = 1;
4606     }
4607   else
4608     /* NAME is not ambiguous.  */
4609     new_binding = decl;
4610
4611   if (doing_global)
4612     set_namespace_binding (name, current_namespace, new_binding);
4613   else
4614     {
4615       /* We only create an OVERLOAD if there was a previous binding at
4616          this level, or if decl is a template. In the former case, we
4617          need to remove the old binding and replace it with the new
4618          binding.  We must also run through the NAMES on the binding
4619          level where the name was bound to update the chain.  */
4620
4621       if (TREE_CODE (new_binding) == OVERLOAD && old)
4622         {
4623           tree *d;
4624
4625           for (d = &BINDING_LEVEL (IDENTIFIER_BINDING (name))->names;
4626                *d;
4627                d = &TREE_CHAIN (*d))
4628             if (*d == old
4629                 || (TREE_CODE (*d) == TREE_LIST
4630                     && TREE_VALUE (*d) == old))
4631               {
4632                 if (TREE_CODE (*d) == TREE_LIST)
4633                   /* Just replace the old binding with the new.  */
4634                   TREE_VALUE (*d) = new_binding;
4635                 else
4636                   /* Build a TREE_LIST to wrap the OVERLOAD.  */
4637                   *d = tree_cons (NULL_TREE, new_binding,
4638                                   TREE_CHAIN (*d));
4639
4640                 /* And update the CPLUS_BINDING node.  */
4641                 BINDING_VALUE (IDENTIFIER_BINDING (name))
4642                   = new_binding;
4643                 return decl;
4644               }
4645
4646           /* We should always find a previous binding in this case.  */
4647           my_friendly_abort (0);
4648         }
4649
4650       /* Install the new binding.  */
4651       push_local_binding (name, new_binding, flags);
4652     }
4653
4654   return decl;
4655 }
4656 \f
4657 /* Generate an implicit declaration for identifier FUNCTIONID
4658    as a function of type int ().  Print a warning if appropriate.  */
4659
4660 tree
4661 implicitly_declare (functionid)
4662      tree functionid;
4663 {
4664   register tree decl;
4665
4666   /* We used to reuse an old implicit decl here,
4667      but this loses with inline functions because it can clobber
4668      the saved decl chains.  */
4669   decl = build_lang_decl (FUNCTION_DECL, functionid, default_function_type);
4670
4671   DECL_EXTERNAL (decl) = 1;
4672   TREE_PUBLIC (decl) = 1;
4673
4674   /* ISO standard says implicit declarations are in the innermost block.
4675      So we record the decl in the standard fashion.  */
4676   pushdecl (decl);
4677   rest_of_decl_compilation (decl, NULL_PTR, 0, 0);
4678
4679   if (warn_implicit
4680       /* Only one warning per identifier.  */
4681       && IDENTIFIER_IMPLICIT_DECL (functionid) == NULL_TREE)
4682     {
4683       cp_pedwarn ("implicit declaration of function `%#D'", decl);
4684     }
4685
4686   SET_IDENTIFIER_IMPLICIT_DECL (functionid, decl);
4687
4688   return decl;
4689 }
4690
4691 /* Return zero if the declaration NEWDECL is valid
4692    when the declaration OLDDECL (assumed to be for the same name)
4693    has already been seen.
4694    Otherwise return an error message format string with a %s
4695    where the identifier should go.  */
4696
4697 static const char *
4698 redeclaration_error_message (newdecl, olddecl)
4699      tree newdecl, olddecl;
4700 {
4701   if (TREE_CODE (newdecl) == TYPE_DECL)
4702     {
4703       /* Because C++ can put things into name space for free,
4704          constructs like "typedef struct foo { ... } foo"
4705          would look like an erroneous redeclaration.  */
4706       if (same_type_p (TREE_TYPE (newdecl), TREE_TYPE (olddecl)))
4707         return 0;
4708       else
4709         return "redefinition of `%#D'";
4710     }
4711   else if (TREE_CODE (newdecl) == FUNCTION_DECL)
4712     {
4713       /* If this is a pure function, its olddecl will actually be
4714          the original initialization to `0' (which we force to call
4715          abort()).  Don't complain about redefinition in this case.  */
4716       if (DECL_LANG_SPECIFIC (olddecl) && DECL_PURE_VIRTUAL_P (olddecl))
4717         return 0;
4718
4719       /* If both functions come from different namespaces, this is not
4720          a redeclaration - this is a conflict with a used function. */
4721       if (DECL_NAMESPACE_SCOPE_P (olddecl)
4722           && DECL_CONTEXT (olddecl) != DECL_CONTEXT (newdecl))
4723         return "`%D' conflicts with used function";
4724
4725       /* We'll complain about linkage mismatches in
4726          warn_extern_redeclared_static.  */
4727
4728       /* Defining the same name twice is no good.  */
4729       if (DECL_INITIAL (olddecl) != NULL_TREE
4730           && DECL_INITIAL (newdecl) != NULL_TREE)
4731         {
4732           if (DECL_NAME (olddecl) == NULL_TREE)
4733             return "`%#D' not declared in class";
4734           else
4735             return "redefinition of `%#D'";
4736         }
4737       return 0;
4738     }
4739   else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
4740     {
4741       if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
4742            && (DECL_TEMPLATE_RESULT (newdecl)
4743                != DECL_TEMPLATE_RESULT (olddecl))
4744            && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl))
4745            && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl)))
4746           || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL
4747               && COMPLETE_TYPE_P (TREE_TYPE (newdecl))
4748               && COMPLETE_TYPE_P (TREE_TYPE (olddecl))))
4749         return "redefinition of `%#D'";
4750       return 0;
4751     }
4752   else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl))
4753     {
4754       /* Objects declared at top level:  */
4755       /* If at least one is a reference, it's ok.  */
4756       if (DECL_EXTERNAL (newdecl) || DECL_EXTERNAL (olddecl))
4757         return 0;
4758       /* Reject two definitions.  */
4759       return "redefinition of `%#D'";
4760     }
4761   else
4762     {
4763       /* Objects declared with block scope:  */
4764       /* Reject two definitions, and reject a definition
4765          together with an external reference.  */
4766       if (!(DECL_EXTERNAL (newdecl) && DECL_EXTERNAL (olddecl)))
4767         return "redeclaration of `%#D'";
4768       return 0;
4769     }
4770 }
4771 \f
4772 /* Create a new label, named ID.  */
4773
4774 static tree
4775 make_label_decl (id, local_p)
4776      tree id;
4777      int local_p;
4778 {
4779   tree decl;
4780
4781   decl = build_decl (LABEL_DECL, id, void_type_node);
4782   if (expanding_p)
4783     /* Make sure every label has an rtx.  */
4784     label_rtx (decl);
4785
4786   DECL_CONTEXT (decl) = current_function_decl;
4787   DECL_MODE (decl) = VOIDmode;
4788   C_DECLARED_LABEL_FLAG (decl) = local_p;
4789
4790   /* Say where one reference is to the label, for the sake of the
4791      error if it is not defined.  */
4792   DECL_SOURCE_LINE (decl) = lineno;
4793   DECL_SOURCE_FILE (decl) = input_filename;
4794
4795   /* Record the fact that this identifier is bound to this label.  */
4796   SET_IDENTIFIER_LABEL_VALUE (id, decl);
4797
4798   return decl;
4799 }
4800
4801 /* Record this label on the list of used labels so that we can check
4802    at the end of the function to see whether or not the label was
4803    actually defined, and so we can check when the label is defined whether
4804    this use is valid.  */
4805
4806 static void
4807 use_label (decl)
4808      tree decl;
4809 {
4810   if (named_label_uses == NULL
4811       || named_label_uses->names_in_scope != current_binding_level->names
4812       || named_label_uses->label_decl != decl)
4813     {
4814       struct named_label_use_list *new_ent;
4815       new_ent = ((struct named_label_use_list *)
4816                  ggc_alloc (sizeof (struct named_label_use_list)));
4817       new_ent->label_decl = decl;
4818       new_ent->names_in_scope = current_binding_level->names;
4819       new_ent->binding_level = current_binding_level;
4820       new_ent->lineno_o_goto = lineno;
4821       new_ent->filename_o_goto = input_filename;
4822       new_ent->next = named_label_uses;
4823       named_label_uses = new_ent;
4824     }
4825 }
4826
4827 /* Look for a label named ID in the current function.  If one cannot
4828    be found, create one.  (We keep track of used, but undefined,
4829    labels, and complain about them at the end of a function.)  */
4830
4831 tree
4832 lookup_label (id)
4833      tree id;
4834 {
4835   tree decl;
4836   struct named_label_list *ent;
4837
4838   /* You can't use labels at global scope.  */
4839   if (current_function_decl == NULL_TREE)
4840     {
4841       error ("label `%s' referenced outside of any function",
4842              IDENTIFIER_POINTER (id));
4843       return NULL_TREE;
4844     }
4845
4846   /* See if we've already got this label.  */
4847   decl = IDENTIFIER_LABEL_VALUE (id);
4848   if (decl != NULL_TREE && DECL_CONTEXT (decl) == current_function_decl)
4849     return decl;
4850
4851   /* Record this label on the list of labels used in this function.
4852      We do this before calling make_label_decl so that we get the
4853      IDENTIFIER_LABEL_VALUE before the new label is declared.  */
4854   ent = ((struct named_label_list *)
4855          ggc_alloc_cleared (sizeof (struct named_label_list)));
4856   ent->old_value = IDENTIFIER_LABEL_VALUE (id);
4857   ent->next = named_labels;
4858   named_labels = ent;
4859
4860   /* We need a new label.  */
4861   decl = make_label_decl (id, /*local_p=*/0);
4862
4863   /* Now fill in the information we didn't have before.  */
4864   ent->label_decl = decl;
4865
4866   return decl;
4867 }
4868
4869 /* Declare a local label named ID.  */
4870
4871 tree
4872 declare_local_label (id)
4873      tree id;
4874 {
4875   tree decl;
4876
4877   /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4878      this scope we can restore the old value of
4879      IDENTIFIER_TYPE_VALUE.  */
4880   current_binding_level->shadowed_labels
4881     = tree_cons (IDENTIFIER_LABEL_VALUE (id), NULL_TREE,
4882                  current_binding_level->shadowed_labels);
4883   /* Look for the label.  */
4884   decl = make_label_decl (id, /*local_p=*/1);
4885   /* Now fill in the information we didn't have before.  */
4886   TREE_VALUE (current_binding_level->shadowed_labels) = decl;
4887
4888   return decl;
4889 }
4890
4891 /* Returns nonzero if it is ill-formed to jump past the declaration of
4892    DECL.  Returns 2 if it's also a real problem.  */
4893
4894 static int
4895 decl_jump_unsafe (decl)
4896      tree decl;
4897 {
4898   if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
4899     return 0;
4900
4901   if (DECL_INITIAL (decl) == NULL_TREE
4902       && pod_type_p (TREE_TYPE (decl)))
4903     return 0;
4904
4905   /* This is really only important if we're crossing an initialization.
4906      The POD stuff is just pedantry; why should it matter if the class
4907      contains a field of pointer to member type?  */
4908   if (DECL_INITIAL (decl)
4909       || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl))))
4910     return 2;
4911   return 1;
4912 }
4913
4914 /* Check that a single previously seen jump to a newly defined label
4915    is OK.  DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4916    the jump context; NAMES are the names in scope in LEVEL at the jump
4917    context; FILE and LINE are the source position of the jump or 0.  */
4918
4919 static void
4920 check_previous_goto_1 (decl, level, names, file, line)
4921      tree decl;
4922      struct binding_level *level;
4923      tree names;
4924      const char *file;
4925      int line;
4926 {
4927   int identified = 0;
4928   int saw_eh = 0;
4929   struct binding_level *b = current_binding_level;
4930   for (; b; b = b->level_chain)
4931     {
4932       tree new_decls = b->names;
4933       tree old_decls = (b == level ? names : NULL_TREE);
4934       for (; new_decls != old_decls;
4935            new_decls = TREE_CHAIN (new_decls))
4936         {
4937           int problem = decl_jump_unsafe (new_decls);
4938           if (! problem)
4939             continue;
4940
4941           if (! identified)
4942             {
4943               if (decl)
4944                 cp_pedwarn ("jump to label `%D'", decl);
4945               else
4946                 pedwarn ("jump to case label");
4947
4948               if (file)
4949                 pedwarn_with_file_and_line (file, line, "  from here");
4950               identified = 1;
4951             }
4952
4953           if (problem > 1 && DECL_ARTIFICIAL (new_decls))
4954             /* Can't skip init of __exception_info.  */
4955             cp_error_at ("  enters catch block", new_decls);
4956           else if (problem > 1)
4957             cp_error_at ("  crosses initialization of `%#D'",
4958                          new_decls);
4959           else
4960             cp_pedwarn_at ("  enters scope of non-POD `%#D'",
4961                            new_decls);
4962         }
4963
4964       if (b == level)
4965         break;
4966       if (b->eh_region && ! saw_eh)
4967         {
4968           if (! identified)
4969             {
4970               if (decl)
4971                 cp_pedwarn ("jump to label `%D'", decl);
4972               else
4973                 pedwarn ("jump to case label");
4974
4975               if (file)
4976                 pedwarn_with_file_and_line (file, line, "  from here");
4977               identified = 1;
4978             }
4979           error ("  enters try block");
4980           saw_eh = 1;
4981         }
4982     }
4983 }
4984
4985 static void
4986 check_previous_goto (use)
4987      struct named_label_use_list *use;
4988 {
4989   check_previous_goto_1 (use->label_decl, use->binding_level,
4990                          use->names_in_scope, use->filename_o_goto,
4991                          use->lineno_o_goto);
4992 }
4993
4994 static void
4995 check_switch_goto (level)
4996      struct binding_level *level;
4997 {
4998   check_previous_goto_1 (NULL_TREE, level, level->names, NULL, 0);
4999 }
5000
5001 /* Check that any previously seen jumps to a newly defined label DECL
5002    are OK.  Called by define_label.  */
5003
5004 static void
5005 check_previous_gotos (decl)
5006      tree decl;
5007 {
5008   struct named_label_use_list **usep;
5009
5010   if (! TREE_USED (decl))
5011     return;
5012
5013   for (usep = &named_label_uses; *usep; )
5014     {
5015       struct named_label_use_list *use = *usep;
5016       if (use->label_decl == decl)
5017         {
5018           check_previous_goto (use);
5019           *usep = use->next;
5020         }
5021       else
5022         usep = &(use->next);
5023     }
5024 }
5025
5026 /* Check that a new jump to a label DECL is OK.  Called by
5027    finish_goto_stmt.  */
5028
5029 void
5030 check_goto (decl)
5031      tree decl;
5032 {
5033   int identified = 0;
5034   tree bad;
5035   struct named_label_list *lab;
5036
5037   /* We can't know where a computed goto is jumping.  So we assume
5038      that it's OK.  */
5039   if (! DECL_P (decl))
5040     return;
5041
5042   /* If the label hasn't been defined yet, defer checking.  */
5043   if (! DECL_INITIAL (decl))
5044     {
5045       use_label (decl);
5046       return;
5047     }
5048
5049   for (lab = named_labels; lab; lab = lab->next)
5050     if (decl == lab->label_decl)
5051       break;
5052
5053   /* If the label is not on named_labels it's a gcc local label, so
5054      it must be in an outer scope, so jumping to it is always OK.  */
5055   if (lab == 0)
5056     return;
5057
5058   if ((lab->eh_region || lab->bad_decls) && !identified)
5059     {
5060       cp_pedwarn_at ("jump to label `%D'", decl);
5061       pedwarn ("  from here");
5062       identified = 1;
5063     }
5064
5065   for (bad = lab->bad_decls; bad; bad = TREE_CHAIN (bad))
5066     {
5067       tree b = TREE_VALUE (bad);
5068       int u = decl_jump_unsafe (b);
5069
5070       if (u > 1 && DECL_ARTIFICIAL (b))
5071         /* Can't skip init of __exception_info.  */
5072         cp_error_at ("  enters catch block", b);
5073       else if (u > 1)
5074         cp_error_at ("  skips initialization of `%#D'", b);
5075       else
5076         cp_pedwarn_at ("  enters scope of non-POD `%#D'", b);
5077     }
5078
5079   if (lab->eh_region)
5080     error ("  enters try block");
5081 }
5082
5083 /* Define a label, specifying the location in the source file.
5084    Return the LABEL_DECL node for the label, if the definition is valid.
5085    Otherwise return 0.  */
5086
5087 tree
5088 define_label (filename, line, name)
5089      const char *filename;
5090      int line;
5091      tree name;
5092 {
5093   tree decl = lookup_label (name);
5094   struct named_label_list *ent;
5095
5096   for (ent = named_labels; ent; ent = ent->next)
5097     if (ent->label_decl == decl)
5098       break;
5099
5100   /* After labels, make any new cleanups go into their
5101      own new (temporary) binding contour.  */
5102   current_binding_level->more_cleanups_ok = 0;
5103
5104   if (name == get_identifier ("wchar_t"))
5105     cp_pedwarn ("label named wchar_t");
5106
5107   if (DECL_INITIAL (decl) != NULL_TREE)
5108     {
5109       cp_error ("duplicate label `%D'", decl);
5110       return 0;
5111     }
5112   else
5113     {
5114       /* Mark label as having been defined.  */
5115       DECL_INITIAL (decl) = error_mark_node;
5116       /* Say where in the source.  */
5117       DECL_SOURCE_FILE (decl) = filename;
5118       DECL_SOURCE_LINE (decl) = line;
5119       if (ent)
5120         {
5121           ent->names_in_scope = current_binding_level->names;
5122           ent->binding_level = current_binding_level;
5123         }
5124       check_previous_gotos (decl);
5125       current_function_return_value = NULL_TREE;
5126       return decl;
5127     }
5128 }
5129
5130 struct cp_switch
5131 {
5132   struct binding_level *level;
5133   struct cp_switch *next;
5134 };
5135
5136 static struct cp_switch *switch_stack;
5137
5138 void
5139 push_switch ()
5140 {
5141   struct cp_switch *p
5142     = (struct cp_switch *) xmalloc (sizeof (struct cp_switch));
5143   p->level = current_binding_level;
5144   p->next = switch_stack;
5145   switch_stack = p;
5146 }
5147
5148 void
5149 pop_switch ()
5150 {
5151   struct cp_switch *cs;
5152
5153   cs = switch_stack;
5154   switch_stack = switch_stack->next;
5155   free (cs);
5156 }
5157
5158 /* Note that we've seen a definition of a case label, and complain if this
5159    is a bad place for one.  */
5160
5161 void
5162 define_case_label ()
5163 {
5164   tree cleanup = last_cleanup_this_contour ();
5165
5166   if (! switch_stack)
5167     /* Don't crash; we'll complain in do_case.  */
5168     return;
5169
5170   if (cleanup)
5171     {
5172       static int explained = 0;
5173       cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup));
5174       warning ("where case label appears here");
5175       if (!explained)
5176         {
5177           warning ("(enclose actions of previous case statements requiring");
5178           warning ("destructors in their own binding contours.)");
5179           explained = 1;
5180         }
5181     }
5182
5183   check_switch_goto (switch_stack->level);
5184
5185   /* After labels, make any new cleanups go into their
5186      own new (temporary) binding contour.  */
5187
5188   current_binding_level->more_cleanups_ok = 0;
5189   current_function_return_value = NULL_TREE;
5190 }
5191 \f
5192 /* Return the list of declarations of the current level.
5193    Note that this list is in reverse order unless/until
5194    you nreverse it; and when you do nreverse it, you must
5195    store the result back using `storedecls' or you will lose.  */
5196
5197 tree
5198 getdecls ()
5199 {
5200   return current_binding_level->names;
5201 }
5202
5203 /* Return the list of type-tags (for structs, etc) of the current level.  */
5204
5205 tree
5206 gettags ()
5207 {
5208   return current_binding_level->tags;
5209 }
5210
5211 /* Store the list of declarations of the current level.
5212    This is done for the parameter declarations of a function being defined,
5213    after they are modified in the light of any missing parameters.  */
5214
5215 static void
5216 storedecls (decls)
5217      tree decls;
5218 {
5219   current_binding_level->names = decls;
5220 }
5221
5222 /* Similarly, store the list of tags of the current level.  */
5223
5224 void
5225 storetags (tags)
5226      tree tags;
5227 {
5228   current_binding_level->tags = tags;
5229 }
5230 \f
5231 /* Given NAME, an IDENTIFIER_NODE,
5232    return the structure (or union or enum) definition for that name.
5233    Searches binding levels from BINDING_LEVEL up to the global level.
5234    If THISLEVEL_ONLY is nonzero, searches only the specified context
5235    (but skips any tag-transparent contexts to find one that is
5236    meaningful for tags).
5237    FORM says which kind of type the caller wants;
5238    it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5239    If the wrong kind of type is found, and it's not a template, an error is
5240    reported.  */
5241
5242 static tree
5243 lookup_tag (form, name, binding_level, thislevel_only)
5244      enum tree_code form;
5245      tree name;
5246      struct binding_level *binding_level;
5247      int thislevel_only;
5248 {
5249   register struct binding_level *level;
5250   /* Non-zero if, we should look past a template parameter level, even
5251      if THISLEVEL_ONLY.  */
5252   int allow_template_parms_p = 1;
5253
5254   for (level = binding_level; level; level = level->level_chain)
5255     {
5256       register tree tail;
5257       if (ANON_AGGRNAME_P (name))
5258         for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5259           {
5260             /* There's no need for error checking here, because
5261                anon names are unique throughout the compilation.  */
5262             if (TYPE_IDENTIFIER (TREE_VALUE (tail)) == name)
5263               return TREE_VALUE (tail);
5264           }
5265       else if (level->namespace_p)
5266         /* Do namespace lookup. */
5267         for (tail = current_namespace; 1; tail = CP_DECL_CONTEXT (tail))
5268           {
5269             tree old = binding_for_name (name, tail);
5270
5271             /* If we just skipped past a template parameter level,
5272                even though THISLEVEL_ONLY, and we find a template
5273                class declaration, then we use the _TYPE node for the
5274                template.  See the example below.  */
5275             if (thislevel_only && !allow_template_parms_p
5276                 && old && BINDING_VALUE (old)
5277                 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old)))
5278               old = TREE_TYPE (BINDING_VALUE (old));
5279             else
5280               old = BINDING_TYPE (old);
5281
5282             /* If it has an original type, it is a typedef, and we
5283                should not return it.  */
5284             if (old && DECL_ORIGINAL_TYPE (TYPE_NAME (old)))
5285               old = NULL_TREE;
5286             if (old && TREE_CODE (old) != form
5287                 && !(form != ENUMERAL_TYPE && TREE_CODE (old) == TEMPLATE_DECL))
5288               {
5289                 cp_error ("`%#D' redeclared as %C", old, form);
5290                 return NULL_TREE;
5291               }
5292             if (old)
5293               return old;
5294             if (thislevel_only || tail == global_namespace)
5295               return NULL_TREE;
5296           }
5297       else
5298         for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5299           {
5300             if (TREE_PURPOSE (tail) == name)
5301               {
5302                 enum tree_code code = TREE_CODE (TREE_VALUE (tail));
5303                 /* Should tighten this up; it'll probably permit
5304                    UNION_TYPE and a struct template, for example.  */
5305                 if (code != form
5306                     && !(form != ENUMERAL_TYPE && code == TEMPLATE_DECL))
5307                   {
5308                     /* Definition isn't the kind we were looking for.  */
5309                     cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail),
5310                               form);
5311                     return NULL_TREE;
5312                   }
5313                 return TREE_VALUE (tail);
5314               }
5315           }
5316       if (thislevel_only && ! level->tag_transparent)
5317         {
5318           if (level->template_parms_p && allow_template_parms_p)
5319             {
5320               /* We must deal with cases like this:
5321
5322                    template <class T> struct S;
5323                    template <class T> struct S {};
5324
5325                  When looking up `S', for the second declaration, we
5326                  would like to find the first declaration.  But, we
5327                  are in the pseudo-global level created for the
5328                  template parameters, rather than the (surrounding)
5329                  namespace level.  Thus, we keep going one more level,
5330                  even though THISLEVEL_ONLY is non-zero.  */
5331               allow_template_parms_p = 0;
5332               continue;
5333             }
5334           else
5335             return NULL_TREE;
5336         }
5337     }
5338   return NULL_TREE;
5339 }
5340
5341 #if 0
5342 void
5343 set_current_level_tags_transparency (tags_transparent)
5344      int tags_transparent;
5345 {
5346   current_binding_level->tag_transparent = tags_transparent;
5347 }
5348 #endif
5349
5350 /* Given a type, find the tag that was defined for it and return the tag name.
5351    Otherwise return 0.  However, the value can never be 0
5352    in the cases in which this is used.
5353
5354    C++: If NAME is non-zero, this is the new name to install.  This is
5355    done when replacing anonymous tags with real tag names.  */
5356
5357 static tree
5358 lookup_tag_reverse (type, name)
5359      tree type;
5360      tree name;
5361 {
5362   register struct binding_level *level;
5363
5364   for (level = current_binding_level; level; level = level->level_chain)
5365     {
5366       register tree tail;
5367       for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5368         {
5369           if (TREE_VALUE (tail) == type)
5370             {
5371               if (name)
5372                 TREE_PURPOSE (tail) = name;
5373               return TREE_PURPOSE (tail);
5374             }
5375         }
5376     }
5377   return NULL_TREE;
5378 }
5379 \f
5380 /* Look up NAME in the NAMESPACE.  */
5381
5382 tree
5383 lookup_namespace_name (namespace, name)
5384      tree namespace, name;
5385 {
5386   tree val;
5387   tree template_id = NULL_TREE;
5388
5389   my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL, 370);
5390
5391   if (TREE_CODE (name) == NAMESPACE_DECL)
5392     /* This happens for A::B<int> when B is a namespace. */
5393     return name;
5394   else if (TREE_CODE (name) == TEMPLATE_DECL)
5395     {
5396       /* This happens for A::B where B is a template, and there are no
5397          template arguments.  */
5398       cp_error ("invalid use of `%D'", name);
5399       return error_mark_node;
5400     }
5401
5402   namespace = ORIGINAL_NAMESPACE (namespace);
5403
5404   if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
5405     {
5406       template_id = name;
5407       name = TREE_OPERAND (name, 0);
5408       if (TREE_CODE (name) == OVERLOAD)
5409         name = DECL_NAME (OVL_CURRENT (name));
5410       else if (DECL_P (name))
5411         name = DECL_NAME (name);
5412     }
5413
5414   my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 373);
5415
5416   val = make_node (CPLUS_BINDING);
5417   if (!qualified_lookup_using_namespace (name, namespace, val, 0))
5418     return error_mark_node;
5419
5420   if (BINDING_VALUE (val))
5421     {
5422       val = BINDING_VALUE (val);
5423
5424       if (template_id)
5425         {
5426           if (DECL_CLASS_TEMPLATE_P (val))
5427             val = lookup_template_class (val,
5428                                          TREE_OPERAND (template_id, 1),
5429                                          /*in_decl=*/NULL_TREE,
5430                                          /*context=*/NULL_TREE,
5431                                          /*entering_scope=*/0);
5432           else if (DECL_FUNCTION_TEMPLATE_P (val)
5433                    || TREE_CODE (val) == OVERLOAD)
5434             val = lookup_template_function (val,
5435                                             TREE_OPERAND (template_id, 1));
5436           else
5437             {
5438               cp_error ("`%D::%D' is not a template",
5439                         namespace, name);
5440               return error_mark_node;
5441             }
5442         }
5443
5444       /* If we have a single function from a using decl, pull it out.  */
5445       if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
5446         val = OVL_FUNCTION (val);
5447       return val;
5448     }
5449
5450   cp_error ("`%D' undeclared in namespace `%D'", name, namespace);
5451   return error_mark_node;
5452 }
5453
5454 /* Hash a TYPENAME_TYPE.  K is really of type `tree'.  */
5455
5456 static unsigned long
5457 typename_hash (k)
5458      hash_table_key k;
5459 {
5460   unsigned long hash;
5461   tree t;
5462
5463   t = (tree) k;
5464   hash = (((unsigned long) TYPE_CONTEXT (t))
5465           ^ ((unsigned long) DECL_NAME (TYPE_NAME (t))));
5466
5467   return hash;
5468 }
5469
5470 /* Compare two TYPENAME_TYPEs.  K1 and K2 are really of type `tree'.  */
5471
5472 static boolean
5473 typename_compare (k1, k2)
5474      hash_table_key k1;
5475      hash_table_key k2;
5476 {
5477   tree t1;
5478   tree t2;
5479   tree d1;
5480   tree d2;
5481
5482   t1 = (tree) k1;
5483   t2 = (tree) k2;
5484   d1 = TYPE_NAME (t1);
5485   d2 = TYPE_NAME (t2);
5486
5487   return (DECL_NAME (d1) == DECL_NAME (d2)
5488           && same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2))
5489           && ((TREE_TYPE (t1) != NULL_TREE)
5490               == (TREE_TYPE (t2) != NULL_TREE))
5491           && same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
5492           && TYPENAME_TYPE_FULLNAME (t1) == TYPENAME_TYPE_FULLNAME (t2));
5493 }
5494
5495 /* Build a TYPENAME_TYPE.  If the type is `typename T::t', CONTEXT is
5496    the type of `T', NAME is the IDENTIFIER_NODE for `t'.  If BASE_TYPE
5497    is non-NULL, this type is being created by the implicit typename
5498    extension, and BASE_TYPE is a type named `t' in some base class of
5499    `T' which depends on template parameters.
5500
5501    Returns the new TYPENAME_TYPE.  */
5502
5503 tree
5504 build_typename_type (context, name, fullname, base_type)
5505      tree context;
5506      tree name;
5507      tree fullname;
5508      tree base_type;
5509 {
5510   tree t;
5511   tree d;
5512   struct hash_entry* e;
5513
5514   static struct hash_table ht;
5515
5516   if (!ht.table)
5517     {
5518       static struct hash_table *h = &ht;
5519       if (!hash_table_init (&ht, &hash_newfunc, &typename_hash,
5520                             &typename_compare))
5521         fatal ("virtual memory exhausted");
5522       ggc_add_tree_hash_table_root (&h, 1);
5523     }
5524
5525   /* Build the TYPENAME_TYPE.  */
5526   t = make_aggr_type (TYPENAME_TYPE);
5527   TYPE_CONTEXT (t) = FROB_CONTEXT (context);
5528   TYPENAME_TYPE_FULLNAME (t) = fullname;
5529   TREE_TYPE (t) = base_type;
5530
5531   /* Build the corresponding TYPE_DECL.  */
5532   d = build_decl (TYPE_DECL, name, t);
5533   TYPE_NAME (TREE_TYPE (d)) = d;
5534   TYPE_STUB_DECL (TREE_TYPE (d)) = d;
5535   DECL_CONTEXT (d) = FROB_CONTEXT (context);
5536   DECL_ARTIFICIAL (d) = 1;
5537
5538   /* See if we already have this type.  */
5539   e = hash_lookup (&ht, t, /*create=*/false, /*copy=*/0);
5540   if (e)
5541     t = (tree) e->key;
5542   else
5543     /* Insert the type into the table.  */
5544     hash_lookup (&ht, t, /*create=*/true, /*copy=*/0);
5545
5546   return t;
5547 }
5548
5549 /* Resolve `typename CONTEXT::NAME'.  Returns an appropriate type,
5550    unless an error occurs, in which case error_mark_node is returned.
5551    If COMPLAIN zero, don't complain about any errors that occur.  */
5552
5553 tree
5554 make_typename_type (context, name, complain)
5555      tree context, name;
5556      int complain;
5557 {
5558   tree fullname;
5559
5560   if (TYPE_P (name))
5561     {
5562       if (!(TYPE_LANG_SPECIFIC (name)
5563             && (CLASSTYPE_IS_TEMPLATE (name)
5564                 || CLASSTYPE_USE_TEMPLATE (name))))
5565         name = TYPE_IDENTIFIER (name);
5566       else
5567         /* Create a TEMPLATE_ID_EXPR for the type.  */
5568         name = build_nt (TEMPLATE_ID_EXPR,
5569                          CLASSTYPE_TI_TEMPLATE (name),
5570                          CLASSTYPE_TI_ARGS (name));
5571     }
5572   else if (TREE_CODE (name) == TYPE_DECL)
5573     name = DECL_NAME (name);
5574
5575   fullname = name;
5576
5577   if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
5578     {
5579       name = TREE_OPERAND (name, 0);
5580       if (TREE_CODE (name) == TEMPLATE_DECL)
5581         name = TREE_OPERAND (fullname, 0) = DECL_NAME (name);
5582     }
5583   if (TREE_CODE (name) != IDENTIFIER_NODE)
5584     my_friendly_abort (2000);
5585
5586   if (TREE_CODE (context) == NAMESPACE_DECL)
5587     {
5588       /* We can get here from typename_sub0 in the explicit_template_type
5589          expansion.  Just fail.  */
5590       if (complain)
5591         cp_error ("no class template named `%#T' in `%#T'",
5592                   name, context);
5593       return error_mark_node;
5594     }
5595
5596   if (! uses_template_parms (context)
5597       || currently_open_class (context))
5598     {
5599       if (TREE_CODE (fullname) == TEMPLATE_ID_EXPR)
5600         {
5601           tree tmpl = NULL_TREE;
5602           if (IS_AGGR_TYPE (context))
5603             tmpl = lookup_field (context, name, 0, 0);
5604           if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
5605             {
5606               if (complain)
5607                 cp_error ("no class template named `%#T' in `%#T'",
5608                           name, context);
5609               return error_mark_node;
5610             }
5611
5612           return lookup_template_class (tmpl,
5613                                         TREE_OPERAND (fullname, 1),
5614                                         NULL_TREE, context,
5615                                         /*entering_scope=*/0);
5616         }
5617       else
5618         {
5619           tree t;
5620
5621           if (!IS_AGGR_TYPE (context))
5622             {
5623               if (complain)
5624                 cp_error ("no type named `%#T' in `%#T'", name, context);
5625               return error_mark_node;
5626             }
5627
5628           t = lookup_field (context, name, 0, 1);
5629           if (t)
5630             return TREE_TYPE (t);
5631         }
5632     }
5633
5634   /* If the CONTEXT is not a template type, then either the field is
5635      there now or its never going to be.  */
5636   if (!uses_template_parms (context))
5637     {
5638       if (complain)
5639         cp_error ("no type named `%#T' in `%#T'", name, context);
5640       return error_mark_node;
5641     }
5642
5643
5644   return build_typename_type (context, name, fullname,  NULL_TREE);
5645 }
5646
5647 /* Select the right _DECL from multiple choices. */
5648
5649 static tree
5650 select_decl (binding, flags)
5651      tree binding;
5652      int flags;
5653 {
5654   tree val;
5655   val = BINDING_VALUE (binding);
5656   if (LOOKUP_NAMESPACES_ONLY (flags))
5657     {
5658       /* We are not interested in types. */
5659       if (val && TREE_CODE (val) == NAMESPACE_DECL)
5660         return val;
5661       return NULL_TREE;
5662     }
5663
5664   /* If we could have a type and
5665      we have nothing or we need a type and have none.  */
5666   if (BINDING_TYPE (binding)
5667       && (!val || ((flags & LOOKUP_PREFER_TYPES)
5668                    && TREE_CODE (val) != TYPE_DECL)))
5669     val = TYPE_STUB_DECL (BINDING_TYPE (binding));
5670   /* Don't return non-types if we really prefer types. */
5671   else if (val && LOOKUP_TYPES_ONLY (flags)  && TREE_CODE (val) != TYPE_DECL
5672            && (TREE_CODE (val) != TEMPLATE_DECL
5673                || !DECL_CLASS_TEMPLATE_P (val)))
5674     val = NULL_TREE;
5675
5676   return val;
5677 }
5678
5679 /* Unscoped lookup of a global: iterate over current namespaces,
5680    considering using-directives.  If SPACESP is non-NULL, store a list
5681    of the namespaces we've considered in it.  */
5682
5683 tree
5684 unqualified_namespace_lookup (name, flags, spacesp)
5685      tree name;
5686      int flags;
5687      tree *spacesp;
5688 {
5689   tree b = make_node (CPLUS_BINDING);
5690   tree initial = current_decl_namespace();
5691   tree scope = initial;
5692   tree siter;
5693   struct binding_level *level;
5694   tree val = NULL_TREE;
5695
5696   if (spacesp)
5697     *spacesp = NULL_TREE;
5698
5699   for (; !val; scope = CP_DECL_CONTEXT (scope))
5700     {
5701       if (spacesp)
5702         *spacesp = tree_cons (scope, NULL_TREE, *spacesp);
5703       val = binding_for_name (name, scope);
5704
5705       /* Initialize binding for this context. */
5706       BINDING_VALUE (b) = BINDING_VALUE (val);
5707       BINDING_TYPE (b) = BINDING_TYPE (val);
5708
5709       /* Add all _DECLs seen through local using-directives. */
5710       for (level = current_binding_level;
5711            !level->namespace_p;
5712            level = level->level_chain)
5713         if (!lookup_using_namespace (name, b, level->using_directives,
5714                                      scope, flags, spacesp))
5715           /* Give up because of error. */
5716           return error_mark_node;
5717
5718       /* Add all _DECLs seen through global using-directives. */
5719       /* XXX local and global using lists should work equally. */
5720       siter = initial;
5721       while (1)
5722         {
5723           if (!lookup_using_namespace (name, b, DECL_NAMESPACE_USING (siter),
5724                                        scope, flags, spacesp))
5725             /* Give up because of error. */
5726             return error_mark_node;
5727           if (siter == scope) break;
5728           siter = CP_DECL_CONTEXT (siter);
5729         }
5730
5731       val = select_decl (b, flags);
5732       if (scope == global_namespace)
5733         break;
5734     }
5735   return val;
5736 }
5737
5738 /* Combine prefer_type and namespaces_only into flags.  */
5739
5740 static int
5741 lookup_flags (prefer_type, namespaces_only)
5742   int prefer_type, namespaces_only;
5743 {
5744   if (namespaces_only)
5745     return LOOKUP_PREFER_NAMESPACES;
5746   if (prefer_type > 1)
5747     return LOOKUP_PREFER_TYPES;
5748   if (prefer_type > 0)
5749     return LOOKUP_PREFER_BOTH;
5750   return 0;
5751 }
5752
5753 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5754    ignore it or not.  Subroutine of lookup_name_real.  */
5755
5756 static tree
5757 qualify_lookup (val, flags)
5758      tree val;
5759      int flags;
5760 {
5761   if (val == NULL_TREE)
5762     return val;
5763   if ((flags & LOOKUP_PREFER_NAMESPACES) && TREE_CODE (val) == NAMESPACE_DECL)
5764     return val;
5765   if ((flags & LOOKUP_PREFER_TYPES)
5766       && (TREE_CODE (val) == TYPE_DECL
5767           || ((flags & LOOKUP_TEMPLATES_EXPECTED)
5768               && DECL_CLASS_TEMPLATE_P (val))))
5769     return val;
5770   if (flags & (LOOKUP_PREFER_NAMESPACES | LOOKUP_PREFER_TYPES))
5771     return NULL_TREE;
5772   return val;
5773 }
5774
5775 /* Any other BINDING overrides an implicit TYPENAME.  Warn about
5776    that.  */
5777
5778 static void
5779 warn_about_implicit_typename_lookup (typename, binding)
5780      tree typename;
5781      tree binding;
5782 {
5783   tree subtype = TREE_TYPE (TREE_TYPE (typename));
5784   tree name = DECL_NAME (typename);
5785
5786   if (! (TREE_CODE (binding) == TEMPLATE_DECL
5787          && CLASSTYPE_TEMPLATE_INFO (subtype)
5788          && CLASSTYPE_TI_TEMPLATE (subtype) == binding)
5789       && ! (TREE_CODE (binding) == TYPE_DECL
5790             && same_type_p (TREE_TYPE (binding), subtype)))
5791     {
5792       cp_warning ("lookup of `%D' finds `%#D'",
5793                   name, binding);
5794       cp_warning ("  instead of `%D' from dependent base class",
5795                   typename);
5796       cp_warning ("  (use `typename %T::%D' if that's what you meant)",
5797                   constructor_name (current_class_type), name);
5798     }
5799 }
5800
5801 /* Look up NAME in the current binding level and its superiors in the
5802    namespace of variables, functions and typedefs.  Return a ..._DECL
5803    node of some kind representing its definition if there is only one
5804    such declaration, or return a TREE_LIST with all the overloaded
5805    definitions if there are many, or return 0 if it is undefined.
5806
5807    If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5808    If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5809    If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5810    Otherwise we prefer non-TYPE_DECLs.
5811
5812    If NONCLASS is non-zero, we don't look for the NAME in class scope,
5813    using IDENTIFIER_CLASS_VALUE.  */
5814
5815 static tree
5816 lookup_name_real (name, prefer_type, nonclass, namespaces_only)
5817      tree name;
5818      int prefer_type, nonclass, namespaces_only;
5819 {
5820   tree t;
5821   tree val = NULL_TREE;
5822   int yylex = 0;
5823   tree from_obj = NULL_TREE;
5824   int flags;
5825   int val_is_implicit_typename = 0;
5826
5827   /* Hack: copy flag set by parser, if set. */
5828   if (only_namespace_names)
5829     namespaces_only = 1;
5830
5831   if (prefer_type == -2)
5832     {
5833       extern int looking_for_typename;
5834       tree type = NULL_TREE;
5835
5836       yylex = 1;
5837       prefer_type = looking_for_typename;
5838
5839       flags = lookup_flags (prefer_type, namespaces_only);
5840       /* If the next thing is '<', class templates are types. */
5841       if (looking_for_template)
5842         flags |= LOOKUP_TEMPLATES_EXPECTED;
5843
5844       /* std:: becomes :: for now.  */
5845       if (got_scope == std_node)
5846         got_scope = void_type_node;
5847
5848       if (got_scope)
5849         type = got_scope;
5850       else if (got_object != error_mark_node)
5851         type = got_object;
5852
5853       if (type)
5854         {
5855           if (type == error_mark_node)
5856             return error_mark_node;
5857           if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type))
5858             type = TREE_TYPE (type);
5859
5860           if (TYPE_P (type))
5861             type = complete_type (type);
5862
5863           if (TREE_CODE (type) == VOID_TYPE)
5864             type = global_namespace;
5865           if (TREE_CODE (type) == NAMESPACE_DECL)
5866             {
5867               val = make_node (CPLUS_BINDING);
5868               flags |= LOOKUP_COMPLAIN;
5869               if (!qualified_lookup_using_namespace (name, type, val, flags))
5870                 return NULL_TREE;
5871               val = select_decl (val, flags);
5872             }
5873           else if (! IS_AGGR_TYPE (type)
5874                    || TREE_CODE (type) == TEMPLATE_TYPE_PARM
5875                    || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM
5876                    || TREE_CODE (type) == TYPENAME_TYPE)
5877             /* Someone else will give an error about this if needed.  */
5878             val = NULL_TREE;
5879           else if (type == current_class_type)
5880             val = IDENTIFIER_CLASS_VALUE (name);
5881           else
5882             {
5883               val = lookup_member (type, name, 0, prefer_type);
5884               type_access_control (type, val);
5885             }
5886         }
5887       else
5888         val = NULL_TREE;
5889
5890       if (got_scope)
5891         goto done;
5892       else if (got_object && val)
5893         from_obj = val;
5894     }
5895   else
5896     {
5897       flags = lookup_flags (prefer_type, namespaces_only);
5898       /* If we're not parsing, we need to complain. */
5899       flags |= LOOKUP_COMPLAIN;
5900     }
5901
5902   /* First, look in non-namespace scopes.  */
5903
5904   if (current_class_type == NULL_TREE)
5905     nonclass = 1;
5906
5907   for (t = IDENTIFIER_BINDING (name); t; t = TREE_CHAIN (t))
5908     {
5909       tree binding;
5910
5911       if (!LOCAL_BINDING_P (t) && nonclass)
5912         /* We're not looking for class-scoped bindings, so keep going.  */
5913         continue;
5914
5915       /* If this is the kind of thing we're looking for, we're done.  */
5916       if (qualify_lookup (BINDING_VALUE (t), flags))
5917         binding = BINDING_VALUE (t);
5918       else if ((flags & LOOKUP_PREFER_TYPES)
5919                && qualify_lookup (BINDING_TYPE (t), flags))
5920         binding = BINDING_TYPE (t);
5921       else
5922         binding = NULL_TREE;
5923
5924       /* Handle access control on types from enclosing or base classes.  */
5925       if (binding && ! yylex
5926           && BINDING_LEVEL (t) && BINDING_LEVEL (t)->parm_flag == 2)
5927         type_access_control (BINDING_LEVEL (t)->this_class, binding);
5928
5929       if (binding
5930           && (!val || !IMPLICIT_TYPENAME_TYPE_DECL_P (binding)))
5931         {
5932           if (val_is_implicit_typename && !yylex)
5933             warn_about_implicit_typename_lookup (val, binding);
5934           val = binding;
5935           val_is_implicit_typename
5936             = IMPLICIT_TYPENAME_TYPE_DECL_P (val);
5937           if (!val_is_implicit_typename)
5938             break;
5939         }
5940     }
5941
5942   /* Now lookup in namespace scopes.  */
5943   if (!val || val_is_implicit_typename)
5944     {
5945       t = unqualified_namespace_lookup (name, flags, 0);
5946       if (t)
5947         {
5948           if (val_is_implicit_typename && !yylex)
5949             warn_about_implicit_typename_lookup (val, t);
5950           val = t;
5951         }
5952     }
5953
5954  done:
5955   if (val)
5956     {
5957       /* This should only warn about types used in qualified-ids.  */
5958       if (from_obj && from_obj != val)
5959         {
5960           if (looking_for_typename && TREE_CODE (from_obj) == TYPE_DECL
5961               && TREE_CODE (val) == TYPE_DECL
5962               && TREE_TYPE (from_obj) != TREE_TYPE (val))
5963             {
5964               cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5965                           name, got_object, TREE_TYPE (from_obj));
5966               cp_pedwarn ("  does not match lookup in the current scope (`%#T')",
5967                           TREE_TYPE (val));
5968             }
5969
5970           /* We don't change val to from_obj if got_object depends on
5971              template parms because that breaks implicit typename for
5972              destructor calls.  */
5973           if (! uses_template_parms (got_object))
5974             val = from_obj;
5975         }
5976
5977       /* If we have a single function from a using decl, pull it out.  */
5978       if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
5979         val = OVL_FUNCTION (val);
5980     }
5981   else if (from_obj)
5982     val = from_obj;
5983
5984   return val;
5985 }
5986
5987 tree
5988 lookup_name_nonclass (name)
5989      tree name;
5990 {
5991   return lookup_name_real (name, 0, 1, 0);
5992 }
5993
5994 tree
5995 lookup_function_nonclass (name, args)
5996      tree name;
5997      tree args;
5998 {
5999   return lookup_arg_dependent (name, lookup_name_nonclass (name), args);
6000 }
6001
6002 tree
6003 lookup_name_namespace_only (name)
6004      tree name;
6005 {
6006   /* type-or-namespace, nonclass, namespace_only */
6007   return lookup_name_real (name, 1, 1, 1);
6008 }
6009
6010 tree
6011 lookup_name (name, prefer_type)
6012      tree name;
6013      int prefer_type;
6014 {
6015   return lookup_name_real (name, prefer_type, 0, 0);
6016 }
6017
6018 /* Similar to `lookup_name' but look only in the innermost non-class
6019    binding level.  */
6020
6021 tree
6022 lookup_name_current_level (name)
6023      tree name;
6024 {
6025   struct binding_level *b;
6026   tree t = NULL_TREE;
6027
6028   b = current_binding_level;
6029   while (b->parm_flag == 2)
6030     b = b->level_chain;
6031
6032   if (b->namespace_p)
6033     {
6034       t = IDENTIFIER_NAMESPACE_VALUE (name);
6035
6036       /* extern "C" function() */
6037       if (t != NULL_TREE && TREE_CODE (t) == TREE_LIST)
6038         t = TREE_VALUE (t);
6039     }
6040   else if (IDENTIFIER_BINDING (name)
6041            && LOCAL_BINDING_P (IDENTIFIER_BINDING (name)))
6042     {
6043       while (1)
6044         {
6045           if (BINDING_LEVEL (IDENTIFIER_BINDING (name)) == b)
6046             return IDENTIFIER_VALUE (name);
6047
6048           if (b->keep == 2)
6049             b = b->level_chain;
6050           else
6051             break;
6052         }
6053     }
6054
6055   return t;
6056 }
6057
6058 /* Like lookup_name_current_level, but for types.  */
6059
6060 tree
6061 lookup_type_current_level (name)
6062      tree name;
6063 {
6064   register tree t = NULL_TREE;
6065
6066   my_friendly_assert (! current_binding_level->namespace_p, 980716);
6067
6068   if (REAL_IDENTIFIER_TYPE_VALUE (name) != NULL_TREE
6069       && REAL_IDENTIFIER_TYPE_VALUE (name) != global_type_node)
6070     {
6071       struct binding_level *b = current_binding_level;
6072       while (1)
6073         {
6074           if (purpose_member (name, b->type_shadowed))
6075             return REAL_IDENTIFIER_TYPE_VALUE (name);
6076           if (b->keep == 2)
6077             b = b->level_chain;
6078           else
6079             break;
6080         }
6081     }
6082
6083   return t;
6084 }
6085
6086 void
6087 begin_only_namespace_names ()
6088 {
6089   only_namespace_names = 1;
6090 }
6091
6092 void
6093 end_only_namespace_names ()
6094 {
6095   only_namespace_names = 0;
6096 }
6097 \f
6098 /* Arrange for the user to get a source line number, even when the
6099    compiler is going down in flames, so that she at least has a
6100    chance of working around problems in the compiler.  We used to
6101    call error(), but that let the segmentation fault continue
6102    through; now, it's much more passive by asking them to send the
6103    maintainers mail about the problem.  */
6104
6105 static void
6106 signal_catch (sig)
6107      int sig ATTRIBUTE_UNUSED;
6108 {
6109   signal (SIGSEGV, SIG_DFL);
6110 #ifdef SIGIOT
6111   signal (SIGIOT, SIG_DFL);
6112 #endif
6113 #ifdef SIGILL
6114   signal (SIGILL, SIG_DFL);
6115 #endif
6116 #ifdef SIGABRT
6117   signal (SIGABRT, SIG_DFL);
6118 #endif
6119 #ifdef SIGBUS
6120   signal (SIGBUS, SIG_DFL);
6121 #endif
6122   my_friendly_abort (0);
6123 }
6124
6125 /* Push the declarations of builtin types into the namespace.
6126    RID_INDEX, if < CP_RID_MAX is the index of the builtin type
6127    in the array RID_POINTERS.  NAME is the name used when looking
6128    up the builtin type.  TYPE is the _TYPE node for the builtin type.  */
6129
6130 static void
6131 record_builtin_type (rid_index, name, type)
6132      enum rid rid_index;
6133      const char *name;
6134      tree type;
6135 {
6136   tree rname = NULL_TREE, tname = NULL_TREE;
6137   tree tdecl = NULL_TREE;
6138
6139   if ((int) rid_index < (int) CP_RID_MAX)
6140     rname = ridpointers[(int) rid_index];
6141   if (name)
6142     tname = get_identifier (name);
6143
6144   TYPE_BUILT_IN (type) = 1;
6145
6146   if (tname)
6147     {
6148       tdecl = pushdecl (build_decl (TYPE_DECL, tname, type));
6149       set_identifier_type_value (tname, NULL_TREE);
6150       if ((int) rid_index < (int) CP_RID_MAX)
6151         /* Built-in types live in the global namespace. */
6152         SET_IDENTIFIER_GLOBAL_VALUE (tname, tdecl);
6153     }
6154   if (rname != NULL_TREE)
6155     {
6156       if (tname != NULL_TREE)
6157         {
6158           set_identifier_type_value (rname, NULL_TREE);
6159           SET_IDENTIFIER_GLOBAL_VALUE (rname, tdecl);
6160         }
6161       else
6162         {
6163           tdecl = pushdecl (build_decl (TYPE_DECL, rname, type));
6164           set_identifier_type_value (rname, NULL_TREE);
6165         }
6166     }
6167 }
6168
6169 /* Record one of the standard Java types.
6170  * Declare it as having the given NAME.
6171  * If SIZE > 0, it is the size of one of the integral types;
6172  * otherwise it is the negative of the size of one of the other types.  */
6173
6174 static tree
6175 record_builtin_java_type (name, size)
6176      const char *name;
6177      int size;
6178 {
6179   tree type, decl;
6180   if (size > 0)
6181     type = make_signed_type (size);
6182   else if (size > -32)
6183     { /* "__java_char" or ""__java_boolean". */
6184       type = make_unsigned_type (-size);
6185       /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6186     }
6187   else
6188     { /* "__java_float" or ""__java_double". */
6189       type = make_node (REAL_TYPE);
6190       TYPE_PRECISION (type) = - size;
6191       layout_type (type);
6192     }
6193   record_builtin_type (CP_RID_MAX, name, type);
6194   decl = TYPE_NAME (type);
6195
6196   /* Suppress generate debug symbol entries for these types,
6197      since for normal C++ they are just clutter.
6198      However, push_lang_context undoes this if extern "Java" is seen. */
6199   DECL_IGNORED_P (decl) = 1;
6200
6201   TYPE_FOR_JAVA (type) = 1;
6202   return type;
6203 }
6204
6205 /* Push a type into the namespace so that the back-ends ignore it. */
6206
6207 static void
6208 record_unknown_type (type, name)
6209      tree type;
6210      const char *name;
6211 {
6212   tree decl = pushdecl (build_decl (TYPE_DECL, get_identifier (name), type));
6213   /* Make sure the "unknown type" typedecl gets ignored for debug info.  */
6214   DECL_IGNORED_P (decl) = 1;
6215   TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
6216   TYPE_SIZE (type) = TYPE_SIZE (void_type_node);
6217   TYPE_ALIGN (type) = 1;
6218   TYPE_USER_ALIGN (type) = 0;
6219   TYPE_MODE (type) = TYPE_MODE (void_type_node);
6220 }
6221
6222 /* An string for which we should create an IDENTIFIER_NODE at
6223    startup.  */
6224
6225 typedef struct predefined_identifier
6226 {
6227   /* The name of the identifier.  */
6228   const char *name;
6229   /* The place where the IDENTIFIER_NODE should be stored.  */
6230   tree *node;
6231   /* Non-zero if this is the name of a constructor or destructor.  */
6232   int ctor_or_dtor_p;
6233 } predefined_identifier;
6234
6235 /* Create all the predefined identifiers.  */
6236
6237 static void
6238 initialize_predefined_identifiers ()
6239 {
6240   struct predefined_identifier *pid;
6241
6242   /* A table of identifiers to create at startup.  */
6243   static predefined_identifier predefined_identifiers[] = {
6244     { "C++", &lang_name_cplusplus, 0 },
6245     { "C", &lang_name_c, 0 },
6246     { "Java", &lang_name_java, 0 },
6247     { CTOR_NAME, &ctor_identifier, 1 },
6248     { "__base_ctor", &base_ctor_identifier, 1 },
6249     { "__comp_ctor", &complete_ctor_identifier, 1 },
6250     { DTOR_NAME, &dtor_identifier, 1 },
6251     { "__comp_dtor", &complete_dtor_identifier, 1 },
6252     { "__base_dtor", &base_dtor_identifier, 1 },
6253     { "__deleting_dtor", &deleting_dtor_identifier, 1 },
6254     { VTABLE_DELTA2_NAME, &delta2_identifier, 0 },
6255     { VTABLE_DELTA_NAME, &delta_identifier, 0 },
6256     { IN_CHARGE_NAME, &in_charge_identifier, 0 },
6257     { VTABLE_INDEX_NAME, &index_identifier, 0 },
6258     { "nelts", &nelts_identifier, 0 },
6259     { THIS_NAME, &this_identifier, 0 },
6260     { VTABLE_PFN_NAME, &pfn_identifier, 0 },
6261     { "__pfn_or_delta2", &pfn_or_delta2_identifier, 0 },
6262     { "_vptr", &vptr_identifier, 0 },
6263     { "__cp_push_exception", &cp_push_exception_identifier, 0 },
6264     { "__vtt_parm", &vtt_parm_identifier, 0 },
6265     { "std", &std_identifier, 0 },
6266     { NULL, NULL, 0 }
6267   };
6268
6269   for (pid = predefined_identifiers; pid->name; ++pid)
6270     {
6271       *pid->node = get_identifier (pid->name);
6272       if (pid->ctor_or_dtor_p)
6273         IDENTIFIER_CTOR_OR_DTOR_P (*pid->node) = 1;
6274     }
6275 }
6276
6277 /* Create the predefined scalar types of C,
6278    and some nodes representing standard constants (0, 1, (void *)0).
6279    Initialize the global binding level.
6280    Make definitions for built-in primitive functions.  */
6281
6282 void
6283 init_decl_processing ()
6284 {
6285   tree fields[20];
6286   int wchar_type_size;
6287   tree array_domain_type;
6288
6289   /* Check to see that the user did not specify an invalid combination
6290      of command-line options.  */
6291   if (flag_new_abi && !flag_vtable_thunks)
6292     fatal ("the new ABI requires vtable thunks");
6293
6294   /* Create all the identifiers we need.  */
6295   initialize_predefined_identifiers ();
6296
6297   /* Let the back-end now how to save and restore language-specific
6298      per-function globals.  */
6299   init_lang_status = &push_cp_function_context;
6300   free_lang_status = &pop_cp_function_context;
6301   mark_lang_status = &mark_cp_function_context;
6302
6303   cp_parse_init ();
6304   init_decl2 ();
6305   init_pt ();
6306
6307   /* Create the global variables.  */
6308   push_to_top_level ();
6309
6310   /* Enter the global namespace. */
6311   my_friendly_assert (global_namespace == NULL_TREE, 375);
6312   push_namespace (get_identifier ("::"));
6313   global_namespace = current_namespace;
6314   current_lang_name = NULL_TREE;
6315
6316   /* Adjust various flags based on command-line settings.  */
6317   if (flag_strict_prototype == 2)
6318     flag_strict_prototype = pedantic;
6319   if (! flag_permissive && ! pedantic)
6320     flag_pedantic_errors = 1;
6321   if (!flag_no_inline)
6322     flag_inline_trees = 1;
6323
6324   strict_prototypes_lang_c = flag_strict_prototype;
6325
6326   /* Initially, C.  */
6327   current_lang_name = lang_name_c;
6328
6329   current_function_decl = NULL_TREE;
6330   current_binding_level = NULL_BINDING_LEVEL;
6331   free_binding_level = NULL_BINDING_LEVEL;
6332
6333   /* Because most segmentation signals can be traced back into user
6334      code, catch them and at least give the user a chance of working
6335      around compiler bugs.  */
6336   signal (SIGSEGV, signal_catch);
6337
6338   /* We will also catch aborts in the back-end through signal_catch and
6339      give the user a chance to see where the error might be, and to defeat
6340      aborts in the back-end when there have been errors previously in their
6341      code.  */
6342 #ifdef SIGIOT
6343   signal (SIGIOT, signal_catch);
6344 #endif
6345 #ifdef SIGILL
6346   signal (SIGILL, signal_catch);
6347 #endif
6348 #ifdef SIGABRT
6349   signal (SIGABRT, signal_catch);
6350 #endif
6351 #ifdef SIGBUS
6352   signal (SIGBUS, signal_catch);
6353 #endif
6354
6355   build_common_tree_nodes (flag_signed_char);
6356
6357   error_mark_list = build_tree_list (error_mark_node, error_mark_node);
6358   TREE_TYPE (error_mark_list) = error_mark_node;
6359
6360   /* Make the binding_level structure for global names.  */
6361   pushlevel (0);
6362   global_binding_level = current_binding_level;
6363   /* The global level is the namespace level of ::.  */
6364   NAMESPACE_LEVEL (global_namespace) = global_binding_level;
6365   declare_namespace_level ();
6366
6367   /* Define `int' and `char' first so that dbx will output them first.  */
6368   record_builtin_type (RID_INT, NULL_PTR, integer_type_node);
6369   record_builtin_type (RID_CHAR, "char", char_type_node);
6370
6371   /* `signed' is the same as `int' */
6372   record_builtin_type (RID_SIGNED, NULL_PTR, integer_type_node);
6373   record_builtin_type (RID_LONG, "long int", long_integer_type_node);
6374   record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
6375   record_builtin_type (CP_RID_MAX, "long unsigned int",
6376                        long_unsigned_type_node);
6377   record_builtin_type (CP_RID_MAX, "unsigned long", long_unsigned_type_node);
6378   record_builtin_type (CP_RID_MAX, "long long int",
6379                        long_long_integer_type_node);
6380   record_builtin_type (CP_RID_MAX, "long long unsigned int",
6381                        long_long_unsigned_type_node);
6382   record_builtin_type (CP_RID_MAX, "long long unsigned",
6383                        long_long_unsigned_type_node);
6384   record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
6385   record_builtin_type (CP_RID_MAX, "short unsigned int",
6386                        short_unsigned_type_node);
6387   record_builtin_type (CP_RID_MAX, "unsigned short",
6388                        short_unsigned_type_node);
6389
6390   ptrdiff_type_node
6391     = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE)));
6392
6393   /* Define both `signed char' and `unsigned char'.  */
6394   record_builtin_type (CP_RID_MAX, "signed char", signed_char_type_node);
6395   record_builtin_type (CP_RID_MAX, "unsigned char", unsigned_char_type_node);
6396
6397   /* `unsigned long' is the standard type for sizeof.
6398      Note that stddef.h uses `unsigned long',
6399      and this must agree, even if long and int are the same size.  */
6400   set_sizetype
6401     (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE))));
6402
6403   /* Create the widest literal types. */
6404   widest_integer_literal_type_node = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
6405   pushdecl (build_decl (TYPE_DECL, NULL_TREE,
6406                         widest_integer_literal_type_node));
6407
6408   widest_unsigned_literal_type_node = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
6409   pushdecl (build_decl (TYPE_DECL, NULL_TREE,
6410                         widest_unsigned_literal_type_node));
6411
6412   /* These are types that type_for_size and type_for_mode use.  */
6413   pushdecl (build_decl (TYPE_DECL, NULL_TREE, intQI_type_node));
6414   pushdecl (build_decl (TYPE_DECL, NULL_TREE, intHI_type_node));
6415   pushdecl (build_decl (TYPE_DECL, NULL_TREE, intSI_type_node));
6416   pushdecl (build_decl (TYPE_DECL, NULL_TREE, intDI_type_node));
6417 #if HOST_BITS_PER_WIDE_INT >= 64
6418   pushdecl (build_decl (TYPE_DECL, get_identifier ("__int128_t"), intTI_type_node));
6419 #endif
6420   pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intQI_type_node));
6421   pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intHI_type_node));
6422   pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intSI_type_node));
6423   pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intDI_type_node));
6424 #if HOST_BITS_PER_WIDE_INT >= 64
6425   pushdecl (build_decl (TYPE_DECL, get_identifier ("__uint128_t"), unsigned_intTI_type_node));
6426 #endif
6427
6428   build_common_tree_nodes_2 (flag_short_double);
6429
6430   java_byte_type_node = record_builtin_java_type ("__java_byte", 8);
6431   java_short_type_node = record_builtin_java_type ("__java_short", 16);
6432   java_int_type_node = record_builtin_java_type ("__java_int", 32);
6433   java_long_type_node = record_builtin_java_type ("__java_long", 64);
6434   java_float_type_node = record_builtin_java_type ("__java_float", -32);
6435   java_double_type_node = record_builtin_java_type ("__java_double", -64);
6436   java_char_type_node = record_builtin_java_type ("__java_char", -16);
6437   java_boolean_type_node = record_builtin_java_type ("__java_boolean", -1);
6438
6439   integer_two_node = build_int_2 (2, 0);
6440   TREE_TYPE (integer_two_node) = integer_type_node;
6441   integer_three_node = build_int_2 (3, 0);
6442   TREE_TYPE (integer_three_node) = integer_type_node;
6443
6444   boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
6445   TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
6446   TYPE_MAX_VALUE (boolean_type_node) = build_int_2 (1, 0);
6447   TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node)) = boolean_type_node;
6448   TYPE_PRECISION (boolean_type_node) = 1;
6449   record_builtin_type (RID_BOOL, "bool", boolean_type_node);
6450   boolean_false_node = build_int_2 (0, 0);
6451   TREE_TYPE (boolean_false_node) = boolean_type_node;
6452   boolean_true_node = build_int_2 (1, 0);
6453   TREE_TYPE (boolean_true_node) = boolean_type_node;
6454
6455   signed_size_zero_node = build_int_2 (0, 0);
6456   record_builtin_type (RID_FLOAT, NULL_PTR, float_type_node);
6457   record_builtin_type (RID_DOUBLE, NULL_PTR, double_type_node);
6458   record_builtin_type (CP_RID_MAX, "long double", long_double_type_node);
6459
6460   pushdecl (build_decl (TYPE_DECL, get_identifier ("complex int"),
6461                         complex_integer_type_node));
6462   pushdecl (build_decl (TYPE_DECL, get_identifier ("complex float"),
6463                         complex_float_type_node));
6464   pushdecl (build_decl (TYPE_DECL, get_identifier ("complex double"),
6465                         complex_double_type_node));
6466   pushdecl (build_decl (TYPE_DECL, get_identifier ("complex long double"),
6467                         complex_long_double_type_node));
6468
6469   TREE_TYPE (signed_size_zero_node) = make_signed_type (TYPE_PRECISION (sizetype));
6470
6471   record_builtin_type (RID_VOID, NULL_PTR, void_type_node);
6472   void_list_node = build_tree_list (NULL_TREE, void_type_node);
6473   TREE_PARMLIST (void_list_node) = 1;
6474
6475   /* Used for expressions that do nothing, but are not errors.  */
6476   void_zero_node = build_int_2 (0, 0);
6477   TREE_TYPE (void_zero_node) = void_type_node;
6478
6479   string_type_node = build_pointer_type (char_type_node);
6480   const_string_type_node
6481     = build_pointer_type (build_qualified_type (char_type_node,
6482                                                 TYPE_QUAL_CONST));
6483   empty_except_spec = build_tree_list (NULL_TREE, NULL_TREE);
6484 #if 0
6485   record_builtin_type (CP_RID_MAX, NULL_PTR, string_type_node);
6486 #endif
6487
6488   /* Make a type to be the domain of a few array types
6489      whose domains don't really matter.
6490      200 is small enough that it always fits in size_t.  */
6491   array_domain_type = build_index_type (build_int_2 (200, 0));
6492
6493   /* Make a type for arrays of characters.
6494      With luck nothing will ever really depend on the length of this
6495      array type.  */
6496   char_array_type_node
6497     = build_array_type (char_type_node, array_domain_type);
6498
6499   /* Likewise for arrays of ints.  */
6500   int_array_type_node
6501     = build_array_type (integer_type_node, array_domain_type);
6502
6503   if (flag_new_abi)
6504     delta_type_node = ptrdiff_type_node;
6505   else if (flag_huge_objects)
6506     delta_type_node = long_integer_type_node;
6507   else
6508     delta_type_node = short_integer_type_node;
6509
6510   if (flag_new_abi)
6511     vtable_index_type = ptrdiff_type_node;
6512   else
6513     vtable_index_type = delta_type_node;
6514
6515   default_function_type
6516     = build_function_type (integer_type_node, NULL_TREE);
6517
6518   ptr_type_node = build_pointer_type (void_type_node);
6519   const_ptr_type_node
6520     = build_pointer_type (build_qualified_type (void_type_node,
6521                                                 TYPE_QUAL_CONST));
6522   vtt_parm_type = build_pointer_type (const_ptr_type_node);
6523   c_common_nodes_and_builtins (1, flag_no_builtin, flag_no_nonansi_builtin);
6524   lang_type_promotes_to = convert_type_from_ellipsis;
6525
6526   void_ftype_ptr
6527     = build_exception_variant (void_ftype_ptr, empty_except_spec);
6528
6529   /* C++ extensions */
6530
6531   unknown_type_node = make_node (UNKNOWN_TYPE);
6532   record_unknown_type (unknown_type_node, "unknown type");
6533
6534   /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node.  */
6535   TREE_TYPE (unknown_type_node) = unknown_type_node;
6536
6537   TREE_TYPE (null_node) = type_for_size (POINTER_SIZE, 0);
6538
6539   /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6540      result.  */
6541   TYPE_POINTER_TO (unknown_type_node) = unknown_type_node;
6542   TYPE_REFERENCE_TO (unknown_type_node) = unknown_type_node;
6543
6544   /* This is special for C++ so functions can be overloaded.  */
6545   wchar_type_node = get_identifier (flag_short_wchar
6546                                     ? "short unsigned int"
6547                                     : WCHAR_TYPE);
6548   wchar_type_node = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node));
6549   wchar_type_size = TYPE_PRECISION (wchar_type_node);
6550   signed_wchar_type_node = make_signed_type (wchar_type_size);
6551   unsigned_wchar_type_node = make_unsigned_type (wchar_type_size);
6552   wchar_type_node
6553     = TREE_UNSIGNED (wchar_type_node)
6554       ? unsigned_wchar_type_node
6555       : signed_wchar_type_node;
6556   record_builtin_type (RID_WCHAR, "__wchar_t", wchar_type_node);
6557
6558   /* Artificial declaration of wchar_t -- can be bashed */
6559   wchar_decl_node = build_decl (TYPE_DECL, get_identifier ("wchar_t"),
6560                                 wchar_type_node);
6561   pushdecl (wchar_decl_node);
6562
6563   /* This is for wide string constants.  */
6564   wchar_array_type_node
6565     = build_array_type (wchar_type_node, array_domain_type);
6566
6567   if (flag_vtable_thunks)
6568     {
6569       /* Make sure we get a unique function type, so we can give
6570          its pointer type a name.  (This wins for gdb.) */
6571       tree vfunc_type = make_node (FUNCTION_TYPE);
6572       TREE_TYPE (vfunc_type) = integer_type_node;
6573       TYPE_ARG_TYPES (vfunc_type) = NULL_TREE;
6574       layout_type (vfunc_type);
6575
6576       vtable_entry_type = build_pointer_type (vfunc_type);
6577     }
6578   else
6579     {
6580       vtable_entry_type = make_aggr_type (RECORD_TYPE);
6581       fields[0] = build_decl (FIELD_DECL, delta_identifier,
6582                               delta_type_node);
6583       fields[1] = build_decl (FIELD_DECL, index_identifier,
6584                               delta_type_node);
6585       fields[2] = build_decl (FIELD_DECL, pfn_identifier,
6586                               ptr_type_node);
6587       finish_builtin_type (vtable_entry_type, VTBL_PTR_TYPE, fields, 2,
6588                            double_type_node);
6589
6590       /* Make this part of an invisible union.  */
6591       fields[3] = copy_node (fields[2]);
6592       TREE_TYPE (fields[3]) = delta_type_node;
6593       DECL_NAME (fields[3]) = delta2_identifier;
6594       DECL_MODE (fields[3]) = TYPE_MODE (delta_type_node);
6595       DECL_SIZE (fields[3]) = TYPE_SIZE (delta_type_node);
6596       DECL_SIZE_UNIT (fields[3]) = TYPE_SIZE_UNIT (delta_type_node);
6597       TREE_UNSIGNED (fields[3]) = 0;
6598       TREE_CHAIN (fields[2]) = fields[3];
6599       vtable_entry_type = build_qualified_type (vtable_entry_type,
6600                                                 TYPE_QUAL_CONST);
6601     }
6602   record_builtin_type (CP_RID_MAX, VTBL_PTR_TYPE, vtable_entry_type);
6603
6604   vtbl_type_node
6605     = build_cplus_array_type (vtable_entry_type, NULL_TREE);
6606   layout_type (vtbl_type_node);
6607   vtbl_type_node = build_qualified_type (vtbl_type_node, TYPE_QUAL_CONST);
6608   record_builtin_type (CP_RID_MAX, NULL_PTR, vtbl_type_node);
6609   vtbl_ptr_type_node = build_pointer_type (vtable_entry_type);
6610   layout_type (vtbl_ptr_type_node);
6611   record_builtin_type (CP_RID_MAX, NULL_PTR, vtbl_ptr_type_node);
6612
6613   std_node = build_decl (NAMESPACE_DECL,
6614                          flag_honor_std
6615                          ? get_identifier ("fake std") : std_identifier,
6616                          void_type_node);
6617   pushdecl (std_node);
6618
6619   if (flag_new_abi)
6620     {
6621       push_namespace (get_identifier ("__cxxabiv1"));
6622       abi_node = current_namespace;
6623       pop_namespace ();
6624     }
6625
6626   global_type_node = make_node (LANG_TYPE);
6627   record_unknown_type (global_type_node, "global type");
6628
6629   /* Now, C++.  */
6630   current_lang_name = lang_name_cplusplus;
6631
6632   {
6633     tree bad_alloc_type_node, newtype, deltype;
6634     if (flag_honor_std)
6635       push_namespace (get_identifier ("std"));
6636     bad_alloc_type_node = xref_tag
6637       (class_type_node, get_identifier ("bad_alloc"), 1);
6638     if (flag_honor_std)
6639       pop_namespace ();
6640     newtype = build_exception_variant
6641       (ptr_ftype_sizetype, add_exception_specifier (NULL_TREE, bad_alloc_type_node, -1));
6642     deltype = build_exception_variant (void_ftype_ptr, empty_except_spec);
6643     push_cp_library_fn (NEW_EXPR, newtype);
6644     push_cp_library_fn (VEC_NEW_EXPR, newtype);
6645     global_delete_fndecl = push_cp_library_fn (DELETE_EXPR, deltype);
6646     push_cp_library_fn (VEC_DELETE_EXPR, deltype);
6647   }
6648
6649   abort_fndecl
6650     = build_library_fn_ptr ("__pure_virtual", void_ftype);
6651
6652   /* Perform other language dependent initializations.  */
6653   init_class_processing ();
6654   init_init_processing ();
6655   init_search_processing ();
6656   init_rtti_processing ();
6657
6658   if (flag_exceptions)
6659     init_exception_processing ();
6660   if (flag_no_inline)
6661     {
6662       flag_inline_functions = 0;
6663     }
6664
6665   if (! supports_one_only ())
6666     flag_weak = 0;
6667
6668   /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__.  */
6669   make_fname_decl = cp_make_fname_decl;
6670   declare_function_name ();
6671
6672   /* Prepare to check format strings against argument lists.  */
6673   init_function_format_info ();
6674
6675   /* Show we use EH for cleanups.  */
6676   using_eh_for_cleanups ();
6677
6678   print_error_function = lang_print_error_function;
6679   valid_lang_attribute = cp_valid_lang_attribute;
6680
6681   /* Maintain consistency.  Perhaps we should just complain if they
6682      say -fwritable-strings?  */
6683   if (flag_writable_strings)
6684     flag_const_strings = 0;
6685
6686   /* Add GC roots for all of our global variables.  */
6687   ggc_add_tree_root (c_global_trees, sizeof c_global_trees / sizeof(tree));
6688   ggc_add_tree_root (cp_global_trees, sizeof cp_global_trees / sizeof(tree));
6689   ggc_add_tree_root (&integer_three_node, 1);
6690   ggc_add_tree_root (&integer_two_node, 1);
6691   ggc_add_tree_root (&signed_size_zero_node, 1);
6692   ggc_add_tree_root (&size_one_node, 1);
6693   ggc_add_tree_root (&size_zero_node, 1);
6694   ggc_add_root (&global_binding_level, 1, sizeof global_binding_level,
6695                 mark_binding_level);
6696   ggc_add_root (&scope_chain, 1, sizeof scope_chain, &mark_saved_scope);
6697   ggc_add_tree_root (&static_ctors, 1);
6698   ggc_add_tree_root (&static_dtors, 1);
6699   ggc_add_tree_root (&lastiddecl, 1);
6700
6701   ggc_add_tree_root (&last_function_parm_tags, 1);
6702   ggc_add_tree_root (&current_function_return_value, 1);
6703   ggc_add_tree_root (&current_function_parms, 1);
6704   ggc_add_tree_root (&current_function_parm_tags, 1);
6705   ggc_add_tree_root (&last_function_parms, 1);
6706   ggc_add_tree_root (&error_mark_list, 1);
6707
6708   ggc_add_tree_root (&global_namespace, 1);
6709   ggc_add_tree_root (&global_type_node, 1);
6710   ggc_add_tree_root (&anonymous_namespace_name, 1);
6711
6712   ggc_add_tree_root (&got_object, 1);
6713   ggc_add_tree_root (&got_scope, 1);
6714
6715   ggc_add_tree_root (&current_lang_name, 1);
6716   ggc_add_tree_root (&static_aggregates, 1);
6717 }
6718
6719 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6720    decl, NAME is the initialization string and TYPE_DEP indicates whether
6721    NAME depended on the type of the function. We make use of that to detect
6722    __PRETTY_FUNCTION__ inside a template fn.  Because we build a tree for
6723    the function before emitting any of it, we don't need to treat the
6724    VAR_DECL specially. We can decide whether to emit it later, if it was
6725    used.  */
6726
6727 static tree
6728 cp_make_fname_decl (id, name, type_dep)
6729      tree id;
6730      const char *name;
6731      int type_dep;
6732 {
6733   tree decl, type, init;
6734   size_t length = strlen (name);
6735   tree domain = NULL_TREE;
6736
6737   if (!processing_template_decl)
6738     type_dep = 0;
6739   if (!type_dep)
6740     domain = build_index_type (build_int_2 (length, 0));
6741
6742   type =  build_cplus_array_type
6743           (build_qualified_type (char_type_node, TYPE_QUAL_CONST),
6744            domain);
6745
6746   decl = build_decl (VAR_DECL, id, type);
6747   TREE_STATIC (decl) = 1;
6748   TREE_READONLY (decl) = 1;
6749   DECL_SOURCE_LINE (decl) = 0;
6750   DECL_ARTIFICIAL (decl) = 1;
6751   DECL_IN_SYSTEM_HEADER (decl) = 1;
6752   pushdecl (decl);
6753   if (processing_template_decl)
6754     decl = push_template_decl (decl);
6755   if (type_dep)
6756     {
6757       init = build (FUNCTION_NAME, type);
6758       DECL_PRETTY_FUNCTION_P (decl) = 1;
6759     }
6760   else
6761     {
6762       init = build_string (length + 1, name);
6763       TREE_TYPE (init) = type;
6764     }
6765   DECL_INITIAL (decl) = init;
6766   cp_finish_decl (decl, init, NULL_TREE, LOOKUP_ONLYCONVERTING);
6767
6768   /* We will have to make sure we only emit this, if it is actually used. */
6769   return decl;
6770 }
6771
6772 /* Function to print any language-specific context for an error message.  */
6773
6774 static void
6775 lang_print_error_function (file)
6776      const char *file;
6777 {
6778   default_print_error_function (file);
6779   maybe_print_template_context ();
6780 }
6781
6782 /* Entry point for the benefit of c_common_nodes_and_builtins.
6783
6784    Make a definition for a builtin function named NAME and whose data type
6785    is TYPE.  TYPE should be a function type with argument types.
6786
6787    CLASS and CODE tell later passes how to compile calls to this function.
6788    See tree.h for possible values.
6789
6790    If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6791    the name to be called if we can't opencode the function.  */
6792
6793 tree
6794 builtin_function (name, type, code, class, libname)
6795      const char *name;
6796      tree type;
6797      int code;
6798      enum built_in_class class;
6799      const char *libname;
6800 {
6801   tree decl = build_library_fn_1 (get_identifier (name), ERROR_MARK, type);
6802   DECL_BUILT_IN_CLASS (decl) = class;
6803   DECL_FUNCTION_CODE (decl) = code;
6804
6805   my_friendly_assert (DECL_CONTEXT (decl) == NULL_TREE, 392);
6806
6807   /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6808      we cannot change DECL_ASSEMBLER_NAME until we have installed this
6809      function in the namespace.  */
6810   pushdecl (decl);
6811   if (libname)
6812     DECL_ASSEMBLER_NAME (decl) = get_identifier (libname);
6813   make_function_rtl (decl);
6814
6815   /* Warn if a function in the namespace for users
6816      is used without an occasion to consider it declared.  */
6817   if (name[0] != '_' || name[1] != '_')
6818     DECL_ANTICIPATED (decl) = 1;
6819
6820   return decl;
6821 }
6822
6823 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6824    function.  Not called directly.  */
6825
6826 static tree
6827 build_library_fn_1 (name, operator_code, type)
6828      tree name;
6829      enum tree_code operator_code;
6830      tree type;
6831 {
6832   tree fn = build_lang_decl (FUNCTION_DECL, name, type);
6833   DECL_EXTERNAL (fn) = 1;
6834   TREE_PUBLIC (fn) = 1;
6835   DECL_ARTIFICIAL (fn) = 1;
6836   TREE_NOTHROW (fn) = 1;
6837   SET_OVERLOADED_OPERATOR_CODE (fn, operator_code);
6838   return fn;
6839 }
6840
6841 /* Returns the _DECL for a library function with C linkage.
6842    We assume that such functions never throw; if this is incorrect,
6843    callers should unset TREE_NOTHROW.  */
6844
6845 tree
6846 build_library_fn (name, type)
6847      tree name;
6848      tree type;
6849 {
6850   tree fn = build_library_fn_1 (name, ERROR_MARK, type);
6851   make_function_rtl (fn);
6852   return fn;
6853 }
6854
6855 /* Returns the _DECL for a library function with C++ linkage.  */
6856
6857 static tree
6858 build_cp_library_fn (name, operator_code, type)
6859      tree name;
6860      enum tree_code operator_code;
6861      tree type;
6862 {
6863   tree fn = build_library_fn_1 (name, operator_code, type);
6864   TREE_NOTHROW (fn) = TYPE_NOTHROW_P (type);
6865   DECL_CONTEXT (fn) = FROB_CONTEXT (current_namespace);
6866   set_mangled_name_for_decl (fn);
6867   make_function_rtl (fn);
6868   return fn;
6869 }
6870
6871 /* Like build_library_fn, but takes a C string instead of an
6872    IDENTIFIER_NODE.  */
6873
6874 tree
6875 build_library_fn_ptr (name, type)
6876      const char *name;
6877      tree type;
6878 {
6879   return build_library_fn (get_identifier (name), type);
6880 }
6881
6882 /* Like build_cp_library_fn, but takes a C string instead of an
6883    IDENTIFIER_NODE.  */
6884
6885 tree
6886 build_cp_library_fn_ptr (name, type)
6887      const char *name;
6888      tree type;
6889 {
6890   return build_cp_library_fn (get_identifier (name), ERROR_MARK, type);
6891 }
6892
6893 /* Like build_library_fn, but also pushes the function so that we will
6894    be able to find it via IDENTIFIER_GLOBAL_VALUE.  */
6895
6896 tree
6897 push_library_fn (name, type)
6898      tree name, type;
6899 {
6900   tree fn = build_library_fn (name, type);
6901   pushdecl_top_level (fn);
6902   return fn;
6903 }
6904
6905 /* Like build_cp_library_fn, but also pushes the function so that it
6906    will be found by normal lookup.  */
6907
6908 static tree
6909 push_cp_library_fn (operator_code, type)
6910      enum tree_code operator_code;
6911      tree type;
6912 {
6913   tree fn = build_cp_library_fn (ansi_opname (operator_code),
6914                                  operator_code,
6915                                  type);
6916   pushdecl (fn);
6917   return fn;
6918 }
6919
6920 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6921    a FUNCTION_TYPE.  */
6922
6923 tree
6924 push_void_library_fn (name, parmtypes)
6925      tree name, parmtypes;
6926 {
6927   tree type = build_function_type (void_type_node, parmtypes);
6928   return push_library_fn (name, type);
6929 }
6930
6931 /* Like push_library_fn, but also note that this function throws
6932    and does not return.  Used for __throw_foo and the like.  */
6933
6934 tree
6935 push_throw_library_fn (name, type)
6936      tree name, type;
6937 {
6938   tree fn = push_library_fn (name, type);
6939   TREE_THIS_VOLATILE (fn) = 1;
6940   TREE_NOTHROW (fn) = 0;
6941   return fn;
6942 }
6943 \f
6944 /* When we call finish_struct for an anonymous union, we create
6945    default copy constructors and such.  But, an anonymous union
6946    shouldn't have such things; this function undoes the damage to the
6947    anonymous union type T.
6948
6949    (The reason that we create the synthesized methods is that we don't
6950    distinguish `union { int i; }' from `typedef union { int i; } U'.
6951    The first is an anonymous union; the second is just an ordinary
6952    union type.)  */
6953
6954 void
6955 fixup_anonymous_aggr (t)
6956      tree t;
6957 {
6958   tree *q;
6959
6960   /* Wipe out memory of synthesized methods */
6961   TYPE_HAS_CONSTRUCTOR (t) = 0;
6962   TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 0;
6963   TYPE_HAS_INIT_REF (t) = 0;
6964   TYPE_HAS_CONST_INIT_REF (t) = 0;
6965   TYPE_HAS_ASSIGN_REF (t) = 0;
6966   TYPE_HAS_CONST_ASSIGN_REF (t) = 0;
6967
6968   /* Splice the implicitly generated functions out of the TYPE_METHODS
6969      list.  */
6970   q = &TYPE_METHODS (t);
6971   while (*q)
6972     {
6973       if (DECL_ARTIFICIAL (*q))
6974         *q = TREE_CHAIN (*q);
6975       else
6976         q = &TREE_CHAIN (*q);
6977     }
6978
6979   /* ISO C++ 9.5.3.  Anonymous unions may not have function members.  */
6980   if (TYPE_METHODS (t))
6981     error ("an anonymous union cannot have function members");
6982 }
6983
6984 /* Make sure that a declaration with no declarator is well-formed, i.e.
6985    just defines a tagged type or anonymous union.
6986
6987    Returns the type defined, if any.  */
6988
6989 tree
6990 check_tag_decl (declspecs)
6991      tree declspecs;
6992 {
6993   int found_type = 0;
6994   int saw_friend = 0;
6995   tree ob_modifier = NULL_TREE;
6996   register tree link;
6997   register tree t = NULL_TREE;
6998
6999   for (link = declspecs; link; link = TREE_CHAIN (link))
7000     {
7001       register tree value = TREE_VALUE (link);
7002
7003       if (TYPE_P (value)
7004           || (TREE_CODE (value) == IDENTIFIER_NODE
7005               && IDENTIFIER_GLOBAL_VALUE (value)
7006               && TYPE_P (IDENTIFIER_GLOBAL_VALUE (value))))
7007         {
7008           ++found_type;
7009
7010           if (IS_AGGR_TYPE (value) || TREE_CODE (value) == ENUMERAL_TYPE)
7011             {
7012               my_friendly_assert (TYPE_MAIN_DECL (value) != NULL_TREE, 261);
7013               t = value;
7014             }
7015         }
7016       else if (value == ridpointers[(int) RID_FRIEND])
7017         {
7018           if (current_class_type == NULL_TREE
7019               || current_scope () != current_class_type)
7020             ob_modifier = value;
7021           else
7022             saw_friend = 1;
7023         }
7024       else if (value == ridpointers[(int) RID_STATIC]
7025                || value == ridpointers[(int) RID_EXTERN]
7026                || value == ridpointers[(int) RID_AUTO]
7027                || value == ridpointers[(int) RID_REGISTER]
7028                || value == ridpointers[(int) RID_INLINE]
7029                || value == ridpointers[(int) RID_VIRTUAL]
7030                || value == ridpointers[(int) RID_CONST]
7031                || value == ridpointers[(int) RID_VOLATILE]
7032                || value == ridpointers[(int) RID_EXPLICIT])
7033         ob_modifier = value;
7034     }
7035
7036   if (found_type > 1)
7037     error ("multiple types in one declaration");
7038
7039   if (t == NULL_TREE && ! saw_friend)
7040     pedwarn ("declaration does not declare anything");
7041
7042   /* Check for an anonymous union.  We're careful
7043      accessing TYPE_IDENTIFIER because some built-in types, like
7044      pointer-to-member types, do not have TYPE_NAME.  */
7045   else if (t && IS_AGGR_TYPE_CODE (TREE_CODE (t))
7046            && TYPE_NAME (t)
7047            && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
7048     {
7049       /* Anonymous unions are objects, so they can have specifiers.  */;
7050       SET_ANON_AGGR_TYPE_P (t);
7051
7052       if (TREE_CODE (t) != UNION_TYPE && pedantic && ! in_system_header)
7053         pedwarn ("ISO C++ prohibits anonymous structs");
7054     }
7055
7056   else if (ob_modifier)
7057     {
7058       if (ob_modifier == ridpointers[(int) RID_INLINE]
7059           || ob_modifier == ridpointers[(int) RID_VIRTUAL])
7060         cp_error ("`%D' can only be specified for functions", ob_modifier);
7061       else if (ob_modifier == ridpointers[(int) RID_FRIEND])
7062         cp_error ("`%D' can only be specified inside a class", ob_modifier);
7063       else if (ob_modifier == ridpointers[(int) RID_EXPLICIT])
7064         cp_error ("`%D' can only be specified for constructors",
7065                   ob_modifier);
7066       else
7067         cp_error ("`%D' can only be specified for objects and functions",
7068                   ob_modifier);
7069     }
7070
7071   return t;
7072 }
7073
7074 /* Called when a declaration is seen that contains no names to declare.
7075    If its type is a reference to a structure, union or enum inherited
7076    from a containing scope, shadow that tag name for the current scope
7077    with a forward reference.
7078    If its type defines a new named structure or union
7079    or defines an enum, it is valid but we need not do anything here.
7080    Otherwise, it is an error.
7081
7082    C++: may have to grok the declspecs to learn about static,
7083    complain for anonymous unions.  */
7084
7085 void
7086 shadow_tag (declspecs)
7087      tree declspecs;
7088 {
7089   tree t = check_tag_decl (declspecs);
7090
7091   if (t)
7092     maybe_process_partial_specialization (t);
7093
7094   /* This is where the variables in an anonymous union are
7095      declared.  An anonymous union declaration looks like:
7096      union { ... } ;
7097      because there is no declarator after the union, the parser
7098      sends that declaration here.  */
7099   if (t && ANON_AGGR_TYPE_P (t))
7100     {
7101       fixup_anonymous_aggr (t);
7102
7103       if (TYPE_FIELDS (t))
7104         {
7105           tree decl = grokdeclarator (NULL_TREE, declspecs, NORMAL, 0,
7106                                       NULL_TREE);
7107           finish_anon_union (decl);
7108         }
7109     }
7110 }
7111 \f
7112 /* Decode a "typename", such as "int **", returning a ..._TYPE node.  */
7113
7114 tree
7115 groktypename (typename)
7116      tree typename;
7117 {
7118   if (TREE_CODE (typename) != TREE_LIST)
7119     return typename;
7120   return grokdeclarator (TREE_VALUE (typename),
7121                          TREE_PURPOSE (typename),
7122                          TYPENAME, 0, NULL_TREE);
7123 }
7124
7125 /* Decode a declarator in an ordinary declaration or data definition.
7126    This is called as soon as the type information and variable name
7127    have been parsed, before parsing the initializer if any.
7128    Here we create the ..._DECL node, fill in its type,
7129    and put it on the list of decls for the current context.
7130    The ..._DECL node is returned as the value.
7131
7132    Exception: for arrays where the length is not specified,
7133    the type is left null, to be filled in by `cp_finish_decl'.
7134
7135    Function definitions do not come here; they go to start_function
7136    instead.  However, external and forward declarations of functions
7137    do go through here.  Structure field declarations are done by
7138    grokfield and not through here.  */
7139
7140 tree
7141 start_decl (declarator, declspecs, initialized, attributes, prefix_attributes)
7142      tree declarator, declspecs;
7143      int initialized;
7144      tree attributes, prefix_attributes;
7145 {
7146   register tree decl;
7147   register tree type, tem;
7148   tree context;
7149   extern int have_extern_spec;
7150   extern int used_extern_spec;
7151   tree attrlist;
7152
7153 #if 0
7154   /* See code below that used this.  */
7155   int init_written = initialized;
7156 #endif
7157
7158   /* This should only be done once on the top most decl.  */
7159   if (have_extern_spec && !used_extern_spec)
7160     {
7161       declspecs = decl_tree_cons (NULL_TREE, get_identifier ("extern"),
7162                                   declspecs);
7163       used_extern_spec = 1;
7164     }
7165
7166   if (attributes || prefix_attributes)
7167     attrlist = build_tree_list (attributes, prefix_attributes);
7168   else
7169     attrlist = NULL_TREE;
7170
7171   decl = grokdeclarator (declarator, declspecs, NORMAL, initialized,
7172                          attrlist);
7173
7174   if (decl == NULL_TREE || TREE_CODE (decl) == VOID_TYPE)
7175     return NULL_TREE;
7176
7177   type = TREE_TYPE (decl);
7178
7179   if (type == error_mark_node)
7180     return NULL_TREE;
7181
7182   context = DECL_CONTEXT (decl);
7183
7184   if (initialized && context && TREE_CODE (context) == NAMESPACE_DECL
7185       && context != current_namespace && TREE_CODE (decl) == VAR_DECL)
7186     {
7187       /* When parsing the initializer, lookup should use the object's
7188          namespace. */
7189       push_decl_namespace (context);
7190     }
7191
7192   /* We are only interested in class contexts, later. */
7193   if (context && TREE_CODE (context) == NAMESPACE_DECL)
7194     context = NULL_TREE;
7195
7196   if (initialized)
7197     /* Is it valid for this decl to have an initializer at all?
7198        If not, set INITIALIZED to zero, which will indirectly
7199        tell `cp_finish_decl' to ignore the initializer once it is parsed.  */
7200     switch (TREE_CODE (decl))
7201       {
7202       case TYPE_DECL:
7203         /* typedef foo = bar  means give foo the same type as bar.
7204            We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7205            Any other case of an initialization in a TYPE_DECL is an error.  */
7206         if (pedantic || list_length (declspecs) > 1)
7207           {
7208             cp_error ("typedef `%D' is initialized", decl);
7209             initialized = 0;
7210           }
7211         break;
7212
7213       case FUNCTION_DECL:
7214         cp_error ("function `%#D' is initialized like a variable", decl);
7215         initialized = 0;
7216         break;
7217
7218       default:
7219         break;
7220       }
7221
7222   if (initialized)
7223     {
7224       if (! toplevel_bindings_p ()
7225           && DECL_EXTERNAL (decl))
7226         cp_warning ("declaration of `%#D' has `extern' and is initialized",
7227                     decl);
7228       DECL_EXTERNAL (decl) = 0;
7229       if (toplevel_bindings_p ())
7230         TREE_STATIC (decl) = 1;
7231
7232       /* Tell `pushdecl' this is an initialized decl
7233          even though we don't yet have the initializer expression.
7234          Also tell `cp_finish_decl' it may store the real initializer.  */
7235       DECL_INITIAL (decl) = error_mark_node;
7236     }
7237
7238 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7239   SET_DEFAULT_DECL_ATTRIBUTES (decl, attributes);
7240 #endif
7241
7242   /* Set attributes here so if duplicate decl, will have proper attributes.  */
7243   cplus_decl_attributes (decl, attributes, prefix_attributes);
7244
7245   if (context && COMPLETE_TYPE_P (complete_type (context)))
7246     {
7247       push_nested_class (context, 2);
7248
7249       if (TREE_CODE (decl) == VAR_DECL)
7250         {
7251           tree field = lookup_field (context, DECL_NAME (decl), 0, 0);
7252           if (field == NULL_TREE || TREE_CODE (field) != VAR_DECL)
7253             cp_error ("`%#D' is not a static member of `%#T'", decl, context);
7254           else
7255             {
7256               if (DECL_CONTEXT (field) != context)
7257                 {
7258                   cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7259                               DECL_CONTEXT (field), DECL_NAME (decl),
7260                               context, DECL_NAME (decl));
7261                   DECL_CONTEXT (decl) = DECL_CONTEXT (field);
7262                 }
7263               /* Static data member are tricky; an in-class initialization
7264                  still doesn't provide a definition, so the in-class
7265                  declaration will have DECL_EXTERNAL set, but will have an
7266                  initialization.  Thus, duplicate_decls won't warn
7267                  about this situation, and so we check here.  */
7268               if (DECL_INITIAL (decl) && DECL_INITIAL (field))
7269                 cp_error ("duplicate initialization of %D", decl);
7270               if (duplicate_decls (decl, field))
7271                 decl = field;
7272             }
7273         }
7274       else
7275         {
7276           tree field = check_classfn (context, decl);
7277           if (field && duplicate_decls (decl, field))
7278             decl = field;
7279         }
7280
7281       /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set.  */
7282       DECL_IN_AGGR_P (decl) = 0;
7283       if ((DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl))
7284           || CLASSTYPE_TEMPLATE_INSTANTIATION (context))
7285         {
7286           SET_DECL_TEMPLATE_SPECIALIZATION (decl);
7287           /* [temp.expl.spec] An explicit specialization of a static data
7288              member of a template is a definition if the declaration
7289              includes an initializer; otherwise, it is a declaration.
7290
7291              We check for processing_specialization so this only applies
7292              to the new specialization syntax.  */
7293           if (DECL_INITIAL (decl) == NULL_TREE && processing_specialization)
7294             DECL_EXTERNAL (decl) = 1;
7295         }
7296
7297       if (DECL_EXTERNAL (decl) && ! DECL_TEMPLATE_SPECIALIZATION (decl))
7298         cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7299                     decl);
7300     }
7301
7302   /* Enter this declaration into the symbol table.  */
7303   tem = maybe_push_decl (decl);
7304
7305   if (processing_template_decl)
7306     tem = push_template_decl (tem);
7307
7308 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7309   /* Tell the back-end to use or not use .common as appropriate.  If we say
7310      -fconserve-space, we want this to save .data space, at the expense of
7311      wrong semantics.  If we say -fno-conserve-space, we want this to
7312      produce errors about redefs; to do this we force variables into the
7313      data segment.  */
7314   DECL_COMMON (tem) = flag_conserve_space || ! TREE_PUBLIC (tem);
7315 #endif
7316
7317   if (! processing_template_decl)
7318     start_decl_1 (tem);
7319
7320   return tem;
7321 }
7322
7323 void
7324 start_decl_1 (decl)
7325      tree decl;
7326 {
7327   tree type = TREE_TYPE (decl);
7328   int initialized = (DECL_INITIAL (decl) != NULL_TREE);
7329
7330   if (type == error_mark_node)
7331     return;
7332
7333   /* If this type of object needs a cleanup, but we're not allowed to
7334      add any more objects with cleanups to the current scope, create a
7335      new binding level.  */
7336   if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
7337       && current_binding_level->more_cleanups_ok == 0)
7338     {
7339       keep_next_level (2);
7340       pushlevel (1);
7341       clear_last_expr ();
7342       add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
7343     }
7344
7345   if (initialized)
7346     /* Is it valid for this decl to have an initializer at all?
7347        If not, set INITIALIZED to zero, which will indirectly
7348        tell `cp_finish_decl' to ignore the initializer once it is parsed.  */
7349     {
7350       /* Don't allow initializations for incomplete types except for
7351          arrays which might be completed by the initialization.  */
7352       if (COMPLETE_TYPE_P (complete_type (type)))
7353         ;                       /* A complete type is ok.  */
7354       else if (TREE_CODE (type) != ARRAY_TYPE)
7355         {
7356           cp_error ("variable `%#D' has initializer but incomplete type",
7357                     decl);
7358           initialized = 0;
7359           type = TREE_TYPE (decl) = error_mark_node;
7360         }
7361       else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type))))
7362         {
7363           if (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl))
7364             cp_error ("elements of array `%#D' have incomplete type", decl);
7365           /* else we already gave an error in start_decl.  */
7366           initialized = 0;
7367         }
7368     }
7369
7370   if (!initialized
7371       && TREE_CODE (decl) != TYPE_DECL
7372       && TREE_CODE (decl) != TEMPLATE_DECL
7373       && type != error_mark_node
7374       && IS_AGGR_TYPE (type)
7375       && ! DECL_EXTERNAL (decl))
7376     {
7377       if ((! processing_template_decl || ! uses_template_parms (type))
7378           && !COMPLETE_TYPE_P (complete_type (type)))
7379         {
7380           cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7381                  decl);
7382           /* Change the type so that assemble_variable will give
7383              DECL an rtl we can live with: (mem (const_int 0)).  */
7384           type = TREE_TYPE (decl) = error_mark_node;
7385         }
7386       else
7387         {
7388           /* If any base type in the hierarchy of TYPE needs a constructor,
7389              then we set initialized to 1.  This way any nodes which are
7390              created for the purposes of initializing this aggregate
7391              will live as long as it does.  This is necessary for global
7392              aggregates which do not have their initializers processed until
7393              the end of the file.  */
7394           initialized = TYPE_NEEDS_CONSTRUCTING (type);
7395         }
7396     }
7397
7398   if (! initialized)
7399     DECL_INITIAL (decl) = NULL_TREE;
7400 }
7401
7402 /* Handle initialization of references.
7403    These three arguments are from `cp_finish_decl', and have the
7404    same meaning here that they do there.
7405
7406    Quotes on semantics can be found in ARM 8.4.3.  */
7407
7408 static void
7409 grok_reference_init (decl, type, init)
7410      tree decl, type, init;
7411 {
7412   tree tmp;
7413
7414   if (init == NULL_TREE)
7415     {
7416       if ((DECL_LANG_SPECIFIC (decl) == 0
7417            || DECL_IN_AGGR_P (decl) == 0)
7418           && ! DECL_THIS_EXTERN (decl))
7419         cp_error ("`%D' declared as reference but not initialized", decl);
7420       return;
7421     }
7422
7423   if (init == error_mark_node)
7424     return;
7425
7426   if (TREE_CODE (init) == CONSTRUCTOR)
7427     {
7428       cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl);
7429       return;
7430     }
7431
7432   if (TREE_CODE (init) == TREE_LIST)
7433     init = build_compound_expr (init);
7434
7435   if (TREE_CODE (TREE_TYPE (init)) == REFERENCE_TYPE)
7436     init = convert_from_reference (init);
7437
7438   if (TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE
7439       && TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE)
7440     {
7441       /* Note: default conversion is only called in very special cases.  */
7442       init = default_conversion (init);
7443     }
7444
7445   /* Convert INIT to the reference type TYPE.  This may involve the
7446      creation of a temporary, whose lifetime must be the same as that
7447      of the reference.  If so, a DECL_STMT for the temporary will be
7448      added just after the DECL_STMT for DECL.  That's why we don't set
7449      DECL_INITIAL for local references (instead assigning to them
7450      explicitly); we need to allow the temporary to be initialized
7451      first.  */
7452   tmp = convert_to_reference
7453     (type, init, CONV_IMPLICIT,
7454      LOOKUP_ONLYCONVERTING|LOOKUP_SPECULATIVELY|LOOKUP_NORMAL|DIRECT_BIND,
7455      decl);
7456
7457   if (tmp == error_mark_node)
7458     return;
7459   else if (tmp != NULL_TREE)
7460     {
7461       init = tmp;
7462       tmp = save_expr (tmp);
7463       if (building_stmt_tree ())
7464         {
7465           /* Initialize the declaration.  */
7466           tmp = build (INIT_EXPR, TREE_TYPE (decl), decl, tmp);
7467           finish_expr_stmt (tmp);
7468         }
7469       else
7470         DECL_INITIAL (decl) = tmp;
7471     }
7472   else
7473     {
7474       cp_error ("cannot initialize `%T' from `%T'", type, TREE_TYPE (init));
7475       return;
7476     }
7477
7478   if (TREE_STATIC (decl) && ! TREE_CONSTANT (DECL_INITIAL (decl)))
7479     {
7480       expand_static_init (decl, DECL_INITIAL (decl));
7481       DECL_INITIAL (decl) = NULL_TREE;
7482     }
7483   return;
7484 }
7485
7486 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7487    mucking with forces it does not comprehend (i.e. initialization with a
7488    constructor).  If we are at global scope and won't go into COMMON, fill
7489    it in with a dummy CONSTRUCTOR to force the variable into .data;
7490    otherwise we can use error_mark_node.  */
7491
7492 static tree
7493 obscure_complex_init (decl, init)
7494      tree decl, init;
7495 {
7496   if (! flag_no_inline && TREE_STATIC (decl))
7497     {
7498       if (extract_init (decl, init))
7499         return NULL_TREE;
7500     }
7501
7502 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7503   if (toplevel_bindings_p () && ! DECL_COMMON (decl))
7504     DECL_INITIAL (decl) = build (CONSTRUCTOR, TREE_TYPE (decl), NULL_TREE,
7505                                  NULL_TREE);
7506   else
7507 #endif
7508     DECL_INITIAL (decl) = error_mark_node;
7509
7510   return init;
7511 }
7512
7513 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7514    array until we finish parsing the initializer.  If that's the
7515    situation we're in, update DECL accordingly.  */
7516
7517 static void
7518 maybe_deduce_size_from_array_init (decl, init)
7519      tree decl;
7520      tree init;
7521 {
7522   tree type = TREE_TYPE (decl);
7523
7524   if (TREE_CODE (type) == ARRAY_TYPE
7525       && TYPE_DOMAIN (type) == NULL_TREE
7526       && TREE_CODE (decl) != TYPE_DECL)
7527     {
7528       int do_default
7529         = (TREE_STATIC (decl)
7530            /* Even if pedantic, an external linkage array
7531               may have incomplete type at first.  */
7532            ? pedantic && ! DECL_EXTERNAL (decl)
7533            : !DECL_EXTERNAL (decl));
7534       tree initializer = init ? init : DECL_INITIAL (decl);
7535       int failure = complete_array_type (type, initializer, do_default);
7536
7537       if (failure == 1)
7538         cp_error ("initializer fails to determine size of `%D'", decl);
7539
7540       if (failure == 2)
7541         {
7542           if (do_default)
7543             cp_error ("array size missing in `%D'", decl);
7544           /* If a `static' var's size isn't known, make it extern as
7545              well as static, so it does not get allocated.  If it's not
7546              `static', then don't mark it extern; finish_incomplete_decl
7547              will give it a default size and it will get allocated.  */
7548           else if (!pedantic && TREE_STATIC (decl) && !TREE_PUBLIC (decl))
7549             DECL_EXTERNAL (decl) = 1;
7550         }
7551
7552       if (pedantic && TYPE_DOMAIN (type) != NULL_TREE
7553           && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type)),
7554                               integer_zero_node))
7555         cp_error ("zero-size array `%D'", decl);
7556
7557       layout_decl (decl, 0);
7558     }
7559 }
7560
7561 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7562    any appropriate error messages regarding the layout.  */
7563
7564 static void
7565 layout_var_decl (decl)
7566      tree decl;
7567 {
7568   tree type = TREE_TYPE (decl);
7569 #if 0
7570   tree ttype = target_type (type);
7571 #endif
7572
7573   /* If we haven't already layed out this declaration, do so now.
7574      Note that we must not call complete type for an external object
7575      because it's type might involve templates that we are not
7576      supposed to isntantiate yet.  (And it's perfectly legal to say
7577      `extern X x' for some incomplete type `X'.)  */
7578   if (!DECL_EXTERNAL (decl))
7579     complete_type (type);
7580   if (!DECL_SIZE (decl) && COMPLETE_TYPE_P (type))
7581     layout_decl (decl, 0);
7582
7583   if (!DECL_EXTERNAL (decl) && DECL_SIZE (decl) == NULL_TREE)
7584     {
7585       /* An automatic variable with an incomplete type: that is an error.
7586          Don't talk about array types here, since we took care of that
7587          message in grokdeclarator.  */
7588       cp_error ("storage size of `%D' isn't known", decl);
7589       TREE_TYPE (decl) = error_mark_node;
7590     }
7591 #if 0
7592   /* Keep this code around in case we later want to control debug info
7593      based on whether a type is "used".  (jason 1999-11-11) */
7594
7595   else if (!DECL_EXTERNAL (decl) && IS_AGGR_TYPE (ttype))
7596     /* Let debugger know it should output info for this type.  */
7597     note_debug_info_needed (ttype);
7598
7599   if (TREE_STATIC (decl) && DECL_CLASS_SCOPE_P (decl))
7600     note_debug_info_needed (DECL_CONTEXT (decl));
7601 #endif
7602
7603   if ((DECL_EXTERNAL (decl) || TREE_STATIC (decl))
7604       && DECL_SIZE (decl) != NULL_TREE
7605       && ! TREE_CONSTANT (DECL_SIZE (decl)))
7606     {
7607       if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST)
7608         constant_expression_warning (DECL_SIZE (decl));
7609       else
7610         cp_error ("storage size of `%D' isn't constant", decl);
7611     }
7612 }
7613
7614 /* If a local static variable is declared in an inline function, or if
7615    we have a weak definition, we must endeavor to create only one
7616    instance of the variable at link-time.  */
7617
7618 static void
7619 maybe_commonize_var (decl)
7620      tree decl;
7621 {
7622   /* Static data in a function with comdat linkage also has comdat
7623      linkage.  */
7624   if (TREE_STATIC (decl)
7625       /* Don't mess with __FUNCTION__.  */
7626       && ! DECL_ARTIFICIAL (decl)
7627       && current_function_decl
7628       && DECL_CONTEXT (decl) == current_function_decl
7629       && (DECL_THIS_INLINE (current_function_decl)
7630           || DECL_TEMPLATE_INSTANTIATION (current_function_decl))
7631       && TREE_PUBLIC (current_function_decl))
7632     {
7633       /* Rather than try to get this right with inlining, we suppress
7634          inlining of such functions.  */
7635       current_function_cannot_inline
7636         = "function with static variable cannot be inline";
7637
7638       /* If flag_weak, we don't need to mess with this, as we can just
7639          make the function weak, and let it refer to its unique local
7640          copy.  This works because we don't allow the function to be
7641          inlined.  */
7642       if (! flag_weak)
7643         {
7644           if (DECL_INTERFACE_KNOWN (current_function_decl))
7645             {
7646               TREE_PUBLIC (decl) = 1;
7647               DECL_EXTERNAL (decl) = DECL_EXTERNAL (current_function_decl);
7648             }
7649           else if (DECL_INITIAL (decl) == NULL_TREE
7650                    || DECL_INITIAL (decl) == error_mark_node)
7651             {
7652               TREE_PUBLIC (decl) = 1;
7653               DECL_COMMON (decl) = 1;
7654             }
7655           /* else we lose. We can only do this if we can use common,
7656              which we can't if it has been initialized.  */
7657
7658           if (TREE_PUBLIC (decl))
7659             DECL_ASSEMBLER_NAME (decl)
7660               = build_static_name (current_function_decl, DECL_NAME (decl));
7661           else
7662             {
7663               cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl);
7664               cp_warning_at ("  you can work around this by removing the initializer", decl);
7665             }
7666         }
7667     }
7668   else if (DECL_LANG_SPECIFIC (decl) && DECL_COMDAT (decl))
7669     /* Set it up again; we might have set DECL_INITIAL since the last
7670        time.  */
7671     comdat_linkage (decl);
7672 }
7673
7674 /* Issue an error message if DECL is an uninitialized const variable.  */
7675
7676 static void
7677 check_for_uninitialized_const_var (decl)
7678      tree decl;
7679 {
7680   tree type = TREE_TYPE (decl);
7681
7682   /* ``Unless explicitly declared extern, a const object does not have
7683      external linkage and must be initialized. ($8.4; $12.1)'' ARM
7684      7.1.6 */
7685   if (TREE_CODE (decl) == VAR_DECL
7686       && TREE_CODE (type) != REFERENCE_TYPE
7687       && CP_TYPE_CONST_P (type)
7688       && !TYPE_NEEDS_CONSTRUCTING (type)
7689       && !DECL_INITIAL (decl))
7690     cp_error ("uninitialized const `%D'", decl);
7691 }
7692
7693 /* Verify INIT (the initializer for DECL), and record the
7694    initialization in DECL_INITIAL, if appropriate.  Returns a new
7695    value for INIT.  */
7696
7697 static tree
7698 check_initializer (decl, init)
7699      tree decl;
7700      tree init;
7701 {
7702   tree type;
7703
7704   if (TREE_CODE (decl) == FIELD_DECL)
7705     return init;
7706
7707   type = TREE_TYPE (decl);
7708
7709   /* If `start_decl' didn't like having an initialization, ignore it now.  */
7710   if (init != NULL_TREE && DECL_INITIAL (decl) == NULL_TREE)
7711     init = NULL_TREE;
7712
7713   /* Check the initializer.  */
7714   if (init)
7715     {
7716       /* Things that are going to be initialized need to have complete
7717          type.  */
7718       TREE_TYPE (decl) = type = complete_type (TREE_TYPE (decl));
7719
7720       if (type == error_mark_node)
7721         /* We will have already complained.  */
7722         init = NULL_TREE;
7723       else if (COMPLETE_TYPE_P (type) && !TREE_CONSTANT (TYPE_SIZE (type)))
7724         {
7725           cp_error ("variable-sized object `%D' may not be initialized", decl);
7726           init = NULL_TREE;
7727         }
7728       else if (TREE_CODE (type) == ARRAY_TYPE
7729                && !COMPLETE_TYPE_P (TREE_TYPE (type)))
7730         {
7731           cp_error ("elements of array `%#D' have incomplete type", decl);
7732           init = NULL_TREE;
7733         }
7734       else if (!COMPLETE_TYPE_P (type))
7735         {
7736           cp_error ("`%D' has incomplete type", decl);
7737           TREE_TYPE (decl) = error_mark_node;
7738           init = NULL_TREE;
7739         }
7740     }
7741
7742   if (TREE_CODE (decl) == CONST_DECL)
7743     {
7744       my_friendly_assert (TREE_CODE (decl) != REFERENCE_TYPE, 148);
7745
7746       DECL_INITIAL (decl) = init;
7747
7748       /* This will keep us from needing to worry about our obstacks.  */
7749       my_friendly_assert (init != NULL_TREE, 149);
7750       init = NULL_TREE;
7751     }
7752   else if (!DECL_EXTERNAL (decl) && TREE_CODE (type) == REFERENCE_TYPE)
7753     {
7754       if (TREE_STATIC (decl))
7755         make_decl_rtl (decl, NULL_PTR, toplevel_bindings_p ());
7756       grok_reference_init (decl, type, init);
7757       init = NULL_TREE;
7758     }
7759   else if (init)
7760     {
7761       if (TYPE_HAS_CONSTRUCTOR (type) || TYPE_NEEDS_CONSTRUCTING (type))
7762         {
7763           if (TREE_CODE (type) == ARRAY_TYPE)
7764             init = digest_init (type, init, (tree *) 0);
7765           else if (TREE_CODE (init) == CONSTRUCTOR
7766                    && TREE_HAS_CONSTRUCTOR (init))
7767             {
7768               if (TYPE_NON_AGGREGATE_CLASS (type))
7769                 {
7770                   cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7771                             decl);
7772                   init = error_mark_node;
7773                 }
7774               else
7775                 goto dont_use_constructor;
7776             }
7777         }
7778       else
7779         {
7780         dont_use_constructor:
7781           if (TREE_CODE (init) != TREE_VEC)
7782             init = store_init_value (decl, init);
7783         }
7784
7785       if (init)
7786         /* We must hide the initializer so that expand_decl
7787            won't try to do something it does not understand.  */
7788         init = obscure_complex_init (decl, init);
7789     }
7790   else if (DECL_EXTERNAL (decl))
7791     ;
7792   else if (TYPE_P (type)
7793            && (IS_AGGR_TYPE (type) || TYPE_NEEDS_CONSTRUCTING (type)))
7794     {
7795       tree core_type = strip_array_types (type);
7796
7797       if (! TYPE_NEEDS_CONSTRUCTING (core_type))
7798         {
7799           if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type))
7800             cp_error ("structure `%D' with uninitialized const members", decl);
7801           if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type))
7802             cp_error ("structure `%D' with uninitialized reference members",
7803                       decl);
7804         }
7805
7806       check_for_uninitialized_const_var (decl);
7807
7808       if (COMPLETE_TYPE_P (type) && TYPE_NEEDS_CONSTRUCTING (type))
7809         init = obscure_complex_init (decl, NULL_TREE);
7810
7811     }
7812   else
7813     check_for_uninitialized_const_var (decl);
7814
7815   return init;
7816 }
7817
7818 /* If DECL is not a local variable, give it RTL.  */
7819
7820 static void
7821 make_rtl_for_nonlocal_decl (decl, init, asmspec)
7822      tree decl;
7823      tree init;
7824      const char *asmspec;
7825 {
7826   int toplev;
7827   tree type;
7828
7829   type = TREE_TYPE (decl);
7830   toplev = toplevel_bindings_p ();
7831
7832   /* Handle non-variables up front.  */
7833   if (TREE_CODE (decl) != VAR_DECL)
7834     {
7835       rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7836       return;
7837     }
7838
7839   /* Set the DECL_ASSEMBLER_NAME for the variable.  */
7840   if (asmspec)
7841     DECL_ASSEMBLER_NAME (decl) = get_identifier (asmspec);
7842
7843   if (DECL_VIRTUAL_P (decl))
7844     make_decl_rtl (decl, NULL_PTR, toplev);
7845   else if (TREE_READONLY (decl)
7846            && DECL_INITIAL (decl) != NULL_TREE
7847            && DECL_INITIAL (decl) != error_mark_node
7848            && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
7849     {
7850       DECL_INITIAL (decl) = save_expr (DECL_INITIAL (decl));
7851
7852       if (toplev && ! TREE_PUBLIC (decl))
7853         {
7854           /* If this is a static const, change its apparent linkage
7855              if it belongs to a #pragma interface.  */
7856           if (!interface_unknown)
7857             {
7858               TREE_PUBLIC (decl) = 1;
7859               DECL_EXTERNAL (decl) = interface_only;
7860             }
7861           make_decl_rtl (decl, asmspec, toplev);
7862         }
7863       else if (toplev)
7864         rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7865     }
7866   else if (DECL_LANG_SPECIFIC (decl) && DECL_IN_AGGR_P (decl))
7867     {
7868       my_friendly_assert (TREE_STATIC (decl), 19990828);
7869
7870       if (init == NULL_TREE
7871 #ifdef DEFAULT_STATIC_DEFS
7872           /* If this code is dead, then users must
7873              explicitly declare static member variables
7874              outside the class def'n as well.  */
7875           && TYPE_NEEDS_CONSTRUCTING (type)
7876 #endif
7877           )
7878         {
7879           DECL_EXTERNAL (decl) = 1;
7880           make_decl_rtl (decl, asmspec, 1);
7881         }
7882       else
7883         rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7884     }
7885   else if (TREE_CODE (CP_DECL_CONTEXT (decl)) == NAMESPACE_DECL
7886            || (TREE_CODE (decl) == VAR_DECL && TREE_STATIC (decl)))
7887     rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7888 }
7889
7890
7891 /* The old ARM scoping rules injected variables declared in the
7892    initialization statement of a for-statement into the surrounding
7893    scope.  We support this usage, in order to be backward-compatible.
7894    DECL is a just-declared VAR_DECL; if necessary inject its
7895    declaration into the surrounding scope.  */
7896
7897 void
7898 maybe_inject_for_scope_var (decl)
7899      tree decl;
7900 {
7901   if (current_binding_level->is_for_scope)
7902     {
7903       struct binding_level *outer
7904         = current_binding_level->level_chain;
7905
7906       /* Check to see if the same name is already bound at the outer
7907          level, either because it was directly declared, or because a
7908          dead for-decl got preserved.  In either case, the code would
7909          not have been valid under the ARM scope rules, so clear
7910          is_for_scope for the current_binding_level.
7911
7912          Otherwise, we need to preserve the temp slot for decl to last
7913          into the outer binding level.  */
7914
7915       tree outer_binding
7916         = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl)));
7917
7918       if (outer_binding && BINDING_LEVEL (outer_binding) == outer
7919           && (TREE_CODE (BINDING_VALUE (outer_binding))
7920               == VAR_DECL)
7921           && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding)))
7922         {
7923           BINDING_VALUE (outer_binding)
7924             = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding));
7925           current_binding_level->is_for_scope = 0;
7926         }
7927       else if (DECL_IN_MEMORY_P (decl))
7928         preserve_temp_slots (DECL_RTL (decl));
7929     }
7930 }
7931
7932 /* Generate code to initialize DECL (a local variable).  */
7933
7934 void
7935 initialize_local_var (decl, init, flags)
7936      tree decl;
7937      tree init;
7938      int flags;
7939 {
7940   tree type = TREE_TYPE (decl);
7941
7942   /* If the type is bogus, don't bother initializing the variable.  */
7943   if (type == error_mark_node)
7944     return;
7945
7946   if (DECL_SIZE (decl) == NULL_TREE && !TREE_STATIC (decl))
7947     {
7948       /* If we used it already as memory, it must stay in memory.  */
7949       DECL_INITIAL (decl) = NULL_TREE;
7950       TREE_ADDRESSABLE (decl) = TREE_USED (decl);
7951     }
7952
7953   /* Local statics are handled differently from ordinary automatic
7954      variables.  */
7955   if (TREE_STATIC (decl))
7956     {
7957       if (TYPE_NEEDS_CONSTRUCTING (type) || init != NULL_TREE
7958           || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
7959         expand_static_init (decl, init);
7960       return;
7961     }
7962
7963   if (DECL_SIZE (decl) && type != error_mark_node)
7964     {
7965       int already_used;
7966
7967       /* Compute and store the initial value.  */
7968       already_used = TREE_USED (decl) || TREE_USED (type);
7969
7970       if (init || TYPE_NEEDS_CONSTRUCTING (type))
7971         {
7972           int saved_stmts_are_full_exprs_p;
7973
7974           emit_line_note (DECL_SOURCE_FILE (decl),
7975                           DECL_SOURCE_LINE (decl));
7976           saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p ();
7977           current_stmt_tree->stmts_are_full_exprs_p = 1;
7978           if (building_stmt_tree ())
7979             finish_expr_stmt (build_aggr_init (decl, init, flags));
7980           else
7981             genrtl_expr_stmt (build_aggr_init (decl, init, flags));
7982           current_stmt_tree->stmts_are_full_exprs_p = saved_stmts_are_full_exprs_p;
7983         }
7984
7985       /* Set this to 0 so we can tell whether an aggregate which was
7986          initialized was ever used.  Don't do this if it has a
7987          destructor, so we don't complain about the 'resource
7988          allocation is initialization' idiom.  Now set
7989          attribute((unused)) on types so decls of that type will be
7990          marked used. (see TREE_USED, above.)  */
7991       if (TYPE_NEEDS_CONSTRUCTING (type)
7992           && ! already_used
7993           && TYPE_HAS_TRIVIAL_DESTRUCTOR (type)
7994           && DECL_NAME (decl))
7995         TREE_USED (decl) = 0;
7996       else if (already_used)
7997         TREE_USED (decl) = 1;
7998     }
7999 }
8000
8001 /* Generate code to destroy DECL (a local variable).  */
8002
8003 static void
8004 destroy_local_var (decl)
8005      tree decl;
8006 {
8007   tree type = TREE_TYPE (decl);
8008   tree cleanup;
8009
8010   /* Only variables get cleaned up.  */
8011   if (TREE_CODE (decl) != VAR_DECL)
8012     return;
8013
8014   /* And only things with destructors need cleaning up.  */
8015   if (type == error_mark_node
8016       || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
8017     return;
8018
8019   if (TREE_CODE (decl) == VAR_DECL &&
8020       (DECL_EXTERNAL (decl) || TREE_STATIC (decl)))
8021     /* We don't clean up things that aren't defined in this
8022        translation unit, or that need a static cleanup.  The latter
8023        are handled by finish_file.  */
8024     return;
8025
8026   /* Compute the cleanup.  */
8027   cleanup = maybe_build_cleanup (decl);
8028
8029   /* Record the cleanup required for this declaration.  */
8030   if (DECL_SIZE (decl) && TREE_TYPE (decl) != error_mark_node
8031       && cleanup)
8032     finish_decl_cleanup (decl, cleanup);
8033 }
8034
8035
8036
8037 /* Finish processing of a declaration;
8038    install its line number and initial value.
8039    If the length of an array type is not known before,
8040    it must be determined now, from the initial value, or it is an error.
8041
8042    INIT0 holds the value of an initializer that should be allowed to escape
8043    the normal rules.
8044
8045    FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
8046    if the (init) syntax was used.  */
8047
8048 void
8049 cp_finish_decl (decl, init, asmspec_tree, flags)
8050      tree decl, init;
8051      tree asmspec_tree;
8052      int flags;
8053 {
8054   register tree type;
8055   tree ttype = NULL_TREE;
8056   const char *asmspec = NULL;
8057   int was_readonly = 0;
8058
8059   if (! decl)
8060     {
8061       if (init)
8062         error ("assignment (not initialization) in declaration");
8063       return;
8064     }
8065
8066   /* If a name was specified, get the string.  */
8067   if (asmspec_tree)
8068       asmspec = TREE_STRING_POINTER (asmspec_tree);
8069
8070   if (init && TREE_CODE (init) == NAMESPACE_DECL)
8071     {
8072       cp_error ("cannot initialize `%D' to namespace `%D'",
8073                 decl, init);
8074       init = NULL_TREE;
8075     }
8076
8077   if (current_class_type
8078       && CP_DECL_CONTEXT (decl) == current_class_type
8079       && TYPE_BEING_DEFINED (current_class_type)
8080       && (DECL_INITIAL (decl) || init))
8081     DECL_DEFINED_IN_CLASS_P (decl) = 1;
8082
8083   if (TREE_CODE (decl) == VAR_DECL
8084       && DECL_CONTEXT (decl)
8085       && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL
8086       && DECL_CONTEXT (decl) != current_namespace
8087       && init)
8088     {
8089       /* Leave the namespace of the object. */
8090       pop_decl_namespace ();
8091     }
8092
8093   type = TREE_TYPE (decl);
8094
8095   if (type == error_mark_node)
8096     return;
8097
8098   /* Add this declaration to the statement-tree.  */
8099   if (building_stmt_tree () && at_function_scope_p ())
8100     add_decl_stmt (decl);
8101
8102   if (TYPE_HAS_MUTABLE_P (type))
8103     TREE_READONLY (decl) = 0;
8104
8105   if (processing_template_decl)
8106     {
8107       if (init && DECL_INITIAL (decl))
8108         DECL_INITIAL (decl) = init;
8109       goto finish_end0;
8110     }
8111
8112   /* Parameters are handled by store_parm_decls, not cp_finish_decl.  */
8113   my_friendly_assert (TREE_CODE (decl) != PARM_DECL, 19990828);
8114
8115   /* Take care of TYPE_DECLs up front.  */
8116   if (TREE_CODE (decl) == TYPE_DECL)
8117     {
8118       if (init && DECL_INITIAL (decl))
8119         {
8120           /* typedef foo = bar; store the type of bar as the type of foo.  */
8121           TREE_TYPE (decl) = type = TREE_TYPE (init);
8122           DECL_INITIAL (decl) = init = NULL_TREE;
8123         }
8124       if (type != error_mark_node
8125           && IS_AGGR_TYPE (type) && DECL_NAME (decl))
8126         {
8127           if (TREE_TYPE (DECL_NAME (decl)) && TREE_TYPE (decl) != type)
8128             cp_warning ("shadowing previous type declaration of `%#D'", decl);
8129           set_identifier_type_value (DECL_NAME (decl), type);
8130           CLASSTYPE_GOT_SEMICOLON (type) = 1;
8131         }
8132       GNU_xref_decl (current_function_decl, decl);
8133
8134       /* If we have installed this as the canonical typedef for this
8135          type, and that type has not been defined yet, delay emitting
8136          the debug information for it, as we will emit it later.  */
8137       if (TYPE_MAIN_DECL (TREE_TYPE (decl)) == decl
8138           && !COMPLETE_TYPE_P (TREE_TYPE (decl)))
8139         TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
8140
8141       rest_of_decl_compilation (decl, NULL_PTR,
8142                                 DECL_CONTEXT (decl) == NULL_TREE, at_eof);
8143       goto finish_end;
8144     }
8145
8146   if (TREE_CODE (decl) != FUNCTION_DECL)
8147     ttype = target_type (type);
8148
8149   if (! DECL_EXTERNAL (decl) && TREE_READONLY (decl)
8150       && TYPE_NEEDS_CONSTRUCTING (type))
8151     {
8152       /* Currently, GNU C++ puts constants in text space, making them
8153          impossible to initialize.  In the future, one would hope for
8154          an operating system which understood the difference between
8155          initialization and the running of a program.  */
8156       was_readonly = 1;
8157       TREE_READONLY (decl) = 0;
8158     }
8159
8160   if (TREE_CODE (decl) == FIELD_DECL && asmspec)
8161     {
8162       /* This must override the asm specifier which was placed by
8163          grokclassfn.  Lay this out fresh.  */
8164       DECL_RTL (TREE_TYPE (decl)) = NULL_RTX;
8165       DECL_ASSEMBLER_NAME (decl) = get_identifier (asmspec);
8166       make_decl_rtl (decl, asmspec, 0);
8167     }
8168
8169   /* Deduce size of array from initialization, if not already known.  */
8170   maybe_deduce_size_from_array_init (decl, init);
8171   init = check_initializer (decl, init);
8172
8173   GNU_xref_decl (current_function_decl, decl);
8174
8175   if (TREE_CODE (decl) == VAR_DECL)
8176     layout_var_decl (decl);
8177
8178   /* Output the assembler code and/or RTL code for variables and functions,
8179      unless the type is an undefined structure or union.
8180      If not, it will get done when the type is completed.  */
8181   if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL
8182       || TREE_CODE (decl) == RESULT_DECL)
8183     {
8184       if (TREE_CODE (decl) == VAR_DECL)
8185         maybe_commonize_var (decl);
8186
8187       make_rtl_for_nonlocal_decl (decl, init, asmspec);
8188
8189       if (TREE_CODE (type) == FUNCTION_TYPE
8190           || TREE_CODE (type) == METHOD_TYPE)
8191         abstract_virtuals_error (decl,
8192                                  strip_array_types (TREE_TYPE (type)));
8193       else
8194         abstract_virtuals_error (decl, strip_array_types (type));
8195
8196       if (TREE_CODE (decl) == FUNCTION_DECL)
8197         ;
8198       else if (DECL_EXTERNAL (decl)
8199                && ! (DECL_LANG_SPECIFIC (decl)
8200                      && DECL_NOT_REALLY_EXTERN (decl)))
8201         {
8202           if (init)
8203             DECL_INITIAL (decl) = init;
8204         }
8205       else if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL)
8206         {
8207           /* This is a local declaration.  */
8208           if (doing_semantic_analysis_p ())
8209             maybe_inject_for_scope_var (decl);
8210           /* Initialize the local variable.  But, if we're building a
8211              statement-tree, we'll do the initialization when we
8212              expand the tree.  */
8213           if (processing_template_decl)
8214             {
8215               if (init || DECL_INITIAL (decl) == error_mark_node)
8216                 DECL_INITIAL (decl) = init;
8217             }
8218           else
8219             {
8220               /* If we're not building RTL, then we need to do so
8221                  now.  */
8222               if (!building_stmt_tree ())
8223                 emit_local_var (decl);
8224               /* Initialize the variable.  */
8225               initialize_local_var (decl, init, flags);
8226               /* Clean up the variable.  */
8227               destroy_local_var (decl);
8228             }
8229         }
8230       else if (TREE_STATIC (decl) && type != error_mark_node)
8231         {
8232           /* Cleanups for static variables are handled by `finish_file'.  */
8233           if (TYPE_NEEDS_CONSTRUCTING (type) || init != NULL_TREE
8234               || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
8235             expand_static_init (decl, init);
8236         }
8237     finish_end0:
8238
8239       /* Undo call to `pushclass' that was done in `start_decl'
8240          due to initialization of qualified member variable.
8241          I.e., Foo::x = 10;  */
8242       {
8243         tree context = CP_DECL_CONTEXT (decl);
8244         if (context
8245             && TYPE_P (context)
8246             && (TREE_CODE (decl) == VAR_DECL
8247                 /* We also have a pushclass done that we need to undo here
8248                    if we're at top level and declare a method.  */
8249                 || TREE_CODE (decl) == FUNCTION_DECL)
8250             /* If size hasn't been set, we're still defining it,
8251                and therefore inside the class body; don't pop
8252                the binding level..  */
8253             && COMPLETE_TYPE_P (context)
8254             && context == current_class_type)
8255           pop_nested_class ();
8256       }
8257     }
8258
8259  finish_end:
8260
8261   if (was_readonly)
8262     TREE_READONLY (decl) = 1;
8263 }
8264
8265 /* This is here for a midend callback from c-common.c */
8266
8267 void
8268 finish_decl (decl, init, asmspec_tree)
8269      tree decl, init;
8270      tree asmspec_tree;
8271 {
8272   cp_finish_decl (decl, init, asmspec_tree, 0);
8273 }
8274
8275 /* Returns a declaration for a VAR_DECL as if:
8276
8277      extern "C" TYPE NAME;
8278
8279    had been seen.  Used to create compiler-generated global
8280    variables.  */
8281
8282 tree
8283 declare_global_var (name, type)
8284      tree name;
8285      tree type;
8286 {
8287   tree decl;
8288
8289   push_to_top_level ();
8290   decl = build_decl (VAR_DECL, name, type);
8291   TREE_PUBLIC (decl) = 1;
8292   DECL_EXTERNAL (decl) = 1;
8293   DECL_ARTIFICIAL (decl) = 1;
8294   pushdecl (decl);
8295   cp_finish_decl (decl, NULL_TREE, NULL_TREE, 0);
8296   pop_from_top_level ();
8297
8298   return decl;
8299 }
8300
8301 /* Returns a pointer to the `atexit' function.  Note that if
8302    FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8303    `__cxa_atexit' function specified in the IA64 C++ ABI.  */
8304
8305 static tree
8306 get_atexit_node ()
8307 {
8308   tree atexit_fndecl;
8309   tree arg_types;
8310   tree fn_type;
8311   tree fn_ptr_type;
8312   const char *name;
8313
8314   if (atexit_node)
8315     return atexit_node;
8316
8317   if (flag_use_cxa_atexit)
8318     {
8319       /* The declaration for `__cxa_atexit' is:
8320
8321            int __cxa_atexit (void (*)(void *), void *, void *)
8322
8323          We build up the argument types and then then function type
8324          itself.  */
8325
8326       /* First, build the pointer-to-function type for the first
8327          argument.  */
8328       arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8329       fn_type = build_function_type (void_type_node, arg_types);
8330       fn_ptr_type = build_pointer_type (fn_type);
8331       /* Then, build the rest of the argument types.  */
8332       arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8333       arg_types = tree_cons (NULL_TREE, ptr_type_node, arg_types);
8334       arg_types = tree_cons (NULL_TREE, fn_ptr_type, arg_types);
8335       /* And the final __cxa_atexit type.  */
8336       fn_type = build_function_type (integer_type_node, arg_types);
8337       fn_ptr_type = build_pointer_type (fn_type);
8338       name = "__cxa_atexit";
8339     }
8340   else
8341     {
8342       /* The declaration for `atexit' is:
8343
8344            int atexit (void (*)());
8345
8346          We build up the argument types and then then function type
8347          itself.  */
8348       fn_type = build_function_type (void_type_node, void_list_node);
8349       fn_ptr_type = build_pointer_type (fn_type);
8350       arg_types = tree_cons (NULL_TREE, fn_ptr_type, void_list_node);
8351       /* Build the final atexit type.  */
8352       fn_type = build_function_type (integer_type_node, arg_types);
8353       name = "atexit";
8354     }
8355
8356   /* Now, build the function declaration.  */
8357   push_lang_context (lang_name_c);
8358   atexit_fndecl = build_library_fn_ptr (name, fn_type);
8359   mark_used (atexit_fndecl);
8360   pop_lang_context ();
8361   atexit_node = default_conversion (atexit_fndecl);
8362
8363   return atexit_node;
8364 }
8365
8366 /* Returns the __dso_handle VAR_DECL.  */
8367
8368 static tree
8369 get_dso_handle_node ()
8370 {
8371   if (dso_handle_node)
8372     return dso_handle_node;
8373
8374   /* Declare the variable.  */
8375   dso_handle_node = declare_global_var (get_identifier ("__dso_handle"),
8376                                         ptr_type_node);
8377
8378   return dso_handle_node;
8379 }
8380
8381 /* Begin a new function with internal linkage whose job will be simply
8382    to destroy some particular variable.  */
8383
8384 static tree
8385 start_cleanup_fn ()
8386 {
8387   static int counter = 0;
8388   int old_interface_unknown = interface_unknown;
8389   char name[32];
8390   tree parmtypes;
8391   tree fntype;
8392   tree fndecl;
8393
8394   push_to_top_level ();
8395
8396   /* No need to mangle this.  */
8397   push_lang_context (lang_name_c);
8398
8399   interface_unknown = 1;
8400
8401   /* Build the parameter-types.  */
8402   parmtypes = void_list_node;
8403   /* Functions passed to __cxa_atexit take an additional parameter.
8404      We'll just ignore it.  After we implement the new calling
8405      convention for destructors, we can eliminate the use of
8406      additional cleanup functions entirely in the -fnew-abi case.  */
8407   if (flag_use_cxa_atexit)
8408     parmtypes = tree_cons (NULL_TREE, ptr_type_node, parmtypes);
8409   /* Build the function type itself.  */
8410   fntype = build_function_type (void_type_node, parmtypes);
8411   /* Build the name of the function.  */
8412   sprintf (name, "__tcf_%d", counter++);
8413   /* Build the function declaration.  */
8414   fndecl = build_lang_decl (FUNCTION_DECL, get_identifier (name), fntype);
8415   /* It's a function with internal linkage, generated by the
8416      compiler.  */
8417   TREE_PUBLIC (fndecl) = 0;
8418   DECL_ARTIFICIAL (fndecl) = 1;
8419   /* Build the parameter.  */
8420   if (flag_use_cxa_atexit)
8421     {
8422       tree parmdecl;
8423
8424       parmdecl = build_decl (PARM_DECL, NULL_TREE, ptr_type_node);
8425       DECL_CONTEXT (parmdecl) = fndecl;
8426       DECL_ARG_TYPE (parmdecl) = ptr_type_node;
8427       TREE_USED (parmdecl) = 1;
8428       DECL_ARGUMENTS (fndecl) = parmdecl;
8429     }
8430
8431   pushdecl (fndecl);
8432   start_function (/*specs=*/NULL_TREE, fndecl, NULL_TREE, SF_PRE_PARSED);
8433   do_pushlevel ();
8434
8435   interface_unknown = old_interface_unknown;
8436
8437   pop_lang_context ();
8438
8439   return current_function_decl;
8440 }
8441
8442 /* Finish the cleanup function begun by start_cleanup_fn.  */
8443
8444 static void
8445 end_cleanup_fn ()
8446 {
8447   do_poplevel ();
8448
8449   expand_body (finish_function (0));
8450
8451   pop_from_top_level ();
8452 }
8453
8454 /* Generate code to handle the destruction of DECL, an object with
8455    static storage duration.  */
8456
8457 void
8458 register_dtor_fn (decl)
8459      tree decl;
8460 {
8461   tree cleanup;
8462   tree compound_stmt;
8463   tree args;
8464   tree fcall;
8465
8466   int saved_flag_access_control;
8467
8468   if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
8469     return;
8470
8471   /* Call build_cleanup before we enter the anonymous function so that
8472      any access checks will be done relative to the current scope,
8473      rather than the scope of the anonymous function.  */
8474   build_cleanup (decl);
8475
8476   /* Now start the function.  */
8477   cleanup = start_cleanup_fn ();
8478
8479   /* Now, recompute the cleanup.  It may contain SAVE_EXPRs that refer
8480      to the original function, rather than the anonymous one.  That
8481      will make the back-end think that nested functions are in use,
8482      which causes confusion.  */
8483   saved_flag_access_control = flag_access_control;
8484   flag_access_control = 0;
8485   fcall = build_cleanup (decl);
8486   flag_access_control = saved_flag_access_control;
8487
8488   /* Create the body of the anonymous function.  */
8489   compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
8490   finish_expr_stmt (fcall);
8491   finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
8492   end_cleanup_fn ();
8493
8494   /* Call atexit with the cleanup function.  */
8495   mark_addressable (cleanup);
8496   cleanup = build_unary_op (ADDR_EXPR, cleanup, 0);
8497   if (flag_use_cxa_atexit)
8498     {
8499       args = tree_cons (NULL_TREE, get_dso_handle_node (), NULL_TREE);
8500       args = tree_cons (NULL_TREE, null_pointer_node, args);
8501       args = tree_cons (NULL_TREE, cleanup, args);
8502     }
8503   else
8504     args = tree_cons (NULL_TREE, cleanup, NULL_TREE);
8505   finish_expr_stmt (build_function_call (get_atexit_node (), args));
8506 }
8507
8508 void
8509 expand_static_init (decl, init)
8510      tree decl;
8511      tree init;
8512 {
8513   tree oldstatic = value_member (decl, static_aggregates);
8514
8515   if (oldstatic)
8516     {
8517       if (TREE_PURPOSE (oldstatic) && init != NULL_TREE)
8518         cp_error ("multiple initializations given for `%D'", decl);
8519     }
8520   else if (! toplevel_bindings_p ())
8521     {
8522       /* Emit code to perform this initialization but once.  */
8523       tree if_stmt;
8524       tree then_clause;
8525       tree assignment;
8526       tree guard;
8527       tree guard_init;
8528
8529       /* Emit code to perform this initialization but once.  This code
8530          looks like:
8531
8532            static int guard = 0;
8533            if (!guard) {
8534              // Do initialization.
8535              guard = 1;
8536              // Register variable for destruction at end of program.
8537            }
8538
8539          Note that the `temp' variable is only set to 1 *after* the
8540          initialization is complete.  This ensures that an exception,
8541          thrown during the construction, will cause the variable to
8542          reinitialized when we pass through this code again, as per:
8543
8544            [stmt.dcl]
8545
8546            If the initialization exits by throwing an exception, the
8547            initialization is not complete, so it will be tried again
8548            the next time control enters the declaration.
8549
8550          In theory, this process should be thread-safe, too; multiple
8551          threads should not be able to initialize the variable more
8552          than once.  We don't yet attempt to ensure thread-safety.  */
8553
8554       /* Create the guard variable.  */
8555       guard = get_guard (decl);
8556
8557       /* Begin the conditional initialization.  */
8558       if_stmt = begin_if_stmt ();
8559       finish_if_stmt_cond (get_guard_cond (guard), if_stmt);
8560       then_clause = begin_compound_stmt (/*has_no_scope=*/0);
8561
8562       /* Do the initialization itself.  */
8563       if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl))
8564           || (init && TREE_CODE (init) == TREE_LIST))
8565         assignment = build_aggr_init (decl, init, 0);
8566       else if (init)
8567         /* The initialization we're doing here is just a bitwise
8568            copy.  */
8569         assignment = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
8570       else
8571         assignment = NULL_TREE;
8572
8573       /* Once the assignment is complete, set TEMP to 1.  Since the
8574          construction of the static object is complete at this point,
8575          we want to make sure TEMP is set to 1 even if a temporary
8576          constructed during the initialization throws an exception
8577          when it is destroyed.  So, we combine the initialization and
8578          the assignment to TEMP into a single expression, ensuring
8579          that when we call finish_expr_stmt the cleanups will not be
8580          run until after TEMP is set to 1.  */
8581       guard_init = set_guard (guard);
8582       if (assignment)
8583         {
8584           assignment = tree_cons (NULL_TREE, assignment,
8585                                   build_tree_list (NULL_TREE,
8586                                                    guard_init));
8587           assignment = build_compound_expr (assignment);
8588         }
8589       else
8590         assignment = guard_init;
8591       finish_expr_stmt (assignment);
8592
8593       /* Use atexit to register a function for destroying this static
8594          variable.  */
8595       register_dtor_fn (decl);
8596
8597       finish_compound_stmt (/*has_no_scope=*/0, then_clause);
8598       finish_then_clause (if_stmt);
8599       finish_if_stmt ();
8600     }
8601   else
8602     static_aggregates = tree_cons (init, decl, static_aggregates);
8603 }
8604
8605 /* Finish the declaration of a catch-parameter.  */
8606
8607 tree
8608 start_handler_parms (declspecs, declarator)
8609      tree declspecs;
8610      tree declarator;
8611 {
8612   tree decl;
8613   if (declspecs)
8614     {
8615       decl = grokdeclarator (declarator, declspecs, CATCHPARM,
8616                              1, NULL_TREE);
8617       if (decl == NULL_TREE)
8618         error ("invalid catch parameter");
8619     }
8620   else
8621     decl = NULL_TREE;
8622
8623   return decl;
8624 }
8625
8626 \f
8627 /* Make TYPE a complete type based on INITIAL_VALUE.
8628    Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8629    2 if there was no information (in which case assume 0 if DO_DEFAULT).  */
8630
8631 int
8632 complete_array_type (type, initial_value, do_default)
8633      tree type, initial_value;
8634      int do_default;
8635 {
8636   register tree maxindex = NULL_TREE;
8637   int value = 0;
8638
8639   if (initial_value)
8640     {
8641       /* Note MAXINDEX  is really the maximum index,
8642          one less than the size.  */
8643       if (TREE_CODE (initial_value) == STRING_CST)
8644         {
8645           int eltsize
8646             = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
8647           maxindex = build_int_2 ((TREE_STRING_LENGTH (initial_value)
8648                                    / eltsize) - 1, 0);
8649         }
8650       else if (TREE_CODE (initial_value) == CONSTRUCTOR)
8651         {
8652           tree elts = CONSTRUCTOR_ELTS (initial_value);
8653
8654           maxindex = ssize_int (-1);
8655           for (; elts; elts = TREE_CHAIN (elts))
8656             {
8657               if (TREE_PURPOSE (elts))
8658                 maxindex = TREE_PURPOSE (elts);
8659               else
8660                 maxindex = size_binop (PLUS_EXPR, maxindex, ssize_int (1));
8661             }
8662           maxindex = copy_node (maxindex);
8663         }
8664       else
8665         {
8666           /* Make an error message unless that happened already.  */
8667           if (initial_value != error_mark_node)
8668             value = 1;
8669           else
8670             initial_value = NULL_TREE;
8671
8672           /* Prevent further error messages.  */
8673           maxindex = build_int_2 (0, 0);
8674         }
8675     }
8676
8677   if (!maxindex)
8678     {
8679       if (do_default)
8680         maxindex = build_int_2 (0, 0);
8681       value = 2;
8682     }
8683
8684   if (maxindex)
8685     {
8686       tree itype;
8687       tree domain;
8688
8689       domain = build_index_type (maxindex);
8690       TYPE_DOMAIN (type) = domain;
8691
8692       if (! TREE_TYPE (maxindex))
8693         TREE_TYPE (maxindex) = domain;
8694       if (initial_value)
8695         itype = TREE_TYPE (initial_value);
8696       else
8697         itype = NULL;
8698       if (itype && !TYPE_DOMAIN (itype))
8699         TYPE_DOMAIN (itype) = domain;
8700       /* The type of the main variant should never be used for arrays
8701          of different sizes.  It should only ever be completed with the
8702          size of the array.  */
8703       if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)))
8704         TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)) = domain;
8705     }
8706
8707   /* Lay out the type now that we can get the real answer.  */
8708
8709   layout_type (type);
8710
8711   return value;
8712 }
8713 \f
8714 /* Return zero if something is declared to be a member of type
8715    CTYPE when in the context of CUR_TYPE.  STRING is the error
8716    message to print in that case.  Otherwise, quietly return 1.  */
8717
8718 static int
8719 member_function_or_else (ctype, cur_type, flags)
8720      tree ctype, cur_type;
8721      enum overload_flags flags;
8722 {
8723   if (ctype && ctype != cur_type)
8724     {
8725       if (flags == DTOR_FLAG)
8726         error ("destructor for alien class `%s' cannot be a member",
8727                TYPE_NAME_STRING (ctype));
8728       else
8729         error ("constructor for alien class `%s' cannot be a member",
8730                TYPE_NAME_STRING (ctype));
8731       return 0;
8732     }
8733   return 1;
8734 }
8735 \f
8736 /* Subroutine of `grokdeclarator'.  */
8737
8738 /* Generate errors possibly applicable for a given set of specifiers.
8739    This is for ARM $7.1.2.  */
8740
8741 static void
8742 bad_specifiers (object, type, virtualp, quals, inlinep, friendp, raises)
8743      tree object;
8744      const char *type;
8745      int virtualp, quals, friendp, raises, inlinep;
8746 {
8747   if (virtualp)
8748     cp_error ("`%D' declared as a `virtual' %s", object, type);
8749   if (inlinep)
8750     cp_error ("`%D' declared as an `inline' %s", object, type);
8751   if (quals)
8752     cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8753               object, type);
8754   if (friendp)
8755     cp_error_at ("`%D' declared as a friend", object);
8756   if (raises)
8757     cp_error_at ("`%D' declared with an exception specification", object);
8758 }
8759
8760 /* CTYPE is class type, or null if non-class.
8761    TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8762    or METHOD_TYPE.
8763    DECLARATOR is the function's name.
8764    VIRTUALP is truthvalue of whether the function is virtual or not.
8765    FLAGS are to be passed through to `grokclassfn'.
8766    QUALS are qualifiers indicating whether the function is `const'
8767    or `volatile'.
8768    RAISES is a list of exceptions that this function can raise.
8769    CHECK is 1 if we must find this method in CTYPE, 0 if we should
8770    not look, and -1 if we should not call `grokclassfn' at all.
8771
8772    Returns `NULL_TREE' if something goes wrong, after issuing
8773    applicable error messages.  */
8774
8775 static tree
8776 grokfndecl (ctype, type, declarator, orig_declarator, virtualp, flags, quals,
8777             raises, check, friendp, publicp, inlinep, funcdef_flag,
8778             template_count, in_namespace)
8779      tree ctype, type;
8780      tree declarator;
8781      tree orig_declarator;
8782      int virtualp;
8783      enum overload_flags flags;
8784      tree quals, raises;
8785      int check, friendp, publicp, inlinep, funcdef_flag, template_count;
8786      tree in_namespace;
8787 {
8788   tree cname, decl;
8789   int staticp = ctype && TREE_CODE (type) == FUNCTION_TYPE;
8790   int has_default_arg = 0;
8791   tree t;
8792
8793   if (ctype)
8794     cname = TREE_CODE (TYPE_NAME (ctype)) == TYPE_DECL
8795       ? TYPE_IDENTIFIER (ctype) : TYPE_NAME (ctype);
8796   else
8797     cname = NULL_TREE;
8798
8799   if (raises)
8800     {
8801       type = build_exception_variant (type, raises);
8802     }
8803
8804   decl = build_lang_decl (FUNCTION_DECL, declarator, type);
8805   /* Propagate volatile out from type to decl. */
8806   if (TYPE_VOLATILE (type))
8807     TREE_THIS_VOLATILE (decl) = 1;
8808
8809   /* If this decl has namespace scope, set that up.  */
8810   if (in_namespace)
8811     set_decl_namespace (decl, in_namespace, friendp);
8812   else if (!ctype)
8813     DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
8814
8815   /* `main' and builtins have implicit 'C' linkage.  */
8816   if ((MAIN_NAME_P (declarator)
8817        || (IDENTIFIER_LENGTH (declarator) > 10
8818            && IDENTIFIER_POINTER (declarator)[0] == '_'
8819            && IDENTIFIER_POINTER (declarator)[1] == '_'
8820            && strncmp (IDENTIFIER_POINTER (declarator)+2, "builtin_", 8) == 0))
8821       && current_lang_name == lang_name_cplusplus
8822       && ctype == NULL_TREE
8823       /* NULL_TREE means global namespace.  */
8824       && DECL_CONTEXT (decl) == NULL_TREE)
8825     DECL_LANGUAGE (decl) = lang_c;
8826
8827   /* Should probably propagate const out from type to decl I bet (mrs).  */
8828   if (staticp)
8829     {
8830       DECL_STATIC_FUNCTION_P (decl) = 1;
8831       DECL_CONTEXT (decl) = ctype;
8832     }
8833
8834   if (ctype)
8835     DECL_CONTEXT (decl) = ctype;
8836
8837   if (ctype == NULL_TREE && DECL_MAIN_P (decl))
8838     {
8839       if (processing_template_decl)
8840         error ("cannot declare `::main' to be a template");
8841       if (inlinep)
8842         error ("cannot declare `::main' to be inline");
8843       else if (! publicp)
8844         error ("cannot declare `::main' to be static");
8845       inlinep = 0;
8846       publicp = 1;
8847     }
8848
8849   /* Members of anonymous types and local classes have no linkage; make
8850      them internal.  */
8851   if (ctype && (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype))
8852                 || decl_function_context (TYPE_MAIN_DECL (ctype))))
8853     publicp = 0;
8854
8855   if (publicp)
8856     {
8857       /* [basic.link]: A name with no linkage (notably, the name of a class
8858          or enumeration declared in a local scope) shall not be used to
8859          declare an entity with linkage.
8860
8861          Only check this for public decls for now.  */
8862       t = no_linkage_check (TREE_TYPE (decl));
8863       if (t)
8864         {
8865           if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
8866             {
8867               if (DECL_EXTERN_C_P (decl))
8868                 /* Allow this; it's pretty common in C.  */;
8869               else
8870                 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8871                             decl);
8872             }
8873           else
8874             cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8875                         decl, t);
8876         }
8877     }
8878
8879   TREE_PUBLIC (decl) = publicp;
8880   if (! publicp)
8881     {
8882       DECL_INTERFACE_KNOWN (decl) = 1;
8883       DECL_NOT_REALLY_EXTERN (decl) = 1;
8884     }
8885
8886   if (inlinep)
8887     DECL_THIS_INLINE (decl) = DECL_INLINE (decl) = 1;
8888
8889   DECL_EXTERNAL (decl) = 1;
8890   if (quals != NULL_TREE && TREE_CODE (type) == FUNCTION_TYPE)
8891     {
8892       cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8893                 (ctype ? "static " : "non-"), decl, TREE_VALUE (quals));
8894       quals = NULL_TREE;
8895     }
8896
8897   if (IDENTIFIER_OPNAME_P (DECL_NAME (decl)))
8898     grok_op_properties (decl, virtualp, check < 0);
8899
8900   if (ctype && decl_function_context (decl))
8901     DECL_NO_STATIC_CHAIN (decl) = 1;
8902
8903   for (t = TYPE_ARG_TYPES (TREE_TYPE (decl)); t; t = TREE_CHAIN (t))
8904     if (TREE_PURPOSE (t)
8905         && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
8906       {
8907         has_default_arg = 1;
8908         break;
8909       }
8910
8911   if (friendp
8912       && TREE_CODE (orig_declarator) == TEMPLATE_ID_EXPR)
8913     {
8914       if (funcdef_flag)
8915         cp_error
8916           ("defining explicit specialization `%D' in friend declaration",
8917            orig_declarator);
8918       else
8919         {
8920           if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8921             {
8922               /* Something like `template <class T> friend void f<T>()'.  */
8923               cp_error ("invalid use of template-id `%D' in declaration of primary template",
8924                         orig_declarator);
8925               return NULL_TREE;
8926             }
8927
8928
8929           /* A friend declaration of the form friend void f<>().  Record
8930              the information in the TEMPLATE_ID_EXPR.  */
8931           SET_DECL_IMPLICIT_INSTANTIATION (decl);
8932           DECL_TEMPLATE_INFO (decl)
8933             = tree_cons (TREE_OPERAND (orig_declarator, 0),
8934                          TREE_OPERAND (orig_declarator, 1),
8935                          NULL_TREE);
8936
8937           if (has_default_arg)
8938             {
8939               cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8940                         decl);
8941               return NULL_TREE;
8942             }
8943
8944           if (inlinep)
8945             {
8946               cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8947                         decl);
8948               return NULL_TREE;
8949             }
8950         }
8951     }
8952
8953   if (has_default_arg)
8954     add_defarg_fn (decl);
8955
8956   /* Plain overloading: will not be grok'd by grokclassfn.  */
8957   if (! ctype && ! processing_template_decl
8958       && !DECL_EXTERN_C_P (decl)
8959       && (! DECL_USE_TEMPLATE (decl) || name_mangling_version < 1))
8960     set_mangled_name_for_decl (decl);
8961
8962   if (funcdef_flag)
8963     /* Make the init_value nonzero so pushdecl knows this is not
8964        tentative.  error_mark_node is replaced later with the BLOCK.  */
8965     DECL_INITIAL (decl) = error_mark_node;
8966
8967   if (TYPE_NOTHROW_P (type) || nothrow_libfn_p (decl))
8968     TREE_NOTHROW (decl) = 1;
8969
8970   /* Caller will do the rest of this.  */
8971   if (check < 0)
8972     return decl;
8973
8974   if (flags == NO_SPECIAL && ctype && constructor_name (cname) == declarator)
8975     DECL_CONSTRUCTOR_P (decl) = 1;
8976
8977   /* Function gets the ugly name, field gets the nice one.  This call
8978      may change the type of the function (because of default
8979      parameters)!  */
8980   if (ctype != NULL_TREE)
8981     grokclassfn (ctype, decl, flags, quals);
8982
8983   decl = check_explicit_specialization (orig_declarator, decl,
8984                                         template_count,
8985                                         2 * (funcdef_flag != 0) +
8986                                         4 * (friendp != 0));
8987   if (decl == error_mark_node)
8988     return NULL_TREE;
8989
8990   if (ctype != NULL_TREE
8991       && (! TYPE_FOR_JAVA (ctype) || check_java_method (decl))
8992       && check)
8993     {
8994       tree old_decl;
8995
8996       old_decl = check_classfn (ctype, decl);
8997
8998       if (old_decl && TREE_CODE (old_decl) == TEMPLATE_DECL)
8999         /* Because grokfndecl is always supposed to return a
9000            FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
9001            here.  We depend on our callers to figure out that its
9002            really a template that's being returned.  */
9003         old_decl = DECL_TEMPLATE_RESULT (old_decl);
9004
9005       if (old_decl && DECL_STATIC_FUNCTION_P (old_decl)
9006           && TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE)
9007         {
9008           /* Remove the `this' parm added by grokclassfn.
9009              XXX Isn't this done in start_function, too?  */
9010           revert_static_member_fn (decl);
9011           last_function_parms = TREE_CHAIN (last_function_parms);
9012         }
9013       if (old_decl && DECL_ARTIFICIAL (old_decl))
9014         cp_error ("definition of implicitly-declared `%D'", old_decl);
9015
9016       if (old_decl)
9017         {
9018           /* Since we've smashed OLD_DECL to its
9019              DECL_TEMPLATE_RESULT, we must do the same to DECL.  */
9020           if (TREE_CODE (decl) == TEMPLATE_DECL)
9021             decl = DECL_TEMPLATE_RESULT (decl);
9022
9023           /* Attempt to merge the declarations.  This can fail, in
9024              the case of some illegal specialization declarations.  */
9025           if (!duplicate_decls (decl, old_decl))
9026             cp_error ("no `%#D' member function declared in class `%T'",
9027                       decl, ctype);
9028           return old_decl;
9029         }
9030     }
9031
9032   if (DECL_CONSTRUCTOR_P (decl) && !grok_ctor_properties (ctype, decl))
9033     return NULL_TREE;
9034
9035   if (ctype == NULL_TREE || check)
9036     return decl;
9037
9038   if (virtualp)
9039     {
9040       DECL_VIRTUAL_P (decl) = 1;
9041       if (DECL_VINDEX (decl) == NULL_TREE)
9042         DECL_VINDEX (decl) = error_mark_node;
9043       IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1;
9044     }
9045
9046   return decl;
9047 }
9048
9049 static tree
9050 grokvardecl (type, declarator, specbits_in, initialized, constp, in_namespace)
9051      tree type;
9052      tree declarator;
9053      RID_BIT_TYPE *specbits_in;
9054      int initialized;
9055      int constp;
9056      tree in_namespace;
9057 {
9058   tree decl;
9059   RID_BIT_TYPE specbits;
9060
9061   specbits = *specbits_in;
9062
9063   if (TREE_CODE (type) == OFFSET_TYPE)
9064     {
9065       /* If you declare a static member so that it
9066          can be initialized, the code will reach here.  */
9067       tree basetype = TYPE_OFFSET_BASETYPE (type);
9068       type = TREE_TYPE (type);
9069       decl = build_lang_decl (VAR_DECL, declarator, type);
9070       DECL_CONTEXT (decl) = basetype;
9071       /* DECL_ASSEMBLER_NAME is needed only for full-instantiated
9072          templates.  */
9073       if (!uses_template_parms (decl))
9074         {
9075           if (flag_new_abi)
9076             DECL_ASSEMBLER_NAME (decl) = mangle_decl (decl);
9077           else
9078             DECL_ASSEMBLER_NAME (decl) = build_static_name (basetype,
9079                                                             declarator);
9080         }
9081     }
9082   else
9083     {
9084       tree context;
9085
9086       if (in_namespace)
9087         context = in_namespace;
9088       else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN, specbits))
9089         context = current_namespace;
9090       else
9091         context = NULL_TREE;
9092
9093       if (processing_template_decl && context)
9094         /* For global variables, declared in a template, we need the
9095            full lang_decl.  */
9096         decl = build_lang_decl (VAR_DECL, declarator, type);
9097       else
9098         decl = build_decl (VAR_DECL, declarator, type);
9099
9100       if (context)
9101         set_decl_namespace (decl, context, 0);
9102
9103       context = DECL_CONTEXT (decl);
9104       if (declarator && context && current_lang_name != lang_name_c)
9105         {
9106           if (flag_new_abi)
9107             DECL_ASSEMBLER_NAME (decl) = mangle_decl (decl);
9108           else
9109             DECL_ASSEMBLER_NAME (decl)
9110               = build_static_name (context, declarator);
9111         }
9112     }
9113
9114   if (in_namespace)
9115     set_decl_namespace (decl, in_namespace, 0);
9116
9117   if (RIDBIT_SETP (RID_EXTERN, specbits))
9118     {
9119       DECL_THIS_EXTERN (decl) = 1;
9120       DECL_EXTERNAL (decl) = !initialized;
9121     }
9122
9123   /* In class context, static means one per class,
9124      public access, and static storage.  */
9125   if (DECL_CLASS_SCOPE_P (decl))
9126     {
9127       TREE_PUBLIC (decl) = 1;
9128       TREE_STATIC (decl) = 1;
9129       DECL_EXTERNAL (decl) = 0;
9130     }
9131   /* At top level, either `static' or no s.c. makes a definition
9132      (perhaps tentative), and absence of `static' makes it public.  */
9133   else if (toplevel_bindings_p ())
9134     {
9135       TREE_PUBLIC (decl) = (RIDBIT_NOTSETP (RID_STATIC, specbits)
9136                             && (DECL_THIS_EXTERN (decl) || ! constp));
9137       TREE_STATIC (decl) = ! DECL_EXTERNAL (decl);
9138     }
9139   /* Not at top level, only `static' makes a static definition.  */
9140   else
9141     {
9142       TREE_STATIC (decl) = !! RIDBIT_SETP (RID_STATIC, specbits);
9143       TREE_PUBLIC (decl) = DECL_EXTERNAL (decl);
9144     }
9145
9146   if (TREE_PUBLIC (decl))
9147     {
9148       /* [basic.link]: A name with no linkage (notably, the name of a class
9149          or enumeration declared in a local scope) shall not be used to
9150          declare an entity with linkage.
9151
9152          Only check this for public decls for now.  */
9153       tree t = no_linkage_check (TREE_TYPE (decl));
9154       if (t)
9155         {
9156           if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
9157             /* Ignore for now; `enum { foo } e' is pretty common.  */;
9158           else
9159             cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9160                         decl, t);
9161         }
9162     }
9163
9164   return decl;
9165 }
9166
9167 /* Create and return a canonical pointer to member function type, for
9168    TYPE, which is a POINTER_TYPE to a METHOD_TYPE.  */
9169
9170 tree
9171 build_ptrmemfunc_type (type)
9172      tree type;
9173 {
9174   tree fields[4];
9175   tree t;
9176   tree u;
9177   tree unqualified_variant = NULL_TREE;
9178
9179   /* If a canonical type already exists for this type, use it.  We use
9180      this method instead of type_hash_canon, because it only does a
9181      simple equality check on the list of field members.  */
9182
9183   if ((t = TYPE_GET_PTRMEMFUNC_TYPE (type)))
9184     return t;
9185
9186   /* Make sure that we always have the unqualified pointer-to-member
9187      type first.  */
9188   if (CP_TYPE_QUALS (type) != TYPE_UNQUALIFIED)
9189     unqualified_variant
9190       = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type));
9191
9192   t = make_aggr_type (RECORD_TYPE);
9193   /* Let the front-end know this is a pointer to member function...  */
9194   TYPE_PTRMEMFUNC_FLAG (t) = 1;
9195   /* ... and not really an aggregate.  */
9196   SET_IS_AGGR_TYPE (t, 0);
9197
9198   if (!flag_new_abi)
9199     {
9200       u = make_aggr_type (UNION_TYPE);
9201       SET_IS_AGGR_TYPE (u, 0);
9202       fields[0] = build_decl (FIELD_DECL, pfn_identifier, type);
9203       fields[1] = build_decl (FIELD_DECL, delta2_identifier,
9204                               delta_type_node);
9205       finish_builtin_type (u, "__ptrmemfunc_type", fields, 1, ptr_type_node);
9206       TYPE_NAME (u) = NULL_TREE;
9207
9208       fields[0] = build_decl (FIELD_DECL, delta_identifier,
9209                               delta_type_node);
9210       fields[1] = build_decl (FIELD_DECL, index_identifier,
9211                               delta_type_node);
9212       fields[2] = build_decl (FIELD_DECL, pfn_or_delta2_identifier, u);
9213       finish_builtin_type (t, "__ptrmemfunc_type", fields, 2, ptr_type_node);
9214     }
9215   else
9216     {
9217       fields[0] = build_decl (FIELD_DECL, pfn_identifier, type);
9218       fields[1] = build_decl (FIELD_DECL, delta_identifier,
9219                               delta_type_node);
9220       finish_builtin_type (t, "__ptrmemfunc_type", fields, 1, ptr_type_node);
9221     }
9222
9223   /* Zap out the name so that the back-end will give us the debugging
9224      information for this anonymous RECORD_TYPE.  */
9225   TYPE_NAME (t) = NULL_TREE;
9226
9227   /* If this is not the unqualified form of this pointer-to-member
9228      type, set the TYPE_MAIN_VARIANT for this type to be the
9229      unqualified type.  Since they are actually RECORD_TYPEs that are
9230      not variants of each other, we must do this manually.  */
9231   if (CP_TYPE_QUALS (type) != TYPE_UNQUALIFIED)
9232     {
9233       t = build_qualified_type (t, CP_TYPE_QUALS (type));
9234       TYPE_MAIN_VARIANT (t) = unqualified_variant;
9235       TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (unqualified_variant);
9236       TYPE_NEXT_VARIANT (unqualified_variant) = t;
9237     }
9238
9239   /* Cache this pointer-to-member type so that we can find it again
9240      later.  */
9241   TYPE_SET_PTRMEMFUNC_TYPE (type, t);
9242
9243   /* Seems to be wanted.  */
9244   CLASSTYPE_GOT_SEMICOLON (t) = 1;
9245
9246   return t;
9247 }
9248
9249 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9250    Check to see that the definition is valid.  Issue appropriate error
9251    messages.  Return 1 if the definition is particularly bad, or 0
9252    otherwise.  */
9253
9254 int
9255 check_static_variable_definition (decl, type)
9256      tree decl;
9257      tree type;
9258 {
9259   /* Motion 10 at San Diego: If a static const integral data member is
9260      initialized with an integral constant expression, the initializer
9261      may appear either in the declaration (within the class), or in
9262      the definition, but not both.  If it appears in the class, the
9263      member is a member constant.  The file-scope definition is always
9264      required.  */
9265   if (CLASS_TYPE_P (type) || TREE_CODE (type) == REFERENCE_TYPE)
9266     {
9267       cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9268                 type);
9269       /* If we just return the declaration, crashes will sometimes
9270          occur.  We therefore return void_type_node, as if this was a
9271          friend declaration, to cause callers to completely ignore
9272          this declaration.  */
9273       return 1;
9274     }
9275   else if (!CP_TYPE_CONST_P (type))
9276     cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9277               decl);
9278   else if (pedantic && !INTEGRAL_TYPE_P (type))
9279     cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl, type);
9280
9281   return 0;
9282 }
9283
9284 /* Given the SIZE (i.e., number of elements) in an array, compute an
9285    appropriate index type for the array.  If non-NULL, NAME is the
9286    name of the thing being declared.  */
9287
9288 tree
9289 compute_array_index_type (name, size)
9290      tree name;
9291      tree size;
9292 {
9293   tree itype;
9294
9295   /* The size might be the result of a cast. */
9296   STRIP_TYPE_NOPS (size);
9297
9298   /* It might be a const variable or enumeration constant.  */
9299   size = decl_constant_value (size);
9300
9301   /* If this involves a template parameter, it will be a constant at
9302      instantiation time, but we don't know what the value is yet.
9303      Even if no template parameters are involved, we may an expression
9304      that is not a constant; we don't even simplify `1 + 2' when
9305      processing a template.  */
9306   if (processing_template_decl)
9307     {
9308       /* Resolve a qualified reference to an enumerator or static
9309          const data member of ours.  */
9310       if (TREE_CODE (size) == SCOPE_REF
9311           && TREE_OPERAND (size, 0) == current_class_type)
9312         {
9313           tree t = lookup_field (current_class_type,
9314                                  TREE_OPERAND (size, 1), 0, 0);
9315           if (t)
9316             size = t;
9317         }
9318
9319       return build_index_type (build_min (MINUS_EXPR, sizetype,
9320                                           size, integer_one_node));
9321     }
9322
9323   /* The array bound must be an integer type.  */
9324   if (TREE_CODE (TREE_TYPE (size)) != INTEGER_TYPE
9325       && TREE_CODE (TREE_TYPE (size)) != ENUMERAL_TYPE
9326       && TREE_CODE (TREE_TYPE (size)) != BOOLEAN_TYPE)
9327     {
9328       if (name)
9329         cp_error ("size of array `%D' has non-integer type", name);
9330       else
9331         cp_error ("size of array has non-integer type");
9332       size = integer_one_node;
9333     }
9334
9335   /* Normally, the array-bound will be a constant.  */
9336   if (TREE_CONSTANT (size))
9337     {
9338       /* Check to see if the array bound overflowed.  Make that an
9339          error, no matter how generous we're being.  */
9340       int old_flag_pedantic_errors = flag_pedantic_errors;
9341       int old_pedantic = pedantic;
9342       pedantic = flag_pedantic_errors = 1;
9343       constant_expression_warning (size);
9344       pedantic = old_pedantic;
9345       flag_pedantic_errors = old_flag_pedantic_errors;
9346
9347       /* An array must have a positive number of elements.  */
9348       if (INT_CST_LT (size, integer_zero_node))
9349         {
9350           if (name)
9351             cp_error ("size of array `%D' is negative", name);
9352           else
9353             cp_error ("size of array is negative");
9354           size = integer_one_node;
9355         }
9356       /* Except that an extension we allow zero-sized arrays.  We
9357          always allow them in system headers because glibc uses
9358          them.  */
9359       else if (integer_zerop (size) && pedantic && !in_system_header)
9360         {
9361           if (name)
9362             cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name);
9363           else
9364             cp_pedwarn ("ISO C++ forbids zero-size array");
9365         }
9366     }
9367
9368   /* Compute the index of the largest element in the array.  It is
9369      one less than the number of elements in the array.  */
9370   itype
9371     = fold (cp_build_binary_op (MINUS_EXPR,
9372                                 cp_convert (ssizetype, size),
9373                                 cp_convert (ssizetype,
9374                                             integer_one_node)));
9375
9376   /* Check for variable-sized arrays.  We allow such things as an
9377      extension, even though they are not allowed in ANSI/ISO C++.  */
9378   if (!TREE_CONSTANT (itype))
9379     {
9380       if (pedantic)
9381         {
9382           if (name)
9383             cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9384                         name);
9385           else
9386             cp_pedwarn ("ISO C++ forbids variable-size array");
9387         }
9388
9389       /* Create a variable-sized array index type.  */
9390       itype = variable_size (itype);
9391     }
9392   /* Make sure that there was no overflow when creating to a signed
9393      index type.  (For example, on a 32-bit machine, an array with
9394      size 2^32 - 1 is too big.)  */
9395   else if (TREE_OVERFLOW (itype))
9396     {
9397       error ("overflow in array dimension");
9398       TREE_OVERFLOW (itype) = 0;
9399     }
9400
9401   /* Create and return the appropriate index type.  */
9402   return build_index_type (itype);
9403 }
9404
9405 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9406    indicated TYPE.  If non-NULL, NAME is the NAME of the declaration
9407    with this type.  */
9408
9409 static tree
9410 create_array_type_for_decl (name, type, size)
9411      tree name;
9412      tree type;
9413      tree size;
9414 {
9415   tree itype = NULL_TREE;
9416   const char* error_msg;
9417
9418   /* If things have already gone awry, bail now.  */
9419   if (type == error_mark_node || size == error_mark_node)
9420     return error_mark_node;
9421
9422   /* Assume that everything will go OK.  */
9423   error_msg = NULL;
9424
9425   /* There are some types which cannot be array elements.  */
9426   switch (TREE_CODE (type))
9427     {
9428     case VOID_TYPE:
9429       error_msg = "array of void";
9430       break;
9431
9432     case FUNCTION_TYPE:
9433       error_msg = "array of functions";
9434       break;
9435
9436     case REFERENCE_TYPE:
9437       error_msg = "array of references";
9438       break;
9439
9440     case OFFSET_TYPE:
9441       error_msg = "array of data members";
9442       break;
9443
9444     case METHOD_TYPE:
9445       error_msg = "array of function members";
9446       break;
9447
9448     default:
9449       break;
9450     }
9451
9452   /* If something went wrong, issue an error-message and return.  */
9453   if (error_msg)
9454     {
9455       if (name)
9456         cp_error ("declaration of `%D' as %s", name, error_msg);
9457       else
9458         cp_error ("creating %s", error_msg);
9459
9460       return error_mark_node;
9461     }
9462
9463   /* [dcl.array]
9464
9465      The constant expressions that specify the bounds of the arrays
9466      can be omitted only for the first member of the sequence.  */
9467   if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
9468     {
9469       cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9470                 name);
9471
9472       return error_mark_node;
9473     }
9474
9475   /* Figure out the index type for the array.  */
9476   if (size)
9477     itype = compute_array_index_type (name, size);
9478
9479   return build_cplus_array_type (type, itype);
9480 }
9481
9482 /* Check that it's OK to declare a function with the indicated TYPE.
9483    SFK indicates the kind of special function (if any) that this
9484    function is.  CTYPE is the class of which this function is a
9485    member.  OPTYPE is the type given in a conversion operator
9486    declaration.  Returns the actual return type of the function; that
9487    may be different than TYPE if an error occurs, or for certain
9488    special functions.  */
9489
9490 static tree
9491 check_special_function_return_type (sfk, type, ctype, optype)
9492      special_function_kind sfk;
9493      tree type;
9494      tree ctype;
9495      tree optype;
9496 {
9497   switch (sfk)
9498     {
9499     case sfk_constructor:
9500       if (type)
9501         cp_error ("return type specification for constructor invalid");
9502
9503       /* In the old ABI, we return `this'; in the new ABI we don't
9504          bother.  */
9505       type = flag_new_abi ? void_type_node : build_pointer_type (ctype);
9506       break;
9507
9508     case sfk_destructor:
9509       if (type)
9510         cp_error ("return type specification for destructor invalid");
9511       type = void_type_node;
9512       break;
9513
9514     case sfk_conversion:
9515       if (type && !same_type_p (type, optype))
9516         cp_error ("operator `%T' declared to return `%T'", optype, type);
9517       else if (type)
9518         cp_pedwarn ("return type specified for `operator %T'",  optype);
9519       type = optype;
9520       break;
9521
9522     default:
9523       my_friendly_abort (20000408);
9524       break;
9525     }
9526
9527   return type;
9528 }
9529
9530 /* Given declspecs and a declarator,
9531    determine the name and type of the object declared
9532    and construct a ..._DECL node for it.
9533    (In one case we can return a ..._TYPE node instead.
9534     For invalid input we sometimes return 0.)
9535
9536    DECLSPECS is a chain of tree_list nodes whose value fields
9537     are the storage classes and type specifiers.
9538
9539    DECL_CONTEXT says which syntactic context this declaration is in:
9540      NORMAL for most contexts.  Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9541      FUNCDEF for a function definition.  Like NORMAL but a few different
9542       error messages in each case.  Return value may be zero meaning
9543       this definition is too screwy to try to parse.
9544      MEMFUNCDEF for a function definition.  Like FUNCDEF but prepares to
9545       handle member functions (which have FIELD context).
9546       Return value may be zero meaning this definition is too screwy to
9547       try to parse.
9548      PARM for a parameter declaration (either within a function prototype
9549       or before a function body).  Make a PARM_DECL, or return void_type_node.
9550      CATCHPARM for a parameter declaration before a catch clause.
9551      TYPENAME if for a typename (in a cast or sizeof).
9552       Don't make a DECL node; just return the ..._TYPE node.
9553      FIELD for a struct or union field; make a FIELD_DECL.
9554      BITFIELD for a field with specified width.
9555    INITIALIZED is 1 if the decl has an initializer.
9556
9557    ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9558    normal attributes in TREE_PURPOSE, or NULL_TREE.
9559
9560    In the TYPENAME case, DECLARATOR is really an abstract declarator.
9561    It may also be so in the PARM case, for a prototype where the
9562    argument type is specified but not the name.
9563
9564    This function is where the complicated C meanings of `static'
9565    and `extern' are interpreted.
9566
9567    For C++, if there is any monkey business to do, the function which
9568    calls this one must do it, i.e., prepending instance variables,
9569    renaming overloaded function names, etc.
9570
9571    Note that for this C++, it is an error to define a method within a class
9572    which does not belong to that class.
9573
9574    Except in the case where SCOPE_REFs are implicitly known (such as
9575    methods within a class being redundantly qualified),
9576    declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9577    (class_name::decl_name).  The caller must also deal with this.
9578
9579    If a constructor or destructor is seen, and the context is FIELD,
9580    then the type gains the attribute TREE_HAS_x.  If such a declaration
9581    is erroneous, NULL_TREE is returned.
9582
9583    QUALS is used only for FUNCDEF and MEMFUNCDEF cases.  For a member
9584    function, these are the qualifiers to give to the `this' pointer. We
9585    apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9586
9587    May return void_type_node if the declarator turned out to be a friend.
9588    See grokfield for details.  */
9589
9590 tree
9591 grokdeclarator (declarator, declspecs, decl_context, initialized, attrlist)
9592      tree declspecs;
9593      tree declarator;
9594      enum decl_context decl_context;
9595      int initialized;
9596      tree attrlist;
9597 {
9598   RID_BIT_TYPE specbits;
9599   int nclasses = 0;
9600   tree spec;
9601   tree type = NULL_TREE;
9602   int longlong = 0;
9603   int constp;
9604   int restrictp;
9605   int volatilep;
9606   int type_quals;
9607   int virtualp, explicitp, friendp, inlinep, staticp;
9608   int explicit_int = 0;
9609   int explicit_char = 0;
9610   int defaulted_int = 0;
9611   tree typedef_decl = NULL_TREE;
9612   const char *name;
9613   tree typedef_type = NULL_TREE;
9614   int funcdef_flag = 0;
9615   enum tree_code innermost_code = ERROR_MARK;
9616   int bitfield = 0;
9617 #if 0
9618   /* See the code below that used this.  */
9619   tree decl_machine_attr = NULL_TREE;
9620 #endif
9621   /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9622      All FIELD_DECLs we build here have `init' put into their DECL_INITIAL.  */
9623   tree init = NULL_TREE;
9624
9625   /* Keep track of what sort of function is being processed
9626      so that we can warn about default return values, or explicit
9627      return values which do not match prescribed defaults.  */
9628   special_function_kind sfk = sfk_none;
9629
9630   tree dname = NULL_TREE;
9631   tree ctype = current_class_type;
9632   tree ctor_return_type = NULL_TREE;
9633   enum overload_flags flags = NO_SPECIAL;
9634   tree quals = NULL_TREE;
9635   tree raises = NULL_TREE;
9636   int template_count = 0;
9637   tree in_namespace = NULL_TREE;
9638   tree inner_attrs;
9639   int ignore_attrs;
9640
9641   RIDBIT_RESET_ALL (specbits);
9642   if (decl_context == FUNCDEF)
9643     funcdef_flag = 1, decl_context = NORMAL;
9644   else if (decl_context == MEMFUNCDEF)
9645     funcdef_flag = -1, decl_context = FIELD;
9646   else if (decl_context == BITFIELD)
9647     bitfield = 1, decl_context = FIELD;
9648
9649   /* Look inside a declarator for the name being declared
9650      and get it as a string, for an error message.  */
9651   {
9652     tree *next = &declarator;
9653     register tree decl;
9654     name = NULL;
9655
9656     while (next && *next)
9657       {
9658         decl = *next;
9659         switch (TREE_CODE (decl))
9660           {
9661           case TREE_LIST:
9662             /* For attributes.  */
9663             next = &TREE_VALUE (decl);
9664             break;
9665
9666           case COND_EXPR:
9667             ctype = NULL_TREE;
9668             next = &TREE_OPERAND (decl, 0);
9669             break;
9670
9671           case BIT_NOT_EXPR:    /* For C++ destructors!  */
9672             {
9673               tree name = TREE_OPERAND (decl, 0);
9674               tree rename = NULL_TREE;
9675
9676               my_friendly_assert (flags == NO_SPECIAL, 152);
9677               flags = DTOR_FLAG;
9678               sfk = sfk_destructor;
9679               if (TREE_CODE (name) == TYPE_DECL)
9680                 TREE_OPERAND (decl, 0) = name = constructor_name (name);
9681               my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 153);
9682               if (ctype == NULL_TREE)
9683                 {
9684                   if (current_class_type == NULL_TREE)
9685                     {
9686                       error ("destructors must be member functions");
9687                       flags = NO_SPECIAL;
9688                     }
9689                   else
9690                     {
9691                       tree t = constructor_name (current_class_name);
9692                       if (t != name)
9693                         rename = t;
9694                     }
9695                 }
9696               else
9697                 {
9698                   tree t = constructor_name (ctype);
9699                   if (t != name)
9700                     rename = t;
9701                 }
9702
9703               if (rename)
9704                 {
9705                   cp_error ("destructor `%T' must match class name `%T'",
9706                             name, rename);
9707                   TREE_OPERAND (decl, 0) = rename;
9708                 }
9709               next = &name;
9710             }
9711             break;
9712
9713           case ADDR_EXPR:       /* C++ reference declaration */
9714             /* Fall through. */
9715           case ARRAY_REF:
9716           case INDIRECT_REF:
9717             ctype = NULL_TREE;
9718             innermost_code = TREE_CODE (decl);
9719             next = &TREE_OPERAND (decl, 0);
9720             break;
9721
9722           case CALL_EXPR:
9723             if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl)))
9724               {
9725                 /* This is actually a variable declaration using
9726                    constructor syntax.  We need to call start_decl and
9727                    cp_finish_decl so we can get the variable
9728                    initialized...  */
9729
9730                 tree attributes, prefix_attributes;
9731
9732                 *next = TREE_OPERAND (decl, 0);
9733                 init = CALL_DECLARATOR_PARMS (decl);
9734
9735                 if (attrlist)
9736                   {
9737                     attributes = TREE_PURPOSE (attrlist);
9738                     prefix_attributes = TREE_VALUE (attrlist);
9739                   }
9740                 else
9741                   {
9742                     attributes = NULL_TREE;
9743                     prefix_attributes = NULL_TREE;
9744                   }
9745
9746                 decl = start_decl (declarator, declspecs, 1,
9747                                    attributes, prefix_attributes);
9748                 decl_type_access_control (decl);
9749                 if (decl)
9750                   {
9751                     /* Look for __unused__ attribute */
9752                     if (TREE_USED (TREE_TYPE (decl)))
9753                       TREE_USED (decl) = 1;
9754                     finish_decl (decl, init, NULL_TREE);
9755                   }
9756                 else
9757                   cp_error ("invalid declarator");
9758                 return 0;
9759               }
9760             innermost_code = TREE_CODE (decl);
9761             if (decl_context == FIELD && ctype == NULL_TREE)
9762               ctype = current_class_type;
9763             if (ctype
9764                 && TREE_OPERAND (decl, 0)
9765                 && (TREE_CODE (TREE_OPERAND (decl, 0)) == TYPE_DECL
9766                     && ((DECL_NAME (TREE_OPERAND (decl, 0))
9767                          == constructor_name_full (ctype))
9768                         || (DECL_NAME (TREE_OPERAND (decl, 0))
9769                             == constructor_name (ctype)))))
9770               TREE_OPERAND (decl, 0) = constructor_name (ctype);
9771             next = &TREE_OPERAND (decl, 0);
9772             decl = *next;
9773             if (ctype != NULL_TREE
9774                 && decl != NULL_TREE && flags != DTOR_FLAG
9775                 && decl == constructor_name (ctype))
9776               {
9777                 sfk = sfk_constructor;
9778                 ctor_return_type = ctype;
9779               }
9780             ctype = NULL_TREE;
9781             break;
9782
9783           case TEMPLATE_ID_EXPR:
9784               {
9785                 tree fns = TREE_OPERAND (decl, 0);
9786
9787                 if (TREE_CODE (fns) == LOOKUP_EXPR)
9788                   fns = TREE_OPERAND (fns, 0);
9789
9790                 dname = fns;
9791                 if (TREE_CODE (dname) == COMPONENT_REF)
9792                   dname = TREE_OPERAND (dname, 1);
9793                 if (TREE_CODE (dname) != IDENTIFIER_NODE)
9794                   {
9795                     my_friendly_assert (is_overloaded_fn (dname),
9796                                         19990331);
9797                     dname = DECL_NAME (get_first_fn (dname));
9798                   }
9799               }
9800           /* Fall through. */
9801
9802           case IDENTIFIER_NODE:
9803             if (TREE_CODE (decl) == IDENTIFIER_NODE)
9804               dname = decl;
9805
9806             next = 0;
9807
9808             if (is_rid (dname))
9809               {
9810                 cp_error ("declarator-id missing; using reserved word `%D'",
9811                           dname);
9812                 name = IDENTIFIER_POINTER (dname);
9813               }
9814             else if (!IDENTIFIER_TYPENAME_P (dname))
9815               name = IDENTIFIER_POINTER (dname);
9816             else
9817               {
9818                 my_friendly_assert (flags == NO_SPECIAL, 154);
9819                 flags = TYPENAME_FLAG;
9820                 ctor_return_type = TREE_TYPE (dname);
9821                 sfk = sfk_conversion;
9822                 if (IDENTIFIER_GLOBAL_VALUE (dname)
9823                     && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname))
9824                         == TYPE_DECL))
9825                   name = IDENTIFIER_POINTER (dname);
9826                 else
9827                   name = "<invalid operator>";
9828               }
9829             break;
9830
9831             /* C++ extension */
9832           case SCOPE_REF:
9833             {
9834               /* Perform error checking, and decide on a ctype.  */
9835               tree cname = TREE_OPERAND (decl, 0);
9836               if (cname == NULL_TREE)
9837                 ctype = NULL_TREE;
9838               else if (TREE_CODE (cname) == NAMESPACE_DECL)
9839                 {
9840                   ctype = NULL_TREE;
9841                   in_namespace = TREE_OPERAND (decl, 0);
9842                   TREE_OPERAND (decl, 0) = NULL_TREE;
9843                 }
9844               else if (! is_aggr_type (cname, 1))
9845                 TREE_OPERAND (decl, 0) = NULL_TREE;
9846               /* Must test TREE_OPERAND (decl, 1), in case user gives
9847                  us `typedef (class::memfunc)(int); memfunc *memfuncptr;'  */
9848               else if (TREE_OPERAND (decl, 1)
9849                        && TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF)
9850                 ctype = cname;
9851               else if (TREE_CODE (cname) == TEMPLATE_TYPE_PARM
9852                        || TREE_CODE (cname) == TEMPLATE_TEMPLATE_PARM)
9853                 {
9854                   cp_error ("`%T::%D' is not a valid declarator", cname,
9855                             TREE_OPERAND (decl, 1));
9856                   cp_error ("  perhaps you want `typename %T::%D' to make it a type",
9857                             cname, TREE_OPERAND (decl, 1));
9858                   return void_type_node;
9859                 }
9860               else if (ctype == NULL_TREE)
9861                 ctype = cname;
9862               else if (TREE_COMPLEXITY (decl) == current_class_depth)
9863                 TREE_OPERAND (decl, 0) = ctype;
9864               else
9865                 {
9866                   if (! UNIQUELY_DERIVED_FROM_P (cname, ctype))
9867                     {
9868                       cp_error ("type `%T' is not derived from type `%T'",
9869                                 cname, ctype);
9870                       TREE_OPERAND (decl, 0) = NULL_TREE;
9871                     }
9872                   else
9873                     ctype = cname;
9874                 }
9875
9876               if (ctype && TREE_CODE (TREE_OPERAND (decl, 1)) == TYPE_DECL
9877                   && ((DECL_NAME (TREE_OPERAND (decl, 1))
9878                        == constructor_name_full (ctype))
9879                       || (DECL_NAME (TREE_OPERAND (decl, 1))
9880                           == constructor_name (ctype))))
9881                 TREE_OPERAND (decl, 1) = constructor_name (ctype);
9882               next = &TREE_OPERAND (decl, 1);
9883               decl = *next;
9884               if (ctype)
9885                 {
9886                   if (TREE_CODE (decl) == IDENTIFIER_NODE
9887                       && constructor_name (ctype) == decl)
9888                     {
9889                       sfk = sfk_constructor;
9890                       ctor_return_type = ctype;
9891                     }
9892                   else if (TREE_CODE (decl) == BIT_NOT_EXPR
9893                            && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
9894                            && (constructor_name (ctype) == TREE_OPERAND (decl, 0)
9895                                || constructor_name_full (ctype) == TREE_OPERAND (decl, 0)))
9896                     {
9897                       sfk = sfk_destructor;
9898                       ctor_return_type = ctype;
9899                       flags = DTOR_FLAG;
9900                       TREE_OPERAND (decl, 0) = constructor_name (ctype);
9901                       next = &TREE_OPERAND (decl, 0);
9902                     }
9903                 }
9904             }
9905             break;
9906
9907           case ERROR_MARK:
9908             next = 0;
9909             break;
9910
9911           case TYPE_DECL:
9912             /* Parse error puts this typespec where
9913                a declarator should go.  */
9914             cp_error ("`%T' specified as declarator-id", DECL_NAME (decl));
9915             if (TREE_TYPE (decl) == current_class_type)
9916               cp_error ("  perhaps you want `%T' for a constructor",
9917                         current_class_name);
9918             dname = DECL_NAME (decl);
9919             name = IDENTIFIER_POINTER (dname);
9920
9921             /* Avoid giving two errors for this.  */
9922             IDENTIFIER_CLASS_VALUE (dname) = NULL_TREE;
9923
9924             declspecs = tree_cons (NULL_TREE, integer_type_node, declspecs);
9925             *next = dname;
9926             next = 0;
9927             break;
9928
9929           default:
9930             cp_compiler_error ("`%D' as declarator", decl);
9931             return 0; /* We used to do a 155 abort here.  */
9932           }
9933       }
9934   }
9935
9936   /* A function definition's declarator must have the form of
9937      a function declarator.  */
9938
9939   if (funcdef_flag && innermost_code != CALL_EXPR)
9940     return 0;
9941
9942   if (((dname && IDENTIFIER_OPNAME_P (dname)) || flags == TYPENAME_FLAG)
9943       && innermost_code != CALL_EXPR
9944       && ! (ctype && declspecs == NULL_TREE))
9945     {
9946       cp_error ("declaration of `%D' as non-function", dname);
9947       return void_type_node;
9948     }
9949
9950   /* Anything declared one level down from the top level
9951      must be one of the parameters of a function
9952      (because the body is at least two levels down).  */
9953
9954   /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9955      by not allowing C++ class definitions to specify their parameters
9956      with xdecls (must be spec.d in the parmlist).
9957
9958      Since we now wait to push a class scope until we are sure that
9959      we are in a legitimate method context, we must set oldcname
9960      explicitly (since current_class_name is not yet alive).
9961
9962      We also want to avoid calling this a PARM if it is in a namespace.  */
9963
9964   if (decl_context == NORMAL && !toplevel_bindings_p ())
9965     {
9966       struct binding_level *b = current_binding_level;
9967       current_binding_level = b->level_chain;
9968       if (current_binding_level != 0 && toplevel_bindings_p ())
9969         decl_context = PARM;
9970       current_binding_level = b;
9971     }
9972
9973   if (name == NULL)
9974     name = decl_context == PARM ? "parameter" : "type name";
9975
9976   /* Look through the decl specs and record which ones appear.
9977      Some typespecs are defined as built-in typenames.
9978      Others, the ones that are modifiers of other types,
9979      are represented by bits in SPECBITS: set the bits for
9980      the modifiers that appear.  Storage class keywords are also in SPECBITS.
9981
9982      If there is a typedef name or a type, store the type in TYPE.
9983      This includes builtin typedefs such as `int'.
9984
9985      Set EXPLICIT_INT if the type is `int' or `char' and did not
9986      come from a user typedef.
9987
9988      Set LONGLONG if `long' is mentioned twice.
9989
9990      For C++, constructors and destructors have their own fast treatment.  */
9991
9992   for (spec = declspecs; spec; spec = TREE_CHAIN (spec))
9993     {
9994       register int i;
9995       register tree id;
9996
9997       /* Certain parse errors slip through.  For example,
9998          `int class;' is not caught by the parser. Try
9999          weakly to recover here.  */
10000       if (TREE_CODE (spec) != TREE_LIST)
10001         return 0;
10002
10003       id = TREE_VALUE (spec);
10004
10005       if (TREE_CODE (id) == IDENTIFIER_NODE)
10006         {
10007           if (id == ridpointers[(int) RID_INT]
10008               || id == ridpointers[(int) RID_CHAR]
10009               || id == ridpointers[(int) RID_BOOL]
10010               || id == ridpointers[(int) RID_WCHAR])
10011             {
10012               if (type)
10013                 {
10014                   if (id == ridpointers[(int) RID_BOOL])
10015                     error ("`bool' is now a keyword");
10016                   else
10017                     cp_error ("extraneous `%T' ignored", id);
10018                 }
10019               else
10020                 {
10021                   if (id == ridpointers[(int) RID_INT])
10022                     explicit_int = 1;
10023                   else if (id == ridpointers[(int) RID_CHAR])
10024                     explicit_char = 1;
10025                   type = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id));
10026                 }
10027               goto found;
10028             }
10029           /* C++ aggregate types.  */
10030           if (IDENTIFIER_HAS_TYPE_VALUE (id))
10031             {
10032               if (type)
10033                 cp_error ("multiple declarations `%T' and `%T'", type, id);
10034               else
10035                 type = IDENTIFIER_TYPE_VALUE (id);
10036               goto found;
10037             }
10038
10039           for (i = (int) RID_FIRST_MODIFIER; i <= (int) RID_LAST_MODIFIER; i++)
10040             {
10041               if (ridpointers[i] == id)
10042                 {
10043                   if (i == (int) RID_LONG && RIDBIT_SETP (i, specbits))
10044                     {
10045                       if (pedantic && ! in_system_header && warn_long_long)
10046                         pedwarn ("ISO C++ does not support `long long'");
10047                       if (longlong)
10048                         error ("`long long long' is too long for GCC");
10049                       else
10050                         longlong = 1;
10051                     }
10052                   else if (RIDBIT_SETP (i, specbits))
10053                     pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id));
10054                   RIDBIT_SET (i, specbits);
10055                   goto found;
10056                 }
10057             }
10058         }
10059       /* C++ aggregate types.  */
10060       else if (TREE_CODE (id) == TYPE_DECL)
10061         {
10062           if (type)
10063             cp_error ("multiple declarations `%T' and `%T'", type,
10064                       TREE_TYPE (id));
10065           else
10066             {
10067               type = TREE_TYPE (id);
10068               TREE_VALUE (spec) = type;
10069             }
10070           goto found;
10071         }
10072       if (type)
10073         error ("two or more data types in declaration of `%s'", name);
10074       else if (TREE_CODE (id) == IDENTIFIER_NODE)
10075         {
10076           register tree t = lookup_name (id, 1);
10077           if (!t || TREE_CODE (t) != TYPE_DECL)
10078             error ("`%s' fails to be a typedef or built in type",
10079                    IDENTIFIER_POINTER (id));
10080           else
10081             {
10082               type = TREE_TYPE (t);
10083 #if 0
10084               /* See the code below that used this.  */
10085               decl_machine_attr = DECL_MACHINE_ATTRIBUTES (id);
10086 #endif
10087               typedef_decl = t;
10088             }
10089         }
10090       else if (id != error_mark_node)
10091         /* Can't change CLASS nodes into RECORD nodes here!  */
10092         type = id;
10093
10094     found: ;
10095     }
10096
10097   typedef_type = type;
10098
10099   /* No type at all: default to `int', and set DEFAULTED_INT
10100      because it was not a user-defined typedef.  */
10101
10102   if (type == NULL_TREE
10103       && (RIDBIT_SETP (RID_SIGNED, specbits)
10104           || RIDBIT_SETP (RID_UNSIGNED, specbits)
10105           || RIDBIT_SETP (RID_LONG, specbits)
10106           || RIDBIT_SETP (RID_SHORT, specbits)))
10107     {
10108       /* These imply 'int'.  */
10109       type = integer_type_node;
10110       defaulted_int = 1;
10111     }
10112
10113   if (sfk != sfk_none)
10114     type = check_special_function_return_type (sfk, type,
10115                                                ctor_return_type,
10116                                                ctor_return_type);
10117   else if (type == NULL_TREE)
10118     {
10119       int is_main;
10120
10121       explicit_int = -1;
10122
10123           /* We handle `main' specially here, because 'main () { }' is so
10124              common.  With no options, it is allowed.  With -Wreturn-type,
10125              it is a warning.  It is only an error with -pedantic-errors.  */
10126       is_main = (funcdef_flag
10127                  && MAIN_NAME_P (dname)
10128                  && ctype == NULL_TREE
10129                  && in_namespace == NULL_TREE
10130                  && current_namespace == global_namespace);
10131
10132       if (in_system_header || flag_ms_extensions)
10133         /* Allow it, sigh.  */;
10134       else if (pedantic || ! is_main)
10135         cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10136                     name);
10137       else if (warn_return_type)
10138         cp_warning ("ISO C++ forbids declaration of `%s' with no type",
10139                     name);
10140
10141       type = integer_type_node;
10142     }
10143
10144   ctype = NULL_TREE;
10145
10146   /* Now process the modifiers that were specified
10147      and check for invalid combinations.  */
10148
10149   /* Long double is a special combination.  */
10150
10151   if (RIDBIT_SETP (RID_LONG, specbits)
10152       && TYPE_MAIN_VARIANT (type) == double_type_node)
10153     {
10154       RIDBIT_RESET (RID_LONG, specbits);
10155       type = build_qualified_type (long_double_type_node,
10156                                    CP_TYPE_QUALS (type));
10157     }
10158
10159   /* Check all other uses of type modifiers.  */
10160
10161   if (RIDBIT_SETP (RID_UNSIGNED, specbits)
10162       || RIDBIT_SETP (RID_SIGNED, specbits)
10163       || RIDBIT_SETP (RID_LONG, specbits)
10164       || RIDBIT_SETP (RID_SHORT, specbits))
10165     {
10166       int ok = 0;
10167
10168       if (TREE_CODE (type) == REAL_TYPE)
10169         error ("short, signed or unsigned invalid for `%s'", name);
10170       else if (TREE_CODE (type) != INTEGER_TYPE)
10171         error ("long, short, signed or unsigned invalid for `%s'", name);
10172       else if (RIDBIT_SETP (RID_LONG, specbits)
10173                && RIDBIT_SETP (RID_SHORT, specbits))
10174         error ("long and short specified together for `%s'", name);
10175       else if ((RIDBIT_SETP (RID_LONG, specbits)
10176                 || RIDBIT_SETP (RID_SHORT, specbits))
10177                && explicit_char)
10178         error ("long or short specified with char for `%s'", name);
10179       else if ((RIDBIT_SETP (RID_LONG, specbits)
10180                 || RIDBIT_SETP (RID_SHORT, specbits))
10181                && TREE_CODE (type) == REAL_TYPE)
10182         error ("long or short specified with floating type for `%s'", name);
10183       else if (RIDBIT_SETP (RID_SIGNED, specbits)
10184                && RIDBIT_SETP (RID_UNSIGNED, specbits))
10185         error ("signed and unsigned given together for `%s'", name);
10186       else
10187         {
10188           ok = 1;
10189           if (!explicit_int && !defaulted_int && !explicit_char && pedantic)
10190             {
10191               pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10192                        name);
10193               if (flag_pedantic_errors)
10194                 ok = 0;
10195             }
10196         }
10197
10198       /* Discard the type modifiers if they are invalid.  */
10199       if (! ok)
10200         {
10201           RIDBIT_RESET (RID_UNSIGNED, specbits);
10202           RIDBIT_RESET (RID_SIGNED, specbits);
10203           RIDBIT_RESET (RID_LONG, specbits);
10204           RIDBIT_RESET (RID_SHORT, specbits);
10205           longlong = 0;
10206         }
10207     }
10208
10209   if (RIDBIT_SETP (RID_COMPLEX, specbits)
10210       && TREE_CODE (type) != INTEGER_TYPE && TREE_CODE (type) != REAL_TYPE)
10211     {
10212       error ("complex invalid for `%s'", name);
10213       RIDBIT_RESET (RID_COMPLEX, specbits);
10214     }
10215
10216   /* Decide whether an integer type is signed or not.
10217      Optionally treat bitfields as signed by default.  */
10218   if (RIDBIT_SETP (RID_UNSIGNED, specbits)
10219       /* [class.bit]
10220
10221          It is implementation-defined whether a plain (neither
10222          explicitly signed or unsigned) char, short, int, or long
10223          bit-field is signed or unsigned.
10224
10225          Naturally, we extend this to long long as well.  Note that
10226          this does not include wchar_t.  */
10227       || (bitfield && !flag_signed_bitfields
10228           && RIDBIT_NOTSETP (RID_SIGNED, specbits)
10229           /* A typedef for plain `int' without `signed' can be
10230              controlled just like plain `int', but a typedef for
10231              `signed int' cannot be so controlled.  */
10232           && !(typedef_decl
10233                && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl))
10234           && (TREE_CODE (type) == INTEGER_TYPE
10235               || TREE_CODE (type) == CHAR_TYPE)
10236           && !same_type_p (TYPE_MAIN_VARIANT (type), wchar_type_node)))
10237     {
10238       if (longlong)
10239         type = long_long_unsigned_type_node;
10240       else if (RIDBIT_SETP (RID_LONG, specbits))
10241         type = long_unsigned_type_node;
10242       else if (RIDBIT_SETP (RID_SHORT, specbits))
10243         type = short_unsigned_type_node;
10244       else if (type == char_type_node)
10245         type = unsigned_char_type_node;
10246       else if (typedef_decl)
10247         type = unsigned_type (type);
10248       else
10249         type = unsigned_type_node;
10250     }
10251   else if (RIDBIT_SETP (RID_SIGNED, specbits)
10252            && type == char_type_node)
10253     type = signed_char_type_node;
10254   else if (longlong)
10255     type = long_long_integer_type_node;
10256   else if (RIDBIT_SETP (RID_LONG, specbits))
10257     type = long_integer_type_node;
10258   else if (RIDBIT_SETP (RID_SHORT, specbits))
10259     type = short_integer_type_node;
10260
10261   if (RIDBIT_SETP (RID_COMPLEX, specbits))
10262     {
10263       /* If we just have "complex", it is equivalent to
10264          "complex double", but if any modifiers at all are specified it is
10265          the complex form of TYPE.  E.g, "complex short" is
10266          "complex short int".  */
10267
10268       if (defaulted_int && ! longlong
10269           && ! (RIDBIT_SETP (RID_LONG, specbits)
10270                 || RIDBIT_SETP (RID_SHORT, specbits)
10271                 || RIDBIT_SETP (RID_SIGNED, specbits)
10272                 || RIDBIT_SETP (RID_UNSIGNED, specbits)))
10273         type = complex_double_type_node;
10274       else if (type == integer_type_node)
10275         type = complex_integer_type_node;
10276       else if (type == float_type_node)
10277         type = complex_float_type_node;
10278       else if (type == double_type_node)
10279         type = complex_double_type_node;
10280       else if (type == long_double_type_node)
10281         type = complex_long_double_type_node;
10282       else
10283         type = build_complex_type (type);
10284     }
10285
10286   if (sfk == sfk_conversion
10287       && (RIDBIT_SETP (RID_CONST, specbits)
10288           || RIDBIT_SETP (RID_VOLATILE, specbits)
10289           || RIDBIT_SETP (RID_RESTRICT, specbits)))
10290     cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10291               ctor_return_type);
10292
10293   /* Set CONSTP if this declaration is `const', whether by
10294      explicit specification or via a typedef.
10295      Likewise for VOLATILEP.  */
10296
10297   constp = !! RIDBIT_SETP (RID_CONST, specbits) + CP_TYPE_CONST_P (type);
10298   restrictp =
10299     !! RIDBIT_SETP (RID_RESTRICT, specbits) + CP_TYPE_RESTRICT_P (type);
10300   volatilep =
10301     !! RIDBIT_SETP (RID_VOLATILE, specbits) + CP_TYPE_VOLATILE_P (type);
10302   type_quals = ((constp ? TYPE_QUAL_CONST : 0)
10303                 | (restrictp ? TYPE_QUAL_RESTRICT : 0)
10304                 | (volatilep ? TYPE_QUAL_VOLATILE : 0));
10305   type = cp_build_qualified_type (type, type_quals);
10306   staticp = 0;
10307   inlinep = !! RIDBIT_SETP (RID_INLINE, specbits);
10308   virtualp = RIDBIT_SETP (RID_VIRTUAL, specbits);
10309   RIDBIT_RESET (RID_VIRTUAL, specbits);
10310   explicitp = RIDBIT_SETP (RID_EXPLICIT, specbits) != 0;
10311   RIDBIT_RESET (RID_EXPLICIT, specbits);
10312
10313   if (RIDBIT_SETP (RID_STATIC, specbits))
10314     staticp = 1 + (decl_context == FIELD);
10315
10316   if (virtualp && staticp == 2)
10317     {
10318       cp_error ("member `%D' cannot be declared both virtual and static",
10319                 dname);
10320       staticp = 0;
10321     }
10322   friendp = RIDBIT_SETP (RID_FRIEND, specbits);
10323   RIDBIT_RESET (RID_FRIEND, specbits);
10324
10325   /* Warn if two storage classes are given. Default to `auto'.  */
10326
10327   if (RIDBIT_ANY_SET (specbits))
10328     {
10329       if (RIDBIT_SETP (RID_STATIC, specbits)) nclasses++;
10330       if (RIDBIT_SETP (RID_EXTERN, specbits)) nclasses++;
10331       if (decl_context == PARM && nclasses > 0)
10332         error ("storage class specifiers invalid in parameter declarations");
10333       if (RIDBIT_SETP (RID_TYPEDEF, specbits))
10334         {
10335           if (decl_context == PARM)
10336             error ("typedef declaration invalid in parameter declaration");
10337           nclasses++;
10338         }
10339       if (RIDBIT_SETP (RID_AUTO, specbits)) nclasses++;
10340       if (RIDBIT_SETP (RID_REGISTER, specbits)) nclasses++;
10341     }
10342
10343   /* Give error if `virtual' is used outside of class declaration.  */
10344   if (virtualp
10345       && (current_class_name == NULL_TREE || decl_context != FIELD))
10346     {
10347       error ("virtual outside class declaration");
10348       virtualp = 0;
10349     }
10350
10351   /* Static anonymous unions are dealt with here.  */
10352   if (staticp && decl_context == TYPENAME
10353       && TREE_CODE (declspecs) == TREE_LIST
10354       && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs)))
10355     decl_context = FIELD;
10356
10357   /* Warn about storage classes that are invalid for certain
10358      kinds of declarations (parameters, typenames, etc.).  */
10359
10360   if (nclasses > 1)
10361     error ("multiple storage classes in declaration of `%s'", name);
10362   else if (decl_context != NORMAL && nclasses > 0)
10363     {
10364       if ((decl_context == PARM || decl_context == CATCHPARM)
10365           && (RIDBIT_SETP (RID_REGISTER, specbits)
10366               || RIDBIT_SETP (RID_AUTO, specbits)))
10367         ;
10368       else if (RIDBIT_SETP (RID_TYPEDEF, specbits))
10369         ;
10370       else if (decl_context == FIELD
10371                /* C++ allows static class elements  */
10372                && RIDBIT_SETP (RID_STATIC, specbits))
10373         /* C++ also allows inlines and signed and unsigned elements,
10374            but in those cases we don't come in here.  */
10375         ;
10376       else
10377         {
10378           if (decl_context == FIELD)
10379             {
10380               tree tmp = NULL_TREE;
10381               register int op = 0;
10382
10383               if (declarator)
10384                 {
10385                   /* Avoid trying to get an operand off an identifier node.  */
10386                   if (TREE_CODE (declarator) == IDENTIFIER_NODE)
10387                     tmp = declarator;
10388                   else
10389                     tmp = TREE_OPERAND (declarator, 0);
10390                   op = IDENTIFIER_OPNAME_P (tmp);
10391                   if (IDENTIFIER_TYPENAME_P (tmp))
10392                     {
10393                       if (IDENTIFIER_GLOBAL_VALUE (tmp)
10394                           && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp))
10395                               == TYPE_DECL))
10396                         name = IDENTIFIER_POINTER (tmp);
10397                       else
10398                         name = "<invalid operator>";
10399                     }
10400                 }
10401               error ("storage class specified for %s `%s'",
10402                      op ? "member operator" : "field",
10403                      name);
10404             }
10405           else
10406             {
10407               if (decl_context == PARM || decl_context == CATCHPARM)
10408                 error ("storage class specified for parameter `%s'", name);
10409               else
10410                 error ("storage class specified for typename");
10411             }
10412           RIDBIT_RESET (RID_REGISTER, specbits);
10413           RIDBIT_RESET (RID_AUTO, specbits);
10414           RIDBIT_RESET (RID_EXTERN, specbits);
10415         }
10416     }
10417   else if (RIDBIT_SETP (RID_EXTERN, specbits) && initialized && !funcdef_flag)
10418     {
10419       if (toplevel_bindings_p ())
10420         {
10421           /* It's common practice (and completely valid) to have a const
10422              be initialized and declared extern.  */
10423           if (!(type_quals & TYPE_QUAL_CONST))
10424             warning ("`%s' initialized and declared `extern'", name);
10425         }
10426       else
10427         error ("`%s' has both `extern' and initializer", name);
10428     }
10429   else if (RIDBIT_SETP (RID_EXTERN, specbits) && funcdef_flag
10430            && ! toplevel_bindings_p ())
10431     error ("nested function `%s' declared `extern'", name);
10432   else if (toplevel_bindings_p ())
10433     {
10434       if (RIDBIT_SETP (RID_AUTO, specbits))
10435         error ("top-level declaration of `%s' specifies `auto'", name);
10436     }
10437
10438   if (nclasses > 0 && friendp)
10439     error ("storage class specifiers invalid in friend function declarations");
10440
10441   /* Now figure out the structure of the declarator proper.
10442      Descend through it, creating more complex types, until we reach
10443      the declared identifier (or NULL_TREE, in an absolute declarator).  */
10444
10445   inner_attrs = NULL_TREE;
10446   ignore_attrs = 0;
10447
10448   while (declarator && TREE_CODE (declarator) != IDENTIFIER_NODE
10449          && TREE_CODE (declarator) != TEMPLATE_ID_EXPR)
10450     {
10451       /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10452          an INDIRECT_REF (for *...),
10453          a CALL_EXPR (for ...(...)),
10454          an identifier (for the name being declared)
10455          or a null pointer (for the place in an absolute declarator
10456          where the name was omitted).
10457          For the last two cases, we have just exited the loop.
10458
10459          For C++ it could also be
10460          a SCOPE_REF (for class :: ...).  In this case, we have converted
10461          sensible names to types, and those are the values we use to
10462          qualify the member name.
10463          an ADDR_EXPR (for &...),
10464          a BIT_NOT_EXPR (for destructors)
10465
10466          At this point, TYPE is the type of elements of an array,
10467          or for a function to return, or for a pointer to point to.
10468          After this sequence of ifs, TYPE is the type of the
10469          array or function or pointer, and DECLARATOR has had its
10470          outermost layer removed.  */
10471
10472       if (type == error_mark_node)
10473         {
10474           if (TREE_CODE (declarator) == SCOPE_REF)
10475             declarator = TREE_OPERAND (declarator, 1);
10476           else
10477             declarator = TREE_OPERAND (declarator, 0);
10478           continue;
10479         }
10480       if (quals != NULL_TREE
10481           && (declarator == NULL_TREE
10482               || TREE_CODE (declarator) != SCOPE_REF))
10483         {
10484           if (ctype == NULL_TREE && TREE_CODE (type) == METHOD_TYPE)
10485             ctype = TYPE_METHOD_BASETYPE (type);
10486           if (ctype != NULL_TREE)
10487             {
10488               tree dummy = build_decl (TYPE_DECL, NULL_TREE, type);
10489               grok_method_quals (ctype, dummy, quals);
10490               type = TREE_TYPE (dummy);
10491               ctype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type)));
10492               quals = NULL_TREE;
10493             }
10494         }
10495
10496       /* See the comment for the TREE_LIST case, below.  */
10497       if (ignore_attrs)
10498         ignore_attrs = 0;
10499       else if (inner_attrs)
10500         {
10501           decl_attributes (type, inner_attrs, NULL_TREE);
10502           inner_attrs = NULL_TREE;
10503         }
10504
10505       switch (TREE_CODE (declarator))
10506         {
10507         case TREE_LIST:
10508           {
10509             /* We encode a declarator with embedded attributes using
10510                a TREE_LIST.  The attributes apply to the declarator
10511                directly inside them, so we have to skip an iteration
10512                before applying them to the type.  If the declarator just
10513                inside is the declarator-id, we apply the attrs to the
10514                decl itself.  */
10515             inner_attrs = TREE_PURPOSE (declarator);
10516             ignore_attrs = 1;
10517             declarator = TREE_VALUE (declarator);
10518           }
10519           break;
10520
10521         case ARRAY_REF:
10522           {
10523             register tree size;
10524
10525             size = TREE_OPERAND (declarator, 1);
10526
10527             /* VC++ spells a zero-sized array with [].  */
10528             if (size == NULL_TREE && decl_context == FIELD && ! staticp
10529                 && ! RIDBIT_SETP (RID_TYPEDEF, specbits))
10530               size = integer_zero_node;
10531
10532             declarator = TREE_OPERAND (declarator, 0);
10533
10534             type = create_array_type_for_decl (dname, type, size);
10535
10536             /* VLAs never work as fields. */
10537             if (decl_context == FIELD && !processing_template_decl
10538                 && TREE_CODE (type) == ARRAY_TYPE
10539                 && TYPE_DOMAIN (type) != NULL_TREE
10540                 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))
10541               {
10542                 cp_error ("size of member `%D' is not constant", dname);
10543                 /* Proceed with arbitrary constant size, so that offset
10544                    computations don't get confused. */
10545                 type = create_array_type_for_decl (dname, TREE_TYPE (type),
10546                                                    integer_one_node);
10547               }
10548
10549             ctype = NULL_TREE;
10550           }
10551           break;
10552
10553         case CALL_EXPR:
10554           {
10555             tree arg_types;
10556             int funcdecl_p;
10557             tree inner_parms = CALL_DECLARATOR_PARMS (declarator);
10558             tree inner_decl = TREE_OPERAND (declarator, 0);
10559
10560             /* Declaring a function type.
10561                Make sure we have a valid type for the function to return.  */
10562
10563             /* We now know that the TYPE_QUALS don't apply to the
10564                decl, but to its return type.  */
10565             type_quals = TYPE_UNQUALIFIED;
10566
10567             /* Warn about some types functions can't return.  */
10568
10569             if (TREE_CODE (type) == FUNCTION_TYPE)
10570               {
10571                 error ("`%s' declared as function returning a function", name);
10572                 type = integer_type_node;
10573               }
10574             if (TREE_CODE (type) == ARRAY_TYPE)
10575               {
10576                 error ("`%s' declared as function returning an array", name);
10577                 type = integer_type_node;
10578               }
10579
10580             if (inner_decl && TREE_CODE (inner_decl) == SCOPE_REF)
10581               inner_decl = TREE_OPERAND (inner_decl, 1);
10582
10583             if (inner_decl && TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR)
10584               inner_decl = dname;
10585
10586             /* Pick up type qualifiers which should be applied to `this'.  */
10587             quals = CALL_DECLARATOR_QUALS (declarator);
10588
10589             /* Pick up the exception specifications.  */
10590             raises = CALL_DECLARATOR_EXCEPTION_SPEC (declarator);
10591
10592             /* Say it's a definition only for the CALL_EXPR
10593                closest to the identifier.  */
10594             funcdecl_p
10595               = inner_decl
10596               && (TREE_CODE (inner_decl) == IDENTIFIER_NODE
10597                   || TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR
10598                   || TREE_CODE (inner_decl) == BIT_NOT_EXPR);
10599
10600             if (ctype == NULL_TREE
10601                 && decl_context == FIELD
10602                 && funcdecl_p
10603                 && (friendp == 0 || dname == current_class_name))
10604               ctype = current_class_type;
10605
10606             if (ctype && sfk == sfk_conversion)
10607               TYPE_HAS_CONVERSION (ctype) = 1;
10608             if (ctype && constructor_name (ctype) == dname)
10609               {
10610                 /* We are within a class's scope. If our declarator name
10611                    is the same as the class name, and we are defining
10612                    a function, then it is a constructor/destructor, and
10613                    therefore returns a void type.  */
10614
10615                 if (flags == DTOR_FLAG)
10616                   {
10617                     /* ISO C++ 12.4/2.  A destructor may not be
10618                        declared const or volatile.  A destructor may
10619                        not be static.  */
10620                     if (staticp == 2)
10621                       error ("destructor cannot be static member function");
10622                     if (quals)
10623                       {
10624                         cp_error ("destructors may not be `%s'",
10625                                   IDENTIFIER_POINTER (TREE_VALUE (quals)));
10626                         quals = NULL_TREE;
10627                       }
10628                     if (decl_context == FIELD)
10629                       {
10630                         if (! member_function_or_else (ctype,
10631                                                        current_class_type,
10632                                                        flags))
10633                           return void_type_node;
10634                       }
10635                   }
10636                 else            /* It's a constructor.  */
10637                   {
10638                     if (explicitp == 1)
10639                       explicitp = 2;
10640                     /* ISO C++ 12.1.  A constructor may not be
10641                        declared const or volatile.  A constructor may
10642                        not be virtual.  A constructor may not be
10643                        static.  */
10644                     if (staticp == 2)
10645                       error ("constructor cannot be static member function");
10646                     if (virtualp)
10647                       {
10648                         pedwarn ("constructors cannot be declared virtual");
10649                         virtualp = 0;
10650                       }
10651                     if (quals)
10652                       {
10653                         cp_error ("constructors may not be `%s'",
10654                                   IDENTIFIER_POINTER (TREE_VALUE (quals)));
10655                         quals = NULL_TREE;
10656                       }
10657                     {
10658                       RID_BIT_TYPE tmp_bits;
10659                       bcopy ((void*)&specbits, (void*)&tmp_bits, sizeof (RID_BIT_TYPE));
10660                       RIDBIT_RESET (RID_INLINE, tmp_bits);
10661                       RIDBIT_RESET (RID_STATIC, tmp_bits);
10662                       if (RIDBIT_ANY_SET (tmp_bits))
10663                         error ("return value type specifier for constructor ignored");
10664                     }
10665                     if (decl_context == FIELD)
10666                       {
10667                         if (! member_function_or_else (ctype,
10668                                                        current_class_type,
10669                                                        flags))
10670                           return void_type_node;
10671                         TYPE_HAS_CONSTRUCTOR (ctype) = 1;
10672                         if (sfk != sfk_constructor)
10673                           return NULL_TREE;
10674                       }
10675                   }
10676                 if (decl_context == FIELD)
10677                   staticp = 0;
10678               }
10679             else if (friendp)
10680               {
10681                 if (initialized)
10682                   error ("can't initialize friend function `%s'", name);
10683                 if (virtualp)
10684                   {
10685                     /* Cannot be both friend and virtual.  */
10686                     error ("virtual functions cannot be friends");
10687                     RIDBIT_RESET (RID_FRIEND, specbits);
10688                     friendp = 0;
10689                   }
10690                 if (decl_context == NORMAL)
10691                   error ("friend declaration not in class definition");
10692                 if (current_function_decl && funcdef_flag)
10693                   cp_error ("can't define friend function `%s' in a local class definition",
10694                             name);
10695               }
10696
10697             /* Construct the function type and go to the next
10698                inner layer of declarator.  */
10699
10700             declarator = TREE_OPERAND (declarator, 0);
10701
10702             /* FIXME: This is where default args should be fully
10703                processed.  */
10704
10705             arg_types = grokparms (inner_parms, funcdecl_p ? funcdef_flag : 0);
10706
10707             if (declarator && flags == DTOR_FLAG)
10708               {
10709                 /* A destructor declared in the body of a class will
10710                    be represented as a BIT_NOT_EXPR.  But, we just
10711                    want the underlying IDENTIFIER.  */
10712                 if (TREE_CODE (declarator) == BIT_NOT_EXPR)
10713                   declarator = TREE_OPERAND (declarator, 0);
10714
10715                 if (strict_prototype == 0 && arg_types == NULL_TREE)
10716                   arg_types = void_list_node;
10717                 else if (arg_types == NULL_TREE
10718                          || arg_types != void_list_node)
10719                   {
10720                     cp_error ("destructors may not have parameters");
10721                     arg_types = void_list_node;
10722                     last_function_parms = NULL_TREE;
10723                   }
10724               }
10725
10726             /* ANSI says that `const int foo ();'
10727                does not make the function foo const.  */
10728             type = build_function_type (type, arg_types);
10729
10730             {
10731               tree t;
10732               for (t = arg_types; t; t = TREE_CHAIN (t))
10733                 if (TREE_PURPOSE (t)
10734                     && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
10735                   {
10736                     add_defarg_fn (type);
10737                     break;
10738                   }
10739             }
10740           }
10741           break;
10742
10743         case ADDR_EXPR:
10744         case INDIRECT_REF:
10745           /* Filter out pointers-to-references and references-to-references.
10746              We can get these if a TYPE_DECL is used.  */
10747
10748           if (TREE_CODE (type) == REFERENCE_TYPE)
10749             {
10750               error ("cannot declare %s to references",
10751                      TREE_CODE (declarator) == ADDR_EXPR
10752                      ? "references" : "pointers");
10753               declarator = TREE_OPERAND (declarator, 0);
10754               continue;
10755             }
10756
10757           if (TREE_CODE (type) == OFFSET_TYPE
10758               && (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE
10759                   || TREE_CODE (TREE_TYPE (type)) == REFERENCE_TYPE))
10760             {
10761               cp_error ("cannot declare pointer to `%#T' member",
10762                         TREE_TYPE (type));
10763               type = TREE_TYPE (type);
10764             }
10765
10766           /* Merge any constancy or volatility into the target type
10767              for the pointer.  */
10768
10769           /* We now know that the TYPE_QUALS don't apply to the decl,
10770              but to the target of the pointer.  */
10771           type_quals = TYPE_UNQUALIFIED;
10772
10773           if (TREE_CODE (declarator) == ADDR_EXPR)
10774             {
10775               if (TREE_CODE (type) == VOID_TYPE)
10776                 error ("invalid type: `void &'");
10777               else
10778                 type = build_reference_type (type);
10779             }
10780           else if (TREE_CODE (type) == METHOD_TYPE)
10781             type = build_ptrmemfunc_type (build_pointer_type (type));
10782           else
10783             type = build_pointer_type (type);
10784
10785           /* Process a list of type modifier keywords (such as
10786              const or volatile) that were given inside the `*' or `&'.  */
10787
10788           if (TREE_TYPE (declarator))
10789             {
10790               register tree typemodlist;
10791               int erred = 0;
10792
10793               constp = 0;
10794               volatilep = 0;
10795               restrictp = 0;
10796               for (typemodlist = TREE_TYPE (declarator); typemodlist;
10797                    typemodlist = TREE_CHAIN (typemodlist))
10798                 {
10799                   tree qualifier = TREE_VALUE (typemodlist);
10800
10801                   if (qualifier == ridpointers[(int) RID_CONST])
10802                     constp++;
10803                   else if (qualifier == ridpointers[(int) RID_VOLATILE])
10804                     volatilep++;
10805                   else if (qualifier == ridpointers[(int) RID_RESTRICT])
10806                     restrictp++;
10807                   else if (!erred)
10808                     {
10809                       erred = 1;
10810                       error ("invalid type modifier within pointer declarator");
10811                     }
10812                 }
10813               if (constp > 1)
10814                 pedwarn ("duplicate `const'");
10815               if (volatilep > 1)
10816                 pedwarn ("duplicate `volatile'");
10817               if (restrictp > 1)
10818                 pedwarn ("duplicate `restrict'");
10819
10820               type_quals = ((constp ? TYPE_QUAL_CONST : 0)
10821                             | (restrictp ? TYPE_QUAL_RESTRICT : 0)
10822                             | (volatilep ? TYPE_QUAL_VOLATILE : 0));
10823               if (TREE_CODE (declarator) == ADDR_EXPR
10824                   && (constp || volatilep))
10825                 {
10826                   if (constp)
10827                     pedwarn ("discarding `const' applied to a reference");
10828                   if (volatilep)
10829                     pedwarn ("discarding `volatile' applied to a reference");
10830                   type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
10831                 }
10832               type = cp_build_qualified_type (type, type_quals);
10833             }
10834           declarator = TREE_OPERAND (declarator, 0);
10835           ctype = NULL_TREE;
10836           break;
10837
10838         case SCOPE_REF:
10839           {
10840             /* We have converted type names to NULL_TREE if the
10841                name was bogus, or to a _TYPE node, if not.
10842
10843                The variable CTYPE holds the type we will ultimately
10844                resolve to.  The code here just needs to build
10845                up appropriate member types.  */
10846             tree sname = TREE_OPERAND (declarator, 1);
10847             tree t;
10848
10849             /* Destructors can have their visibilities changed as well.  */
10850             if (TREE_CODE (sname) == BIT_NOT_EXPR)
10851               sname = TREE_OPERAND (sname, 0);
10852
10853             if (TREE_COMPLEXITY (declarator) == 0)
10854               /* This needs to be here, in case we are called
10855                  multiple times.  */ ;
10856             else if (TREE_COMPLEXITY (declarator) == -1)
10857               /* Namespace member. */
10858               pop_decl_namespace ();
10859             else if (friendp && (TREE_COMPLEXITY (declarator) < 2))
10860               /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10861             else if (! IS_AGGR_TYPE_CODE
10862                      (TREE_CODE (TREE_OPERAND (declarator, 0))))
10863               ;
10864             else if (TREE_COMPLEXITY (declarator) == current_class_depth)
10865               {
10866                 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10867                    that refer to ctype.  They couldn't be resolved earlier
10868                    because we hadn't pushed into the class yet.
10869                    Example: resolve 'B<T>::type' in
10870                    'B<typename B<T>::type> B<T>::f () { }'.  */
10871                 if (current_template_parms
10872                     && uses_template_parms (type)
10873                     && uses_template_parms (current_class_type))
10874                   {
10875                     tree args = current_template_args ();
10876                     type = tsubst (type, args, /*complain=*/1, NULL_TREE);
10877                   }
10878
10879                 /* This pop_nested_class corresponds to the
10880                    push_nested_class used to push into class scope for
10881                    parsing the argument list of a function decl, in
10882                    qualified_id.  */
10883                 pop_nested_class ();
10884                 TREE_COMPLEXITY (declarator) = current_class_depth;
10885               }
10886             else
10887               my_friendly_abort (16);
10888
10889             if (TREE_OPERAND (declarator, 0) == NULL_TREE)
10890               {
10891                 /* We had a reference to a global decl, or
10892                    perhaps we were given a non-aggregate typedef,
10893                    in which case we cleared this out, and should just
10894                    keep going as though it wasn't there.  */
10895                 declarator = sname;
10896                 continue;
10897               }
10898             ctype = TREE_OPERAND (declarator, 0);
10899
10900             t = ctype;
10901             while (t != NULL_TREE && CLASS_TYPE_P (t))
10902               {
10903                 /* You're supposed to have one `template <...>'
10904                    for every template class, but you don't need one
10905                    for a full specialization.  For example:
10906
10907                      template <class T> struct S{};
10908                      template <> struct S<int> { void f(); };
10909                      void S<int>::f () {}
10910
10911                    is correct; there shouldn't be a `template <>' for
10912                    the definition of `S<int>::f'.  */
10913                 if (CLASSTYPE_TEMPLATE_INFO (t)
10914                     && (CLASSTYPE_TEMPLATE_INSTANTIATION (t)
10915                         || uses_template_parms (CLASSTYPE_TI_ARGS (t))))
10916                   template_count += 1;
10917
10918                 t = TYPE_MAIN_DECL (t);
10919                 if (DECL_LANG_SPECIFIC (t))
10920                   t = DECL_CONTEXT (t);
10921                 else
10922                   t = NULL_TREE;
10923               }
10924
10925             if (sname == NULL_TREE)
10926               goto done_scoping;
10927
10928             if (TREE_CODE (sname) == IDENTIFIER_NODE)
10929               {
10930                 /* This is the `standard' use of the scoping operator:
10931                    basetype :: member .  */
10932
10933                 if (ctype == current_class_type)
10934                   {
10935                     /* class A {
10936                          void A::f ();
10937                        };
10938
10939                        Is this ill-formed?  */
10940
10941                     if (pedantic)
10942                       cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10943                                   ctype, name);
10944                   }
10945                 else if (TREE_CODE (type) == FUNCTION_TYPE)
10946                   {
10947                     if (current_class_type == NULL_TREE
10948                         || friendp)
10949                       type = build_cplus_method_type (ctype, TREE_TYPE (type),
10950                                                       TYPE_ARG_TYPES (type));
10951                     else
10952                       {
10953                         cp_error ("cannot declare member function `%T::%s' within `%T'",
10954                                   ctype, name, current_class_type);
10955                         return void_type_node;
10956                       }
10957                   }
10958                 else if (RIDBIT_SETP (RID_TYPEDEF, specbits)
10959                          || COMPLETE_TYPE_P (complete_type (ctype)))
10960                   {
10961                     /* Have to move this code elsewhere in this function.
10962                        this code is used for i.e., typedef int A::M; M *pm;
10963
10964                        It is?  How? jason 10/2/94 */
10965
10966                     if (current_class_type)
10967                       {
10968                         cp_error ("cannot declare member `%T::%s' within `%T'",
10969                                   ctype, name, current_class_type);
10970                         return void_type_node;
10971                       }
10972                     type = build_offset_type (ctype, type);
10973                   }
10974                 else if (uses_template_parms (ctype))
10975                   {
10976                     if (TREE_CODE (type) == FUNCTION_TYPE)
10977                       type
10978                         = build_cplus_method_type (ctype, TREE_TYPE (type),
10979                                                    TYPE_ARG_TYPES (type));
10980                   }
10981                 else
10982                   {
10983                     cp_error ("structure `%T' not yet defined", ctype);
10984                     return error_mark_node;
10985                   }
10986
10987                 declarator = sname;
10988               }
10989             else if (TREE_CODE (sname) == SCOPE_REF)
10990               my_friendly_abort (17);
10991             else
10992               {
10993               done_scoping:
10994                 declarator = TREE_OPERAND (declarator, 1);
10995                 if (declarator && TREE_CODE (declarator) == CALL_EXPR)
10996                   /* In this case, we will deal with it later.  */
10997                   ;
10998                 else
10999                   {
11000                     if (TREE_CODE (type) == FUNCTION_TYPE)
11001                       type = build_cplus_method_type (ctype, TREE_TYPE (type),
11002                                                       TYPE_ARG_TYPES (type));
11003                     else
11004                       type = build_offset_type (ctype, type);
11005                   }
11006               }
11007           }
11008           break;
11009
11010         case BIT_NOT_EXPR:
11011           declarator = TREE_OPERAND (declarator, 0);
11012           break;
11013
11014         case RECORD_TYPE:
11015         case UNION_TYPE:
11016         case ENUMERAL_TYPE:
11017           declarator = NULL_TREE;
11018           break;
11019
11020         case ERROR_MARK:
11021           declarator = NULL_TREE;
11022           break;
11023
11024         default:
11025           my_friendly_abort (158);
11026         }
11027     }
11028
11029   /* See the comment for the TREE_LIST case, above.  */
11030   if (inner_attrs)
11031     {
11032       if (! ignore_attrs)
11033         decl_attributes (type, inner_attrs, NULL_TREE);
11034       else if (attrlist)
11035         TREE_VALUE (attrlist) = chainon (inner_attrs, TREE_VALUE (attrlist));
11036       else
11037         attrlist = build_decl_list (NULL_TREE, inner_attrs);
11038     }
11039
11040   /* Now TYPE has the actual type.  */
11041
11042   if (explicitp == 1 || (explicitp && friendp))
11043     {
11044       /* [dcl.fct.spec] The explicit specifier shall only be used in
11045          declarations of constructors within a class definition.  */
11046       error ("only declarations of constructors can be `explicit'");
11047       explicitp = 0;
11048     }
11049
11050   if (RIDBIT_SETP (RID_MUTABLE, specbits))
11051     {
11052       if (current_class_name == NULL_TREE || decl_context == PARM || friendp)
11053         {
11054           error ("non-member `%s' cannot be declared `mutable'", name);
11055           RIDBIT_RESET (RID_MUTABLE, specbits);
11056         }
11057       else if (decl_context == TYPENAME || RIDBIT_SETP (RID_TYPEDEF, specbits))
11058         {
11059           error ("non-object member `%s' cannot be declared `mutable'", name);
11060           RIDBIT_RESET (RID_MUTABLE, specbits);
11061         }
11062       else if (TREE_CODE (type) == FUNCTION_TYPE
11063                || TREE_CODE (type) == METHOD_TYPE)
11064         {
11065           error ("function `%s' cannot be declared `mutable'", name);
11066           RIDBIT_RESET (RID_MUTABLE, specbits);
11067         }
11068       else if (staticp)
11069         {
11070           error ("static `%s' cannot be declared `mutable'", name);
11071           RIDBIT_RESET (RID_MUTABLE, specbits);
11072         }
11073       else if (type_quals & TYPE_QUAL_CONST)
11074         {
11075           error ("const `%s' cannot be declared `mutable'", name);
11076           RIDBIT_RESET (RID_MUTABLE, specbits);
11077         }
11078     }
11079
11080   if (declarator == NULL_TREE
11081       || TREE_CODE (declarator) == IDENTIFIER_NODE
11082       || (TREE_CODE (declarator) == TEMPLATE_ID_EXPR
11083           && (TREE_CODE (type) == FUNCTION_TYPE
11084               || TREE_CODE (type) == METHOD_TYPE)))
11085     /* OK */;
11086   else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
11087     {
11088       cp_error ("template-id `%D' used as a declarator", declarator);
11089       declarator = dname;
11090     }
11091   else
11092     /* Unexpected declarator format.  */
11093     my_friendly_abort (990210);
11094
11095   /* If this is declaring a typedef name, return a TYPE_DECL.  */
11096
11097   if (RIDBIT_SETP (RID_TYPEDEF, specbits) && decl_context != TYPENAME)
11098     {
11099       tree decl;
11100
11101       /* Note that the grammar rejects storage classes
11102          in typenames, fields or parameters.  */
11103       if (current_lang_name == lang_name_java)
11104         TYPE_FOR_JAVA (type) = 1;
11105
11106       if (decl_context == FIELD)
11107         {
11108           if (declarator == constructor_name (current_class_type))
11109             cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
11110                         declarator);
11111           decl = build_lang_decl (TYPE_DECL, declarator, type);
11112         }
11113       else
11114         decl = build_decl (TYPE_DECL, declarator, type);
11115
11116       /* If the user declares "typedef struct {...} foo" then the
11117          struct will have an anonymous name.  Fill that name in now.
11118          Nothing can refer to it, so nothing needs know about the name
11119          change.  */
11120       if (type != error_mark_node
11121           && declarator
11122           && TYPE_NAME (type)
11123           && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
11124           && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type))
11125           && CP_TYPE_QUALS (type) == TYPE_UNQUALIFIED)
11126         {
11127           tree oldname = TYPE_NAME (type);
11128           tree t;
11129
11130           /* Replace the anonymous name with the real name everywhere.  */
11131           lookup_tag_reverse (type, declarator);
11132           for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
11133             if (TYPE_NAME (t) == oldname)
11134               TYPE_NAME (t) = decl;
11135
11136           if (TYPE_LANG_SPECIFIC (type))
11137             TYPE_WAS_ANONYMOUS (type) = 1;
11138
11139           /* If this is a typedef within a template class, the nested
11140              type is a (non-primary) template.  The name for the
11141              template needs updating as well.  */
11142           if (TYPE_LANG_SPECIFIC (type) && CLASSTYPE_TEMPLATE_INFO (type))
11143             DECL_NAME (CLASSTYPE_TI_TEMPLATE (type))
11144               = TYPE_IDENTIFIER (type);
11145
11146           if (flag_new_abi)
11147             DECL_ASSEMBLER_NAME (decl) = mangle_type (type);
11148           else
11149             {
11150               /* XXX Temporarily set the scope.
11151                  When returning, start_decl expects it as NULL_TREE,
11152                  and will then then set it using pushdecl. */
11153               my_friendly_assert (DECL_CONTEXT (decl) == NULL_TREE, 980404);
11154               if (current_class_type)
11155                 DECL_CONTEXT (decl) = current_class_type;
11156               else
11157                 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
11158
11159               DECL_ASSEMBLER_NAME (decl) = DECL_NAME (decl);
11160               DECL_ASSEMBLER_NAME (decl)
11161                 = get_identifier (build_overload_name (type, 1, 1));
11162               DECL_CONTEXT (decl) = NULL_TREE;
11163             }
11164
11165           /* FIXME remangle member functions; member functions of a
11166              type with external linkage have external linkage.  */
11167         }
11168
11169       if (TREE_CODE (type) == OFFSET_TYPE || TREE_CODE (type) == METHOD_TYPE)
11170         {
11171           cp_error_at ("typedef name may not be class-qualified", decl);
11172           return NULL_TREE;
11173         }
11174       else if (quals)
11175         {
11176           if (ctype == NULL_TREE)
11177             {
11178               if (TREE_CODE (type) != METHOD_TYPE)
11179                 cp_error_at ("invalid type qualifier for non-member function type", decl);
11180               else
11181                 ctype = TYPE_METHOD_BASETYPE (type);
11182             }
11183           if (ctype != NULL_TREE)
11184             grok_method_quals (ctype, decl, quals);
11185         }
11186
11187       if (RIDBIT_SETP (RID_SIGNED, specbits)
11188           || (typedef_decl && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl)))
11189         C_TYPEDEF_EXPLICITLY_SIGNED (decl) = 1;
11190
11191       bad_specifiers (decl, "type", virtualp, quals != NULL_TREE,
11192                       inlinep, friendp, raises != NULL_TREE);
11193
11194       if (initialized)
11195         error ("typedef declaration includes an initializer");
11196
11197       return decl;
11198     }
11199
11200   /* Detect the case of an array type of unspecified size
11201      which came, as such, direct from a typedef name.
11202      We must copy the type, so that each identifier gets
11203      a distinct type, so that each identifier's size can be
11204      controlled separately by its own initializer.  */
11205
11206   if (type == typedef_type && TREE_CODE (type) == ARRAY_TYPE
11207       && TYPE_DOMAIN (type) == NULL_TREE)
11208     {
11209       type = build_cplus_array_type (TREE_TYPE (type), TYPE_DOMAIN (type));
11210     }
11211
11212   /* If this is a type name (such as, in a cast or sizeof),
11213      compute the type and return it now.  */
11214
11215   if (decl_context == TYPENAME)
11216     {
11217       /* Note that the grammar rejects storage classes
11218          in typenames, fields or parameters.  */
11219       if (type_quals != TYPE_UNQUALIFIED)
11220         type_quals = TYPE_UNQUALIFIED;
11221
11222       /* Special case: "friend class foo" looks like a TYPENAME context.  */
11223       if (friendp)
11224         {
11225           if (type_quals != TYPE_UNQUALIFIED)
11226             {
11227               cp_error ("type qualifiers specified for friend class declaration");
11228               type_quals = TYPE_UNQUALIFIED;
11229             }
11230           if (inlinep)
11231             {
11232               cp_error ("`inline' specified for friend class declaration");
11233               inlinep = 0;
11234             }
11235
11236           /* Only try to do this stuff if we didn't already give up.  */
11237           if (type != integer_type_node)
11238             {
11239               /* A friendly class?  */
11240               if (current_class_type)
11241                 make_friend_class (current_class_type, TYPE_MAIN_VARIANT (type));
11242               else
11243                 error ("trying to make class `%s' a friend of global scope",
11244                        TYPE_NAME_STRING (type));
11245               type = void_type_node;
11246             }
11247         }
11248       else if (quals)
11249         {
11250           if (ctype == NULL_TREE)
11251             {
11252               if (TREE_CODE (type) != METHOD_TYPE)
11253                 cp_error ("invalid qualifiers on non-member function type");
11254               else
11255                 ctype = TYPE_METHOD_BASETYPE (type);
11256             }
11257           if (ctype)
11258             {
11259               tree dummy = build_decl (TYPE_DECL, declarator, type);
11260               grok_method_quals (ctype, dummy, quals);
11261               type = TREE_TYPE (dummy);
11262             }
11263         }
11264
11265       return type;
11266     }
11267   else if (declarator == NULL_TREE && decl_context != PARM
11268            && decl_context != CATCHPARM
11269            && TREE_CODE (type) != UNION_TYPE
11270            && ! bitfield)
11271     {
11272       cp_error ("abstract declarator `%T' used as declaration", type);
11273       declarator = make_anon_name ();
11274     }
11275
11276   /* `void' at top level (not within pointer)
11277      is allowed only in typedefs or type names.
11278      We don't complain about parms either, but that is because
11279      a better error message can be made later.  */
11280
11281   if (TREE_CODE (type) == VOID_TYPE && decl_context != PARM)
11282     {
11283       if (! declarator)
11284         error ("unnamed variable or field declared void");
11285       else if (TREE_CODE (declarator) == IDENTIFIER_NODE)
11286         {
11287           if (IDENTIFIER_OPNAME_P (declarator))
11288             my_friendly_abort (356);
11289           else
11290             error ("variable or field `%s' declared void", name);
11291         }
11292       else
11293         error ("variable or field declared void");
11294       type = integer_type_node;
11295     }
11296
11297   /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11298      or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE.  */
11299
11300   if (decl_context == PARM || decl_context == CATCHPARM)
11301     {
11302       if (ctype || in_namespace)
11303         error ("cannot use `::' in parameter declaration");
11304
11305       /* A parameter declared as an array of T is really a pointer to T.
11306          One declared as a function is really a pointer to a function.
11307          One declared as a member is really a pointer to member.  */
11308
11309       if (TREE_CODE (type) == ARRAY_TYPE)
11310         {
11311           /* Transfer const-ness of array into that of type pointed to.  */
11312           type = build_pointer_type (TREE_TYPE (type));
11313           type_quals = TYPE_UNQUALIFIED;
11314         }
11315       else if (TREE_CODE (type) == FUNCTION_TYPE)
11316         type = build_pointer_type (type);
11317       else if (TREE_CODE (type) == OFFSET_TYPE)
11318         type = build_pointer_type (type);
11319       else if (TREE_CODE (type) == VOID_TYPE && declarator)
11320         {
11321           error ("declaration of `%s' as void", name);
11322           return NULL_TREE;
11323         }
11324     }
11325
11326   {
11327     register tree decl;
11328
11329     if (decl_context == PARM)
11330       {
11331         decl = build_decl (PARM_DECL, declarator, type);
11332
11333         bad_specifiers (decl, "parameter", virtualp, quals != NULL_TREE,
11334                         inlinep, friendp, raises != NULL_TREE);
11335
11336         /* Compute the type actually passed in the parmlist,
11337            for the case where there is no prototype.
11338            (For example, shorts and chars are passed as ints.)
11339            When there is a prototype, this is overridden later.  */
11340
11341         DECL_ARG_TYPE (decl) = type_promotes_to (type);
11342       }
11343     else if (decl_context == FIELD)
11344       {
11345         if (type == error_mark_node)
11346           {
11347             /* Happens when declaring arrays of sizes which
11348                are error_mark_node, for example.  */
11349             decl = NULL_TREE;
11350           }
11351         else if (in_namespace && !friendp)
11352           {
11353             /* Something like struct S { int N::j; };  */
11354             cp_error ("invalid use of `::'");
11355             decl = NULL_TREE;
11356           }
11357         else if (TREE_CODE (type) == FUNCTION_TYPE)
11358           {
11359             int publicp = 0;
11360             tree function_context;
11361
11362             /* We catch the others as conflicts with the builtin
11363                typedefs.  */
11364             if (friendp && declarator == ridpointers[(int) RID_SIGNED])
11365               {
11366                 cp_error ("function `%D' cannot be declared friend",
11367                           declarator);
11368                 friendp = 0;
11369               }
11370
11371             if (friendp == 0)
11372               {
11373                 if (ctype == NULL_TREE)
11374                   ctype = current_class_type;
11375
11376                 if (ctype == NULL_TREE)
11377                   {
11378                     cp_error ("can't make `%D' into a method -- not in a class",
11379                               declarator);
11380                     return void_type_node;
11381                   }
11382
11383                 /* ``A union may [ ... ] not [ have ] virtual functions.''
11384                    ARM 9.5 */
11385                 if (virtualp && TREE_CODE (ctype) == UNION_TYPE)
11386                   {
11387                     cp_error ("function `%D' declared virtual inside a union",
11388                               declarator);
11389                     return void_type_node;
11390                   }
11391
11392                 if (declarator == ansi_opname (NEW_EXPR)
11393                     || declarator == ansi_opname (VEC_NEW_EXPR)
11394                     || declarator == ansi_opname (DELETE_EXPR)
11395                     || declarator == ansi_opname (VEC_DELETE_EXPR))
11396                   {
11397                     if (virtualp)
11398                       {
11399                         cp_error ("`%D' cannot be declared virtual, since it is always static",
11400                                   declarator);
11401                         virtualp = 0;
11402                       }
11403                   }
11404                 else if (staticp < 2)
11405                   type = build_cplus_method_type (ctype, TREE_TYPE (type),
11406                                                   TYPE_ARG_TYPES (type));
11407               }
11408
11409             /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node.  */
11410             function_context = (ctype != NULL_TREE) ?
11411               decl_function_context (TYPE_MAIN_DECL (ctype)) : NULL_TREE;
11412             publicp = (! friendp || ! staticp)
11413               && function_context == NULL_TREE;
11414             decl = grokfndecl (ctype, type,
11415                                TREE_CODE (declarator) != TEMPLATE_ID_EXPR
11416                                ? declarator : dname,
11417                                declarator,
11418                                virtualp, flags, quals, raises,
11419                                friendp ? -1 : 0, friendp, publicp, inlinep,
11420                                funcdef_flag, template_count, in_namespace);
11421             if (decl == NULL_TREE)
11422               return decl;
11423 #if 0
11424             /* This clobbers the attrs stored in `decl' from `attrlist'.  */
11425             /* The decl and setting of decl_machine_attr is also turned off.  */
11426             decl = build_decl_attribute_variant (decl, decl_machine_attr);
11427 #endif
11428
11429             /* [class.conv.ctor]
11430
11431                A constructor declared without the function-specifier
11432                explicit that can be called with a single parameter
11433                specifies a conversion from the type of its first
11434                parameter to the type of its class.  Such a constructor
11435                is called a converting constructor.  */
11436             if (explicitp == 2)
11437               DECL_NONCONVERTING_P (decl) = 1;
11438             else if (DECL_CONSTRUCTOR_P (decl))
11439               {
11440                 /* The constructor can be called with exactly one
11441                    parameter if there is at least one parameter, and
11442                    any subsequent parameters have default arguments.
11443                    We don't look at the first parameter, which is
11444                    really just the `this' parameter for the new
11445                    object.  */
11446                 tree arg_types =
11447                   TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl)));
11448
11449                 /* Skip the `in_chrg' argument too, if present.  */
11450                 if (DECL_HAS_IN_CHARGE_PARM_P (decl))
11451                   arg_types = TREE_CHAIN (arg_types);
11452
11453                 if (arg_types == void_list_node
11454                     || (arg_types
11455                         && TREE_CHAIN (arg_types)
11456                         && TREE_CHAIN (arg_types) != void_list_node
11457                         && !TREE_PURPOSE (TREE_CHAIN (arg_types))))
11458                   DECL_NONCONVERTING_P (decl) = 1;
11459               }
11460           }
11461         else if (TREE_CODE (type) == METHOD_TYPE)
11462           {
11463             /* We only get here for friend declarations of
11464                members of other classes.  */
11465             /* All method decls are public, so tell grokfndecl to set
11466                TREE_PUBLIC, also.  */
11467             decl = grokfndecl (ctype, type, declarator, declarator,
11468                                virtualp, flags, quals, raises,
11469                                friendp ? -1 : 0, friendp, 1, 0, funcdef_flag,
11470                                template_count, in_namespace);
11471             if (decl == NULL_TREE)
11472               return NULL_TREE;
11473           }
11474         else if (!staticp && ! processing_template_decl
11475                  && !COMPLETE_TYPE_P (complete_type (type))
11476                  && (TREE_CODE (type) != ARRAY_TYPE || initialized == 0))
11477           {
11478             if (declarator)
11479               cp_error ("field `%D' has incomplete type", declarator);
11480             else
11481               cp_error ("name `%T' has incomplete type", type);
11482
11483             /* If we're instantiating a template, tell them which
11484                instantiation made the field's type be incomplete.  */
11485             if (current_class_type
11486                 && TYPE_NAME (current_class_type)
11487                 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type))
11488                 && declspecs && TREE_VALUE (declspecs)
11489                 && TREE_TYPE (TREE_VALUE (declspecs)) == type)
11490               cp_error ("  in instantiation of template `%T'",
11491                         current_class_type);
11492
11493             type = error_mark_node;
11494             decl = NULL_TREE;
11495           }
11496         else
11497           {
11498             if (friendp)
11499               {
11500                 error ("`%s' is neither function nor member function; cannot be declared friend",
11501                        IDENTIFIER_POINTER (declarator));
11502                 friendp = 0;
11503               }
11504             decl = NULL_TREE;
11505           }
11506
11507         if (friendp)
11508           {
11509             /* Friends are treated specially.  */
11510             if (ctype == current_class_type)
11511               warning ("member functions are implicitly friends of their class");
11512             else
11513               {
11514                 tree t = NULL_TREE;
11515                 if (decl && DECL_NAME (decl))
11516                   {
11517                     if (template_class_depth (current_class_type) == 0)
11518                       {
11519                         decl
11520                           = check_explicit_specialization
11521                           (declarator, decl,
11522                            template_count, 2 * (funcdef_flag != 0) + 4);
11523                         if (decl == error_mark_node)
11524                           return error_mark_node;
11525                       }
11526
11527                     t = do_friend (ctype, declarator, decl,
11528                                    last_function_parms, attrlist, flags, quals,
11529                                    funcdef_flag);
11530                   }
11531                 if (t && funcdef_flag)
11532                   return t;
11533
11534                 return void_type_node;
11535               }
11536           }
11537
11538         /* Structure field.  It may not be a function, except for C++ */
11539
11540         if (decl == NULL_TREE)
11541           {
11542             if (initialized)
11543               {
11544                 if (!staticp)
11545                   {
11546                     /* An attempt is being made to initialize a non-static
11547                        member.  But, from [class.mem]:
11548
11549                        4 A member-declarator can contain a
11550                        constant-initializer only if it declares a static
11551                        member (_class.static_) of integral or enumeration
11552                        type, see _class.static.data_.
11553
11554                        This used to be relatively common practice, but
11555                        the rest of the compiler does not correctly
11556                        handle the initialization unless the member is
11557                        static so we make it static below.  */
11558                     cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11559                                 declarator);
11560                     cp_pedwarn ("making `%D' static", declarator);
11561                     staticp = 1;
11562                   }
11563
11564                 if (uses_template_parms (type))
11565                   /* We'll check at instantiation time.  */
11566                   ;
11567                 else if (check_static_variable_definition (declarator,
11568                                                            type))
11569                   /* If we just return the declaration, crashes
11570                      will sometimes occur.  We therefore return
11571                      void_type_node, as if this was a friend
11572                      declaration, to cause callers to completely
11573                      ignore this declaration.  */
11574                   return void_type_node;
11575               }
11576
11577             /* 9.2p13 [class.mem] */
11578             if (declarator == constructor_name (current_class_type)
11579                 /* The standard does not allow non-static data members
11580                    here either, but we agreed at the 10/99 meeting
11581                    to change that in TC 1 so that they are allowed in
11582                    classes with no user-defined constructors.  */
11583                 && staticp)
11584               cp_pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11585                           declarator);
11586
11587             if (staticp)
11588               {
11589                 /* C++ allows static class members.  All other work
11590                    for this is done by grokfield.  */
11591                 decl = build_lang_decl (VAR_DECL, declarator, type);
11592                 TREE_STATIC (decl) = 1;
11593                 /* In class context, 'static' means public access.  */
11594                 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl) = 1;
11595               }
11596             else
11597               {
11598                 decl = build_decl (FIELD_DECL, declarator, type);
11599                 DECL_NONADDRESSABLE_P (decl) = bitfield;
11600                 if (RIDBIT_SETP (RID_MUTABLE, specbits))
11601                   {
11602                     DECL_MUTABLE_P (decl) = 1;
11603                     RIDBIT_RESET (RID_MUTABLE, specbits);
11604                   }
11605               }
11606
11607             bad_specifiers (decl, "field", virtualp, quals != NULL_TREE,
11608                             inlinep, friendp, raises != NULL_TREE);
11609           }
11610       }
11611     else if (TREE_CODE (type) == FUNCTION_TYPE || TREE_CODE (type) == METHOD_TYPE)
11612       {
11613         tree original_name;
11614         int publicp = 0;
11615
11616         if (! declarator)
11617           return NULL_TREE;
11618
11619         if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
11620           original_name = dname;
11621         else
11622           original_name = declarator;
11623
11624         if (RIDBIT_SETP (RID_AUTO, specbits))
11625           error ("storage class `auto' invalid for function `%s'", name);
11626         else if (RIDBIT_SETP (RID_REGISTER, specbits))
11627           error ("storage class `register' invalid for function `%s'", name);
11628
11629         /* Function declaration not at top level.
11630            Storage classes other than `extern' are not allowed
11631            and `extern' makes no difference.  */
11632         if (! toplevel_bindings_p ()
11633             && (RIDBIT_SETP (RID_STATIC, specbits)
11634                 || RIDBIT_SETP (RID_INLINE, specbits))
11635             && pedantic)
11636           {
11637             if (RIDBIT_SETP (RID_STATIC, specbits))
11638               pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name);
11639             else
11640               pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name);
11641           }
11642
11643         if (ctype == NULL_TREE)
11644           {
11645             if (virtualp)
11646               {
11647                 error ("virtual non-class function `%s'", name);
11648                 virtualp = 0;
11649               }
11650           }
11651         else if (TREE_CODE (type) == FUNCTION_TYPE && staticp < 2)
11652           type = build_cplus_method_type (ctype, TREE_TYPE (type),
11653                                           TYPE_ARG_TYPES (type));
11654
11655         /* Record presence of `static'.  */
11656         publicp = (ctype != NULL_TREE
11657                    || RIDBIT_SETP (RID_EXTERN, specbits)
11658                    || !RIDBIT_SETP (RID_STATIC, specbits));
11659
11660         decl = grokfndecl (ctype, type, original_name, declarator,
11661                            virtualp, flags, quals, raises,
11662                            1, friendp,
11663                            publicp, inlinep, funcdef_flag,
11664                            template_count, in_namespace);
11665         if (decl == NULL_TREE)
11666           return NULL_TREE;
11667
11668         if (staticp == 1)
11669           {
11670             int illegal_static = 0;
11671
11672             /* Don't allow a static member function in a class, and forbid
11673                declaring main to be static.  */
11674             if (TREE_CODE (type) == METHOD_TYPE)
11675               {
11676                 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl);
11677                 illegal_static = 1;
11678               }
11679             else if (current_function_decl)
11680               {
11681                 /* FIXME need arm citation */
11682                 error ("cannot declare static function inside another function");
11683                 illegal_static = 1;
11684               }
11685
11686             if (illegal_static)
11687               {
11688                 staticp = 0;
11689                 RIDBIT_RESET (RID_STATIC, specbits);
11690               }
11691           }
11692       }
11693     else
11694       {
11695         /* It's a variable.  */
11696
11697         /* An uninitialized decl with `extern' is a reference.  */
11698         decl = grokvardecl (type, declarator, &specbits,
11699                             initialized,
11700                             (type_quals & TYPE_QUAL_CONST) != 0,
11701                             in_namespace);
11702         bad_specifiers (decl, "variable", virtualp, quals != NULL_TREE,
11703                         inlinep, friendp, raises != NULL_TREE);
11704
11705         if (ctype)
11706           {
11707             DECL_CONTEXT (decl) = ctype;
11708             if (staticp == 1)
11709               {
11710                 cp_pedwarn ("static member `%D' re-declared as static", decl);
11711                 staticp = 0;
11712                 RIDBIT_RESET (RID_STATIC, specbits);
11713               }
11714             if (RIDBIT_SETP (RID_REGISTER, specbits) && TREE_STATIC (decl))
11715               {
11716                 cp_error ("static member `%D' declared `register'", decl);
11717                 RIDBIT_RESET (RID_REGISTER, specbits);
11718               }
11719             if (RIDBIT_SETP (RID_EXTERN, specbits) && pedantic)
11720               {
11721                 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11722                             decl);
11723                 RIDBIT_RESET (RID_EXTERN, specbits);
11724               }
11725           }
11726       }
11727
11728     my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE, specbits), 19990927);
11729
11730     /* Record `register' declaration for warnings on &
11731        and in case doing stupid register allocation.  */
11732
11733     if (RIDBIT_SETP (RID_REGISTER, specbits))
11734       DECL_REGISTER (decl) = 1;
11735
11736     if (RIDBIT_SETP (RID_EXTERN, specbits))
11737       DECL_THIS_EXTERN (decl) = 1;
11738
11739     if (RIDBIT_SETP (RID_STATIC, specbits))
11740       DECL_THIS_STATIC (decl) = 1;
11741
11742     /* Record constancy and volatility.  There's no need to do this
11743        when processing a template; we'll do this for the instantiated
11744        declaration based on the type of DECL.  */
11745     if (!processing_template_decl)
11746       c_apply_type_quals_to_decl (type_quals, decl);
11747
11748     return decl;
11749   }
11750 }
11751 \f
11752 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11753    An empty exprlist is a parmlist.  An exprlist which
11754    contains only identifiers at the global level
11755    is a parmlist.  Otherwise, it is an exprlist.  */
11756
11757 int
11758 parmlist_is_exprlist (exprs)
11759      tree exprs;
11760 {
11761   if (exprs == NULL_TREE || TREE_PARMLIST (exprs))
11762     return 0;
11763
11764   if (toplevel_bindings_p ())
11765     {
11766       /* At the global level, if these are all identifiers,
11767          then it is a parmlist.  */
11768       while (exprs)
11769         {
11770           if (TREE_CODE (TREE_VALUE (exprs)) != IDENTIFIER_NODE)
11771             return 1;
11772           exprs = TREE_CHAIN (exprs);
11773         }
11774       return 0;
11775     }
11776   return 1;
11777 }
11778
11779 /* Subroutine of start_function.  Ensure that each of the parameter
11780    types (as listed in PARMS) is complete, as is required for a
11781    function definition.  */
11782
11783 static void
11784 require_complete_types_for_parms (parms)
11785      tree parms;
11786 {
11787   for (; parms; parms = TREE_CHAIN (parms))
11788     {
11789       tree type = TREE_TYPE (parms);
11790
11791       /* Try to complete the TYPE.  */
11792       type = complete_type (type);
11793
11794       if (type == error_mark_node)
11795         continue;
11796
11797       if (!COMPLETE_TYPE_P (type))
11798         {
11799           if (DECL_NAME (parms))
11800             error ("parameter `%s' has incomplete type",
11801                    IDENTIFIER_POINTER (DECL_NAME (parms)));
11802           else
11803             error ("parameter has incomplete type");
11804           TREE_TYPE (parms) = error_mark_node;
11805         }
11806       else
11807         layout_decl (parms, 0);
11808     }
11809 }
11810
11811 /* Returns non-zero if T is a local variable.  */
11812
11813 int
11814 local_variable_p (t)
11815      tree t;
11816 {
11817   if ((TREE_CODE (t) == VAR_DECL
11818        /* A VAR_DECL with a context that is a _TYPE is a static data
11819           member.  */
11820        && !TYPE_P (CP_DECL_CONTEXT (t))
11821        /* Any other non-local variable must be at namespace scope.  */
11822        && !DECL_NAMESPACE_SCOPE_P (t))
11823       || (TREE_CODE (t) == PARM_DECL))
11824     return 1;
11825
11826   return 0;
11827 }
11828
11829 /* Returns non-zero if T is an automatic local variable or a label.
11830    (These are the declarations that need to be remapped when the code
11831    containing them is duplicated.)  */
11832
11833 int
11834 nonstatic_local_decl_p (t)
11835      tree t;
11836 {
11837   return ((local_variable_p (t) && !TREE_STATIC (t))
11838           || TREE_CODE (t) == LABEL_DECL
11839           || TREE_CODE (t) == RESULT_DECL);
11840 }
11841
11842 /* Like local_variable_p, but suitable for use as a tree-walking
11843    function.  */
11844
11845 static tree
11846 local_variable_p_walkfn (tp, walk_subtrees, data)
11847      tree *tp;
11848      int *walk_subtrees ATTRIBUTE_UNUSED;
11849      void *data ATTRIBUTE_UNUSED;
11850 {
11851   return ((local_variable_p (*tp) && !DECL_ARTIFICIAL (*tp))
11852           ? *tp : NULL_TREE);
11853 }
11854
11855 /* Check that ARG, which is a default-argument expression for a
11856    parameter DECL, is legal.  Returns ARG, or ERROR_MARK_NODE, if
11857    something goes wrong.  DECL may also be a _TYPE node, rather than a
11858    DECL, if there is no DECL available.  */
11859
11860 tree
11861 check_default_argument (decl, arg)
11862      tree decl;
11863      tree arg;
11864 {
11865   tree var;
11866   tree decl_type;
11867
11868   if (TREE_CODE (arg) == DEFAULT_ARG)
11869     /* We get a DEFAULT_ARG when looking at an in-class declaration
11870        with a default argument.  Ignore the argument for now; we'll
11871        deal with it after the class is complete.  */
11872     return arg;
11873
11874   if (processing_template_decl || uses_template_parms (arg))
11875     /* We don't do anything checking until instantiation-time.  Note
11876        that there may be uninstantiated arguments even for an
11877        instantiated function, since default arguments are not
11878        instantiated until they are needed.  */
11879     return arg;
11880
11881   if (TYPE_P (decl))
11882     {
11883       decl_type = decl;
11884       decl = NULL_TREE;
11885     }
11886   else
11887     decl_type = TREE_TYPE (decl);
11888
11889   if (arg == error_mark_node
11890       || decl == error_mark_node
11891       || TREE_TYPE (arg) == error_mark_node
11892       || decl_type == error_mark_node)
11893     /* Something already went wrong.  There's no need to check
11894        further.  */
11895     return error_mark_node;
11896
11897   /* [dcl.fct.default]
11898
11899      A default argument expression is implicitly converted to the
11900      parameter type.  */
11901   if (!TREE_TYPE (arg)
11902       || !can_convert_arg (decl_type, TREE_TYPE (arg), arg))
11903     {
11904       if (decl)
11905         cp_error ("default argument for `%#D' has type `%T'",
11906                   decl, TREE_TYPE (arg));
11907       else
11908         cp_error ("default argument for parameter of type `%T' has type `%T'",
11909                   decl_type, TREE_TYPE (arg));
11910
11911       return error_mark_node;
11912     }
11913
11914   /* [dcl.fct.default]
11915
11916      Local variables shall not be used in default argument
11917      expressions.
11918
11919      The keyword `this' shall not be used in a default argument of a
11920      member function.  */
11921   var = walk_tree (&arg, local_variable_p_walkfn, NULL);
11922   if (var)
11923     {
11924       cp_error ("default argument `%E' uses local variable `%D'",
11925                 arg, var);
11926       return error_mark_node;
11927     }
11928
11929   /* All is well.  */
11930   return arg;
11931 }
11932
11933 /* Decode the list of parameter types for a function type.
11934    Given the list of things declared inside the parens,
11935    return a list of types.
11936
11937    The list we receive can have three kinds of elements:
11938    an IDENTIFIER_NODE for names given without types,
11939    a TREE_LIST node for arguments given as typespecs or names with typespecs,
11940    or void_type_node, to mark the end of an argument list
11941    when additional arguments are not permitted (... was not used).
11942
11943    FUNCDEF_FLAG is nonzero for a function definition, 0 for
11944    a mere declaration.  A nonempty identifier-list gets an error message
11945    when FUNCDEF_FLAG is zero.
11946    If FUNCDEF_FLAG is 1, then parameter types must be complete.
11947    If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11948
11949    If all elements of the input list contain types,
11950    we return a list of the types.
11951    If all elements contain no type (except perhaps a void_type_node
11952    at the end), we return a null list.
11953    If some have types and some do not, it is an error, and we
11954    return a null list.
11955
11956    Also set last_function_parms to either
11957    a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11958    A list of names is converted to a chain of PARM_DECLs
11959    by store_parm_decls so that ultimately it is always a chain of decls.
11960
11961    Note that in C++, parameters can take default values.  These default
11962    values are in the TREE_PURPOSE field of the TREE_LIST.  It is
11963    an error to specify default values which are followed by parameters
11964    that have no default values, or an ELLIPSES.  For simplicities sake,
11965    only parameters which are specified with their types can take on
11966    default values.  */
11967
11968 static tree
11969 grokparms (first_parm, funcdef_flag)
11970      tree first_parm;
11971      int funcdef_flag;
11972 {
11973   tree result = NULL_TREE;
11974   tree decls = NULL_TREE;
11975
11976   if (first_parm != NULL_TREE
11977       && TREE_CODE (TREE_VALUE (first_parm)) == IDENTIFIER_NODE)
11978     {
11979       if (! funcdef_flag)
11980         pedwarn ("parameter names (without types) in function declaration");
11981       last_function_parms = first_parm;
11982       return NULL_TREE;
11983     }
11984   else if (first_parm != NULL_TREE
11985            && TREE_CODE (TREE_VALUE (first_parm)) != TREE_LIST
11986            && TREE_CODE (TREE_VALUE (first_parm)) != VOID_TYPE)
11987     my_friendly_abort (145);
11988   else
11989     {
11990       /* Types were specified.  This is a list of declarators
11991          each represented as a TREE_LIST node.  */
11992       register tree parm, chain;
11993       int any_init = 0, any_error = 0;
11994
11995       if (first_parm != NULL_TREE)
11996         {
11997           tree last_result = NULL_TREE;
11998           tree last_decl = NULL_TREE;
11999
12000           for (parm = first_parm; parm != NULL_TREE; parm = chain)
12001             {
12002               tree type = NULL_TREE, list_node = parm;
12003               register tree decl = TREE_VALUE (parm);
12004               tree init = TREE_PURPOSE (parm);
12005
12006               chain = TREE_CHAIN (parm);
12007               /* @@ weak defense against parse errors.  */
12008               if (TREE_CODE (decl) != VOID_TYPE
12009                   && TREE_CODE (decl) != TREE_LIST)
12010                 {
12011                   /* Give various messages as the need arises.  */
12012                   if (TREE_CODE (decl) == STRING_CST)
12013                     cp_error ("invalid string constant `%E'", decl);
12014                   else if (TREE_CODE (decl) == INTEGER_CST)
12015                     error ("invalid integer constant in parameter list, did you forget to give parameter name?");
12016                   continue;
12017                 }
12018
12019               if (TREE_CODE (decl) != VOID_TYPE)
12020                 {
12021                   decl = grokdeclarator (TREE_VALUE (decl),
12022                                          TREE_PURPOSE (decl),
12023                                          PARM, init != NULL_TREE,
12024                                          NULL_TREE);
12025                   if (! decl || TREE_TYPE (decl) == error_mark_node)
12026                     continue;
12027
12028                   /* Top-level qualifiers on the parameters are
12029                      ignored for function types.  */
12030                   type = TYPE_MAIN_VARIANT (TREE_TYPE (decl));
12031
12032                   if (TREE_CODE (type) == VOID_TYPE)
12033                     decl = void_type_node;
12034                   else if (TREE_CODE (type) == METHOD_TYPE)
12035                     {
12036                       if (DECL_NAME (decl))
12037                         /* Cannot use the decl here because
12038                            we don't have DECL_CONTEXT set up yet.  */
12039                         cp_error ("parameter `%D' invalidly declared method type",
12040                                   DECL_NAME (decl));
12041                       else
12042                         error ("parameter invalidly declared method type");
12043                       type = build_pointer_type (type);
12044                       TREE_TYPE (decl) = type;
12045                     }
12046                   else if (TREE_CODE (type) == OFFSET_TYPE)
12047                     {
12048                       if (DECL_NAME (decl))
12049                         cp_error ("parameter `%D' invalidly declared offset type",
12050                                   DECL_NAME (decl));
12051                       else
12052                         error ("parameter invalidly declared offset type");
12053                       type = build_pointer_type (type);
12054                       TREE_TYPE (decl) = type;
12055                     }
12056                   else if (abstract_virtuals_error (decl, type))
12057                     any_error = 1;  /* Seems like a good idea. */
12058                   else if (POINTER_TYPE_P (type))
12059                     {
12060                       tree t = type;
12061                       while (POINTER_TYPE_P (t)
12062                              || (TREE_CODE (t) == ARRAY_TYPE
12063                                  && TYPE_DOMAIN (t) != NULL_TREE))
12064                         t = TREE_TYPE (t);
12065                       if (TREE_CODE (t) == ARRAY_TYPE)
12066                         cp_error ("parameter type `%T' includes %s to array of unknown bound",
12067                                   type,
12068                                   TYPE_PTR_P (type) ? "pointer" : "reference");
12069                     }
12070                 }
12071
12072               if (TREE_CODE (decl) == VOID_TYPE)
12073                 {
12074                   if (result == NULL_TREE)
12075                     {
12076                       result = void_list_node;
12077                       last_result = result;
12078                     }
12079                   else
12080                     {
12081                       TREE_CHAIN (last_result) = void_list_node;
12082                       last_result = void_list_node;
12083                     }
12084                   if (chain
12085                       && (chain != void_list_node || TREE_CHAIN (chain)))
12086                     error ("`void' in parameter list must be entire list");
12087                   break;
12088                 }
12089
12090               /* Since there is a prototype, args are passed in their own types.  */
12091               DECL_ARG_TYPE (decl) = TREE_TYPE (decl);
12092               if (PROMOTE_PROTOTYPES
12093                   && (TREE_CODE (type) == INTEGER_TYPE
12094                       || TREE_CODE (type) == ENUMERAL_TYPE)
12095                   && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node))
12096                 DECL_ARG_TYPE (decl) = integer_type_node;
12097               if (!any_error && init)
12098                 {
12099                   any_init++;
12100                   init = check_default_argument (decl, init);
12101                 }
12102               else
12103                 init = NULL_TREE;
12104
12105               if (decls == NULL_TREE)
12106                 {
12107                   decls = decl;
12108                   last_decl = decls;
12109                 }
12110               else
12111                 {
12112                   TREE_CHAIN (last_decl) = decl;
12113                   last_decl = decl;
12114                 }
12115               list_node = tree_cons (init, type, NULL_TREE);
12116               if (result == NULL_TREE)
12117                 {
12118                   result = list_node;
12119                   last_result = result;
12120                 }
12121               else
12122                 {
12123                   TREE_CHAIN (last_result) = list_node;
12124                   last_result = list_node;
12125                 }
12126             }
12127           if (last_result)
12128             TREE_CHAIN (last_result) = NULL_TREE;
12129           /* If there are no parameters, and the function does not end
12130              with `...', then last_decl will be NULL_TREE.  */
12131           if (last_decl != NULL_TREE)
12132             TREE_CHAIN (last_decl) = NULL_TREE;
12133         }
12134     }
12135
12136   last_function_parms = decls;
12137
12138   return result;
12139 }
12140
12141 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
12142    FUNCTION_TYPE with the newly parsed version of its default argument, which
12143    was previously digested as text.  See snarf_defarg et al in lex.c.  */
12144
12145 void
12146 replace_defarg (arg, init)
12147      tree arg, init;
12148 {
12149   if (! processing_template_decl
12150       && ! can_convert_arg (TREE_VALUE (arg), TREE_TYPE (init), init))
12151     cp_pedwarn ("invalid type `%T' for default argument to `%T'",
12152                 TREE_TYPE (init), TREE_VALUE (arg));
12153   TREE_PURPOSE (arg) = init;
12154 }
12155 \f
12156 /* D is a constructor or overloaded `operator='.  Returns non-zero if
12157    D's arguments allow it to be a copy constructor, or copy assignment
12158    operator.  */
12159
12160 int
12161 copy_args_p (d)
12162      tree d;
12163 {
12164   tree t;
12165
12166   if (!DECL_FUNCTION_MEMBER_P (d))
12167     return 0;
12168
12169   t = FUNCTION_ARG_CHAIN (d);
12170   if (DECL_CONSTRUCTOR_P (d) && DECL_HAS_IN_CHARGE_PARM_P (d))
12171     t = TREE_CHAIN (t);
12172   if (t && TREE_CODE (TREE_VALUE (t)) == REFERENCE_TYPE
12173       && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t)))
12174           == DECL_CONTEXT (d))
12175       && (TREE_CHAIN (t) == NULL_TREE
12176           || TREE_CHAIN (t) == void_list_node
12177           || TREE_PURPOSE (TREE_CHAIN (t))))
12178     return 1;
12179   return 0;
12180 }
12181
12182 /* These memoizing functions keep track of special properties which
12183    a class may have.  `grok_ctor_properties' notices whether a class
12184    has a constructor of the form X(X&), and also complains
12185    if the class has a constructor of the form X(X).
12186    `grok_op_properties' takes notice of the various forms of
12187    operator= which are defined, as well as what sorts of type conversion
12188    may apply.  Both functions take a FUNCTION_DECL as an argument.  */
12189
12190 int
12191 grok_ctor_properties (ctype, decl)
12192      tree ctype, decl;
12193 {
12194   tree parmtypes = FUNCTION_ARG_CHAIN (decl);
12195   tree parmtype = parmtypes ? TREE_VALUE (parmtypes) : void_type_node;
12196
12197   /* When a type has virtual baseclasses, a magical first int argument is
12198      added to any ctor so we can tell if the class has been initialized
12199      yet.  This could screw things up in this function, so we deliberately
12200      ignore the leading int if we're in that situation.  */
12201   if (DECL_HAS_IN_CHARGE_PARM_P (decl))
12202     {
12203       my_friendly_assert (parmtypes
12204                           && TREE_VALUE (parmtypes) == integer_type_node,
12205                           980529);
12206       parmtypes = TREE_CHAIN (parmtypes);
12207       parmtype = TREE_VALUE (parmtypes);
12208     }
12209
12210   /* [class.copy]
12211
12212      A non-template constructor for class X is a copy constructor if
12213      its first parameter is of type X&, const X&, volatile X& or const
12214      volatile X&, and either there are no other parameters or else all
12215      other parameters have default arguments.  */
12216   if (TREE_CODE (parmtype) == REFERENCE_TYPE
12217       && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype)) == ctype
12218       && (TREE_CHAIN (parmtypes) == NULL_TREE
12219           || TREE_CHAIN (parmtypes) == void_list_node
12220           || TREE_PURPOSE (TREE_CHAIN (parmtypes)))
12221       && !(DECL_TEMPLATE_INSTANTIATION (decl)
12222            && is_member_template (DECL_TI_TEMPLATE (decl))))
12223     {
12224       TYPE_HAS_INIT_REF (ctype) = 1;
12225       if (CP_TYPE_CONST_P (TREE_TYPE (parmtype)))
12226         TYPE_HAS_CONST_INIT_REF (ctype) = 1;
12227     }
12228   /* [class.copy]
12229
12230      A declaration of a constructor for a class X is ill-formed if its
12231      first parameter is of type (optionally cv-qualified) X and either
12232      there are no other parameters or else all other parameters have
12233      default arguments.
12234
12235      We *don't* complain about member template instantiations that
12236      have this form, though; they can occur as we try to decide what
12237      constructor to use during overload resolution.  Since overload
12238      resolution will never prefer such a constructor to the
12239      non-template copy constructor (which is either explicitly or
12240      implicitly defined), there's no need to worry about their
12241      existence.  Theoretically, they should never even be
12242      instantiated, but that's hard to forestall.  */
12243   else if (TYPE_MAIN_VARIANT (parmtype) == ctype
12244            && (TREE_CHAIN (parmtypes) == NULL_TREE
12245                || TREE_CHAIN (parmtypes) == void_list_node
12246                || TREE_PURPOSE (TREE_CHAIN (parmtypes)))
12247            && !(DECL_TEMPLATE_INSTANTIATION (decl)
12248                 && is_member_template (DECL_TI_TEMPLATE (decl))))
12249     {
12250       cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
12251                 ctype, ctype);
12252       SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl), ctype);
12253       return 0;
12254     }
12255   else if (TREE_CODE (parmtype) == VOID_TYPE
12256            || TREE_PURPOSE (parmtypes) != NULL_TREE)
12257     TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype) = 1;
12258
12259   return 1;
12260 }
12261
12262 /* An operator with this code is unary, but can also be binary.  */
12263
12264 static int
12265 ambi_op_p (code)
12266      enum tree_code code;
12267 {
12268   return (code == INDIRECT_REF
12269           || code == ADDR_EXPR
12270           || code == CONVERT_EXPR
12271           || code == NEGATE_EXPR
12272           || code == PREINCREMENT_EXPR
12273           || code == PREDECREMENT_EXPR);
12274 }
12275
12276 /* An operator with this name can only be unary.  */
12277
12278 static int
12279 unary_op_p (code)
12280      enum tree_code code;
12281 {
12282   return (code == TRUTH_NOT_EXPR
12283           || code == BIT_NOT_EXPR
12284           || code == COMPONENT_REF
12285           || code == TYPE_EXPR);
12286 }
12287
12288 /* Do a little sanity-checking on how they declared their operator.  */
12289
12290 void
12291 grok_op_properties (decl, virtualp, friendp)
12292      tree decl;
12293      int virtualp, friendp;
12294 {
12295   tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl));
12296   tree argtype;
12297   int methodp = (TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE);
12298   tree name = DECL_NAME (decl);
12299   enum tree_code operator_code;
12300   int arity;
12301
12302   /* Count the number of arguments.  */
12303   for (argtype = argtypes, arity = 0;
12304        argtype && argtype != void_list_node;
12305        argtype = TREE_CHAIN (argtype))
12306     ++arity;
12307
12308   if (current_class_type == NULL_TREE)
12309     friendp = 1;
12310
12311   if (DECL_CONV_FN_P (decl))
12312     operator_code = TYPE_EXPR;
12313   else
12314     do
12315       {
12316 #define DEF_OPERATOR(NAME, CODE, NEW_MANGLING, OLD_MANGING, ARITY, ASSN_P)  \
12317         if (ansi_opname (CODE) == name)                                     \
12318           {                                                                 \
12319             operator_code = CODE;                                           \
12320             break;                                                          \
12321           }                                                                 \
12322         else if (ansi_assopname (CODE) == name)                             \
12323           {                                                                 \
12324             operator_code = CODE;                                           \
12325             DECL_ASSIGNMENT_OPERATOR_P (decl) = 1;                          \
12326             break;                                                          \
12327           }
12328
12329 #include "operators.def"
12330 #undef DEF_OPERATOR
12331
12332         my_friendly_abort (20000527);
12333       }
12334     while (0);
12335   my_friendly_assert (operator_code != LAST_CPLUS_TREE_CODE, 20000526);
12336   SET_OVERLOADED_OPERATOR_CODE (decl, operator_code);
12337
12338   if (! friendp)
12339     {
12340       switch (operator_code)
12341         {
12342         case CALL_EXPR:
12343           TYPE_OVERLOADS_CALL_EXPR (current_class_type) = 1;
12344           break;
12345
12346         case ARRAY_REF:
12347           TYPE_OVERLOADS_ARRAY_REF (current_class_type) = 1;
12348           break;
12349
12350         case COMPONENT_REF:
12351         case MEMBER_REF:
12352           TYPE_OVERLOADS_ARROW (current_class_type) = 1;
12353           break;
12354
12355         case NEW_EXPR:
12356           TYPE_HAS_NEW_OPERATOR (current_class_type) = 1;
12357           break;
12358
12359         case DELETE_EXPR:
12360           TYPE_GETS_DELETE (current_class_type) |= 1;
12361           break;
12362
12363         case VEC_NEW_EXPR:
12364           TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type) = 1;
12365           break;
12366
12367         case VEC_DELETE_EXPR:
12368           TYPE_GETS_DELETE (current_class_type) |= 2;
12369           break;
12370
12371         default:
12372           break;
12373         }
12374     }
12375
12376   if (operator_code == NEW_EXPR || operator_code == VEC_NEW_EXPR)
12377     {
12378       /* When the compiler encounters the definition of A::operator new, it
12379          doesn't look at the class declaration to find out if it's static.  */
12380       if (methodp)
12381         revert_static_member_fn (decl);
12382
12383       /* Take care of function decl if we had syntax errors.  */
12384       if (argtypes == NULL_TREE)
12385         TREE_TYPE (decl)
12386           = build_function_type (ptr_type_node,
12387                                  hash_tree_chain (integer_type_node,
12388                                                   void_list_node));
12389       else
12390         TREE_TYPE (decl) = coerce_new_type (TREE_TYPE (decl));
12391     }
12392   else if (operator_code == DELETE_EXPR || operator_code == VEC_DELETE_EXPR)
12393     {
12394       if (methodp)
12395         revert_static_member_fn (decl);
12396
12397       if (argtypes == NULL_TREE)
12398         TREE_TYPE (decl)
12399           = build_function_type (void_type_node,
12400                                  hash_tree_chain (ptr_type_node,
12401                                                   void_list_node));
12402       else
12403         TREE_TYPE (decl) = coerce_delete_type (TREE_TYPE (decl));
12404     }
12405   else
12406     {
12407       /* An operator function must either be a non-static member function
12408          or have at least one parameter of a class, a reference to a class,
12409          an enumeration, or a reference to an enumeration.  13.4.0.6 */
12410       if (! methodp || DECL_STATIC_FUNCTION_P (decl))
12411         {
12412           if (operator_code == TYPE_EXPR
12413               || operator_code == CALL_EXPR
12414               || operator_code == COMPONENT_REF
12415               || operator_code == ARRAY_REF
12416               || operator_code == NOP_EXPR)
12417             cp_error ("`%D' must be a nonstatic member function", decl);
12418           else
12419             {
12420               tree p = argtypes;
12421
12422               if (DECL_STATIC_FUNCTION_P (decl))
12423                 cp_error ("`%D' must be either a non-static member function or a non-member function", decl);
12424
12425               if (p)
12426                 for (; TREE_CODE (TREE_VALUE (p)) != VOID_TYPE ; p = TREE_CHAIN (p))
12427                   {
12428                     tree arg = TREE_VALUE (p);
12429                     if (TREE_CODE (arg) == REFERENCE_TYPE)
12430                       arg = TREE_TYPE (arg);
12431
12432                     /* This lets bad template code slip through.  */
12433                     if (IS_AGGR_TYPE (arg)
12434                         || TREE_CODE (arg) == ENUMERAL_TYPE
12435                         || TREE_CODE (arg) == TEMPLATE_TYPE_PARM
12436                         || TREE_CODE (arg) == TEMPLATE_TEMPLATE_PARM)
12437                       goto foundaggr;
12438                   }
12439               cp_error
12440                 ("`%D' must have an argument of class or enumerated type",
12441                  decl);
12442             foundaggr:
12443               ;
12444             }
12445         }
12446
12447       if (operator_code == CALL_EXPR)
12448         return;                 /* No restrictions on args. */
12449
12450       if (IDENTIFIER_TYPENAME_P (name) && ! DECL_TEMPLATE_INFO (decl))
12451         {
12452           tree t = TREE_TYPE (name);
12453           if (! friendp)
12454             {
12455               int ref = (TREE_CODE (t) == REFERENCE_TYPE);
12456               const char *what = 0;
12457
12458               if (ref)
12459                 t = TYPE_MAIN_VARIANT (TREE_TYPE (t));
12460
12461               if (TREE_CODE (t) == VOID_TYPE)
12462                 what = "void";
12463               else if (t == current_class_type)
12464                 what = "the same type";
12465               /* Don't force t to be complete here.  */
12466               else if (IS_AGGR_TYPE (t)
12467                        && COMPLETE_TYPE_P (t)
12468                        && DERIVED_FROM_P (t, current_class_type))
12469                 what = "a base class";
12470
12471               if (what)
12472                 warning ("conversion to %s%s will never use a type conversion operator",
12473                          ref ? "a reference to " : "", what);
12474             }
12475         }
12476
12477       if (DECL_ASSIGNMENT_OPERATOR_P (decl)
12478           && operator_code == NOP_EXPR)
12479         {
12480           tree parmtype;
12481
12482           if (arity != 2 && methodp)
12483             {
12484               cp_error ("`%D' must take exactly one argument", decl);
12485               return;
12486             }
12487           parmtype = TREE_VALUE (TREE_CHAIN (argtypes));
12488
12489           /* [class.copy]
12490
12491              A user-declared copy assignment operator X::operator= is
12492              a non-static non-template member function of class X with
12493              exactly one parameter of type X, X&, const X&, volatile
12494              X& or const volatile X&.  */
12495           if (copy_assignment_arg_p (parmtype, virtualp)
12496               && !(DECL_TEMPLATE_INSTANTIATION (decl)
12497                    && is_member_template (DECL_TI_TEMPLATE (decl)))
12498               && ! friendp)
12499             {
12500               TYPE_HAS_ASSIGN_REF (current_class_type) = 1;
12501               if (TREE_CODE (parmtype) != REFERENCE_TYPE
12502                   || CP_TYPE_CONST_P (TREE_TYPE (parmtype)))
12503                 TYPE_HAS_CONST_ASSIGN_REF (current_class_type) = 1;
12504             }
12505         }
12506       else if (operator_code == COND_EXPR)
12507         {
12508           /* 13.4.0.3 */
12509           cp_error ("ISO C++ prohibits overloading operator ?:");
12510         }
12511       else if (ambi_op_p (operator_code))
12512         {
12513           if (arity == 1)
12514             /* We pick the one-argument operator codes by default, so
12515                we don't have to change anything.  */
12516             ;
12517           else if (arity == 2)
12518             {
12519               /* If we thought this was a unary operator, we now know
12520                  it to be a binary operator.  */
12521               switch (operator_code)
12522                 {
12523                 case INDIRECT_REF:
12524                   operator_code = MULT_EXPR;
12525                   break;
12526
12527                 case ADDR_EXPR:
12528                   operator_code = BIT_AND_EXPR;
12529                   break;
12530
12531                 case CONVERT_EXPR:
12532                   operator_code = PLUS_EXPR;
12533                   break;
12534
12535                 case NEGATE_EXPR:
12536                   operator_code = MINUS_EXPR;
12537                   break;
12538
12539                 case PREINCREMENT_EXPR:
12540                   operator_code = POSTINCREMENT_EXPR;
12541                   break;
12542
12543                 case PREDECREMENT_EXPR:
12544                   operator_code = POSTDECREMENT_EXPR;
12545                   break;
12546
12547                 default:
12548                   my_friendly_abort (20000527);
12549                 }
12550
12551               SET_OVERLOADED_OPERATOR_CODE (decl, operator_code);
12552
12553               if ((operator_code == POSTINCREMENT_EXPR
12554                    || operator_code == POSTDECREMENT_EXPR)
12555                   && ! processing_template_decl
12556                   && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes)), integer_type_node))
12557                 {
12558                   if (methodp)
12559                     cp_error ("postfix `%D' must take `int' as its argument",
12560                               decl);
12561                   else
12562                     cp_error
12563                       ("postfix `%D' must take `int' as its second argument",
12564                        decl);
12565                 }
12566             }
12567           else
12568             {
12569               if (methodp)
12570                 cp_error ("`%D' must take either zero or one argument", decl);
12571               else
12572                 cp_error ("`%D' must take either one or two arguments", decl);
12573             }
12574
12575           /* More Effective C++ rule 6.  */
12576           if (warn_ecpp
12577               && (operator_code == POSTINCREMENT_EXPR
12578                   || operator_code == POSTDECREMENT_EXPR
12579                   || operator_code == PREINCREMENT_EXPR
12580                   || operator_code == PREDECREMENT_EXPR))
12581             {
12582               tree arg = TREE_VALUE (argtypes);
12583               tree ret = TREE_TYPE (TREE_TYPE (decl));
12584               if (methodp || TREE_CODE (arg) == REFERENCE_TYPE)
12585                 arg = TREE_TYPE (arg);
12586               arg = TYPE_MAIN_VARIANT (arg);
12587               if (operator_code == PREINCREMENT_EXPR
12588                   || operator_code == PREDECREMENT_EXPR)
12589                 {
12590                   if (TREE_CODE (ret) != REFERENCE_TYPE
12591                       || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret)),
12592                                        arg))
12593                     cp_warning ("prefix `%D' should return `%T'", decl,
12594                                 build_reference_type (arg));
12595                 }
12596               else
12597                 {
12598                   if (!same_type_p (TYPE_MAIN_VARIANT (ret), arg))
12599                     cp_warning ("postfix `%D' should return `%T'", decl, arg);
12600                 }
12601             }
12602         }
12603       else if (unary_op_p (operator_code))
12604         {
12605           if (arity != 1)
12606             {
12607               if (methodp)
12608                 cp_error ("`%D' must take `void'", decl);
12609               else
12610                 cp_error ("`%D' must take exactly one argument", decl);
12611             }
12612         }
12613       else /* if (binary_op_p (operator_code)) */
12614         {
12615           if (arity != 2)
12616             {
12617               if (methodp)
12618                 cp_error ("`%D' must take exactly one argument", decl);
12619               else
12620                 cp_error ("`%D' must take exactly two arguments", decl);
12621             }
12622
12623           /* More Effective C++ rule 7.  */
12624           if (warn_ecpp
12625               && (operator_code == TRUTH_ANDIF_EXPR
12626                   || operator_code == TRUTH_ORIF_EXPR
12627                   || operator_code == COMPOUND_EXPR))
12628             cp_warning ("user-defined `%D' always evaluates both arguments",
12629                         decl);
12630         }
12631
12632       /* Effective C++ rule 23.  */
12633       if (warn_ecpp
12634           && arity == 2
12635           && (operator_code == PLUS_EXPR
12636               || operator_code == MINUS_EXPR
12637               || operator_code == TRUNC_DIV_EXPR
12638               || operator_code == MULT_EXPR)
12639           && TREE_CODE (TREE_TYPE (TREE_TYPE (decl))) == REFERENCE_TYPE)
12640         cp_warning ("`%D' should return by value", decl);
12641
12642       /* 13.4.0.8 */
12643       for (; argtypes && argtypes != void_list_node;
12644           argtypes = TREE_CHAIN (argtypes))
12645         if (TREE_PURPOSE (argtypes))
12646           {
12647             TREE_PURPOSE (argtypes) = NULL_TREE;
12648             if (operator_code == POSTINCREMENT_EXPR
12649                 || operator_code == POSTDECREMENT_EXPR)
12650               {
12651                 if (pedantic)
12652                   cp_pedwarn ("`%D' cannot have default arguments", decl);
12653               }
12654             else
12655               cp_error ("`%D' cannot have default arguments", decl);
12656           }
12657
12658     }
12659 }
12660 \f
12661 static const char *
12662 tag_name (code)
12663      enum tag_types code;
12664 {
12665   switch (code)
12666     {
12667     case record_type:
12668       return "struct";
12669     case class_type:
12670       return "class";
12671     case union_type:
12672       return "union ";
12673     case enum_type:
12674       return "enum";
12675     default:
12676       my_friendly_abort (981122);
12677     }
12678 }
12679
12680 /* Get the struct, enum or union (CODE says which) with tag NAME.
12681    Define the tag as a forward-reference if it is not defined.
12682
12683    C++: If a class derivation is given, process it here, and report
12684    an error if multiple derivation declarations are not identical.
12685
12686    If this is a definition, come in through xref_tag and only look in
12687    the current frame for the name (since C++ allows new names in any
12688    scope.)  */
12689
12690 tree
12691 xref_tag (code_type_node, name, globalize)
12692      tree code_type_node;
12693      tree name;
12694      int globalize;
12695 {
12696   enum tag_types tag_code;
12697   enum tree_code code;
12698   register tree ref, t;
12699   struct binding_level *b = current_binding_level;
12700   int got_type = 0;
12701   tree attributes = NULL_TREE;
12702   tree context = NULL_TREE;
12703
12704   /* If we are called from the parser, code_type_node will sometimes be a
12705      TREE_LIST.  This indicates that the user wrote
12706      "class __attribute__ ((foo)) bar".  Extract the attributes so we can
12707      use them later.  */
12708   if (TREE_CODE (code_type_node) == TREE_LIST)
12709     {
12710       attributes = TREE_PURPOSE (code_type_node);
12711       code_type_node = TREE_VALUE (code_type_node);
12712     }
12713
12714   tag_code = (enum tag_types) tree_low_cst (code_type_node, 1);
12715   switch (tag_code)
12716     {
12717     case record_type:
12718     case class_type:
12719       code = RECORD_TYPE;
12720       break;
12721     case union_type:
12722       code = UNION_TYPE;
12723       break;
12724     case enum_type:
12725       code = ENUMERAL_TYPE;
12726       break;
12727     default:
12728       my_friendly_abort (18);
12729     }
12730
12731   /* If a cross reference is requested, look up the type
12732      already defined for this tag and return it.  */
12733   if (TYPE_P (name))
12734     {
12735       t = name;
12736       name = TYPE_IDENTIFIER (t);
12737       got_type = 1;
12738     }
12739   else
12740     t = IDENTIFIER_TYPE_VALUE (name);
12741
12742   if (t && TREE_CODE (t) != code && TREE_CODE (t) != TEMPLATE_TYPE_PARM
12743       && TREE_CODE (t) != TEMPLATE_TEMPLATE_PARM)
12744     t = NULL_TREE;
12745
12746   if (! globalize)
12747     {
12748       /* If we know we are defining this tag, only look it up in
12749          this scope and don't try to find it as a type.  */
12750       ref = lookup_tag (code, name, b, 1);
12751     }
12752   else
12753     {
12754       if (t)
12755         {
12756           /* [dcl.type.elab] If the identifier resolves to a
12757              typedef-name or a template type-parameter, the
12758              elaborated-type-specifier is ill-formed.  */
12759           if (t != TYPE_MAIN_VARIANT (t)
12760               || (CLASS_TYPE_P (t) && TYPE_WAS_ANONYMOUS (t)))
12761             cp_pedwarn ("using typedef-name `%D' after `%s'",
12762                         TYPE_NAME (t), tag_name (tag_code));
12763           else if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
12764             cp_error ("using template type parameter `%T' after `%s'",
12765                       t, tag_name (tag_code));
12766
12767           ref = t;
12768         }
12769       else
12770         ref = lookup_tag (code, name, b, 0);
12771
12772       if (! ref)
12773         {
12774           /* Try finding it as a type declaration.  If that wins,
12775              use it.  */
12776           ref = lookup_name (name, 1);
12777
12778           if (ref != NULL_TREE
12779               && processing_template_decl
12780               && DECL_CLASS_TEMPLATE_P (ref)
12781               && template_class_depth (current_class_type) == 0)
12782             /* Since GLOBALIZE is true, we're declaring a global
12783                template, so we want this type.  */
12784             ref = DECL_TEMPLATE_RESULT (ref);
12785
12786           if (ref && TREE_CODE (ref) == TYPE_DECL
12787               && TREE_CODE (TREE_TYPE (ref)) == code)
12788             ref = TREE_TYPE (ref);
12789           else
12790             ref = NULL_TREE;
12791         }
12792
12793       if (ref && current_class_type
12794           && template_class_depth (current_class_type)
12795           && PROCESSING_REAL_TEMPLATE_DECL_P ())
12796         {
12797           /* Since GLOBALIZE is non-zero, we are not looking at a
12798              definition of this tag.  Since, in addition, we are currently
12799              processing a (member) template declaration of a template
12800              class, we must be very careful; consider:
12801
12802                template <class X>
12803                struct S1
12804
12805                template <class U>
12806                struct S2
12807                { template <class V>
12808                friend struct S1; };
12809
12810              Here, the S2::S1 declaration should not be confused with the
12811              outer declaration.  In particular, the inner version should
12812              have a template parameter of level 2, not level 1.  This
12813              would be particularly important if the member declaration
12814              were instead:
12815
12816                template <class V = U> friend struct S1;
12817
12818              say, when we should tsubst into `U' when instantiating
12819              S2.  On the other hand, when presented with:
12820
12821                  template <class T>
12822                  struct S1 {
12823                    template <class U>
12824                    struct S2 {};
12825                    template <class U>
12826                    friend struct S2;
12827                  };
12828
12829               we must find the inner binding eventually.  We
12830               accomplish this by making sure that the new type we
12831               create to represent this declaration has the right
12832               TYPE_CONTEXT.  */
12833           context = TYPE_CONTEXT (ref);
12834           ref = NULL_TREE;
12835         }
12836     }
12837
12838   if (! ref)
12839     {
12840       /* If no such tag is yet defined, create a forward-reference node
12841          and record it as the "definition".
12842          When a real declaration of this type is found,
12843          the forward-reference will be altered into a real type.  */
12844       if (code == ENUMERAL_TYPE)
12845         {
12846           cp_error ("use of enum `%#D' without previous declaration", name);
12847
12848           ref = make_node (ENUMERAL_TYPE);
12849
12850           /* Give the type a default layout like unsigned int
12851              to avoid crashing if it does not get defined.  */
12852           TYPE_MODE (ref) = TYPE_MODE (unsigned_type_node);
12853           TYPE_ALIGN (ref) = TYPE_ALIGN (unsigned_type_node);
12854           TYPE_USER_ALIGN (ref) = 0;
12855           TREE_UNSIGNED (ref) = 1;
12856           TYPE_PRECISION (ref) = TYPE_PRECISION (unsigned_type_node);
12857           TYPE_MIN_VALUE (ref) = TYPE_MIN_VALUE (unsigned_type_node);
12858           TYPE_MAX_VALUE (ref) = TYPE_MAX_VALUE (unsigned_type_node);
12859
12860           /* Enable us to recognize when a type is created in class context.
12861              To do nested classes correctly, this should probably be cleared
12862              out when we leave this classes scope.  Currently this in only
12863              done in `start_enum'.  */
12864
12865           pushtag (name, ref, globalize);
12866         }
12867       else
12868         {
12869           struct binding_level *old_b = class_binding_level;
12870
12871           ref = make_aggr_type (code);
12872           TYPE_CONTEXT (ref) = context;
12873
12874 #ifdef NONNESTED_CLASSES
12875           /* Class types don't nest the way enums do.  */
12876           class_binding_level = (struct binding_level *)0;
12877 #endif
12878           pushtag (name, ref, globalize);
12879           class_binding_level = old_b;
12880         }
12881     }
12882   else
12883     {
12884       if (!globalize && processing_template_decl && IS_AGGR_TYPE (ref))
12885         redeclare_class_template (ref, current_template_parms);
12886     }
12887
12888   /* Until the type is defined, tentatively accept whatever
12889      structure tag the user hands us.  */
12890   if (!COMPLETE_TYPE_P (ref)
12891       && ref != current_class_type
12892       /* Have to check this, in case we have contradictory tag info.  */
12893       && IS_AGGR_TYPE_CODE (TREE_CODE (ref)))
12894     {
12895       if (tag_code == class_type)
12896         CLASSTYPE_DECLARED_CLASS (ref) = 1;
12897       else if (tag_code == record_type)
12898         CLASSTYPE_DECLARED_CLASS (ref) = 0;
12899     }
12900
12901   TREE_TYPE (ref) = attributes;
12902
12903   return ref;
12904 }
12905
12906 tree
12907 xref_tag_from_type (old, id, globalize)
12908      tree old, id;
12909      int globalize;
12910 {
12911   tree code_type_node;
12912
12913   if (TREE_CODE (old) == RECORD_TYPE)
12914     code_type_node = (CLASSTYPE_DECLARED_CLASS (old)
12915                       ? class_type_node : record_type_node);
12916   else
12917     code_type_node = union_type_node;
12918
12919   if (id == NULL_TREE)
12920     id = TYPE_IDENTIFIER (old);
12921
12922   return xref_tag (code_type_node, id, globalize);
12923 }
12924
12925 /* REF is a type (named NAME), for which we have just seen some
12926    baseclasses.  BINFO is a list of those baseclasses; the
12927    TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12928    the base-class.  CODE_TYPE_NODE indicates whether REF is a class,
12929    struct, or union.  */
12930
12931 void
12932 xref_basetypes (code_type_node, name, ref, binfo)
12933      tree code_type_node;
12934      tree name, ref;
12935      tree binfo;
12936 {
12937   /* In the declaration `A : X, Y, ... Z' we mark all the types
12938      (A, X, Y, ..., Z) so we can check for duplicates.  */
12939   tree binfos;
12940   tree base;
12941
12942   int i, len;
12943   enum tag_types tag_code = (enum tag_types) tree_low_cst (code_type_node, 1);
12944
12945   if (tag_code == union_type)
12946     {
12947       cp_error ("derived union `%T' invalid", ref);
12948       return;
12949     }
12950
12951   len = list_length (binfo);
12952
12953   /* First, make sure that any templates in base-classes are
12954      instantiated.  This ensures that if we call ourselves recursively
12955      we do not get confused about which classes are marked and which
12956      are not.  */
12957   for (base = binfo; base; base = TREE_CHAIN (base))
12958     complete_type (TREE_VALUE (base));
12959
12960   SET_CLASSTYPE_MARKED (ref);
12961   BINFO_BASETYPES (TYPE_BINFO (ref)) = binfos = make_tree_vec (len);
12962
12963   for (i = 0; binfo; binfo = TREE_CHAIN (binfo))
12964     {
12965       /* The base of a derived struct is public by default.  */
12966       int via_public
12967         = (TREE_PURPOSE (binfo) == access_public_node
12968            || TREE_PURPOSE (binfo) == access_public_virtual_node
12969            || (tag_code != class_type
12970                && (TREE_PURPOSE (binfo) == access_default_node
12971                    || TREE_PURPOSE (binfo) == access_default_virtual_node)));
12972       int via_protected
12973         = (TREE_PURPOSE (binfo) == access_protected_node
12974            || TREE_PURPOSE (binfo) == access_protected_virtual_node);
12975       int via_virtual
12976         = (TREE_PURPOSE (binfo) == access_private_virtual_node
12977            || TREE_PURPOSE (binfo) == access_protected_virtual_node
12978            || TREE_PURPOSE (binfo) == access_public_virtual_node
12979            || TREE_PURPOSE (binfo) == access_default_virtual_node);
12980       tree basetype = TREE_VALUE (binfo);
12981       tree base_binfo;
12982
12983       if (basetype && TREE_CODE (basetype) == TYPE_DECL)
12984         basetype = TREE_TYPE (basetype);
12985       if (!basetype
12986           || (TREE_CODE (basetype) != RECORD_TYPE
12987               && TREE_CODE (basetype) != TYPENAME_TYPE
12988               && TREE_CODE (basetype) != TEMPLATE_TYPE_PARM
12989               && TREE_CODE (basetype) != TEMPLATE_TEMPLATE_PARM))
12990         {
12991           cp_error ("base type `%T' fails to be a struct or class type",
12992                     TREE_VALUE (binfo));
12993           continue;
12994         }
12995
12996       GNU_xref_hier (name, basetype, via_public, via_virtual, 0);
12997
12998       /* This code replaces similar code in layout_basetypes.
12999          We put the complete_type first for implicit `typename'.  */
13000       if (!COMPLETE_TYPE_P (basetype)
13001           && ! (current_template_parms && uses_template_parms (basetype)))
13002         {
13003           cp_error ("base class `%T' has incomplete type", basetype);
13004           continue;
13005         }
13006       else
13007         {
13008           if (CLASSTYPE_MARKED (basetype))
13009             {
13010               if (basetype == ref)
13011                 cp_error ("recursive type `%T' undefined", basetype);
13012               else
13013                 cp_error ("duplicate base type `%T' invalid", basetype);
13014               continue;
13015             }
13016
13017           if (TYPE_FOR_JAVA (basetype)
13018               && (current_lang_stack
13019                   == &VARRAY_TREE (current_lang_base, 0)))
13020             TYPE_FOR_JAVA (ref) = 1;
13021
13022           /* Note that the BINFO records which describe individual
13023              inheritances are *not* shared in the lattice!  They
13024              cannot be shared because a given baseclass may be
13025              inherited with different `accessibility' by different
13026              derived classes.  (Each BINFO record describing an
13027              individual inheritance contains flags which say what
13028              the `accessibility' of that particular inheritance is.)  */
13029
13030           base_binfo
13031             = make_binfo (size_zero_node, basetype,
13032                           CLASS_TYPE_P (basetype)
13033                           ? TYPE_BINFO_VTABLE (basetype) : NULL_TREE,
13034                           CLASS_TYPE_P (basetype)
13035                           ? TYPE_BINFO_VIRTUALS (basetype) : NULL_TREE);
13036
13037           TREE_VEC_ELT (binfos, i) = base_binfo;
13038           TREE_VIA_PUBLIC (base_binfo) = via_public;
13039           TREE_VIA_PROTECTED (base_binfo) = via_protected;
13040           TREE_VIA_VIRTUAL (base_binfo) = via_virtual;
13041           BINFO_INHERITANCE_CHAIN (base_binfo) = TYPE_BINFO (ref);
13042
13043           /* We need to unshare the binfos now so that lookups during class
13044              definition work.  */
13045           unshare_base_binfos (base_binfo);
13046
13047           SET_CLASSTYPE_MARKED (basetype);
13048
13049           /* We are free to modify these bits because they are meaningless
13050              at top level, and BASETYPE is a top-level type.  */
13051           if (via_virtual || TYPE_USES_VIRTUAL_BASECLASSES (basetype))
13052             {
13053               TYPE_USES_VIRTUAL_BASECLASSES (ref) = 1;
13054               /* Converting to a virtual base class requires looking
13055                  up the offset of the virtual base.  */
13056               TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref) = 1;
13057             }
13058
13059           if (CLASS_TYPE_P (basetype))
13060             {
13061               TYPE_HAS_NEW_OPERATOR (ref)
13062                 |= TYPE_HAS_NEW_OPERATOR (basetype);
13063               TYPE_HAS_ARRAY_NEW_OPERATOR (ref)
13064                 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype);
13065               TYPE_GETS_DELETE (ref) |= TYPE_GETS_DELETE (basetype);
13066               /* If the base-class uses multiple inheritance, so do we.  */
13067               TYPE_USES_MULTIPLE_INHERITANCE (ref)
13068                 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype);
13069               /* Likewise, if converting to a base of the base may require
13070                  code, then we may need to generate code to convert to a
13071                  base as well.  */
13072               TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref)
13073                 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype);
13074             }
13075
13076           i += 1;
13077         }
13078     }
13079   if (i)
13080     TREE_VEC_LENGTH (binfos) = i;
13081   else
13082     BINFO_BASETYPES (TYPE_BINFO (ref)) = NULL_TREE;
13083
13084   if (i > 1)
13085     {
13086       TYPE_USES_MULTIPLE_INHERITANCE (ref) = 1;
13087       /* If there is more than one non-empty they cannot be at the same
13088          address.  */
13089       TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref) = 1;
13090     }
13091
13092   /* Unmark all the types.  */
13093   while (--i >= 0)
13094     CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos, i)));
13095   CLEAR_CLASSTYPE_MARKED (ref);
13096
13097   /* Now that we know all the base-classes, set up the list of virtual
13098      bases.  */
13099   get_vbase_types (ref);
13100 }
13101
13102 \f
13103 /* Begin compiling the definition of an enumeration type.
13104    NAME is its name (or null if anonymous).
13105    Returns the type object, as yet incomplete.
13106    Also records info about it so that build_enumerator
13107    may be used to declare the individual values as they are read.  */
13108
13109 tree
13110 start_enum (name)
13111      tree name;
13112 {
13113   register tree enumtype = NULL_TREE;
13114   struct binding_level *b = current_binding_level;
13115
13116   /* If this is the real definition for a previous forward reference,
13117      fill in the contents in the same object that used to be the
13118      forward reference.  */
13119
13120   if (name != NULL_TREE)
13121     enumtype = lookup_tag (ENUMERAL_TYPE, name, b, 1);
13122
13123   if (enumtype != NULL_TREE && TREE_CODE (enumtype) == ENUMERAL_TYPE)
13124     {
13125       cp_error ("multiple definition of `%#T'", enumtype);
13126       cp_error_at ("previous definition here", enumtype);
13127       /* Clear out TYPE_VALUES, and start again.  */
13128       TYPE_VALUES (enumtype) = NULL_TREE;
13129     }
13130   else
13131     {
13132       enumtype = make_node (ENUMERAL_TYPE);
13133       pushtag (name, enumtype, 0);
13134     }
13135
13136   if (current_class_type)
13137     TREE_ADDRESSABLE (b->tags) = 1;
13138
13139   GNU_xref_decl (current_function_decl, enumtype);
13140   return enumtype;
13141 }
13142
13143 /* After processing and defining all the values of an enumeration type,
13144    install their decls in the enumeration type and finish it off.
13145    ENUMTYPE is the type object and VALUES a list of name-value pairs.
13146    Returns ENUMTYPE.  */
13147
13148 tree
13149 finish_enum (enumtype)
13150      tree enumtype;
13151 {
13152   register tree minnode = NULL_TREE, maxnode = NULL_TREE;
13153   /* Calculate the maximum value of any enumerator in this type.  */
13154
13155   tree values = TYPE_VALUES (enumtype);
13156   if (values)
13157     {
13158       tree pair;
13159
13160       for (pair = values; pair; pair = TREE_CHAIN (pair))
13161         {
13162           tree decl;
13163           tree value;
13164
13165           /* The TREE_VALUE is a CONST_DECL for this enumeration
13166              constant.  */
13167           decl = TREE_VALUE (pair);
13168
13169           /* [dcl.enum]
13170
13171              Following the closing brace of an enum-specifier, each
13172              enumerator has the type of its enumeration.  Prior to the
13173              closing brace, the type of each enumerator is the type of
13174              its initializing value.  */
13175           TREE_TYPE (decl) = enumtype;
13176
13177           /* The DECL_INITIAL will be NULL if we are processing a
13178              template declaration and this enumeration constant had no
13179              explicit initializer.  */
13180           value = DECL_INITIAL (decl);
13181           if (value && !processing_template_decl)
13182             {
13183               /* Set the TREE_TYPE for the VALUE as well.  That's so
13184                  that when we call decl_constant_value we get an
13185                  entity of the right type (but with the constant
13186                  value).  Since we shouldn't ever call
13187                  decl_constant_value on a template type, there's no
13188                  reason to do that when processing_template_decl.
13189                  And, if the expression is something like a
13190                  TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
13191                  wreak havoc on the intended type of the expression.
13192
13193                  Of course, there's also no point in trying to compute
13194                  minimum or maximum values if we're in a template.  */
13195               TREE_TYPE (value) = enumtype;
13196
13197               if (!minnode)
13198                 minnode = maxnode = value;
13199               else if (tree_int_cst_lt (maxnode, value))
13200                 maxnode = value;
13201               else if (tree_int_cst_lt (value, minnode))
13202                 minnode = value;
13203             }
13204
13205           if (processing_template_decl)
13206             /* If this is just a template, leave the CONST_DECL
13207                alone.  That way tsubst_copy will find CONST_DECLs for
13208                CONST_DECLs, and not INTEGER_CSTs.  */
13209             ;
13210           else
13211             /* In the list we're building up, we want the enumeration
13212                values, not the CONST_DECLs.  */
13213             TREE_VALUE (pair) = value;
13214         }
13215     }
13216   else
13217     maxnode = minnode = integer_zero_node;
13218
13219   TYPE_VALUES (enumtype) = nreverse (values);
13220
13221   if (processing_template_decl)
13222     {
13223       tree scope = current_scope ();
13224       if (scope && TREE_CODE (scope) == FUNCTION_DECL)
13225         add_tree (build_min (TAG_DEFN, enumtype));
13226     }
13227   else
13228     {
13229       int unsignedp = tree_int_cst_sgn (minnode) >= 0;
13230       int lowprec = min_precision (minnode, unsignedp);
13231       int highprec = min_precision (maxnode, unsignedp);
13232       int precision = MAX (lowprec, highprec);
13233       tree tem;
13234
13235       TYPE_SIZE (enumtype) = NULL_TREE;
13236
13237       /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'.  */
13238
13239       TYPE_PRECISION (enumtype) = precision;
13240       if (unsignedp)
13241         fixup_unsigned_type (enumtype);
13242       else
13243         fixup_signed_type (enumtype);
13244
13245       if (flag_short_enums || (precision > TYPE_PRECISION (integer_type_node)))
13246         /* Use the width of the narrowest normal C type which is wide
13247            enough.  */
13248         TYPE_PRECISION (enumtype) = TYPE_PRECISION (type_for_size
13249                                                     (precision, 1));
13250       else
13251         TYPE_PRECISION (enumtype) = TYPE_PRECISION (integer_type_node);
13252
13253       TYPE_SIZE (enumtype) = 0;
13254       layout_type (enumtype);
13255
13256       /* Fix up all variant types of this enum type.  */
13257       for (tem = TYPE_MAIN_VARIANT (enumtype); tem;
13258            tem = TYPE_NEXT_VARIANT (tem))
13259         {
13260           TYPE_VALUES (tem) = TYPE_VALUES (enumtype);
13261           TYPE_MIN_VALUE (tem) = TYPE_MIN_VALUE (enumtype);
13262           TYPE_MAX_VALUE (tem) = TYPE_MAX_VALUE (enumtype);
13263           TYPE_SIZE (tem) = TYPE_SIZE (enumtype);
13264           TYPE_SIZE_UNIT (tem) = TYPE_SIZE_UNIT (enumtype);
13265           TYPE_MODE (tem) = TYPE_MODE (enumtype);
13266           TYPE_PRECISION (tem) = TYPE_PRECISION (enumtype);
13267           TYPE_ALIGN (tem) = TYPE_ALIGN (enumtype);
13268           TYPE_USER_ALIGN (tem) = TYPE_USER_ALIGN (enumtype);
13269           TREE_UNSIGNED (tem) = TREE_UNSIGNED (enumtype);
13270         }
13271
13272       /* Finish debugging output for this type.  */
13273       rest_of_type_compilation (enumtype, namespace_bindings_p ());
13274     }
13275
13276   return enumtype;
13277 }
13278
13279 /* Build and install a CONST_DECL for an enumeration constant of the
13280    enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13281    Assignment of sequential values by default is handled here.  */
13282
13283 void
13284 build_enumerator (name, value, enumtype)
13285      tree name;
13286      tree value;
13287      tree enumtype;
13288 {
13289   tree decl;
13290   tree context;
13291   tree type;
13292   tree values;
13293
13294   /* Remove no-op casts from the value.  */
13295   if (value)
13296     STRIP_TYPE_NOPS (value);
13297
13298   if (! processing_template_decl)
13299     {
13300       /* Validate and default VALUE.  */
13301       if (value != NULL_TREE)
13302         {
13303           value = decl_constant_value (value);
13304
13305           if (TREE_CODE (value) == INTEGER_CST)
13306             {
13307               value = default_conversion (value);
13308               constant_expression_warning (value);
13309             }
13310           else
13311             {
13312               cp_error ("enumerator value for `%D' not integer constant", name);
13313               value = NULL_TREE;
13314             }
13315         }
13316
13317       /* Default based on previous value.  */
13318       if (value == NULL_TREE && ! processing_template_decl)
13319         {
13320           tree prev_value;
13321
13322           if (TYPE_VALUES (enumtype))
13323             {
13324               /* The next value is the previous value ... */
13325               prev_value = DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype)));
13326               /* ... plus one.  */
13327               value = cp_build_binary_op (PLUS_EXPR,
13328                                           prev_value,
13329                                           integer_one_node);
13330
13331               if (tree_int_cst_lt (value, prev_value))
13332                 cp_error ("overflow in enumeration values at `%D'", name);
13333             }
13334           else
13335             value = integer_zero_node;
13336         }
13337
13338       /* Remove no-op casts from the value.  */
13339       if (value)
13340         STRIP_TYPE_NOPS (value);
13341 #if 0
13342       /* To fix MAX_VAL enum consts. (bkoz)  */
13343       TREE_TYPE (value) = integer_type_node;
13344 #endif
13345     }
13346
13347   /* We always have to copy here; not all INTEGER_CSTs are unshared.
13348      Even in other cases, we will later (in finish_enum) be setting
13349      the type of VALUE.  But, we don't need to make a copy if this
13350      VALUE is one of the enumeration constants for this same
13351      enumeration type.  */
13352   for (values = TYPE_VALUES (enumtype); values; values = TREE_CHAIN (values))
13353     if (TREE_VALUE (values) == value)
13354       break;
13355   /* If we didn't break out of the loop, then we do need a copy.  */
13356   if (!values && value)
13357     value = copy_node (value);
13358
13359   /* C++ associates enums with global, function, or class declarations.  */
13360   context = current_scope ();
13361
13362   /* Build the actual enumeration constant.  Note that the enumeration
13363     constants have the type of their initializers until the
13364     enumeration is complete:
13365
13366       [ dcl.enum ]
13367
13368       Following the closing brace of an enum-specifier, each enumer-
13369       ator has the type of its enumeration.  Prior to the closing
13370       brace, the type of each enumerator is the type of its
13371       initializing value.
13372
13373     In finish_enum we will reset the type.  Of course, if we're
13374     processing a template, there may be no value.   */
13375   type = value ? TREE_TYPE (value) : NULL_TREE;
13376
13377   if (context && context == current_class_type)
13378     /* This enum declaration is local to the class.  We need the full
13379       lang_decl so that we can record DECL_CLASS_CONTEXT, for example.  */
13380     decl = build_lang_decl (CONST_DECL, name, type);
13381   else
13382     /* It's a global enum, or it's local to a function.  (Note local to
13383       a function could mean local to a class method.  */
13384     decl = build_decl (CONST_DECL, name, type);
13385
13386   DECL_CONTEXT (decl) = FROB_CONTEXT (context);
13387   DECL_INITIAL (decl) = value;
13388   TREE_READONLY (decl) = 1;
13389
13390   if (context && context == current_class_type)
13391     /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13392       on the TYPE_FIELDS list for `S'.  (That's so that you can say
13393       things like `S::i' later.)  */
13394     finish_member_declaration (decl);
13395   else
13396     {
13397       pushdecl (decl);
13398       GNU_xref_decl (current_function_decl, decl);
13399     }
13400
13401   /* Add this enumeration constant to the list for this type.  */
13402   TYPE_VALUES (enumtype) = tree_cons (name, decl, TYPE_VALUES (enumtype));
13403 }
13404
13405 \f
13406 static int function_depth;
13407
13408 /* We're defining DECL.  Make sure that it's type is OK.  */
13409
13410 static void
13411 check_function_type (decl)
13412      tree decl;
13413 {
13414   tree fntype = TREE_TYPE (decl);
13415   tree return_type = complete_type (TREE_TYPE (fntype));
13416
13417   /* In a function definition, arg types must be complete.  */
13418   require_complete_types_for_parms (current_function_parms);
13419
13420   if (!COMPLETE_OR_VOID_TYPE_P (return_type))
13421     {
13422       cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype));
13423
13424       /* Make it return void instead, but don't change the
13425          type of the DECL_RESULT, in case we have a named return value.  */
13426       if (TREE_CODE (fntype) == METHOD_TYPE)
13427         {
13428           tree ctype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype)));
13429           TREE_TYPE (decl)
13430             = build_cplus_method_type (ctype,
13431                                        void_type_node,
13432                                        FUNCTION_ARG_CHAIN (decl));
13433         }
13434       else
13435         TREE_TYPE (decl)
13436           = build_function_type (void_type_node,
13437                                  TYPE_ARG_TYPES (TREE_TYPE (decl)));
13438       TREE_TYPE (decl)
13439         = build_exception_variant (fntype,
13440                                    TYPE_RAISES_EXCEPTIONS (fntype));
13441     }
13442   else
13443     abstract_virtuals_error (decl, TREE_TYPE (fntype));
13444 }
13445
13446 /* Create the FUNCTION_DECL for a function definition.
13447    DECLSPECS and DECLARATOR are the parts of the declaration;
13448    they describe the function's name and the type it returns,
13449    but twisted together in a fashion that parallels the syntax of C.
13450
13451    FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13452    DECLARATOR is really the DECL for the function we are about to
13453    process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13454    indicating that the function is an inline defined in-class, and
13455    SF_EXPAND indicating that we should generate RTL for this
13456    function.
13457
13458    This function creates a binding context for the function body
13459    as well as setting up the FUNCTION_DECL in current_function_decl.
13460
13461    Returns 1 on success.  If the DECLARATOR is not suitable for a function
13462    (it defines a datum instead), we return 0, which tells
13463    yyparse to report a parse error.
13464
13465    For C++, we must first check whether that datum makes any sense.
13466    For example, "class A local_a(1,2);" means that variable local_a
13467    is an aggregate of type A, which should have a constructor
13468    applied to it with the argument list [1, 2].  */
13469
13470 int
13471 start_function (declspecs, declarator, attrs, flags)
13472      tree declspecs, declarator, attrs;
13473      int flags;
13474 {
13475   tree decl1;
13476   tree ctype = NULL_TREE;
13477   tree fntype;
13478   tree restype;
13479   extern int have_extern_spec;
13480   extern int used_extern_spec;
13481   int doing_friend = 0;
13482   struct binding_level *bl;
13483
13484   /* Sanity check.  */
13485   my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node)) == VOID_TYPE, 160);
13486   my_friendly_assert (TREE_CHAIN (void_list_node) == NULL_TREE, 161);
13487
13488   /* This should only be done once on the top most decl.  */
13489   if (have_extern_spec && !used_extern_spec)
13490     {
13491       declspecs = decl_tree_cons (NULL_TREE, get_identifier ("extern"), declspecs);
13492       used_extern_spec = 1;
13493     }
13494
13495   if (flags & SF_PRE_PARSED)
13496     {
13497       decl1 = declarator;
13498
13499       fntype = TREE_TYPE (decl1);
13500       if (TREE_CODE (fntype) == METHOD_TYPE)
13501         ctype = TYPE_METHOD_BASETYPE (fntype);
13502
13503       /* ISO C++ 11.4/5.  A friend function defined in a class is in
13504          the (lexical) scope of the class in which it is defined.  */
13505       if (!ctype && DECL_FRIEND_P (decl1))
13506         {
13507           ctype = DECL_FRIEND_CONTEXT (decl1);
13508
13509           /* CTYPE could be null here if we're dealing with a template;
13510              for example, `inline friend float foo()' inside a template
13511              will have no CTYPE set.  */
13512           if (ctype && TREE_CODE (ctype) != RECORD_TYPE)
13513             ctype = NULL_TREE;
13514           else
13515             doing_friend = 1;
13516         }
13517
13518       last_function_parms = DECL_ARGUMENTS (decl1);
13519       last_function_parm_tags = NULL_TREE;
13520     }
13521   else
13522     {
13523       decl1 = grokdeclarator (declarator, declspecs, FUNCDEF, 1, NULL_TREE);
13524       /* If the declarator is not suitable for a function definition,
13525          cause a syntax error.  */
13526       if (decl1 == NULL_TREE || TREE_CODE (decl1) != FUNCTION_DECL) return 0;
13527
13528       fntype = TREE_TYPE (decl1);
13529
13530       restype = TREE_TYPE (fntype);
13531       if (CLASS_TYPE_P (restype) && !CLASSTYPE_GOT_SEMICOLON (restype))
13532         {
13533           cp_error ("semicolon missing after declaration of `%#T'", restype);
13534           shadow_tag (build_tree_list (NULL_TREE, restype));
13535           CLASSTYPE_GOT_SEMICOLON (restype) = 1;
13536           if (TREE_CODE (fntype) == FUNCTION_TYPE)
13537             fntype = build_function_type (integer_type_node,
13538                                           TYPE_ARG_TYPES (fntype));
13539           else
13540             fntype = build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype), TREE_READONLY (decl1), TREE_SIDE_EFFECTS (decl1)),
13541                                               integer_type_node,
13542                                               TYPE_ARG_TYPES (fntype));
13543           TREE_TYPE (decl1) = fntype;
13544         }
13545
13546       if (TREE_CODE (fntype) == METHOD_TYPE)
13547         ctype = TYPE_METHOD_BASETYPE (fntype);
13548       else if (DECL_MAIN_P (decl1))
13549         {
13550           /* If this doesn't return integer_type, complain.  */
13551           if (TREE_TYPE (TREE_TYPE (decl1)) != integer_type_node)
13552             {
13553               if (pedantic || warn_return_type)
13554                 pedwarn ("return type for `main' changed to `int'");
13555               TREE_TYPE (decl1) = fntype = default_function_type;
13556             }
13557         }
13558     }
13559
13560   /* Sometimes we don't notice that a function is a static member, and
13561      build a METHOD_TYPE for it.  Fix that up now.  */
13562   if (ctype != NULL_TREE && DECL_STATIC_FUNCTION_P (decl1)
13563       && TREE_CODE (TREE_TYPE (decl1)) == METHOD_TYPE)
13564     {
13565       revert_static_member_fn (decl1);
13566       last_function_parms = TREE_CHAIN (last_function_parms);
13567       ctype = NULL_TREE;
13568     }
13569
13570   /* Warn if function was previously implicitly declared
13571      (but not if we warned then).  */
13572   if (! warn_implicit
13573       && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)) != NULL_TREE)
13574     cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)));
13575
13576   /* Set up current_class_type, and enter the scope of the class, if
13577      appropriate.  */
13578   if (ctype)
13579     push_nested_class (ctype, 1);
13580   else if (DECL_STATIC_FUNCTION_P (decl1))
13581     push_nested_class (DECL_CONTEXT (decl1), 2);
13582
13583   /* Now that we have entered the scope of the class, we must restore
13584      the bindings for any template parameters surrounding DECL1, if it
13585      is an inline member template.  (Order is important; consider the
13586      case where a template parameter has the same name as a field of
13587      the class.)  It is not until after this point that
13588      PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly.  */
13589   if (flags & SF_INCLASS_INLINE)
13590     maybe_begin_member_template_processing (decl1);
13591
13592   /* Effective C++ rule 15.  See also c_expand_return.  */
13593   if (warn_ecpp
13594       && DECL_OVERLOADED_OPERATOR_P (decl1) == NOP_EXPR
13595       && TREE_CODE (TREE_TYPE (fntype)) == VOID_TYPE)
13596     cp_warning ("`operator=' should return a reference to `*this'");
13597
13598   /* Make the init_value nonzero so pushdecl knows this is not tentative.
13599      error_mark_node is replaced below (in poplevel) with the BLOCK.  */
13600   if (!DECL_INITIAL (decl1))
13601     DECL_INITIAL (decl1) = error_mark_node;
13602
13603 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13604   SET_DEFAULT_DECL_ATTRIBUTES (decl1, attrs);
13605 #endif
13606
13607   /* This function exists in static storage.
13608      (This does not mean `static' in the C sense!)  */
13609   TREE_STATIC (decl1) = 1;
13610
13611   /* We must call push_template_decl after current_class_type is set
13612      up.  (If we are processing inline definitions after exiting a
13613      class scope, current_class_type will be NULL_TREE until set above
13614      by push_nested_class.)  */
13615   if (processing_template_decl)
13616     decl1 = push_template_decl (decl1);
13617
13618   /* We are now in the scope of the function being defined.  */
13619   current_function_decl = decl1;
13620
13621   /* Save the parm names or decls from this function's declarator
13622      where store_parm_decls will find them.  */
13623   current_function_parms = last_function_parms;
13624   current_function_parm_tags = last_function_parm_tags;
13625
13626   /* Make sure the parameter and return types are reasonable.  When
13627      you declare a function, these types can be incomplete, but they
13628      must be complete when you define the function.  */
13629   if (! processing_template_decl)
13630     check_function_type (decl1);
13631
13632   /* Build the return declaration for the function.  */
13633   restype = TREE_TYPE (fntype);
13634   if (!processing_template_decl)
13635     {
13636       if (!DECL_RESULT (decl1))
13637         {
13638           DECL_RESULT (decl1)
13639             = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype));
13640           c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype),
13641                                       DECL_RESULT (decl1));
13642         }
13643     }
13644   else
13645     /* Just use `void'.  Nobody will ever look at this anyhow.  */
13646     DECL_RESULT (decl1) = build_decl (RESULT_DECL, 0, void_type_node);
13647
13648   /* Initialize RTL machinery.  We cannot do this until
13649      CURRENT_FUNCTION_DECL and DECL_RESULT are set up.  We do this
13650      even when processing a template; this is how we get
13651      CFUN set up, and our per-function variables initialized.  */
13652   bl = current_binding_level;
13653   init_function_start (decl1, input_filename, lineno);
13654   current_binding_level = bl;
13655   expanding_p = (flags & SF_EXPAND) != 0;
13656
13657   /* Even though we're inside a function body, we still don't want to
13658      call expand_expr to calculate the size of a variable-sized array.
13659      We haven't necessarily assigned RTL to all variables yet, so it's
13660      not safe to try to expand expressions involving them.  */
13661   immediate_size_expand = 0;
13662   cfun->x_dont_save_pending_sizes_p = 1;
13663
13664   /* If we're building a statement-tree, start the tree now.  */
13665   if (processing_template_decl || !expanding_p)
13666     begin_stmt_tree (&DECL_SAVED_TREE (decl1));
13667
13668   /* Let the user know we're compiling this function.  */
13669   announce_function (decl1);
13670
13671   /* Record the decl so that the function name is defined.
13672      If we already have a decl for this name, and it is a FUNCTION_DECL,
13673      use the old decl.  */
13674   if (!processing_template_decl && !(flags & SF_PRE_PARSED))
13675     {
13676       /* A specialization is not used to guide overload resolution.  */
13677       if (!DECL_TEMPLATE_SPECIALIZATION (decl1)
13678           && ! DECL_FUNCTION_MEMBER_P (decl1))
13679         decl1 = pushdecl (decl1);
13680       else
13681         {
13682           /* We need to set the DECL_CONTEXT. */
13683           if (!DECL_CONTEXT (decl1) && DECL_TEMPLATE_INFO (decl1))
13684             DECL_CONTEXT (decl1) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1));
13685           /* And make sure we have enough default args.  */
13686           check_default_args (decl1);
13687         }
13688       fntype = TREE_TYPE (decl1);
13689     }
13690
13691   /* Reset these in case the call to pushdecl changed them.  */
13692   current_function_decl = decl1;
13693   cfun->decl = decl1;
13694
13695   /* Initialize the per-function data.  */
13696   if (!DECL_PENDING_INLINE_P (decl1) && DECL_SAVED_FUNCTION_DATA (decl1))
13697     {
13698       /* If we already parsed this function, and we're just expanding it
13699          now, restore saved state.  */
13700       struct binding_level *bl = current_binding_level;
13701       *cp_function_chain = *DECL_SAVED_FUNCTION_DATA (decl1);
13702       current_binding_level = bl;
13703
13704       /* This function is being processed in whole-function mode; we
13705          already did semantic analysis.  */
13706       cfun->x_whole_function_mode_p = 1;
13707
13708       /* If we decided that we didn't want to inline this function,
13709          make sure the back-end knows that.  */
13710       if (!current_function_cannot_inline)
13711         current_function_cannot_inline = cp_function_chain->cannot_inline;
13712
13713       /* We don't need the saved data anymore.  */
13714       free (DECL_SAVED_FUNCTION_DATA (decl1));
13715       DECL_SAVED_FUNCTION_DATA (decl1) = NULL;
13716     }
13717   else if (ctype && !doing_friend && !DECL_STATIC_FUNCTION_P (decl1))
13718     {
13719       /* We know that this was set up by `grokclassfn'.  We do not
13720          wait until `store_parm_decls', since evil parse errors may
13721          never get us to that point.  Here we keep the consistency
13722          between `current_class_type' and `current_class_ptr'.  */
13723       tree t = DECL_ARGUMENTS (decl1);
13724
13725       my_friendly_assert (t != NULL_TREE && TREE_CODE (t) == PARM_DECL,
13726                           162);
13727       my_friendly_assert (TREE_CODE (TREE_TYPE (t)) == POINTER_TYPE,
13728                           19990811);
13729
13730       cp_function_chain->x_current_class_ref
13731         = build_indirect_ref (t, NULL_PTR);
13732       cp_function_chain->x_current_class_ptr = t;
13733
13734       /* Constructors and destructors need to know whether they're "in
13735          charge" of initializing virtual base classes.  */
13736       if (DECL_HAS_IN_CHARGE_PARM_P (decl1))
13737         current_in_charge_parm = TREE_CHAIN (t);
13738     }
13739
13740   if (DECL_INTERFACE_KNOWN (decl1))
13741     {
13742       tree ctx = decl_function_context (decl1);
13743
13744       if (DECL_NOT_REALLY_EXTERN (decl1))
13745         DECL_EXTERNAL (decl1) = 0;
13746
13747       if (ctx != NULL_TREE && DECL_THIS_INLINE (ctx)
13748           && TREE_PUBLIC (ctx))
13749         /* This is a function in a local class in an extern inline
13750            function.  */
13751         comdat_linkage (decl1);
13752     }
13753   /* If this function belongs to an interface, it is public.
13754      If it belongs to someone else's interface, it is also external.
13755      This only affects inlines and template instantiations.  */
13756   else if (interface_unknown == 0
13757            && (! DECL_TEMPLATE_INSTANTIATION (decl1)
13758                || flag_alt_external_templates))
13759     {
13760       if (DECL_THIS_INLINE (decl1) || DECL_TEMPLATE_INSTANTIATION (decl1)
13761           || processing_template_decl)
13762         {
13763           DECL_EXTERNAL (decl1)
13764             = (interface_only
13765                || (DECL_THIS_INLINE (decl1) && ! flag_implement_inlines
13766                    && !DECL_VINDEX (decl1)));
13767
13768           /* For WIN32 we also want to put these in linkonce sections.  */
13769           maybe_make_one_only (decl1);
13770         }
13771       else
13772         DECL_EXTERNAL (decl1) = 0;
13773       DECL_NOT_REALLY_EXTERN (decl1) = 0;
13774       DECL_INTERFACE_KNOWN (decl1) = 1;
13775     }
13776   else if (interface_unknown && interface_only
13777            && (! DECL_TEMPLATE_INSTANTIATION (decl1)
13778                || flag_alt_external_templates))
13779     {
13780       /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13781          interface, we will have interface_only set but not
13782          interface_known.  In that case, we don't want to use the normal
13783          heuristics because someone will supply a #pragma implementation
13784          elsewhere, and deducing it here would produce a conflict.  */
13785       comdat_linkage (decl1);
13786       DECL_EXTERNAL (decl1) = 0;
13787       DECL_INTERFACE_KNOWN (decl1) = 1;
13788       DECL_DEFER_OUTPUT (decl1) = 1;
13789     }
13790   else
13791     {
13792       /* This is a definition, not a reference.
13793          So clear DECL_EXTERNAL.  */
13794       DECL_EXTERNAL (decl1) = 0;
13795
13796       if ((DECL_THIS_INLINE (decl1) || DECL_TEMPLATE_INSTANTIATION (decl1))
13797           && ! DECL_INTERFACE_KNOWN (decl1)
13798           /* Don't try to defer nested functions for now.  */
13799           && ! decl_function_context (decl1))
13800         DECL_DEFER_OUTPUT (decl1) = 1;
13801       else
13802         DECL_INTERFACE_KNOWN (decl1) = 1;
13803     }
13804
13805   if (doing_semantic_analysis_p ())
13806     {
13807       pushlevel (0);
13808       current_binding_level->parm_flag = 1;
13809     }
13810
13811   if (attrs)
13812     cplus_decl_attributes (decl1, NULL_TREE, attrs);
13813
13814   if (!building_stmt_tree ())
13815     {
13816       GNU_xref_function (decl1, current_function_parms);
13817       make_function_rtl (decl1);
13818     }
13819
13820   /* Promote the value to int before returning it.  */
13821   if (C_PROMOTING_INTEGER_TYPE_P (restype))
13822     restype = type_promotes_to (restype);
13823
13824   /* If this fcn was already referenced via a block-scope `extern' decl
13825      (or an implicit decl), propagate certain information about the usage.  */
13826   if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1)))
13827     TREE_ADDRESSABLE (decl1) = 1;
13828
13829   if (DECL_RESULT (decl1) == NULL_TREE)
13830     {
13831       DECL_RESULT (decl1)
13832         = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype));
13833       TREE_READONLY (DECL_RESULT (decl1)) = CP_TYPE_CONST_P (restype);
13834       TREE_THIS_VOLATILE (DECL_RESULT (decl1)) = CP_TYPE_VOLATILE_P (restype);
13835     }
13836
13837   ++function_depth;
13838
13839   if (DECL_DESTRUCTOR_P (decl1))
13840     {
13841       dtor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13842       DECL_CONTEXT (dtor_label) = current_function_decl;
13843     }
13844   /* Under the old ABI we return `this' from constructors, so we make
13845      ordinary `return' statements in constructors jump to CTOR_LABEL;
13846      from there we return `this'.  Under the new ABI, we don't bother
13847      with any of this.  By not setting CTOR_LABEL the remainder of the
13848      machinery is automatically disabled.  */
13849   else if (!flag_new_abi && DECL_CONSTRUCTOR_P (decl1))
13850     {
13851       ctor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13852       DECL_CONTEXT (ctor_label) = current_function_decl;
13853     }
13854
13855   return 1;
13856 }
13857 \f
13858 /* Called after store_parm_decls for a function-try-block.  */
13859
13860 void
13861 expand_start_early_try_stmts ()
13862 {
13863   expand_start_try_stmts ();
13864 }
13865
13866 /* Store the parameter declarations into the current function declaration.
13867    This is called after parsing the parameter declarations, before
13868    digesting the body of the function.
13869
13870    Also install to binding contour return value identifier, if any.  */
13871
13872 void
13873 store_parm_decls ()
13874 {
13875   register tree fndecl = current_function_decl;
13876   register tree parm;
13877   int parms_have_cleanups = 0;
13878   tree cleanups = NULL_TREE;
13879
13880   /* This is a list of types declared among parms in a prototype.  */
13881   tree parmtags = current_function_parm_tags;
13882
13883   /* This is a chain of any other decls that came in among the parm
13884      declarations.  If a parm is declared with  enum {foo, bar} x;
13885      then CONST_DECLs for foo and bar are put here.  */
13886   tree nonparms = NULL_TREE;
13887
13888   /* Create a binding level for the parms.  */
13889   if (!building_stmt_tree ())
13890     expand_start_bindings (2);
13891
13892   if (current_function_parms)
13893     {
13894       /* This case is when the function was defined with an ANSI prototype.
13895          The parms already have decls, so we need not do anything here
13896          except record them as in effect
13897          and complain if any redundant old-style parm decls were written.  */
13898
13899       tree specparms = current_function_parms;
13900       tree next;
13901
13902       if (doing_semantic_analysis_p ())
13903         {
13904           /* Must clear this because it might contain TYPE_DECLs declared
13905              at class level.  */
13906           storedecls (NULL_TREE);
13907
13908           /* If we're doing semantic analysis, then we'll call pushdecl
13909              for each of these.  We must do them in reverse order so that
13910              they end in the correct forward order.  */
13911           specparms = nreverse (specparms);
13912         }
13913
13914       for (parm = specparms; parm; parm = next)
13915         {
13916           next = TREE_CHAIN (parm);
13917           if (TREE_CODE (parm) == PARM_DECL)
13918             {
13919               tree type = TREE_TYPE (parm);
13920
13921               if (doing_semantic_analysis_p ())
13922                 {
13923                   tree cleanup;
13924
13925                   if (DECL_NAME (parm) == NULL_TREE
13926                       || TREE_CODE (parm) != VOID_TYPE)
13927                     pushdecl (parm);
13928                   else
13929                     cp_error ("parameter `%D' declared void", parm);
13930
13931                   cleanup = (processing_template_decl
13932                              ? NULL_TREE
13933                              : maybe_build_cleanup (parm));
13934
13935                   if (cleanup)
13936                     cleanups = tree_cons (parm, cleanup, cleanups);
13937                 }
13938               else if (type != error_mark_node
13939                        && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
13940                 parms_have_cleanups = 1;
13941             }
13942           else
13943             {
13944               /* If we find an enum constant or a type tag,
13945                  put it aside for the moment.  */
13946               TREE_CHAIN (parm) = NULL_TREE;
13947               nonparms = chainon (nonparms, parm);
13948             }
13949         }
13950
13951       if (doing_semantic_analysis_p ())
13952         {
13953           /* Get the decls in their original chain order
13954              and record in the function.  This is all and only the
13955              PARM_DECLs that were pushed into scope by the loop above.  */
13956           DECL_ARGUMENTS (fndecl) = getdecls ();
13957           storetags (chainon (parmtags, gettags ()));
13958         }
13959     }
13960   else
13961     DECL_ARGUMENTS (fndecl) = NULL_TREE;
13962
13963   /* Now store the final chain of decls for the arguments
13964      as the decl-chain of the current lexical scope.
13965      Put the enumerators in as well, at the front so that
13966      DECL_ARGUMENTS is not modified.  */
13967   if (doing_semantic_analysis_p ())
13968     storedecls (chainon (nonparms, DECL_ARGUMENTS (fndecl)));
13969
13970   /* Initialize the RTL code for the function.  */
13971   DECL_SAVED_INSNS (fndecl) = 0;
13972   if (! building_stmt_tree ())
13973     expand_function_start (fndecl, parms_have_cleanups);
13974
13975   current_function_parms_stored = 1;
13976
13977   /* If this function is `main', emit a call to `__main'
13978      to run global initializers, etc.  */
13979   if (DECL_MAIN_P (fndecl) && !building_stmt_tree ())
13980     expand_main_function ();
13981
13982   /* Now that we have initialized the parms, we can start their
13983      cleanups.  We cannot do this before, since expand_decl_cleanup
13984      should not be called before the parm can be used.  */
13985   while (cleanups)
13986     {
13987       finish_decl_cleanup (TREE_PURPOSE (cleanups),
13988                            TREE_VALUE (cleanups));
13989       cleanups = TREE_CHAIN (cleanups);
13990     }
13991
13992   /* Create a binding contour which can be used to catch
13993      cleanup-generated temporaries.  Also, if the return value needs or
13994      has initialization, deal with that now.  */
13995   if (parms_have_cleanups)
13996     {
13997       pushlevel (0);
13998       if (!building_stmt_tree ())
13999         expand_start_bindings (2);
14000     }
14001
14002   /* Do the starting of the exception specifications, if we have any.  */
14003   if (flag_exceptions && !processing_template_decl
14004       && flag_enforce_eh_specs
14005       && building_stmt_tree ()
14006       && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl)))
14007     current_eh_spec_try_block = expand_start_eh_spec ();
14008 }
14009
14010 /* Bind a name and initialization to the return value of
14011    the current function.  */
14012
14013 void
14014 store_return_init (decl)
14015      tree decl;
14016 {
14017   /* If this named return value comes in a register, put it in a
14018      pseudo-register.  */
14019   if (DECL_REGISTER (decl))
14020     {
14021       original_result_rtx = DECL_RTL (decl);
14022       /* Note that the mode of the old DECL_RTL may be wider than the
14023          mode of DECL_RESULT, depending on the calling conventions for
14024          the processor.  For example, on the Alpha, a 32-bit integer
14025          is returned in a DImode register -- the DECL_RESULT has
14026          SImode but the DECL_RTL for the DECL_RESULT has DImode.  So,
14027          here, we use the mode the back-end has already assigned for
14028          the return value.  */
14029       DECL_RTL (decl) = gen_reg_rtx (GET_MODE (original_result_rtx));
14030       if (TREE_ADDRESSABLE (decl))
14031         put_var_into_stack (decl);
14032     }
14033 }
14034
14035 \f
14036 /* We have finished doing semantic analysis on DECL, but have not yet
14037    generated RTL for its body.  Save away our current state, so that
14038    when we want to generate RTL later we know what to do.  */
14039
14040 static void
14041 save_function_data (decl)
14042      tree decl;
14043 {
14044   struct language_function *f;
14045
14046   /* Save the language-specific per-function data so that we can
14047      get it back when we really expand this function.  */
14048   my_friendly_assert (!DECL_PENDING_INLINE_P (decl),
14049                       19990908);
14050
14051   /* Make a copy.  */
14052   f = ((struct language_function *)
14053        xmalloc (sizeof (struct language_function)));
14054   bcopy ((char *) cp_function_chain, (char *) f,
14055          sizeof (struct language_function));
14056   DECL_SAVED_FUNCTION_DATA (decl) = f;
14057
14058   /* Clear out the bits we don't need.  */
14059   f->x_stmt_tree.x_last_stmt = NULL_TREE;
14060   f->x_stmt_tree.x_last_expr_type = NULL_TREE;
14061   f->x_result_rtx = NULL_RTX;
14062   f->x_named_label_uses = NULL;
14063   f->bindings = NULL;
14064
14065   /* When we get back here again, we will be expanding.  */
14066   f->x_expanding_p = 1;
14067
14068   /* If we've already decided that we cannot inline this function, we
14069      must remember that fact when we actually go to expand the
14070      function.  */
14071   f->cannot_inline = current_function_cannot_inline;
14072 }
14073
14074 /* At the end of every constructor we generate to code to return
14075    `this'.  Do that now.  */
14076
14077 static void
14078 finish_constructor_body ()
14079 {
14080   /* Any return from a constructor will end up here.  */
14081   if (ctor_label)
14082     add_tree (build_min_nt (LABEL_STMT, ctor_label));
14083
14084   /* Clear CTOR_LABEL so that finish_return_stmt knows to really
14085      generate the return, rather than a goto to CTOR_LABEL.  */
14086   ctor_label = NULL_TREE;
14087   /* In check_return_expr we translate an empty return from a
14088      constructor to a return of `this'.  */
14089   finish_return_stmt (NULL_TREE);
14090   /* Mark the end of the constructor.  */
14091   add_tree (build_min_nt (CTOR_STMT));
14092 }
14093
14094 /* At the end of every destructor we generate code to restore virtual
14095    function tables to the values desired by base classes and to call
14096    to base class destructors.  Do that now.  */
14097
14098 static void
14099 finish_destructor_body ()
14100 {
14101   tree compound_stmt;
14102   tree virtual_size;
14103   tree exprstmt;
14104   tree if_stmt;
14105
14106   /* Create a block to contain all the extra code.  */
14107   compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
14108
14109   /* Any return from a destructor will end up here.  */
14110   add_tree (build_min_nt (LABEL_STMT, dtor_label));
14111
14112   /* Generate the code to call destructor on base class.  If this
14113      destructor belongs to a class with virtual functions, then set
14114      the virtual function table pointer to represent the type of our
14115      base class.  */
14116
14117   /* This side-effect makes call to `build_delete' generate the code
14118      we have to have at the end of this destructor.  `build_delete'
14119      will set the flag again.  */
14120   TYPE_HAS_DESTRUCTOR (current_class_type) = 0;
14121
14122   exprstmt = build_delete (current_class_type,
14123                            current_class_ref,
14124                            sfk_base_destructor,
14125                            LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
14126                            0);
14127
14128   if (exprstmt != error_mark_node
14129       && (TREE_CODE (exprstmt) != NOP_EXPR
14130           || TREE_OPERAND (exprstmt, 0) != integer_zero_node
14131           || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type)))
14132     {
14133       if (exprstmt != void_zero_node)
14134         /* Don't call `expand_expr_stmt' if we're not going to do
14135            anything, since -Wall will give a diagnostic.  */
14136         finish_expr_stmt (exprstmt);
14137
14138       /* Run destructors for all virtual baseclasses.  */
14139       if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
14140         {
14141           tree vbases;
14142           tree if_stmt;
14143
14144           if_stmt = begin_if_stmt ();
14145           finish_if_stmt_cond (build (BIT_AND_EXPR, integer_type_node,
14146                                       current_in_charge_parm,
14147                                       integer_two_node),
14148                                if_stmt);
14149
14150           vbases = CLASSTYPE_VBASECLASSES (current_class_type);
14151           /* The CLASSTYPE_VBASECLASSES list is in initialization
14152              order, so we have to march through it in reverse order.  */
14153           for (vbases = nreverse (copy_list (vbases));
14154                vbases;
14155                vbases = TREE_CHAIN (vbases))
14156             {
14157               tree vbase = TREE_VALUE (vbases);
14158
14159               if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (vbase)))
14160                 {
14161                   tree vb = get_vbase
14162                     (BINFO_TYPE (vbase),
14163                      TYPE_BINFO (current_class_type));
14164                   finish_expr_stmt
14165                     (build_scoped_method_call
14166                      (current_class_ref, vb, base_dtor_identifier,
14167                       NULL_TREE));
14168                 }
14169             }
14170
14171           finish_then_clause (if_stmt);
14172           finish_if_stmt ();
14173         }
14174     }
14175
14176   virtual_size = c_sizeof (current_class_type);
14177
14178   /* At the end, call delete if that's what's requested.  */
14179
14180   /* FDIS sez: At the point of definition of a virtual destructor
14181      (including an implicit definition), non-placement operator delete
14182      shall be looked up in the scope of the destructor's class and if
14183      found shall be accessible and unambiguous.
14184
14185      This is somewhat unclear, but I take it to mean that if the class
14186      only defines placement deletes we don't do anything here.  So we
14187      pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
14188      they ever try to delete one of these.  */
14189   exprstmt = build_op_delete_call
14190     (DELETE_EXPR, current_class_ptr, virtual_size,
14191      LOOKUP_NORMAL | LOOKUP_SPECULATIVELY, NULL_TREE);
14192
14193   if_stmt = begin_if_stmt ();
14194   finish_if_stmt_cond (build (BIT_AND_EXPR, integer_type_node,
14195                               current_in_charge_parm,
14196                               integer_one_node),
14197                        if_stmt);
14198   finish_expr_stmt (exprstmt);
14199   finish_then_clause (if_stmt);
14200   finish_if_stmt ();
14201
14202   /* Close the block we started above.  */
14203   finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
14204 }
14205
14206 /* Finish up a function declaration and compile that function
14207    all the way to assembler language output.  The free the storage
14208    for the function definition.
14209
14210    FLAGS is a bitwise or of the following values:
14211      1 - CALL_POPLEVEL
14212        An extra call to poplevel (and expand_end_bindings) must be
14213        made to take care of the binding contour for the base
14214        initializers.  This is only relevant for constructors.
14215      2 - INCLASS_INLINE
14216        We just finished processing the body of an in-class inline
14217        function definition.  (This processing will have taken place
14218        after the class definition is complete.)  */
14219
14220 tree
14221 finish_function (flags)
14222      int flags;
14223 {
14224   register tree fndecl = current_function_decl;
14225   tree fntype, ctype = NULL_TREE;
14226   /* Label to use if this function is supposed to return a value.  */
14227   tree no_return_label = NULL_TREE;
14228   int call_poplevel = (flags & 1) != 0;
14229   int inclass_inline = (flags & 2) != 0;
14230   int expand_p;
14231   int nested;
14232   int current_line = lineno;
14233
14234   /* When we get some parse errors, we can end up without a
14235      current_function_decl, so cope.  */
14236   if (fndecl == NULL_TREE)
14237     return error_mark_node;
14238
14239   nested = function_depth > 1;
14240   fntype = TREE_TYPE (fndecl);
14241
14242   /*  TREE_READONLY (fndecl) = 1;
14243       This caused &foo to be of type ptr-to-const-function
14244       which then got a warning when stored in a ptr-to-function variable.  */
14245
14246   /* This happens on strange parse errors.  */
14247   if (! current_function_parms_stored)
14248     {
14249       call_poplevel = 0;
14250       store_parm_decls ();
14251     }
14252
14253   /* For a cloned function, we've already got all the code we need;
14254      there's no need to add any extra bits.  */
14255   if (building_stmt_tree () && DECL_CLONED_FUNCTION_P (fndecl))
14256     ;
14257   else if (building_stmt_tree ())
14258     {
14259       if (DECL_CONSTRUCTOR_P (fndecl))
14260         {
14261           finish_constructor_body ();
14262           if (call_poplevel)
14263             do_poplevel ();
14264         }
14265       else if (DECL_DESTRUCTOR_P (fndecl) && !processing_template_decl)
14266         finish_destructor_body ();
14267       else if (DECL_MAIN_P (fndecl))
14268         {
14269           /* Make it so that `main' always returns 0 by default.  */
14270 #ifdef VMS
14271           finish_return_stmt (integer_one_node);
14272 #else
14273           finish_return_stmt (integer_zero_node);
14274 #endif
14275         }
14276
14277       /* Finish dealing with exception specifiers.  */
14278       if (flag_exceptions && !processing_template_decl
14279           && flag_enforce_eh_specs
14280           && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl)))
14281         expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
14282                             (TREE_TYPE (current_function_decl)),
14283                             current_eh_spec_try_block);
14284     }
14285   else
14286     {
14287 #if 0
14288       if (write_symbols != NO_DEBUG /*&& TREE_CODE (fntype) != METHOD_TYPE*/)
14289         {
14290           /* Keep this code around in case we later want to control debug info
14291              based on whether a type is "used".  (jason 1999-11-11) */
14292
14293           tree ttype = target_type (fntype);
14294           tree parmdecl;
14295
14296           if (IS_AGGR_TYPE (ttype))
14297             /* Let debugger know it should output info for this type.  */
14298             note_debug_info_needed (ttype);
14299
14300           for (parmdecl = DECL_ARGUMENTS (fndecl); parmdecl; parmdecl = TREE_CHAIN (parmdecl))
14301             {
14302               ttype = target_type (TREE_TYPE (parmdecl));
14303               if (IS_AGGR_TYPE (ttype))
14304                 /* Let debugger know it should output info for this type.  */
14305                 note_debug_info_needed (ttype);
14306             }
14307         }
14308 #endif
14309
14310       /* Clean house because we will need to reorder insns here.  */
14311       do_pending_stack_adjust ();
14312
14313       if (dtor_label)
14314         ;
14315       else if (DECL_CONSTRUCTOR_P (fndecl))
14316         {
14317           if (call_poplevel)
14318             do_poplevel ();
14319         }
14320       else if (return_label != NULL_RTX
14321                && flag_this_is_variable <= 0
14322                && current_function_return_value == NULL_TREE
14323                && ! DECL_NAME (DECL_RESULT (current_function_decl)))
14324         no_return_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
14325
14326       if (flag_exceptions)
14327         expand_exception_blocks ();
14328
14329       /* If this function is supposed to return a value, ensure that
14330          we do not fall into the cleanups by mistake.  The end of our
14331          function will look like this:
14332
14333          user code (may have return stmt somewhere)
14334          goto no_return_label
14335          cleanup_label:
14336          cleanups
14337          goto return_label
14338          no_return_label:
14339          NOTE_INSN_FUNCTION_END
14340          return_label:
14341          things for return
14342
14343          If the user omits a return stmt in the USER CODE section, we
14344          will have a control path which reaches NOTE_INSN_FUNCTION_END.
14345          Otherwise, we won't.  */
14346       if (no_return_label)
14347         {
14348           DECL_CONTEXT (no_return_label) = fndecl;
14349           DECL_INITIAL (no_return_label) = error_mark_node;
14350           DECL_SOURCE_FILE (no_return_label) = input_filename;
14351           DECL_SOURCE_LINE (no_return_label) = current_line;
14352           expand_goto (no_return_label);
14353         }
14354
14355       if (cleanup_label)
14356         {
14357           /* Remove the binding contour which is used
14358              to catch cleanup-generated temporaries.  */
14359           expand_end_bindings (0, 0, 0);
14360           poplevel (0, 0, 0);
14361
14362           /* Emit label at beginning of cleanup code for parameters.  */
14363           emit_label (cleanup_label);
14364         }
14365
14366       /* Get return value into register if that's where it's supposed
14367          to be.  */
14368       if (original_result_rtx)
14369         fixup_result_decl (DECL_RESULT (fndecl), original_result_rtx);
14370
14371       /* Finish building code that will trigger warnings if users forget
14372          to make their functions return values.  */
14373       if (no_return_label || cleanup_label)
14374         emit_jump (return_label);
14375       if (no_return_label)
14376         {
14377           /* We don't need to call `expand_*_return' here because we
14378              don't need any cleanups here--this path of code is only
14379              for error checking purposes.  */
14380           expand_label (no_return_label);
14381         }
14382
14383       /* We hard-wired immediate_size_expand to zero in
14384          start_function.  Expand_function_end will decrement this
14385          variable.  So, we set the variable to one here, so that after
14386          the decrement it will remain zero.  */
14387       immediate_size_expand = 1;
14388
14389       /* Generate rtl for function exit.  */
14390       expand_function_end (input_filename, current_line, 1);
14391     }
14392
14393   /* We have to save this value here in case
14394      maybe_end_member_template_processing decides to pop all the
14395      template parameters.  */
14396   expand_p = !building_stmt_tree ();
14397
14398   /* If we're saving up tree structure, tie off the function now.  */
14399   if (!expand_p)
14400     finish_stmt_tree (&DECL_SAVED_TREE (fndecl));
14401
14402   /* This must come after expand_function_end because cleanups might
14403      have declarations (from inline functions) that need to go into
14404      this function's blocks.  */
14405   if (doing_semantic_analysis_p ())
14406     {
14407       if (current_binding_level->parm_flag != 1)
14408         my_friendly_abort (122);
14409       poplevel (1, 0, 1);
14410     }
14411
14412   /* Remember that we were in class scope.  */
14413   if (current_class_name)
14414     ctype = current_class_type;
14415
14416   /* Must mark the RESULT_DECL as being in this function.  */
14417   DECL_CONTEXT (DECL_RESULT (fndecl)) = fndecl;
14418
14419   /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14420      to the FUNCTION_DECL node itself.  */
14421   BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl;
14422
14423   /* Save away current state, if appropriate.  */
14424   if (!expanding_p && !processing_template_decl)
14425     save_function_data (fndecl);
14426
14427   /* If this function calls `setjmp' it cannot be inlined.  When
14428      `longjmp' is called it is not guaranteed to restore the value of
14429      local variables that have been modified since the call to
14430      `setjmp'.  So, if were to inline this function into some caller
14431      `c', then when we `longjmp', we might not restore all variables
14432      in `c'.  (It might seem, at first blush, that there's no way for
14433      this function to modify local variables in `c', but their
14434      addresses may have been stored somewhere accessible to this
14435      function.)  */
14436   if (!expanding_p && !processing_template_decl && calls_setjmp_p (fndecl))
14437     DECL_UNINLINABLE (fndecl) = 1;
14438
14439   if (expand_p)
14440     {
14441       int returns_null;
14442       int returns_value;
14443
14444       /* So we can tell if jump_optimize sets it to 1.  */
14445       can_reach_end = 0;
14446
14447       /* Before we call rest_of_compilation (which will pop the
14448          CURRENT_FUNCTION), we must save these values.  */
14449       returns_null = current_function_returns_null;
14450       returns_value = current_function_returns_value;
14451
14452       /* If this is a nested function (like a template instantiation
14453          that we're compiling in the midst of compiling something
14454          else), push a new GC context.  That will keep local variables
14455          on the stack from being collected while we're doing the
14456          compilation of this function.  */
14457       if (function_depth > 1)
14458         ggc_push_context ();
14459
14460       /* Run the optimizers and output the assembler code for this
14461          function.  */
14462       rest_of_compilation (fndecl);
14463
14464       /* Undo the call to ggc_push_context above.  */
14465       if (function_depth > 1)
14466         ggc_pop_context ();
14467
14468       if (DECL_SAVED_INSNS (fndecl) && ! TREE_ASM_WRITTEN (fndecl))
14469         {
14470           /* Set DECL_EXTERNAL so that assemble_external will be called as
14471              necessary.  We'll clear it again in finish_file.  */
14472           if (! DECL_EXTERNAL (fndecl))
14473             DECL_NOT_REALLY_EXTERN (fndecl) = 1;
14474           DECL_EXTERNAL (fndecl) = 1;
14475           defer_fn (fndecl);
14476         }
14477
14478 #if 0
14479       /* Keep this code around in case we later want to control debug info
14480          based on whether a type is "used".  (jason 1999-11-11) */
14481
14482       if (ctype && TREE_ASM_WRITTEN (fndecl))
14483         note_debug_info_needed (ctype);
14484 #endif
14485
14486       returns_null |= can_reach_end;
14487
14488       /* Since we don't normally go through c_expand_return for constructors,
14489          this normally gets the wrong value.
14490          Also, named return values have their return codes emitted after
14491          NOTE_INSN_FUNCTION_END, confusing jump.c.  */
14492       if (DECL_CONSTRUCTOR_P (fndecl)
14493           || DECL_NAME (DECL_RESULT (fndecl)) != NULL_TREE)
14494         returns_null = 0;
14495
14496       if (TREE_THIS_VOLATILE (fndecl) && returns_null)
14497         cp_warning ("`noreturn' function `%D' does return", fndecl);
14498       else if ((warn_return_type || pedantic)
14499                && returns_null
14500                && TREE_CODE (TREE_TYPE (fntype)) != VOID_TYPE)
14501         {
14502           /* If this function returns non-void and control can drop through,
14503              complain.  */
14504           cp_warning ("control reaches end of non-void function `%D'", fndecl);
14505         }
14506       /* With just -W, complain only if function returns both with
14507          and without a value.  */
14508       else if (extra_warnings && returns_value && returns_null)
14509         warning ("this function may return with or without a value");
14510     }
14511   else
14512     {
14513       /* Clear out memory we no longer need.  */
14514       free_after_parsing (cfun);
14515       /* Since we never call rest_of_compilation, we never clear
14516          CFUN.  Do so explicitly.  */
14517       free_after_compilation (cfun);
14518       cfun = NULL;
14519     }
14520
14521   /* If this is a in-class inline definition, we may have to pop the
14522      bindings for the template parameters that we added in
14523      maybe_begin_member_template_processing when start_function was
14524      called.  */
14525   if (inclass_inline)
14526     maybe_end_member_template_processing ();
14527
14528   /* Leave the scope of the class.  */
14529   if (ctype)
14530     pop_nested_class ();
14531
14532   --function_depth;
14533
14534   if (!DECL_SAVED_INSNS (fndecl) && !DECL_SAVED_FUNCTION_DATA (fndecl)
14535       && !(flag_inline_trees && DECL_INLINE (fndecl)))
14536     {
14537       tree t;
14538
14539       /* Stop pointing to the local nodes about to be freed.  */
14540       /* But DECL_INITIAL must remain nonzero so we know this
14541          was an actual function definition.  */
14542       DECL_INITIAL (fndecl) = error_mark_node;
14543       for (t = DECL_ARGUMENTS (fndecl); t; t = TREE_CHAIN (t))
14544         DECL_RTL (t) = DECL_INCOMING_RTL (t) = NULL_RTX;
14545     }
14546
14547   if (DECL_STATIC_CONSTRUCTOR (fndecl))
14548     static_ctors = tree_cons (NULL_TREE, fndecl, static_ctors);
14549   if (DECL_STATIC_DESTRUCTOR (fndecl))
14550     static_dtors = tree_cons (NULL_TREE, fndecl, static_dtors);
14551
14552   /* Clean up.  */
14553   if (! nested)
14554     {
14555       /* Let the error reporting routines know that we're outside a
14556          function.  For a nested function, this value is used in
14557          pop_cp_function_context and then reset via pop_function_context.  */
14558       current_function_decl = NULL_TREE;
14559       /* We don't really care about obstacks, but the middle-end
14560          sometimes cares on what obstck things are located.  */
14561       permanent_allocation (1);
14562     }
14563
14564   return fndecl;
14565 }
14566 \f
14567 /* Create the FUNCTION_DECL for a function definition.
14568    DECLSPECS and DECLARATOR are the parts of the declaration;
14569    they describe the return type and the name of the function,
14570    but twisted together in a fashion that parallels the syntax of C.
14571
14572    This function creates a binding context for the function body
14573    as well as setting up the FUNCTION_DECL in current_function_decl.
14574
14575    Returns a FUNCTION_DECL on success.
14576
14577    If the DECLARATOR is not suitable for a function (it defines a datum
14578    instead), we return 0, which tells yyparse to report a parse error.
14579
14580    May return void_type_node indicating that this method is actually
14581    a friend.  See grokfield for more details.
14582
14583    Came here with a `.pushlevel' .
14584
14585    DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14586    CHANGES TO CODE IN `grokfield'.  */
14587
14588 tree
14589 start_method (declspecs, declarator, attrlist)
14590      tree declarator, declspecs, attrlist;
14591 {
14592   tree fndecl = grokdeclarator (declarator, declspecs, MEMFUNCDEF, 0,
14593                                 attrlist);
14594
14595   /* Something too ugly to handle.  */
14596   if (fndecl == NULL_TREE)
14597     return NULL_TREE;
14598
14599   /* Pass friends other than inline friend functions back.  */
14600   if (fndecl == void_type_node)
14601     return fndecl;
14602
14603   if (TREE_CODE (fndecl) != FUNCTION_DECL)
14604     /* Not a function, tell parser to report parse error.  */
14605     return NULL_TREE;
14606
14607   if (DECL_IN_AGGR_P (fndecl))
14608     {
14609       if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl)) != current_class_type)
14610         {
14611           if (DECL_CONTEXT (fndecl)
14612               && TREE_CODE( DECL_CONTEXT (fndecl)) != NAMESPACE_DECL)
14613             cp_error ("`%D' is already defined in class %s", fndecl,
14614                              TYPE_NAME_STRING (DECL_CONTEXT (fndecl)));
14615         }
14616       return void_type_node;
14617     }
14618
14619   check_template_shadow (fndecl);
14620
14621   DECL_THIS_INLINE (fndecl) = 1;
14622
14623   if (flag_default_inline)
14624     DECL_INLINE (fndecl) = 1;
14625
14626   /* We process method specializations in finish_struct_1.  */
14627   if (processing_template_decl && !DECL_TEMPLATE_SPECIALIZATION (fndecl))
14628     fndecl = push_template_decl (fndecl);
14629
14630   if (! DECL_FRIEND_P (fndecl))
14631     {
14632       if (TREE_CHAIN (fndecl))
14633         {
14634           fndecl = copy_node (fndecl);
14635           TREE_CHAIN (fndecl) = NULL_TREE;
14636         }
14637
14638       if (DECL_CONSTRUCTOR_P (fndecl))
14639         {
14640           if (! grok_ctor_properties (current_class_type, fndecl))
14641             return void_type_node;
14642         }
14643       else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl)))
14644         grok_op_properties (fndecl, DECL_VIRTUAL_P (fndecl), 0);
14645     }
14646
14647   cp_finish_decl (fndecl, NULL_TREE, NULL_TREE, 0);
14648
14649   /* Make a place for the parms */
14650   pushlevel (0);
14651   current_binding_level->parm_flag = 1;
14652
14653   DECL_IN_AGGR_P (fndecl) = 1;
14654   return fndecl;
14655 }
14656
14657 /* Go through the motions of finishing a function definition.
14658    We don't compile this method until after the whole class has
14659    been processed.
14660
14661    FINISH_METHOD must return something that looks as though it
14662    came from GROKFIELD (since we are defining a method, after all).
14663
14664    This is called after parsing the body of the function definition.
14665    STMTS is the chain of statements that makes up the function body.
14666
14667    DECL is the ..._DECL that `start_method' provided.  */
14668
14669 tree
14670 finish_method (decl)
14671      tree decl;
14672 {
14673   register tree fndecl = decl;
14674   tree old_initial;
14675
14676   register tree link;
14677
14678   if (decl == void_type_node)
14679     return decl;
14680
14681   old_initial = DECL_INITIAL (fndecl);
14682
14683   /* Undo the level for the parms (from start_method).
14684      This is like poplevel, but it causes nothing to be
14685      saved.  Saving information here confuses symbol-table
14686      output routines.  Besides, this information will
14687      be correctly output when this method is actually
14688      compiled.  */
14689
14690   /* Clear out the meanings of the local variables of this level;
14691      also record in each decl which block it belongs to.  */
14692
14693   for (link = current_binding_level->names; link; link = TREE_CHAIN (link))
14694     {
14695       if (DECL_NAME (link) != NULL_TREE)
14696         pop_binding (DECL_NAME (link), link);
14697       my_friendly_assert (TREE_CODE (link) != FUNCTION_DECL, 163);
14698       DECL_CONTEXT (link) = NULL_TREE;
14699     }
14700
14701   GNU_xref_end_scope ((HOST_WIDE_INT) current_binding_level,
14702                       (HOST_WIDE_INT) current_binding_level->level_chain,
14703                       current_binding_level->parm_flag,
14704                       current_binding_level->keep);
14705
14706   poplevel (0, 0, 0);
14707
14708   DECL_INITIAL (fndecl) = old_initial;
14709
14710   /* We used to check if the context of FNDECL was different from
14711      current_class_type as another way to get inside here.  This didn't work
14712      for String.cc in libg++.  */
14713   if (DECL_FRIEND_P (fndecl))
14714     {
14715       CLASSTYPE_INLINE_FRIENDS (current_class_type)
14716         = tree_cons (NULL_TREE, fndecl, CLASSTYPE_INLINE_FRIENDS (current_class_type));
14717       decl = void_type_node;
14718     }
14719
14720   return decl;
14721 }
14722 \f
14723 /* Called when a new struct TYPE is defined.
14724    If this structure or union completes the type of any previous
14725    variable declaration, lay it out and output its rtl.  */
14726
14727 void
14728 hack_incomplete_structures (type)
14729      tree type;
14730 {
14731   tree *list;
14732   struct binding_level *level;
14733
14734   if (!type) /* Don't do this for class templates.  */
14735     return;
14736
14737   if (namespace_bindings_p ())
14738     {
14739       level = 0;
14740       list = &namespace_scope_incomplete;
14741     }
14742   else
14743     {
14744       level = innermost_nonclass_level ();
14745       list = &level->incomplete;
14746     }
14747
14748   while (1)
14749     {
14750       while (*list)
14751         {
14752           tree decl = TREE_VALUE (*list);
14753           if ((decl && TREE_TYPE (decl) == type)
14754               || (TREE_TYPE (decl)
14755                   && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
14756                   && TREE_TYPE (TREE_TYPE (decl)) == type))
14757             {
14758               int toplevel = toplevel_bindings_p ();
14759               if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
14760                   && TREE_TYPE (TREE_TYPE (decl)) == type)
14761                 layout_type (TREE_TYPE (decl));
14762               layout_decl (decl, 0);
14763               rest_of_decl_compilation (decl, NULL_PTR, toplevel, 0);
14764               if (! toplevel)
14765                 {
14766                   tree cleanup;
14767                   expand_decl (decl);
14768                   cleanup = maybe_build_cleanup (decl);
14769                   expand_decl_init (decl);
14770                   if (! expand_decl_cleanup (decl, cleanup))
14771                     cp_error ("parser lost in parsing declaration of `%D'",
14772                               decl);
14773                 }
14774               *list = TREE_CHAIN (*list);
14775             }
14776           else
14777             list = &TREE_CHAIN (*list);
14778         }
14779
14780       /* Keep looking through artificial binding levels generated
14781          for local variables.  */
14782       if (level && level->keep == 2)
14783         {
14784           level = level->level_chain;
14785           list = &level->incomplete;
14786         }
14787       else
14788         break;
14789     }
14790 }
14791
14792 /* If DECL is of a type which needs a cleanup, build that cleanup
14793    here.  */
14794
14795 tree
14796 maybe_build_cleanup (decl)
14797      tree decl;
14798 {
14799   tree type = TREE_TYPE (decl);
14800
14801   if (type != error_mark_node && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
14802     {
14803       int flags = LOOKUP_NORMAL|LOOKUP_DESTRUCTOR;
14804       tree rval;
14805
14806       if (TREE_CODE (type) == ARRAY_TYPE)
14807         rval = decl;
14808       else
14809         {
14810           mark_addressable (decl);
14811           rval = build_unary_op (ADDR_EXPR, decl, 0);
14812         }
14813
14814       /* Optimize for space over speed here.  */
14815       if (! TYPE_USES_VIRTUAL_BASECLASSES (type)
14816           || flag_expensive_optimizations)
14817         flags |= LOOKUP_NONVIRTUAL;
14818
14819       rval = build_delete (TREE_TYPE (rval), rval,
14820                            sfk_complete_destructor, flags, 0);
14821
14822       if (TYPE_USES_VIRTUAL_BASECLASSES (type)
14823           && ! TYPE_HAS_DESTRUCTOR (type))
14824         rval = build_compound_expr (tree_cons (NULL_TREE, rval,
14825                                                build_tree_list (NULL_TREE, build_vbase_delete (type, decl))));
14826
14827       return rval;
14828     }
14829   return 0;
14830 }
14831 \f
14832 /* Expand a C++ expression at the statement level.
14833    This is needed to ferret out nodes which have UNKNOWN_TYPE.
14834    The C++ type checker should get all of these out when
14835    expressions are combined with other, type-providing, expressions,
14836    leaving only orphan expressions, such as:
14837
14838    &class::bar;         / / takes its address, but does nothing with it.  */
14839
14840 void
14841 cplus_expand_expr_stmt (exp)
14842      tree exp;
14843 {
14844 #if 0
14845   /* We should do this eventually, but right now this causes regex.o from
14846      libg++ to miscompile, and tString to core dump.  */
14847   exp = build1 (CLEANUP_POINT_EXPR, TREE_TYPE (exp), exp);
14848 #endif
14849
14850   /* If we don't do this, we end up down inside expand_expr
14851      trying to do TYPE_MODE on the ERROR_MARK, and really
14852      go outside the bounds of the type.  */
14853   if (exp != error_mark_node)
14854     expand_expr_stmt (exp);
14855 }
14856
14857 /* When a stmt has been parsed, this function is called.  */
14858
14859 void
14860 finish_stmt ()
14861 {
14862   /* Always assume this statement was not an expression statement.  If
14863      it actually was an expression statement, its our callers
14864      responsibility to fix this up.  */
14865   last_expr_type = NULL_TREE;
14866 }
14867
14868 /* DECL was originally constructed as a non-static member function,
14869    but turned out to be static.  Update it accordingly.  */
14870
14871 void
14872 revert_static_member_fn (decl)
14873      tree decl;
14874 {
14875   tree tmp;
14876   tree function = TREE_TYPE (decl);
14877   tree args = TYPE_ARG_TYPES (function);
14878
14879   if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args)))
14880       != TYPE_UNQUALIFIED)
14881     cp_error ("static member function `%#D' declared with type qualifiers",
14882               *decl);
14883
14884   args = TREE_CHAIN (args);
14885   tmp = build_function_type (TREE_TYPE (function), args);
14886   tmp = build_qualified_type (tmp, CP_TYPE_QUALS (function));
14887   tmp = build_exception_variant (tmp,
14888                                  TYPE_RAISES_EXCEPTIONS (function));
14889   TREE_TYPE (decl) = tmp;
14890   if (DECL_ARGUMENTS (decl))
14891     DECL_ARGUMENTS (decl) = TREE_CHAIN (DECL_ARGUMENTS (decl));
14892   DECL_STATIC_FUNCTION_P (decl) = 1;
14893 }
14894
14895 /* Initialize the variables used during compilation of a C++
14896    function.  */
14897
14898 static void
14899 push_cp_function_context (f)
14900      struct function *f;
14901 {
14902   struct language_function *p
14903     = ((struct language_function *)
14904        xcalloc (1, sizeof (struct language_function)));
14905   f->language = p;
14906
14907   /* It takes an explicit call to expand_body to generate RTL for a
14908      function.  */
14909   expanding_p = 0;
14910
14911   /* Whenever we start a new function, we destroy temporaries in the
14912      usual way.  */
14913   current_stmt_tree->stmts_are_full_exprs_p = 1;
14914 }
14915
14916 /* Free the language-specific parts of F, now that we've finished
14917    compiling the function.  */
14918
14919 static void
14920 pop_cp_function_context (f)
14921      struct function *f;
14922 {
14923   if (f->language)
14924     free (f->language);
14925   f->language = 0;
14926 }
14927
14928 /* Mark P for GC.  */
14929
14930 static void
14931 mark_lang_function (p)
14932      struct language_function *p;
14933 {
14934   if (!p)
14935     return;
14936
14937   ggc_mark_tree (p->x_ctor_label);
14938   ggc_mark_tree (p->x_dtor_label);
14939   ggc_mark_tree (p->x_current_class_ptr);
14940   ggc_mark_tree (p->x_current_class_ref);
14941   ggc_mark_tree (p->x_eh_spec_try_block);
14942   ggc_mark_tree (p->x_scope_stmt_stack);
14943
14944   ggc_mark_rtx (p->x_result_rtx);
14945
14946   mark_named_label_lists (&p->x_named_labels, &p->x_named_label_uses);
14947   mark_stmt_tree (&p->x_stmt_tree);
14948   mark_binding_level (&p->bindings);
14949 }
14950
14951 /* Mark the language-specific data in F for GC.  */
14952
14953 static void
14954 mark_cp_function_context (f)
14955      struct function *f;
14956 {
14957   mark_lang_function (f->language);
14958 }
14959
14960 void
14961 lang_mark_false_label_stack (l)
14962      struct label_node *l;
14963 {
14964   /* C++ doesn't use false_label_stack.  It better be NULL.  */
14965   my_friendly_assert (l == NULL, 19990904);
14966 }
14967
14968 void
14969 lang_mark_tree (t)
14970      tree t;
14971 {
14972   enum tree_code code = TREE_CODE (t);
14973   if (code == IDENTIFIER_NODE)
14974     {
14975       struct lang_identifier *li = (struct lang_identifier *) t;
14976       struct lang_id2 *li2 = li->x;
14977       ggc_mark_tree (li->namespace_bindings);
14978       ggc_mark_tree (li->bindings);
14979       ggc_mark_tree (li->class_value);
14980       ggc_mark_tree (li->class_template_info);
14981
14982       if (li2)
14983         {
14984           ggc_mark_tree (li2->label_value);
14985           ggc_mark_tree (li2->implicit_decl);
14986           ggc_mark_tree (li2->error_locus);
14987         }
14988     }
14989   else if (code == CPLUS_BINDING)
14990     {
14991       if (BINDING_HAS_LEVEL_P (t))
14992         mark_binding_level (&BINDING_LEVEL (t));
14993       else
14994         ggc_mark_tree (BINDING_SCOPE (t));
14995       ggc_mark_tree (BINDING_VALUE (t));
14996     }
14997   else if (code == OVERLOAD)
14998     ggc_mark_tree (OVL_FUNCTION (t));
14999   else if (code == TEMPLATE_PARM_INDEX)
15000     ggc_mark_tree (TEMPLATE_PARM_DECL (t));
15001   else if (TREE_CODE_CLASS (code) == 'd')
15002     {
15003       struct lang_decl *ld = DECL_LANG_SPECIFIC (t);
15004
15005       if (ld)
15006         {
15007           ggc_mark (ld);
15008           if (!DECL_GLOBAL_CTOR_P (t)
15009               && !DECL_GLOBAL_DTOR_P (t)
15010               && !DECL_THUNK_P (t))
15011             ggc_mark_tree (ld->decl_flags.u2.access);
15012           else if (DECL_THUNK_P (t))
15013             ggc_mark_tree (ld->decl_flags.u2.vcall_offset);
15014           ggc_mark_tree (ld->decl_flags.context);
15015           if (TREE_CODE (t) != NAMESPACE_DECL)
15016             ggc_mark_tree (ld->decl_flags.u.template_info);
15017           else
15018             mark_binding_level (&NAMESPACE_LEVEL (t));
15019           if (CAN_HAVE_FULL_LANG_DECL_P (t))
15020             {
15021               ggc_mark_tree (ld->befriending_classes);
15022               ggc_mark_tree (ld->saved_tree);
15023               ggc_mark_tree (ld->cloned_function);
15024               if (!DECL_OVERLOADED_OPERATOR_P (t))
15025                 ggc_mark_tree (ld->u2.vtt_parm);
15026               if (TREE_CODE (t) == TYPE_DECL)
15027                 ggc_mark_tree (ld->u.sorted_fields);
15028               else if (TREE_CODE (t) == FUNCTION_DECL
15029                        && !DECL_PENDING_INLINE_P (t))
15030                 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t));
15031             }
15032         }
15033     }
15034   else if (TREE_CODE_CLASS (code) == 't')
15035     {
15036       struct lang_type *lt = TYPE_LANG_SPECIFIC (t);
15037
15038       if (lt && !(TREE_CODE (t) == POINTER_TYPE
15039                   && TREE_CODE (TREE_TYPE (t)) == METHOD_TYPE))
15040         {
15041           ggc_mark (lt);
15042           ggc_mark_tree (lt->vfields);
15043           ggc_mark_tree (lt->vbases);
15044           ggc_mark_tree (lt->tags);
15045           ggc_mark_tree (lt->size);
15046           ggc_mark_tree (lt->pure_virtuals);
15047           ggc_mark_tree (lt->friend_classes);
15048           ggc_mark_tree (lt->rtti);
15049           ggc_mark_tree (lt->methods);
15050           ggc_mark_tree (lt->template_info);
15051           ggc_mark_tree (lt->befriending_classes);
15052         }
15053       else if (lt)
15054         /* In the case of pointer-to-member function types, the
15055            TYPE_LANG_SPECIFIC is really just a tree.  */
15056         ggc_mark_tree ((tree) lt);
15057     }
15058 }