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 "defaults.h"
  41 #include "output.h"
  42 #include "except.h"
  43 #include "toplev.h"
  44 #include "../hash.h"
  45 #include "ggc.h"
  46
  47 extern int current_class_depth;
  48
  49 extern tree global_namespace;
  50
  51 extern int (*valid_lang_attribute) PARAMS ((tree, tree, tree, tree));
  52
  53 #ifndef BOOL_TYPE_SIZE
  54 #ifdef SLOW_BYTE_ACCESS
  55 /* In the new ABI, `bool' has size and alignment `1', on all
  56    platforms.  */
  57 #define BOOL_TYPE_SIZE \
  58   ((SLOW_BYTE_ACCESS && !flag_new_abi) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
  59 #else
  60 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
  61 #endif
  62 #endif
  63
  64 /* We let tm.h override the types used here, to handle trivial differences
  65    such as the choice of unsigned int or long unsigned int for size_t.
  66    When machines start needing nontrivial differences in the size type,
  67    it would be best to do something here to figure out automatically
  68    from other information what type to use.  */
  69
  70 #ifndef SIZE_TYPE
  71 #define SIZE_TYPE "long unsigned int"
  72 #endif
  73
  74 #ifndef PTRDIFF_TYPE
  75 #define PTRDIFF_TYPE "long int"
  76 #endif
  77
  78 #ifndef WCHAR_TYPE
  79 #define WCHAR_TYPE "int"
  80 #endif
  81
  82 #ifndef WINT_TYPE
  83 #define WINT_TYPE "unsigned int"
  84 #endif
  85
  86 #ifndef INTMAX_TYPE
  87 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE)     \
  88                      ? "int"                                    \
  89                      : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
  90                         ? "long int"                            \
  91                         : "long long int"))
  92 #endif
  93
  94 #ifndef UINTMAX_TYPE
  95 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE)    \
  96                      ? "unsigned int"                           \
  97                      : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
  98                         ? "long unsigned int"                   \
  99                         : "long long unsigned int"))
 100 #endif
 101
 102 static tree grokparms                           PARAMS ((tree, int));
 103 static const char *redeclaration_error_message  PARAMS ((tree, tree));
 104
 105 static void push_binding_level PARAMS ((struct binding_level *, int,
 106                                       int));
 107 static void pop_binding_level PARAMS ((void));
 108 static void suspend_binding_level PARAMS ((void));
 109 static void resume_binding_level PARAMS ((struct binding_level *));
 110 static struct binding_level *make_binding_level PARAMS ((void));
 111 static void declare_namespace_level PARAMS ((void));
 112 static int decl_jump_unsafe PARAMS ((tree));
 113 static void storedecls PARAMS ((tree));
 114 static void require_complete_types_for_parms PARAMS ((tree));
 115 static int ambi_op_p PARAMS ((enum tree_code));
 116 static int unary_op_p PARAMS ((enum tree_code));
 117 static tree store_bindings PARAMS ((tree, tree));
 118 static tree lookup_tag_reverse PARAMS ((tree, tree));
 119 static tree obscure_complex_init PARAMS ((tree, tree));
 120 static tree lookup_name_real PARAMS ((tree, int, int, int));
 121 static void warn_extern_redeclared_static PARAMS ((tree, tree));
 122 static void grok_reference_init PARAMS ((tree, tree, tree));
 123 static tree grokfndecl PARAMS ((tree, tree, tree, tree, int,
 124                               enum overload_flags, tree,
 125                               tree, int, int, int, int, int, int, tree));
 126 static tree grokvardecl PARAMS ((tree, tree, RID_BIT_TYPE *, int, int, tree));
 127 static tree lookup_tag PARAMS ((enum tree_code, tree,
 128                               struct binding_level *, int));
 129 static void set_identifier_type_value_with_scope
 130         PARAMS ((tree, tree, struct binding_level *));
 131 static void record_builtin_type PARAMS ((enum rid, const char *, tree));
 132 static void record_unknown_type PARAMS ((tree, const char *));
 133 static tree build_library_fn_1 PARAMS ((tree, enum tree_code, tree));
 134 static int member_function_or_else PARAMS ((tree, tree, enum overload_flags));
 135 static void bad_specifiers PARAMS ((tree, const char *, int, int, int, int,
 136                                   int));
 137 static tree maybe_process_template_type_declaration PARAMS ((tree, int, struct binding_level*));
 138 static void check_for_uninitialized_const_var PARAMS ((tree));
 139 static unsigned long typename_hash PARAMS ((hash_table_key));
 140 static boolean typename_compare PARAMS ((hash_table_key, hash_table_key));
 141 static void push_binding PARAMS ((tree, tree, struct binding_level*));
 142 static int add_binding PARAMS ((tree, tree));
 143 static void pop_binding PARAMS ((tree, tree));
 144 static tree local_variable_p_walkfn PARAMS ((tree *, int *, void *));
 145 static tree find_binding PARAMS ((tree, tree));
 146 static tree select_decl PARAMS ((tree, int));
 147 static int lookup_flags PARAMS ((int, int));
 148 static tree qualify_lookup PARAMS ((tree, int));
 149 static tree record_builtin_java_type PARAMS ((const char *, int));
 150 static const char *tag_name PARAMS ((enum tag_types code));
 151 static void find_class_binding_level PARAMS ((void));
 152 static struct binding_level *innermost_nonclass_level PARAMS ((void));
 153 static void warn_about_implicit_typename_lookup PARAMS ((tree, tree));
 154 static int walk_namespaces_r PARAMS ((tree, walk_namespaces_fn, void *));
 155 static int walk_globals_r PARAMS ((tree, void *));
 156 static void add_decl_to_level PARAMS ((tree, struct binding_level *));
 157 static tree make_label_decl PARAMS ((tree, int));
 158 static void use_label PARAMS ((tree));
 159 static void check_previous_goto_1 PARAMS ((tree, struct binding_level *, tree,
 160                                            const char *, int));
 161 static void check_previous_goto PARAMS ((struct named_label_use_list *));
 162 static void check_switch_goto PARAMS ((struct binding_level *));
 163 static void check_previous_gotos PARAMS ((tree));
 164 static void pop_label PARAMS ((tree, tree));
 165 static void pop_labels PARAMS ((tree));
 166 static void maybe_deduce_size_from_array_init PARAMS ((tree, tree));
 167 static void layout_var_decl PARAMS ((tree));
 168 static void maybe_commonize_var PARAMS ((tree));
 169 static tree check_initializer PARAMS ((tree, tree));
 170 static void make_rtl_for_nonlocal_decl PARAMS ((tree, tree, const char *));
 171 static void push_cp_function_context PARAMS ((struct function *));
 172 static void pop_cp_function_context PARAMS ((struct function *));
 173 static void mark_binding_level PARAMS ((void *));
 174 static void mark_named_label_lists PARAMS ((void *, void *));
 175 static void mark_cp_function_context PARAMS ((struct function *));
 176 static void mark_saved_scope PARAMS ((void *));
 177 static void mark_lang_function PARAMS ((struct cp_language_function *));
 178 static void save_function_data PARAMS ((tree));
 179 static void check_function_type PARAMS ((tree, tree));
 180 static void destroy_local_var PARAMS ((tree));
 181 static void finish_constructor_body PARAMS ((void));
 182 static void finish_destructor_body PARAMS ((void));
 183 static tree create_array_type_for_decl PARAMS ((tree, tree, tree));
 184 static tree get_atexit_node PARAMS ((void));
 185 static tree get_dso_handle_node PARAMS ((void));
 186 static tree start_cleanup_fn PARAMS ((void));
 187 static void end_cleanup_fn PARAMS ((void));
 188 static tree cp_make_fname_decl PARAMS ((tree, const char *, int));
 189 static void initialize_predefined_identifiers PARAMS ((void));
 190 static tree check_special_function_return_type
 191   PARAMS ((special_function_kind, tree, tree, tree));
 192 static tree push_cp_library_fn PARAMS ((enum tree_code, tree));
 193 static tree build_cp_library_fn PARAMS ((tree, enum tree_code, tree));
 194 static void store_parm_decls PARAMS ((tree));
 195
 196 #if defined (DEBUG_CP_BINDING_LEVELS)
 197 static void indent PARAMS ((void));
 198 #endif
 199
 200 /* Erroneous argument lists can use this *IFF* they do not modify it.  */
 201 tree error_mark_list;
 202
 203 /* The following symbols are subsumed in the cp_global_trees array, and
 204    listed here individually for documentation purposes.
 205
 206    C++ extensions
 207         tree wchar_decl_node;
 208
 209         tree vtable_entry_type;
 210         tree delta_type_node;
 211 #if 0
 212    Old rtti stuff.
 213         tree __baselist_desc_type_node;
 214         tree __i_desc_type_node, __m_desc_type_node;
 215         tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
 216 #endif
 217         tree __t_desc_type_node;
 218 #if 0
 219         tree __tp_desc_type_node;
 220 #endif
 221         tree ti_desc_type_node;
 222         tree bltn_desc_type_node, ptr_desc_type_node;
 223         tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
 224         tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
 225         tree ptm_desc_type_node;
 226         tree base_desc_type_node;
 227 #if 0
 228    Not needed yet?  May be needed one day?
 229         tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
 230         tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
 231         tree __ptmf_desc_array_type, __ptmd_desc_array_type;
 232 #endif
 233
 234         tree class_type_node, record_type_node, union_type_node, enum_type_node;
 235         tree unknown_type_node;
 236
 237    Array type `vtable_entry_type[]'
 238
 239         tree vtbl_type_node;
 240         tree vtbl_ptr_type_node;
 241
 242    Namespaces,
 243
 244         tree std_node;
 245         tree abi_node;
 246
 247    A FUNCTION_DECL which can call `abort'.  Not necessarily the
 248    one that the user will declare, but sufficient to be called
 249    by routines that want to abort the program.
 250
 251         tree abort_fndecl;
 252
 253    The FUNCTION_DECL for the default `::operator delete'.
 254
 255         tree global_delete_fndecl;
 256
 257    Used by RTTI
 258         tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
 259         tree tinfo_var_id;
 260
 261 */
 262
 263 tree cp_global_trees[CPTI_MAX];
 264
 265 /* Indicates that there is a type value in some namespace, although
 266    that is not necessarily in scope at the moment.  */
 267
 268 static tree global_type_node;
 269
 270 /* If non-zero, this is the number of times we have entered the `std'
 271    namespace when we are treating that namespace as an alias for the
 272    global namespace.  */
 273 static int in_fake_std;
 274
 275 /* Expect only namespace names now. */
 276 static int only_namespace_names;
 277
 278 /* Used only for jumps to as-yet undefined labels, since jumps to
 279    defined labels can have their validity checked immediately.  */
 280
 281 struct named_label_use_list
 282 {
 283   struct binding_level *binding_level;
 284   tree names_in_scope;
 285   tree label_decl;
 286   const char *filename_o_goto;
 287   int lineno_o_goto;
 288   struct named_label_use_list *next;
 289 };
 290
 291 #define named_label_uses cp_function_chain->x_named_label_uses
 292
 293 /* A list of objects which have constructors or destructors
 294    which reside in the global scope.  The decl is stored in
 295    the TREE_VALUE slot and the initializer is stored
 296    in the TREE_PURPOSE slot.  */
 297 tree static_aggregates;
 298
 299 /* -- end of C++ */
 300
 301 /* A node for the integer constants 2, and 3.  */
 302
 303 tree integer_two_node, integer_three_node;
 304
 305 /* Parsing a function declarator leaves here a chain of structure
 306    and enum types declared in the parmlist.  */
 307
 308 static tree last_function_parm_tags;
 309
 310 /* Similar, for last_function_parm_tags.  */
 311 tree last_function_parms;
 312 static tree current_function_parm_tags;
 313
 314 /* A list of all LABEL_DECLs in the function that have names.  Here so
 315    we can clear out their names' definitions at the end of the
 316    function, and so we can check the validity of jumps to these labels.  */
 317
 318 struct named_label_list
 319 {
 320   struct binding_level *binding_level;
 321   tree names_in_scope;
 322   tree old_value;
 323   tree label_decl;
 324   tree bad_decls;
 325   int eh_region;
 326   struct named_label_list *next;
 327 };
 328
 329 #define named_labels cp_function_chain->x_named_labels
 330
 331 /* Set to 0 at beginning of a function definition, and whenever
 332    a label (case or named) is defined.  Set to value of expression
 333    returned from function when that value can be transformed into
 334    a named return value.  */
 335
 336 tree current_function_return_value;
 337
 338 /* Nonzero means use the ISO C94 dialect of C.  */
 339
 340 int flag_isoc94;
 341
 342 /* Nonzero means use the ISO C99 dialect of C.  */
 343
 344 int flag_isoc99;
 345
 346 /* Nonzero means we are a hosted implementation for code shared with C.  */
 347
 348 int flag_hosted = 1;
 349
 350 /* Nonzero means add default format_arg attributes for functions not
 351    in ISO C.  */
 352
 353 int flag_noniso_default_format_attributes = 1;
 354
 355 /* Nonzero means give `double' the same size as `float'.  */
 356
 357 extern int flag_short_double;
 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 /* The number of function bodies which we are currently processing.
 380    (Zero if we are at namespace scope, one inside the body of a
 381    function, two inside the body of a function in a local class, etc.)  */
 382 int function_depth;
 383 \f
 384 /* For each binding contour we allocate a binding_level structure
 385    which records the names defined in that contour.
 386    Contours include:
 387     0) the global one
 388     1) one for each function definition,
 389        where internal declarations of the parameters appear.
 390     2) one for each compound statement,
 391        to record its declarations.
 392
 393    The current meaning of a name can be found by searching the levels
 394    from the current one out to the global one.
 395
 396    Off to the side, may be the class_binding_level.  This exists only
 397    to catch class-local declarations.  It is otherwise nonexistent.
 398
 399    Also there may be binding levels that catch cleanups that must be
 400    run when exceptions occur.  Thus, to see whether a name is bound in
 401    the current scope, it is not enough to look in the
 402    CURRENT_BINDING_LEVEL.  You should use lookup_name_current_level
 403    instead.  */
 404
 405 /* Note that the information in the `names' component of the global contour
 406    is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers.  */
 407
 408 struct binding_level
 409   {
 410     /* A chain of _DECL nodes for all variables, constants, functions,
 411        and typedef types.  These are in the reverse of the order
 412        supplied.  There may be OVERLOADs on this list, too, but they
 413        are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD.  */
 414     tree names;
 415
 416     /* A list of structure, union and enum definitions, for looking up
 417        tag names.
 418        It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
 419        or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
 420        or ENUMERAL_TYPE node.
 421
 422        C++: the TREE_VALUE nodes can be simple types for
 423        component_bindings.  */
 424     tree tags;
 425
 426     /* A list of USING_DECL nodes. */
 427     tree usings;
 428
 429     /* A list of used namespaces. PURPOSE is the namespace,
 430        VALUE the common ancestor with this binding_level's namespace. */
 431     tree using_directives;
 432
 433     /* If this binding level is the binding level for a class, then
 434        class_shadowed is a TREE_LIST.  The TREE_PURPOSE of each node
 435        is the name of an entity bound in the class; the TREE_VALUE is
 436        the IDENTIFIER_CLASS_VALUE before we entered the class.  Thus,
 437        when leaving class scope, we can restore the
 438        IDENTIFIER_CLASS_VALUE by walking this list.  The TREE_TYPE is
 439        the DECL bound by this name in the class.  */
 440     tree class_shadowed;
 441
 442     /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
 443        is used for all binding levels.  */
 444     tree type_shadowed;
 445
 446     /* A TREE_LIST.  Each TREE_VALUE is the LABEL_DECL for a local
 447        label in this scope.  The TREE_PURPOSE is the previous value of
 448        the IDENTIFIER_LABEL VALUE.  */
 449     tree shadowed_labels;
 450
 451     /* For each level (except not the global one),
 452        a chain of BLOCK nodes for all the levels
 453        that were entered and exited one level down.  */
 454     tree blocks;
 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 function
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 leaving_for_scope;
1294
1295   if (cfun && !doing_semantic_analysis_p ())
1296     return NULL_TREE;
1297
1298   my_friendly_assert (current_binding_level->parm_flag != 2,
1299                       19990916);
1300
1301   real_functionbody = (current_binding_level->keep == 2
1302                        ? ((functionbody = 0), tmp) : functionbody);
1303   tags = functionbody >= 0 ? current_binding_level->tags : 0;
1304   subblocks = functionbody >= 0 ? current_binding_level->blocks : 0;
1305
1306   my_friendly_assert (!current_binding_level->class_shadowed,
1307                       19990414);
1308
1309   /* We used to use KEEP == 2 to indicate that the new block should go
1310      at the beginning of the list of blocks at this binding level,
1311      rather than the end.  This hack is no longer used.  */
1312   my_friendly_assert (keep == 0 || keep == 1, 0);
1313
1314   GNU_xref_end_scope ((HOST_WIDE_INT) current_binding_level,
1315                       (HOST_WIDE_INT) current_binding_level->level_chain,
1316                       current_binding_level->parm_flag,
1317                       current_binding_level->keep);
1318
1319   if (current_binding_level->keep == 1)
1320     keep = 1;
1321
1322   /* Any uses of undefined labels, and any defined labels, now operate
1323      under constraints of next binding contour.  */
1324   if (cfun && !functionbody)
1325     {
1326       struct binding_level *level_chain;
1327       level_chain = current_binding_level->level_chain;
1328       if (level_chain)
1329         {
1330           struct named_label_use_list *uses;
1331           struct named_label_list *labels;
1332           for (labels = named_labels; labels; labels = labels->next)
1333             if (labels->binding_level == current_binding_level)
1334               {
1335                 tree decl;
1336                 if (current_binding_level->eh_region)
1337                   labels->eh_region = 1;
1338                 for (decl = labels->names_in_scope; decl;
1339                      decl = TREE_CHAIN (decl))
1340                   if (decl_jump_unsafe (decl))
1341                     labels->bad_decls = tree_cons (NULL_TREE, decl,
1342                                                    labels->bad_decls);
1343                 labels->binding_level = level_chain;
1344                 labels->names_in_scope = level_chain->names;
1345               }
1346
1347           for (uses = named_label_uses; uses; uses = uses->next)
1348             if (uses->binding_level == current_binding_level)
1349               {
1350                 uses->binding_level = level_chain;
1351                 uses->names_in_scope = level_chain->names;
1352               }
1353         }
1354     }
1355
1356   /* Get the decls in the order they were written.
1357      Usually current_binding_level->names is in reverse order.
1358      But parameter decls were previously put in forward order.  */
1359
1360   if (reverse)
1361     current_binding_level->names
1362       = decls = nreverse (current_binding_level->names);
1363   else
1364     decls = current_binding_level->names;
1365
1366   /* Output any nested inline functions within this block
1367      if they weren't already output.  */
1368   for (decl = decls; decl; decl = TREE_CHAIN (decl))
1369     if (TREE_CODE (decl) == FUNCTION_DECL
1370         && ! TREE_ASM_WRITTEN (decl)
1371         && DECL_INITIAL (decl) != NULL_TREE
1372         && TREE_ADDRESSABLE (decl)
1373         && decl_function_context (decl) == current_function_decl)
1374       {
1375         /* If this decl was copied from a file-scope decl
1376            on account of a block-scope extern decl,
1377            propagate TREE_ADDRESSABLE to the file-scope decl.  */
1378         if (DECL_ABSTRACT_ORIGIN (decl) != NULL_TREE)
1379           TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl)) = 1;
1380         else
1381           {
1382             push_function_context ();
1383             output_inline_function (decl);
1384             pop_function_context ();
1385           }
1386       }
1387
1388   /* When not in function-at-a-time mode, expand_end_bindings will
1389      warn about unused variables.  But, in function-at-a-time mode
1390      expand_end_bindings is not passed the list of variables in the
1391      current scope, and therefore no warning is emitted.  So, we
1392      explicitly warn here.  */
1393   if (!processing_template_decl)
1394     warn_about_unused_variables (getdecls ());
1395
1396   /* If there were any declarations or structure tags in that level,
1397      or if this level is a function body,
1398      create a BLOCK to record them for the life of this function.  */
1399   block = NULL_TREE;
1400   if (keep == 1 || functionbody)
1401     block = make_node (BLOCK);
1402   if (block != NULL_TREE)
1403     {
1404       BLOCK_VARS (block) = decls;
1405       BLOCK_SUBBLOCKS (block) = subblocks;
1406     }
1407
1408   /* In each subblock, record that this is its superior.  */
1409   if (keep >= 0)
1410     for (link = subblocks; link; link = TREE_CHAIN (link))
1411       BLOCK_SUPERCONTEXT (link) = block;
1412
1413   /* We still support the old for-scope rules, whereby the variables
1414      in a for-init statement were in scope after the for-statement
1415      ended.  We only use the new rules in flag_new_for_scope is
1416      nonzero.  */
1417   leaving_for_scope
1418     = current_binding_level->is_for_scope && flag_new_for_scope == 1;
1419
1420   /* Remove declarations for all the DECLs in this level.  */
1421   for (link = decls; link; link = TREE_CHAIN (link))
1422     {
1423       if (leaving_for_scope && TREE_CODE (link) == VAR_DECL
1424           && DECL_NAME (link))
1425         {
1426           tree outer_binding
1427             = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link)));
1428           tree ns_binding;
1429
1430           if (!outer_binding)
1431             ns_binding = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link));
1432           else
1433             ns_binding = NULL_TREE;
1434
1435           if (outer_binding
1436               && (BINDING_LEVEL (outer_binding)
1437                   == current_binding_level->level_chain))
1438             /* We have something like:
1439
1440                  int i;
1441                  for (int i; ;);
1442
1443                and we are leaving the `for' scope.  There's no reason to
1444                keep the binding of the inner `i' in this case.  */
1445             pop_binding (DECL_NAME (link), link);
1446           else if ((outer_binding
1447                     && (TREE_CODE (BINDING_VALUE (outer_binding))
1448                         == TYPE_DECL))
1449                    || (ns_binding
1450                        && TREE_CODE (ns_binding) == TYPE_DECL))
1451             /* Here, we have something like:
1452
1453                  typedef int I;
1454
1455                  void f () {
1456                    for (int I; ;);
1457                  }
1458
1459                We must pop the for-scope binding so we know what's a
1460                type and what isn't.  */
1461             pop_binding (DECL_NAME (link), link);
1462           else
1463             {
1464               /* Mark this VAR_DECL as dead so that we can tell we left it
1465                  there only for backward compatibility.  */
1466               DECL_DEAD_FOR_LOCAL (link) = 1;
1467
1468               /* Keep track of what should of have happenned when we
1469                  popped the binding.  */
1470               if (outer_binding && BINDING_VALUE (outer_binding))
1471                 DECL_SHADOWED_FOR_VAR (link)
1472                   = BINDING_VALUE (outer_binding);
1473
1474               /* Add it to the list of dead variables in the next
1475                  outermost binding to that we can remove these when we
1476                  leave that binding.  */
1477               current_binding_level->level_chain->dead_vars_from_for
1478                 = tree_cons (NULL_TREE, link,
1479                              current_binding_level->level_chain->
1480                              dead_vars_from_for);
1481
1482               /* Although we don't pop the CPLUS_BINDING, we do clear
1483                  its BINDING_LEVEL since the level is going away now.  */
1484               BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link)))
1485                 = 0;
1486             }
1487         }
1488       else
1489         {
1490           /* Remove the binding.  */
1491           decl = link;
1492           if (TREE_CODE (decl) == TREE_LIST)
1493             decl = TREE_VALUE (decl);
1494           if (DECL_P (decl))
1495             pop_binding (DECL_NAME (decl), decl);
1496           else if (TREE_CODE (decl) == OVERLOAD)
1497             pop_binding (DECL_NAME (OVL_FUNCTION (decl)), decl);
1498           else
1499             my_friendly_abort (0);
1500         }
1501     }
1502
1503   /* Remove declarations for any `for' variables from inner scopes
1504      that we kept around.  */
1505   for (link = current_binding_level->dead_vars_from_for;
1506        link; link = TREE_CHAIN (link))
1507     pop_binding (DECL_NAME (TREE_VALUE (link)), TREE_VALUE (link));
1508
1509   /* Restore the IDENTIFIER_TYPE_VALUEs.  */
1510   for (link = current_binding_level->type_shadowed;
1511        link; link = TREE_CHAIN (link))
1512     SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link), TREE_VALUE (link));
1513
1514   /* Restore the IDENTIFIER_LABEL_VALUEs for local labels.  */
1515   for (link = current_binding_level->shadowed_labels;
1516        link;
1517        link = TREE_CHAIN (link))
1518     pop_label (TREE_VALUE (link), TREE_PURPOSE (link));
1519
1520   /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1521      list if a `using' declaration put them there.  The debugging
1522      back-ends won't understand OVERLOAD, so we remove them here.
1523      Because the BLOCK_VARS are (temporarily) shared with
1524      CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1525      popped all the bindings.  */
1526   if (block)
1527     {
1528       tree* d;
1529
1530       for (d = &BLOCK_VARS (block); *d; )
1531         {
1532           if (TREE_CODE (*d) == TREE_LIST)
1533             *d = TREE_CHAIN (*d);
1534           else
1535             d = &TREE_CHAIN (*d);
1536         }
1537     }
1538
1539   /* If the level being exited is the top level of a function,
1540      check over all the labels.  */
1541   if (functionbody)
1542     {
1543       /* Since this is the top level block of a function, the vars are
1544          the function's parameters.  Don't leave them in the BLOCK
1545          because they are found in the FUNCTION_DECL instead.  */
1546       BLOCK_VARS (block) = 0;
1547       pop_labels (block);
1548     }
1549
1550   tmp = current_binding_level->keep;
1551
1552   pop_binding_level ();
1553   if (functionbody)
1554     DECL_INITIAL (current_function_decl) = block;
1555   else if (block)
1556     current_binding_level->blocks
1557       = chainon (current_binding_level->blocks, block);
1558
1559   /* If we did not make a block for the level just exited,
1560      any blocks made for inner levels
1561      (since they cannot be recorded as subblocks in that level)
1562      must be carried forward so they will later become subblocks
1563      of something else.  */
1564   else if (subblocks)
1565     current_binding_level->blocks
1566       = chainon (current_binding_level->blocks, subblocks);
1567
1568   /* Each and every BLOCK node created here in `poplevel' is important
1569      (e.g. for proper debugging information) so if we created one
1570      earlier, mark it as "used".  */
1571   if (block)
1572     TREE_USED (block) = 1;
1573
1574   /* Take care of compiler's internal binding structures.  */
1575   if (tmp == 2)
1576     {
1577       tree scope_stmts;
1578
1579       scope_stmts
1580         = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1581       if (block)
1582         {
1583           SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts)) = block;
1584           SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts)) = block;
1585         }
1586
1587       block = poplevel (keep, reverse, functionbody);
1588     }
1589
1590   return block;
1591 }
1592
1593 /* Delete the node BLOCK from the current binding level.
1594    This is used for the block inside a stmt expr ({...})
1595    so that the block can be reinserted where appropriate.  */
1596
1597 void
1598 delete_block (block)
1599      tree block;
1600 {
1601   tree t;
1602   if (current_binding_level->blocks == block)
1603     current_binding_level->blocks = TREE_CHAIN (block);
1604   for (t = current_binding_level->blocks; t;)
1605     {
1606       if (TREE_CHAIN (t) == block)
1607         TREE_CHAIN (t) = TREE_CHAIN (block);
1608       else
1609         t = TREE_CHAIN (t);
1610     }
1611   TREE_CHAIN (block) = NULL_TREE;
1612   /* Clear TREE_USED which is always set by poplevel.
1613      The flag is set again if insert_block is called.  */
1614   TREE_USED (block) = 0;
1615 }
1616
1617 /* Insert BLOCK at the end of the list of subblocks of the
1618    current binding level.  This is used when a BIND_EXPR is expanded,
1619    to handle the BLOCK node inside the BIND_EXPR.  */
1620
1621 void
1622 insert_block (block)
1623      tree block;
1624 {
1625   TREE_USED (block) = 1;
1626   current_binding_level->blocks
1627     = chainon (current_binding_level->blocks, block);
1628 }
1629
1630 /* Set the BLOCK node for the innermost scope
1631    (the one we are currently in).  */
1632
1633 void
1634 set_block (block)
1635     tree block ATTRIBUTE_UNUSED;
1636 {
1637   /* The RTL expansion machinery requires us to provide this callback,
1638      but it is not applicable in function-at-a-time mode.  */
1639   my_friendly_assert (cfun && !doing_semantic_analysis_p (), 20000911);
1640 }
1641
1642 /* Do a pushlevel for class declarations.  */
1643
1644 void
1645 pushlevel_class ()
1646 {
1647   register struct binding_level *newlevel;
1648
1649   /* Reuse or create a struct for this binding level.  */
1650 #if defined(DEBUG_CP_BINDING_LEVELS)
1651   if (0)
1652 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1653   if (free_binding_level)
1654 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1655     {
1656       newlevel = free_binding_level;
1657       free_binding_level = free_binding_level->level_chain;
1658     }
1659   else
1660     newlevel = make_binding_level ();
1661
1662 #if defined(DEBUG_CP_BINDING_LEVELS)
1663   is_class_level = 1;
1664 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1665
1666   push_binding_level (newlevel, 0, 0);
1667
1668   class_binding_level = current_binding_level;
1669   class_binding_level->parm_flag = 2;
1670   class_binding_level->this_class = current_class_type;
1671 }
1672
1673 /* ...and a poplevel for class declarations.  */
1674
1675 void
1676 poplevel_class ()
1677 {
1678   register struct binding_level *level = class_binding_level;
1679   tree shadowed;
1680
1681   my_friendly_assert (level != 0, 354);
1682
1683   /* If we're leaving a toplevel class, don't bother to do the setting
1684      of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1685      shouldn't even be used when current_class_type isn't set, and second,
1686      if we don't touch it here, we're able to use the cache effect if the
1687      next time we're entering a class scope, it is the same class.  */
1688   if (current_class_depth != 1)
1689     {
1690       struct binding_level* b;
1691
1692       /* Clear out our IDENTIFIER_CLASS_VALUEs.  */
1693       for (shadowed = level->class_shadowed;
1694            shadowed;
1695            shadowed = TREE_CHAIN (shadowed))
1696         IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed)) = NULL_TREE;
1697
1698       /* Find the next enclosing class, and recreate
1699          IDENTIFIER_CLASS_VALUEs appropriate for that class.  */
1700       b = level->level_chain;
1701       while (b && b->parm_flag != 2)
1702         b = b->level_chain;
1703
1704       if (b)
1705         for (shadowed = b->class_shadowed;
1706              shadowed;
1707              shadowed = TREE_CHAIN (shadowed))
1708           {
1709             tree t;
1710
1711             t = IDENTIFIER_BINDING (TREE_PURPOSE (shadowed));
1712             while (t && BINDING_LEVEL (t) != b)
1713               t = TREE_CHAIN (t);
1714
1715             if (t)
1716               IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed))
1717                 = BINDING_VALUE (t);
1718           }
1719     }
1720   else
1721     /* Remember to save what IDENTIFIER's were bound in this scope so we
1722        can recover from cache misses.  */
1723     {
1724       previous_class_type = current_class_type;
1725       previous_class_values = class_binding_level->class_shadowed;
1726     }
1727   for (shadowed = level->type_shadowed;
1728        shadowed;
1729        shadowed = TREE_CHAIN (shadowed))
1730     SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed), TREE_VALUE (shadowed));
1731
1732   /* Remove the bindings for all of the class-level declarations.  */
1733   for (shadowed = level->class_shadowed;
1734        shadowed;
1735        shadowed = TREE_CHAIN (shadowed))
1736     pop_binding (TREE_PURPOSE (shadowed), TREE_TYPE (shadowed));
1737
1738   GNU_xref_end_scope ((HOST_WIDE_INT) class_binding_level,
1739                       (HOST_WIDE_INT) class_binding_level->level_chain,
1740                       class_binding_level->parm_flag,
1741                       class_binding_level->keep);
1742
1743   /* Now, pop out of the binding level which we created up in the
1744      `pushlevel_class' routine.  */
1745 #if defined(DEBUG_CP_BINDING_LEVELS)
1746   is_class_level = 1;
1747 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1748
1749   pop_binding_level ();
1750 }
1751
1752 /* We are entering the scope of a class.  Clear IDENTIFIER_CLASS_VALUE
1753    for any names in enclosing classes.  */
1754
1755 void
1756 clear_identifier_class_values ()
1757 {
1758   tree t;
1759
1760   if (!class_binding_level)
1761     return;
1762
1763   for (t = class_binding_level->class_shadowed;
1764        t;
1765        t = TREE_CHAIN (t))
1766     IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t)) = NULL_TREE;
1767 }
1768
1769 /* Returns non-zero if T is a virtual function table.  */
1770
1771 int
1772 vtable_decl_p (t, data)
1773      tree t;
1774      void *data ATTRIBUTE_UNUSED;
1775 {
1776   return (TREE_CODE (t) == VAR_DECL && DECL_VIRTUAL_P (t));
1777 }
1778
1779 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1780    functions.  */
1781
1782 int
1783 vtype_decl_p (t, data)
1784      tree t;
1785      void *data ATTRIBUTE_UNUSED;
1786 {
1787   return (TREE_CODE (t) == TYPE_DECL
1788           && TREE_CODE (TREE_TYPE (t)) == RECORD_TYPE
1789           && TYPE_POLYMORPHIC_P (TREE_TYPE (t)));
1790 }
1791
1792 /* Return the declarations that are members of the namespace NS.  */
1793
1794 tree
1795 cp_namespace_decls (ns)
1796      tree ns;
1797 {
1798   return NAMESPACE_LEVEL (ns)->names;
1799 }
1800
1801 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1802    itself, calling F for each.  The DATA is passed to F as well.  */
1803
1804 static int
1805 walk_namespaces_r (namespace, f, data)
1806      tree namespace;
1807      walk_namespaces_fn f;
1808      void *data;
1809 {
1810   tree current;
1811   int result = 0;
1812
1813   result |= (*f) (namespace, data);
1814
1815   for (current = cp_namespace_decls (namespace);
1816        current;
1817        current = TREE_CHAIN (current))
1818     {
1819       if (TREE_CODE (current) != NAMESPACE_DECL
1820           || DECL_NAMESPACE_ALIAS (current))
1821         continue;
1822       if (!DECL_LANG_SPECIFIC (current))
1823         {
1824           /* Hmm. std. */
1825           my_friendly_assert (current == fake_std_node, 393);
1826           continue;
1827         }
1828
1829       /* We found a namespace.  */
1830       result |= walk_namespaces_r (current, f, data);
1831     }
1832
1833   return result;
1834 }
1835
1836 /* Walk all the namespaces, calling F for each.  The DATA is passed to
1837    F as well.  */
1838
1839 int
1840 walk_namespaces (f, data)
1841      walk_namespaces_fn f;
1842      void *data;
1843 {
1844   return walk_namespaces_r (global_namespace, f, data);
1845 }
1846
1847 struct walk_globals_data {
1848   walk_globals_pred p;
1849   walk_globals_fn f;
1850   void *data;
1851 };
1852
1853 /* Walk the global declarations in NAMESPACE.  Whenever one is found
1854    for which P returns non-zero, call F with its address.  If any call
1855    to F returns a non-zero value, return a non-zero value.  */
1856
1857 static int
1858 walk_globals_r (namespace, data)
1859      tree namespace;
1860      void *data;
1861 {
1862   struct walk_globals_data* wgd = (struct walk_globals_data *) data;
1863   walk_globals_pred p = wgd->p;
1864   walk_globals_fn f = wgd->f;
1865   void *d = wgd->data;
1866   tree *t;
1867   int result = 0;
1868
1869   t = &NAMESPACE_LEVEL (namespace)->names;
1870
1871   while (*t)
1872     {
1873       tree glbl = *t;
1874
1875       if ((*p) (glbl, d))
1876         result |= (*f) (t, d);
1877
1878       /* If F changed *T, then *T still points at the next item to
1879          examine.  */
1880       if (*t == glbl)
1881         t = &TREE_CHAIN (*t);
1882     }
1883
1884   return result;
1885 }
1886
1887 /* Walk the global declarations.  Whenever one is found for which P
1888    returns non-zero, call F with its address.  If any call to F
1889    returns a non-zero value, return a non-zero value.  */
1890
1891 int
1892 walk_globals (p, f, data)
1893      walk_globals_pred p;
1894      walk_globals_fn f;
1895      void *data;
1896 {
1897   struct walk_globals_data wgd;
1898   wgd.p = p;
1899   wgd.f = f;
1900   wgd.data = data;
1901
1902   return walk_namespaces (walk_globals_r, &wgd);
1903 }
1904
1905 /* Call wrapup_globals_declarations for the globals in NAMESPACE.  If
1906    DATA is non-NULL, this is the last time we will call
1907    wrapup_global_declarations for this NAMESPACE.  */
1908
1909 int
1910 wrapup_globals_for_namespace (namespace, data)
1911      tree namespace;
1912      void *data;
1913 {
1914   tree globals = cp_namespace_decls (namespace);
1915   int len = list_length (globals);
1916   tree *vec = (tree *) alloca (sizeof (tree) * len);
1917   int i;
1918   int result;
1919   tree decl;
1920   int last_time = (data != 0);
1921
1922   if (last_time && namespace == global_namespace)
1923     /* Let compile_file handle the global namespace.  */
1924     return 0;
1925
1926   /* Process the decls in reverse order--earliest first.
1927      Put them into VEC from back to front, then take out from front.  */
1928
1929   for (i = 0, decl = globals; i < len; i++, decl = TREE_CHAIN (decl))
1930     {
1931       /* Pretend we've output an unused static variable.  This ensures
1932          that the toplevel __FUNCTION__ etc won't be emitted, unless
1933          needed. */
1934       if (TREE_CODE (decl) == VAR_DECL && DECL_ARTIFICIAL (decl)
1935           && !TREE_PUBLIC (decl) && !TREE_USED (decl))
1936         {
1937           TREE_ASM_WRITTEN (decl) = 1;
1938           DECL_IGNORED_P (decl) = 1;
1939         }
1940       vec[len - i - 1] = decl;
1941     }
1942
1943   if (last_time)
1944     {
1945       check_global_declarations (vec, len);
1946       return 0;
1947     }
1948
1949   /* Temporarily mark vtables as external.  That prevents
1950      wrapup_global_declarations from writing them out; we must process
1951      them ourselves in finish_vtable_vardecl.  */
1952   for (i = 0; i < len; ++i)
1953     if (vtable_decl_p (vec[i], /*data=*/0) && !DECL_EXTERNAL (vec[i]))
1954       {
1955         DECL_NOT_REALLY_EXTERN (vec[i]) = 1;
1956         DECL_EXTERNAL (vec[i]) = 1;
1957       }
1958
1959   /* Write out any globals that need to be output.  */
1960   result = wrapup_global_declarations (vec, len);
1961
1962   /* Undo the hack to DECL_EXTERNAL above.  */
1963   for (i = 0; i < len; ++i)
1964     if (vtable_decl_p (vec[i], /*data=*/0)
1965         && DECL_NOT_REALLY_EXTERN (vec[i]))
1966       {
1967         DECL_NOT_REALLY_EXTERN (vec[i]) = 0;
1968         DECL_EXTERNAL (vec[i]) = 0;
1969       }
1970
1971   return result;
1972 }
1973
1974 \f
1975 /* Mark ARG (which is really a struct binding_level **) for GC.  */
1976
1977 static void
1978 mark_binding_level (arg)
1979      void *arg;
1980 {
1981   struct binding_level *lvl = *(struct binding_level **)arg;
1982
1983   for (; lvl; lvl = lvl->level_chain)
1984     {
1985       ggc_mark_tree (lvl->names);
1986       ggc_mark_tree (lvl->tags);
1987       ggc_mark_tree (lvl->usings);
1988       ggc_mark_tree (lvl->using_directives);
1989       ggc_mark_tree (lvl->class_shadowed);
1990       ggc_mark_tree (lvl->type_shadowed);
1991       ggc_mark_tree (lvl->shadowed_labels);
1992       ggc_mark_tree (lvl->blocks);
1993       ggc_mark_tree (lvl->this_class);
1994       ggc_mark_tree (lvl->incomplete);
1995       ggc_mark_tree (lvl->dead_vars_from_for);
1996     }
1997 }
1998
1999 static void
2000 mark_named_label_lists (labs, uses)
2001      void *labs;
2002      void *uses;
2003 {
2004   struct named_label_list *l = *(struct named_label_list **)labs;
2005   struct named_label_use_list *u = *(struct named_label_use_list **)uses;
2006
2007   for (; l; l = l->next)
2008     {
2009       ggc_mark (l);
2010       mark_binding_level (l->binding_level);
2011       ggc_mark_tree (l->old_value);
2012       ggc_mark_tree (l->label_decl);
2013       ggc_mark_tree (l->bad_decls);
2014     }
2015
2016   for (; u; u = u->next)
2017     ggc_mark (u);
2018 }
2019 \f
2020 /* For debugging.  */
2021 static int no_print_functions = 0;
2022 static int no_print_builtins = 0;
2023
2024 void
2025 print_binding_level (lvl)
2026      struct binding_level *lvl;
2027 {
2028   tree t;
2029   int i = 0, len;
2030   fprintf (stderr, " blocks=");
2031   fprintf (stderr, HOST_PTR_PRINTF, lvl->blocks);
2032   fprintf (stderr, " n_incomplete=%d parm_flag=%d keep=%d",
2033            list_length (lvl->incomplete), lvl->parm_flag, lvl->keep);
2034   if (lvl->tag_transparent)
2035     fprintf (stderr, " tag-transparent");
2036   if (lvl->more_cleanups_ok)
2037     fprintf (stderr, " more-cleanups-ok");
2038   if (lvl->have_cleanups)
2039     fprintf (stderr, " have-cleanups");
2040   fprintf (stderr, "\n");
2041   if (lvl->names)
2042     {
2043       fprintf (stderr, " names:\t");
2044       /* We can probably fit 3 names to a line?  */
2045       for (t = lvl->names; t; t = TREE_CHAIN (t))
2046         {
2047           if (no_print_functions && (TREE_CODE (t) == FUNCTION_DECL))
2048             continue;
2049           if (no_print_builtins
2050               && (TREE_CODE (t) == TYPE_DECL)
2051               && (!strcmp (DECL_SOURCE_FILE (t),"<built-in>")))
2052             continue;
2053
2054           /* Function decls tend to have longer names.  */
2055           if (TREE_CODE (t) == FUNCTION_DECL)
2056             len = 3;
2057           else
2058             len = 2;
2059           i += len;
2060           if (i > 6)
2061             {
2062               fprintf (stderr, "\n\t");
2063               i = len;
2064             }
2065           print_node_brief (stderr, "", t, 0);
2066           if (t == error_mark_node)
2067             break;
2068         }
2069       if (i)
2070         fprintf (stderr, "\n");
2071     }
2072   if (lvl->tags)
2073     {
2074       fprintf (stderr, " tags:\t");
2075       i = 0;
2076       for (t = lvl->tags; t; t = TREE_CHAIN (t))
2077         {
2078           if (TREE_PURPOSE (t) == NULL_TREE)
2079             len = 3;
2080           else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t)))
2081             len = 2;
2082           else
2083             len = 4;
2084           i += len;
2085           if (i > 5)
2086             {
2087               fprintf (stderr, "\n\t");
2088               i = len;
2089             }
2090           if (TREE_PURPOSE (t) == NULL_TREE)
2091             {
2092               print_node_brief (stderr, "<unnamed-typedef", TREE_VALUE (t), 0);
2093               fprintf (stderr, ">");
2094             }
2095           else if (TREE_PURPOSE (t) == TYPE_IDENTIFIER (TREE_VALUE (t)))
2096             print_node_brief (stderr, "", TREE_VALUE (t), 0);
2097           else
2098             {
2099               print_node_brief (stderr, "<typedef", TREE_PURPOSE (t), 0);
2100               print_node_brief (stderr, "", TREE_VALUE (t), 0);
2101               fprintf (stderr, ">");
2102             }
2103         }
2104       if (i)
2105         fprintf (stderr, "\n");
2106     }
2107   if (lvl->class_shadowed)
2108     {
2109       fprintf (stderr, " class-shadowed:");
2110       for (t = lvl->class_shadowed; t; t = TREE_CHAIN (t))
2111         {
2112           fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
2113         }
2114       fprintf (stderr, "\n");
2115     }
2116   if (lvl->type_shadowed)
2117     {
2118       fprintf (stderr, " type-shadowed:");
2119       for (t = lvl->type_shadowed; t; t = TREE_CHAIN (t))
2120         {
2121           fprintf (stderr, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t)));
2122         }
2123       fprintf (stderr, "\n");
2124     }
2125 }
2126
2127 void
2128 print_other_binding_stack (stack)
2129      struct binding_level *stack;
2130 {
2131   struct binding_level *level;
2132   for (level = stack; level != global_binding_level; level = level->level_chain)
2133     {
2134       fprintf (stderr, "binding level ");
2135       fprintf (stderr, HOST_PTR_PRINTF, level);
2136       fprintf (stderr, "\n");
2137       print_binding_level (level);
2138     }
2139 }
2140
2141 void
2142 print_binding_stack ()
2143 {
2144   struct binding_level *b;
2145   fprintf (stderr, "current_binding_level=");
2146   fprintf (stderr, HOST_PTR_PRINTF, current_binding_level);
2147   fprintf (stderr, "\nclass_binding_level=");
2148   fprintf (stderr, HOST_PTR_PRINTF, class_binding_level);
2149   fprintf (stderr, "\nglobal_binding_level=");
2150   fprintf (stderr, HOST_PTR_PRINTF, global_binding_level);
2151   fprintf (stderr, "\n");
2152   if (class_binding_level)
2153     {
2154       for (b = class_binding_level; b; b = b->level_chain)
2155         if (b == current_binding_level)
2156           break;
2157       if (b)
2158         b = class_binding_level;
2159       else
2160         b = current_binding_level;
2161     }
2162   else
2163     b = current_binding_level;
2164   print_other_binding_stack (b);
2165   fprintf (stderr, "global:\n");
2166   print_binding_level (global_binding_level);
2167 }
2168
2169 /* Namespace binding access routines: The namespace_bindings field of
2170    the identifier is polymorphic, with three possible values:
2171    NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2172    indicating the BINDING_VALUE of global_namespace. */
2173
2174 /* Check whether the a binding for the name to scope is known.
2175    Assumes that the bindings of the name are already a list
2176    of bindings. Returns the binding found, or NULL_TREE. */
2177
2178 static tree
2179 find_binding (name, scope)
2180      tree name;
2181      tree scope;
2182 {
2183   tree iter, prev = NULL_TREE;
2184
2185   scope = ORIGINAL_NAMESPACE (scope);
2186
2187   for (iter = IDENTIFIER_NAMESPACE_BINDINGS (name); iter;
2188        iter = TREE_CHAIN (iter))
2189     {
2190       my_friendly_assert (TREE_CODE (iter) == CPLUS_BINDING, 374);
2191       if (BINDING_SCOPE (iter) == scope)
2192         {
2193           /* Move binding found to the front of the list, so
2194              subsequent lookups will find it faster. */
2195           if (prev)
2196             {
2197               TREE_CHAIN (prev) = TREE_CHAIN (iter);
2198               TREE_CHAIN (iter) = IDENTIFIER_NAMESPACE_BINDINGS (name);
2199               IDENTIFIER_NAMESPACE_BINDINGS (name) = iter;
2200             }
2201           return iter;
2202         }
2203       prev = iter;
2204     }
2205   return NULL_TREE;
2206 }
2207
2208 /* Always returns a binding for name in scope. If the
2209    namespace_bindings is not a list, convert it to one first.
2210    If no binding is found, make a new one. */
2211
2212 tree
2213 binding_for_name (name, scope)
2214      tree name;
2215      tree scope;
2216 {
2217   tree b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2218   tree result;
2219
2220   scope = ORIGINAL_NAMESPACE (scope);
2221
2222   if (b && TREE_CODE (b) != CPLUS_BINDING)
2223     {
2224       /* Get rid of optimization for global scope. */
2225       IDENTIFIER_NAMESPACE_BINDINGS (name) = NULL_TREE;
2226       BINDING_VALUE (binding_for_name (name, global_namespace)) = b;
2227       b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2228     }
2229   if (b && (result = find_binding (name, scope)))
2230     return result;
2231   /* Not found, make a new one. */
2232   result = make_node (CPLUS_BINDING);
2233   TREE_CHAIN (result) = b;
2234   IDENTIFIER_NAMESPACE_BINDINGS (name) = result;
2235   BINDING_SCOPE (result) = scope;
2236   BINDING_TYPE (result) = NULL_TREE;
2237   BINDING_VALUE (result) = NULL_TREE;
2238   return result;
2239 }
2240
2241 /* Return the binding value for name in scope, considering that
2242    namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2243
2244 tree
2245 namespace_binding (name, scope)
2246      tree name;
2247      tree scope;
2248 {
2249   tree b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2250   if (b == NULL_TREE)
2251     return NULL_TREE;
2252   if (scope == NULL_TREE)
2253     scope = global_namespace;
2254   if (TREE_CODE (b) != CPLUS_BINDING)
2255     return (scope == global_namespace) ? b : NULL_TREE;
2256   name = find_binding (name,scope);
2257   if (name == NULL_TREE)
2258     return name;
2259   return BINDING_VALUE (name);
2260 }
2261
2262 /* Set the binding value for name in scope. If modifying the binding
2263    of global_namespace is attempted, try to optimize it. */
2264
2265 void
2266 set_namespace_binding (name, scope, val)
2267      tree name;
2268      tree scope;
2269      tree val;
2270 {
2271   tree b;
2272
2273   if (scope == NULL_TREE)
2274     scope = global_namespace;
2275
2276   if (scope == global_namespace)
2277     {
2278       b = IDENTIFIER_NAMESPACE_BINDINGS (name);
2279       if (b == NULL_TREE || TREE_CODE (b) != CPLUS_BINDING)
2280         {
2281           IDENTIFIER_NAMESPACE_BINDINGS (name) = val;
2282           return;
2283         }
2284     }
2285   b = binding_for_name (name, scope);
2286   BINDING_VALUE (b) = val;
2287 }
2288
2289 /* Push into the scope of the NAME namespace.  If NAME is NULL_TREE, then we
2290    select a name that is unique to this compilation unit.  */
2291
2292 void
2293 push_namespace (name)
2294      tree name;
2295 {
2296   tree d = NULL_TREE;
2297   int need_new = 1;
2298   int implicit_use = 0;
2299   int global = 0;
2300   if (!global_namespace)
2301     {
2302       /* This must be ::. */
2303       my_friendly_assert (name == get_identifier ("::"), 377);
2304       global = 1;
2305     }
2306   else if (!name)
2307     {
2308       /* The name of anonymous namespace is unique for the translation
2309          unit.  */
2310       if (!anonymous_namespace_name)
2311         anonymous_namespace_name = get_file_function_name ('N');
2312       name = anonymous_namespace_name;
2313       d = IDENTIFIER_NAMESPACE_VALUE (name);
2314       if (d)
2315         /* Reopening anonymous namespace.  */
2316         need_new = 0;
2317       implicit_use = 1;
2318     }
2319   else if (current_namespace == global_namespace
2320            && !flag_honor_std
2321            && name == std_identifier)
2322     {
2323       in_fake_std++;
2324       return;
2325     }
2326   else
2327     {
2328       /* Check whether this is an extended namespace definition. */
2329       d = IDENTIFIER_NAMESPACE_VALUE (name);
2330       if (d != NULL_TREE && TREE_CODE (d) == NAMESPACE_DECL)
2331         {
2332           need_new = 0;
2333           if (DECL_NAMESPACE_ALIAS (d))
2334             {
2335               cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2336                         d, DECL_NAMESPACE_ALIAS (d));
2337               d = DECL_NAMESPACE_ALIAS (d);
2338             }
2339         }
2340     }
2341
2342   if (need_new)
2343     {
2344       /* Make a new namespace, binding the name to it. */
2345       d = build_lang_decl (NAMESPACE_DECL, name, void_type_node);
2346       /* The global namespace is not pushed, and the global binding
2347          level is set elsewhere.  */
2348       if (!global)
2349         {
2350           DECL_CONTEXT (d) = FROB_CONTEXT (current_namespace);
2351           d = pushdecl (d);
2352           pushlevel (0);
2353           declare_namespace_level ();
2354           NAMESPACE_LEVEL (d) = current_binding_level;
2355         }
2356     }
2357   else
2358     resume_binding_level (NAMESPACE_LEVEL (d));
2359
2360   if (implicit_use)
2361     do_using_directive (d);
2362   /* Enter the name space. */
2363   current_namespace = d;
2364 }
2365
2366 /* Pop from the scope of the current namespace.  */
2367
2368 void
2369 pop_namespace ()
2370 {
2371   if (current_namespace == global_namespace)
2372     {
2373       my_friendly_assert (in_fake_std > 0, 980421);
2374       in_fake_std--;
2375       return;
2376     }
2377   current_namespace = CP_DECL_CONTEXT (current_namespace);
2378   /* The binding level is not popped, as it might be re-opened later.  */
2379   suspend_binding_level ();
2380 }
2381
2382 /* Push into the scope of the namespace NS, even if it is deeply
2383    nested within another namespace.  */
2384
2385 void
2386 push_nested_namespace (ns)
2387      tree ns;
2388 {
2389   if (ns == global_namespace)
2390     push_to_top_level ();
2391   else
2392     {
2393       push_nested_namespace (CP_DECL_CONTEXT (ns));
2394       push_namespace (DECL_NAME (ns));
2395     }
2396 }
2397
2398 /* Pop back from the scope of the namespace NS, which was previously
2399    entered with push_nested_namespace.  */
2400
2401 void
2402 pop_nested_namespace (ns)
2403      tree ns;
2404 {
2405   while (ns != global_namespace)
2406     {
2407       pop_namespace ();
2408       ns = CP_DECL_CONTEXT (ns);
2409     }
2410
2411   pop_from_top_level ();
2412 }
2413
2414 \f
2415 /* Subroutines for reverting temporarily to top-level for instantiation
2416    of templates and such.  We actually need to clear out the class- and
2417    local-value slots of all identifiers, so that only the global values
2418    are at all visible.  Simply setting current_binding_level to the global
2419    scope isn't enough, because more binding levels may be pushed.  */
2420 struct saved_scope *scope_chain;
2421
2422 /* Mark ARG (which is really a struct saved_scope **) for GC.  */
2423
2424 static void
2425 mark_saved_scope (arg)
2426      void *arg;
2427 {
2428   struct saved_scope *t = *(struct saved_scope **)arg;
2429   while (t)
2430     {
2431       mark_binding_level (&t->class_bindings);
2432       ggc_mark_tree (t->old_bindings);
2433       ggc_mark_tree (t->old_namespace);
2434       ggc_mark_tree (t->class_name);
2435       ggc_mark_tree (t->class_type);
2436       ggc_mark_tree (t->access_specifier);
2437       ggc_mark_tree (t->function_decl);
2438       if (t->lang_base)
2439         ggc_mark_tree_varray (t->lang_base);
2440       ggc_mark_tree (t->lang_name);
2441       ggc_mark_tree (t->template_parms);
2442       ggc_mark_tree (t->x_previous_class_type);
2443       ggc_mark_tree (t->x_previous_class_values);
2444       ggc_mark_tree (t->x_saved_tree);
2445       ggc_mark_tree (t->incomplete);
2446       ggc_mark_tree (t->lookups);
2447
2448       mark_stmt_tree (&t->x_stmt_tree);
2449       mark_binding_level (&t->bindings);
2450       t = t->prev;
2451     }
2452 }
2453
2454 static tree
2455 store_bindings (names, old_bindings)
2456      tree names, old_bindings;
2457 {
2458   tree t;
2459   for (t = names; t; t = TREE_CHAIN (t))
2460     {
2461       tree binding, t1, id;
2462
2463       if (TREE_CODE (t) == TREE_LIST)
2464         id = TREE_PURPOSE (t);
2465       else
2466         id = DECL_NAME (t);
2467
2468       if (!id
2469           /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2470              we have no IDENTIFIER_BINDING if we have left the class
2471              scope, but cached the class-level declarations.  */
2472           || !(IDENTIFIER_BINDING (id) || IDENTIFIER_CLASS_VALUE (id)))
2473         continue;
2474
2475       for (t1 = old_bindings; t1; t1 = TREE_CHAIN (t1))
2476         if (TREE_VEC_ELT (t1, 0) == id)
2477           goto skip_it;
2478
2479       binding = make_tree_vec (4);
2480
2481       if (id)
2482         {
2483           my_friendly_assert (TREE_CODE (id) == IDENTIFIER_NODE, 135);
2484           TREE_VEC_ELT (binding, 0) = id;
2485           TREE_VEC_ELT (binding, 1) = REAL_IDENTIFIER_TYPE_VALUE (id);
2486           TREE_VEC_ELT (binding, 2) = IDENTIFIER_BINDING (id);
2487           TREE_VEC_ELT (binding, 3) = IDENTIFIER_CLASS_VALUE (id);
2488           IDENTIFIER_BINDING (id) = NULL_TREE;
2489           IDENTIFIER_CLASS_VALUE (id) = NULL_TREE;
2490         }
2491       TREE_CHAIN (binding) = old_bindings;
2492       old_bindings = binding;
2493     skip_it:
2494       ;
2495     }
2496   return old_bindings;
2497 }
2498
2499 void
2500 maybe_push_to_top_level (pseudo)
2501      int pseudo;
2502 {
2503   struct saved_scope *s;
2504   struct binding_level *b;
2505   tree old_bindings;
2506   int need_pop;
2507
2508   s = (struct saved_scope *) xcalloc (1, sizeof (struct saved_scope));
2509
2510   b = scope_chain ? current_binding_level : 0;
2511
2512   /* If we're in the middle of some function, save our state.  */
2513   if (cfun)
2514     {
2515       need_pop = 1;
2516       push_function_context_to (NULL_TREE);
2517     }
2518   else
2519     need_pop = 0;
2520
2521   old_bindings = NULL_TREE;
2522   if (scope_chain && previous_class_type)
2523     old_bindings = store_bindings (previous_class_values, old_bindings);
2524
2525   /* Have to include global_binding_level, because class-level decls
2526      aren't listed anywhere useful.  */
2527   for (; b; b = b->level_chain)
2528     {
2529       tree t;
2530
2531       /* Template IDs are inserted into the global level. If they were
2532          inserted into namespace level, finish_file wouldn't find them
2533          when doing pending instantiations. Therefore, don't stop at
2534          namespace level, but continue until :: .  */
2535       if (b == global_binding_level || (pseudo && b->template_parms_p))
2536         break;
2537
2538       old_bindings = store_bindings (b->names, old_bindings);
2539       /* We also need to check class_shadowed to save class-level type
2540          bindings, since pushclass doesn't fill in b->names.  */
2541       if (b->parm_flag == 2)
2542         old_bindings = store_bindings (b->class_shadowed, old_bindings);
2543
2544       /* Unwind type-value slots back to top level.  */
2545       for (t = b->type_shadowed; t; t = TREE_CHAIN (t))
2546         SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t), TREE_VALUE (t));
2547     }
2548   s->prev = scope_chain;
2549   s->old_bindings = old_bindings;
2550   s->bindings = b;
2551   s->need_pop_function_context = need_pop;
2552   s->function_decl = current_function_decl;
2553
2554   scope_chain = s;
2555   current_function_decl = NULL_TREE;
2556   VARRAY_TREE_INIT (current_lang_base, 10, "current_lang_base");
2557   current_lang_stack = &VARRAY_TREE (current_lang_base, 0);
2558   current_lang_name = lang_name_cplusplus;
2559   current_namespace = global_namespace;
2560 }
2561
2562 void
2563 push_to_top_level ()
2564 {
2565   maybe_push_to_top_level (0);
2566 }
2567
2568 void
2569 pop_from_top_level ()
2570 {
2571   struct saved_scope *s = scope_chain;
2572   tree t;
2573
2574   /* Clear out class-level bindings cache.  */
2575   if (previous_class_type)
2576     invalidate_class_lookup_cache ();
2577
2578   VARRAY_FREE (current_lang_base);
2579
2580   scope_chain = s->prev;
2581   for (t = s->old_bindings; t; t = TREE_CHAIN (t))
2582     {
2583       tree id = TREE_VEC_ELT (t, 0);
2584       if (id)
2585         {
2586           SET_IDENTIFIER_TYPE_VALUE (id, TREE_VEC_ELT (t, 1));
2587           IDENTIFIER_BINDING (id) = TREE_VEC_ELT (t, 2);
2588           IDENTIFIER_CLASS_VALUE (id) = TREE_VEC_ELT (t, 3);
2589         }
2590     }
2591
2592   /* If we were in the middle of compiling a function, restore our
2593      state.  */
2594   if (s->need_pop_function_context)
2595     pop_function_context_from (NULL_TREE);
2596   current_function_decl = s->function_decl;
2597
2598   free (s);
2599 }
2600 \f
2601 /* Push a definition of struct, union or enum tag "name".
2602    into binding_level "b".   "type" should be the type node,
2603    We assume that the tag "name" is not already defined.
2604
2605    Note that the definition may really be just a forward reference.
2606    In that case, the TYPE_SIZE will be a NULL_TREE.
2607
2608    C++ gratuitously puts all these tags in the name space.  */
2609
2610 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2611    record the shadowed value for this binding contour.  TYPE is
2612    the type that ID maps to.  */
2613
2614 static void
2615 set_identifier_type_value_with_scope (id, type, b)
2616      tree id;
2617      tree type;
2618      struct binding_level *b;
2619 {
2620   if (!b->namespace_p)
2621     {
2622       /* Shadow the marker, not the real thing, so that the marker
2623          gets restored later. */
2624       tree old_type_value = REAL_IDENTIFIER_TYPE_VALUE (id);
2625       b->type_shadowed
2626         = tree_cons (id, old_type_value, b->type_shadowed);
2627     }
2628   else
2629     {
2630       tree binding = binding_for_name (id, current_namespace);
2631       BINDING_TYPE (binding) = type;
2632       /* Store marker instead of real type. */
2633       type = global_type_node;
2634     }
2635   SET_IDENTIFIER_TYPE_VALUE (id, type);
2636 }
2637
2638 /* As set_identifier_type_value_with_scope, but using current_binding_level.  */
2639
2640 void
2641 set_identifier_type_value (id, type)
2642      tree id;
2643      tree type;
2644 {
2645   set_identifier_type_value_with_scope (id, type, current_binding_level);
2646 }
2647
2648 /* Return the type associated with id. */
2649
2650 tree
2651 identifier_type_value (id)
2652      tree id;
2653 {
2654   /* There is no type with that name, anywhere. */
2655   if (REAL_IDENTIFIER_TYPE_VALUE (id) == NULL_TREE)
2656     return NULL_TREE;
2657   /* This is not the type marker, but the real thing. */
2658   if (REAL_IDENTIFIER_TYPE_VALUE (id) != global_type_node)
2659     return REAL_IDENTIFIER_TYPE_VALUE (id);
2660   /* Have to search for it. It must be on the global level, now.
2661      Ask lookup_name not to return non-types. */
2662   id = lookup_name_real (id, 2, 1, 0);
2663   if (id)
2664     return TREE_TYPE (id);
2665   return NULL_TREE;
2666 }
2667
2668 /* Pop off extraneous binding levels left over due to syntax errors.
2669
2670    We don't pop past namespaces, as they might be valid.  */
2671
2672 void
2673 pop_everything ()
2674 {
2675 #ifdef DEBUG_CP_BINDING_LEVELS
2676   fprintf (stderr, "XXX entering pop_everything ()\n");
2677 #endif
2678   while (!toplevel_bindings_p ())
2679     {
2680       if (current_binding_level->parm_flag == 2)
2681         pop_nested_class ();
2682       else
2683         poplevel (0, 0, 0);
2684     }
2685 #ifdef DEBUG_CP_BINDING_LEVELS
2686   fprintf (stderr, "XXX leaving pop_everything ()\n");
2687 #endif
2688 }
2689
2690 /* The type TYPE is being declared.  If it is a class template, or a
2691    specialization of a class template, do any processing required and
2692    perform error-checking.  If IS_FRIEND is non-zero, this TYPE is
2693    being declared a friend.  B is the binding level at which this TYPE
2694    should be bound.
2695
2696    Returns the TYPE_DECL for TYPE, which may have been altered by this
2697    processing.  */
2698
2699 static tree
2700 maybe_process_template_type_declaration (type, globalize, b)
2701      tree type;
2702      int globalize;
2703      struct binding_level* b;
2704 {
2705   tree decl = TYPE_NAME (type);
2706
2707   if (processing_template_parmlist)
2708     /* You can't declare a new template type in a template parameter
2709        list.  But, you can declare a non-template type:
2710
2711          template <class A*> struct S;
2712
2713        is a forward-declaration of `A'.  */
2714     ;
2715   else
2716     {
2717       maybe_check_template_type (type);
2718
2719       my_friendly_assert (IS_AGGR_TYPE (type)
2720                           || TREE_CODE (type) == ENUMERAL_TYPE, 0);
2721
2722
2723       if (processing_template_decl)
2724         {
2725           /* This may change after the call to
2726              push_template_decl_real, but we want the original value.  */
2727           tree name = DECL_NAME (decl);
2728
2729           decl = push_template_decl_real (decl, globalize);
2730           /* If the current binding level is the binding level for the
2731              template parameters (see the comment in
2732              begin_template_parm_list) and the enclosing level is a class
2733              scope, and we're not looking at a friend, push the
2734              declaration of the member class into the class scope.  In the
2735              friend case, push_template_decl will already have put the
2736              friend into global scope, if appropriate.  */
2737           if (TREE_CODE (type) != ENUMERAL_TYPE
2738               && !globalize && b->template_parms_p
2739               && b->level_chain->parm_flag == 2)
2740             {
2741               finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type));
2742               /* Put this tag on the list of tags for the class, since
2743                  that won't happen below because B is not the class
2744                  binding level, but is instead the pseudo-global level.  */
2745               b->level_chain->tags =
2746                 tree_cons (name, type, b->level_chain->tags);
2747               if (!COMPLETE_TYPE_P (current_class_type))
2748                 CLASSTYPE_TAGS (current_class_type) = b->level_chain->tags;
2749             }
2750         }
2751     }
2752
2753   return decl;
2754 }
2755
2756 /* In C++, you don't have to write `struct S' to refer to `S'; you
2757    can just use `S'.  We accomplish this by creating a TYPE_DECL as
2758    if the user had written `typedef struct S S'.  Create and return
2759    the TYPE_DECL for TYPE.  */
2760
2761 tree
2762 create_implicit_typedef (name, type)
2763      tree name;
2764      tree type;
2765 {
2766   tree decl;
2767
2768   decl = build_decl (TYPE_DECL, name, type);
2769   DECL_ARTIFICIAL (decl) = 1;
2770   /* There are other implicit type declarations, like the one *within*
2771      a class that allows you to write `S::S'.  We must distinguish
2772      amongst these.  */
2773   SET_DECL_IMPLICIT_TYPEDEF_P (decl);
2774   TYPE_NAME (type) = decl;
2775
2776   return decl;
2777 }
2778
2779 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2780    Normally put it into the inner-most non-tag-transparent scope,
2781    but if GLOBALIZE is true, put it in the inner-most non-class scope.
2782    The latter is needed for implicit declarations.  */
2783
2784 void
2785 pushtag (name, type, globalize)
2786      tree name, type;
2787      int globalize;
2788 {
2789   register struct binding_level *b;
2790
2791   b = current_binding_level;
2792   while (b->tag_transparent
2793          || (globalize && b->parm_flag == 2))
2794     b = b->level_chain;
2795
2796   b->tags = tree_cons (name, type, b->tags);
2797
2798   if (name)
2799     {
2800       /* Do C++ gratuitous typedefing.  */
2801       if (IDENTIFIER_TYPE_VALUE (name) != type)
2802         {
2803           register tree d = NULL_TREE;
2804           int in_class = 0;
2805           tree context = TYPE_CONTEXT (type);
2806
2807           if (! context)
2808             {
2809               tree cs = current_scope ();
2810
2811               if (! globalize)
2812                 context = cs;
2813               else if (cs != NULL_TREE && TYPE_P (cs))
2814                 /* When declaring a friend class of a local class, we want
2815                    to inject the newly named class into the scope
2816                    containing the local class, not the namespace scope.  */
2817                 context = decl_function_context (get_type_decl (cs));
2818             }
2819           if (!context)
2820             context = current_namespace;
2821
2822           if ((b->template_parms_p && b->level_chain->parm_flag == 2)
2823               || b->parm_flag == 2)
2824             in_class = 1;
2825
2826           if (current_lang_name == lang_name_java)
2827             TYPE_FOR_JAVA (type) = 1;
2828
2829           d = create_implicit_typedef (name, type);
2830           DECL_CONTEXT (d) = FROB_CONTEXT (context);
2831           if (! in_class)
2832             set_identifier_type_value_with_scope (name, type, b);
2833
2834           d = maybe_process_template_type_declaration (type,
2835                                                        globalize, b);
2836
2837           if (b->parm_flag == 2)
2838             {
2839               if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2840                 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2841                    class.  But if it's a member template class, we
2842                    want the TEMPLATE_DECL, not the TYPE_DECL, so this
2843                    is done later.  */
2844                 finish_member_declaration (d);
2845               else
2846                 pushdecl_class_level (d);
2847             }
2848           else
2849             d = pushdecl_with_scope (d, b);
2850
2851           if (ANON_AGGRNAME_P (name))
2852             DECL_IGNORED_P (d) = 1;
2853
2854           TYPE_CONTEXT (type) = DECL_CONTEXT (d);
2855           DECL_ASSEMBLER_NAME (d) = DECL_NAME (d);
2856
2857           /* If this is a local class, keep track of it.  We need this
2858              information for name-mangling, and so that it is possible to find
2859              all function definitions in a translation unit in a convenient
2860              way.  (It's otherwise tricky to find a member function definition
2861              it's only pointed to from within a local class.)  */
2862           if (TYPE_CONTEXT (type)
2863               && TREE_CODE (TYPE_CONTEXT (type)) == FUNCTION_DECL
2864               && !processing_template_decl)
2865             VARRAY_PUSH_TREE (local_classes, type);
2866
2867           if (!uses_template_parms (type))
2868             {
2869               if (flag_new_abi)
2870                 DECL_ASSEMBLER_NAME (d) = mangle_type (type);
2871               else
2872                 DECL_ASSEMBLER_NAME (d)
2873                   = get_identifier (build_overload_name (type, 1, 1));
2874             }
2875         }
2876       if (b->parm_flag == 2)
2877         {
2878           if (!COMPLETE_TYPE_P (current_class_type))
2879             CLASSTYPE_TAGS (current_class_type) = b->tags;
2880         }
2881     }
2882
2883   if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL)
2884     /* Use the canonical TYPE_DECL for this node.  */
2885     TYPE_STUB_DECL (type) = TYPE_NAME (type);
2886   else
2887     {
2888       /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2889          will be the tagged type we just added to the current
2890          binding level.  This fake NULL-named TYPE_DECL node helps
2891          dwarfout.c to know when it needs to output a
2892          representation of a tagged type, and it also gives us a
2893          convenient place to record the "scope start" address for
2894          the tagged type.  */
2895
2896       tree d = build_decl (TYPE_DECL, NULL_TREE, type);
2897       TYPE_STUB_DECL (type) = pushdecl_with_scope (d, b);
2898     }
2899 }
2900
2901 /* Counter used to create anonymous type names.  */
2902
2903 static int anon_cnt = 0;
2904
2905 /* Return an IDENTIFIER which can be used as a name for
2906    anonymous structs and unions.  */
2907
2908 tree
2909 make_anon_name ()
2910 {
2911   char buf[32];
2912
2913   sprintf (buf, ANON_AGGRNAME_FORMAT, anon_cnt++);
2914   return get_identifier (buf);
2915 }
2916
2917 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2918    This keeps dbxout from getting confused.  */
2919
2920 void
2921 clear_anon_tags ()
2922 {
2923   register struct binding_level *b;
2924   register tree tags;
2925   static int last_cnt = 0;
2926
2927   /* Fast out if no new anon names were declared.  */
2928   if (last_cnt == anon_cnt)
2929     return;
2930
2931   b = current_binding_level;
2932   while (b->tag_transparent)
2933     b = b->level_chain;
2934   tags = b->tags;
2935   while (tags)
2936     {
2937       /* A NULL purpose means we have already processed all tags
2938          from here to the end of the list.  */
2939       if (TREE_PURPOSE (tags) == NULL_TREE)
2940         break;
2941       if (ANON_AGGRNAME_P (TREE_PURPOSE (tags)))
2942         TREE_PURPOSE (tags) = NULL_TREE;
2943       tags = TREE_CHAIN (tags);
2944     }
2945   last_cnt = anon_cnt;
2946 }
2947 \f
2948 /* Subroutine of duplicate_decls: return truthvalue of whether
2949    or not types of these decls match.
2950
2951    For C++, we must compare the parameter list so that `int' can match
2952    `int&' in a parameter position, but `int&' is not confused with
2953    `const int&'.  */
2954
2955 int
2956 decls_match (newdecl, olddecl)
2957      tree newdecl, olddecl;
2958 {
2959   int types_match;
2960
2961   if (newdecl == olddecl)
2962     return 1;
2963
2964   if (TREE_CODE (newdecl) != TREE_CODE (olddecl))
2965     /* If the two DECLs are not even the same kind of thing, we're not
2966        interested in their types.  */
2967     return 0;
2968
2969   if (TREE_CODE (newdecl) == FUNCTION_DECL)
2970     {
2971       tree f1 = TREE_TYPE (newdecl);
2972       tree f2 = TREE_TYPE (olddecl);
2973       tree p1 = TYPE_ARG_TYPES (f1);
2974       tree p2 = TYPE_ARG_TYPES (f2);
2975
2976       if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl)
2977           && ! (DECL_EXTERN_C_P (newdecl)
2978                 && DECL_EXTERN_C_P (olddecl)))
2979         return 0;
2980
2981       if (TREE_CODE (f1) != TREE_CODE (f2))
2982         return 0;
2983
2984       if (same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
2985         {
2986           if (p2 == NULL_TREE && DECL_EXTERN_C_P (olddecl)
2987               && (DECL_BUILT_IN (olddecl)
2988 #ifndef NO_IMPLICIT_EXTERN_C
2989                   || (DECL_IN_SYSTEM_HEADER (newdecl) && !DECL_CLASS_SCOPE_P (newdecl))
2990                   || (DECL_IN_SYSTEM_HEADER (olddecl) && !DECL_CLASS_SCOPE_P (olddecl))
2991 #endif
2992               ))
2993             {
2994               types_match = self_promoting_args_p (p1);
2995               if (p1 == void_list_node)
2996                 TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
2997             }
2998 #ifndef NO_IMPLICIT_EXTERN_C
2999           else if (p1 == NULL_TREE
3000                    && (DECL_EXTERN_C_P (olddecl)
3001                        && DECL_IN_SYSTEM_HEADER (olddecl)
3002                        && !DECL_CLASS_SCOPE_P (olddecl))
3003                    && (DECL_EXTERN_C_P (newdecl)
3004                        && DECL_IN_SYSTEM_HEADER (newdecl)
3005                        && !DECL_CLASS_SCOPE_P (newdecl)))
3006             {
3007               types_match = self_promoting_args_p (p2);
3008               TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
3009             }
3010 #endif
3011           else
3012             types_match = compparms (p1, p2);
3013         }
3014       else
3015         types_match = 0;
3016     }
3017   else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3018     {
3019       if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
3020                                 DECL_TEMPLATE_PARMS (olddecl)))
3021         return 0;
3022
3023       if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl))
3024           != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)))
3025         return 0;
3026
3027       if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
3028         types_match = 1;
3029       else
3030         types_match = decls_match (DECL_TEMPLATE_RESULT (olddecl),
3031                                    DECL_TEMPLATE_RESULT (newdecl));
3032     }
3033   else
3034     {
3035       if (TREE_TYPE (newdecl) == error_mark_node)
3036         types_match = TREE_TYPE (olddecl) == error_mark_node;
3037       else if (TREE_TYPE (olddecl) == NULL_TREE)
3038         types_match = TREE_TYPE (newdecl) == NULL_TREE;
3039       else if (TREE_TYPE (newdecl) == NULL_TREE)
3040         types_match = 0;
3041       else
3042         types_match = comptypes (TREE_TYPE (newdecl),
3043                                  TREE_TYPE (olddecl),
3044                                  COMPARE_REDECLARATION);
3045     }
3046
3047   return types_match;
3048 }
3049
3050 /* If NEWDECL is `static' and an `extern' was seen previously,
3051    warn about it.  OLDDECL is the previous declaration.
3052
3053    Note that this does not apply to the C++ case of declaring
3054    a variable `extern const' and then later `const'.
3055
3056    Don't complain about built-in functions, since they are beyond
3057    the user's control.  */
3058
3059 static void
3060 warn_extern_redeclared_static (newdecl, olddecl)
3061      tree newdecl, olddecl;
3062 {
3063   static const char *explicit_extern_static_warning
3064     = "`%D' was declared `extern' and later `static'";
3065   static const char *implicit_extern_static_warning
3066     = "`%D' was declared implicitly `extern' and later `static'";
3067
3068   tree name;
3069
3070   if (TREE_CODE (newdecl) == TYPE_DECL
3071       || TREE_CODE (newdecl) == TEMPLATE_DECL
3072       || TREE_CODE (newdecl) == CONST_DECL)
3073     return;
3074
3075   /* Don't get confused by static member functions; that's a different
3076      use of `static'.  */
3077   if (TREE_CODE (newdecl) == FUNCTION_DECL
3078       && DECL_STATIC_FUNCTION_P (newdecl))
3079     return;
3080
3081   /* If the old declaration was `static', or the new one isn't, then
3082      then everything is OK.  */
3083   if (DECL_THIS_STATIC (olddecl) || !DECL_THIS_STATIC (newdecl))
3084     return;
3085
3086   /* It's OK to declare a builtin function as `static'.  */
3087   if (TREE_CODE (olddecl) == FUNCTION_DECL
3088       && DECL_ARTIFICIAL (olddecl))
3089     return;
3090
3091   name = DECL_ASSEMBLER_NAME (newdecl);
3092   cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name)
3093               ? implicit_extern_static_warning
3094               : explicit_extern_static_warning, newdecl);
3095   cp_pedwarn_at ("previous declaration of `%D'", olddecl);
3096 }
3097
3098 /* Handle when a new declaration NEWDECL has the same name as an old
3099    one OLDDECL in the same binding contour.  Prints an error message
3100    if appropriate.
3101
3102    If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3103    Otherwise, return 0.  */
3104
3105 int
3106 duplicate_decls (newdecl, olddecl)
3107      tree newdecl, olddecl;
3108 {
3109   unsigned olddecl_uid = DECL_UID (olddecl);
3110   int olddecl_friend = 0, types_match = 0;
3111   int new_defines_function = 0;
3112
3113   if (newdecl == olddecl)
3114     return 1;
3115
3116   types_match = decls_match (newdecl, olddecl);
3117
3118   /* If either the type of the new decl or the type of the old decl is an
3119      error_mark_node, then that implies that we have already issued an
3120      error (earlier) for some bogus type specification, and in that case,
3121      it is rather pointless to harass the user with yet more error message
3122      about the same declaration, so just pretend the types match here.  */
3123   if (TREE_TYPE (newdecl) == error_mark_node
3124       || TREE_TYPE (olddecl) == error_mark_node)
3125     types_match = 1;
3126
3127   /* Check for redeclaration and other discrepancies. */
3128   if (TREE_CODE (olddecl) == FUNCTION_DECL
3129       && DECL_ARTIFICIAL (olddecl))
3130     {
3131       if (TREE_CODE (newdecl) != FUNCTION_DECL)
3132         {
3133           /* If you declare a built-in or predefined function name as static,
3134              the old definition is overridden, but optionally warn this was a
3135              bad choice of name.  */
3136           if (! TREE_PUBLIC (newdecl))
3137             {
3138               if (warn_shadow)
3139                 cp_warning ("shadowing %s function `%#D'",
3140                             DECL_BUILT_IN (olddecl) ? "built-in" : "library",
3141                             olddecl);
3142               /* Discard the old built-in function.  */
3143               return 0;
3144             }
3145           /* If the built-in is not ansi, then programs can override
3146              it even globally without an error.  */
3147           else if (! DECL_BUILT_IN (olddecl))
3148             cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3149                         olddecl, newdecl);
3150           else
3151             {
3152               cp_error ("declaration of `%#D'", newdecl);
3153               cp_error ("conflicts with built-in declaration `%#D'",
3154                         olddecl);
3155             }
3156           return 0;
3157         }
3158       else if (!types_match)
3159         {
3160           if ((DECL_EXTERN_C_P (newdecl)
3161                && DECL_EXTERN_C_P (olddecl))
3162               || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
3163                             TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
3164             {
3165               /* A near match; override the builtin.  */
3166
3167               if (TREE_PUBLIC (newdecl))
3168                 {
3169                   cp_warning ("new declaration `%#D'", newdecl);
3170                   cp_warning ("ambiguates built-in declaration `%#D'",
3171                               olddecl);
3172                 }
3173               else if (warn_shadow)
3174                 cp_warning ("shadowing %s function `%#D'",
3175                             DECL_BUILT_IN (olddecl) ? "built-in" : "library",
3176                             olddecl);
3177             }
3178           else
3179             /* Discard the old built-in function.  */
3180             return 0;
3181         }
3182
3183       if (DECL_THIS_STATIC (newdecl) && !DECL_THIS_STATIC (olddecl))
3184         {
3185           /* If a builtin function is redeclared as `static', merge
3186              the declarations, but make the original one static.  */
3187           DECL_THIS_STATIC (olddecl) = 1;
3188           TREE_PUBLIC (olddecl) = 0;
3189
3190           /* Make the old declaration consistent with the new one so
3191              that all remnants of the builtin-ness of this function
3192              will be banished.  */
3193           DECL_LANGUAGE (olddecl) = DECL_LANGUAGE (newdecl);
3194           DECL_RTL (olddecl) = DECL_RTL (newdecl);
3195           DECL_ASSEMBLER_NAME (olddecl) = DECL_ASSEMBLER_NAME (newdecl);
3196           SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl),
3197                                        newdecl);
3198         }
3199     }
3200   else if (TREE_CODE (olddecl) != TREE_CODE (newdecl))
3201     {
3202       if ((TREE_CODE (olddecl) == TYPE_DECL && DECL_ARTIFICIAL (olddecl)
3203            && TREE_CODE (newdecl) != TYPE_DECL
3204            && ! (TREE_CODE (newdecl) == TEMPLATE_DECL
3205                  && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL))
3206           || (TREE_CODE (newdecl) == TYPE_DECL && DECL_ARTIFICIAL (newdecl)
3207               && TREE_CODE (olddecl) != TYPE_DECL
3208               && ! (TREE_CODE (olddecl) == TEMPLATE_DECL
3209                     && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl))
3210                         == TYPE_DECL))))
3211         {
3212           /* We do nothing special here, because C++ does such nasty
3213              things with TYPE_DECLs.  Instead, just let the TYPE_DECL
3214              get shadowed, and know that if we need to find a TYPE_DECL
3215              for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3216              slot of the identifier.  */
3217           return 0;
3218         }
3219
3220       if ((TREE_CODE (newdecl) == FUNCTION_DECL
3221            && DECL_FUNCTION_TEMPLATE_P (olddecl))
3222           || (TREE_CODE (olddecl) == FUNCTION_DECL
3223               && DECL_FUNCTION_TEMPLATE_P (newdecl)))
3224         return 0;
3225
3226       cp_error ("`%#D' redeclared as different kind of symbol", newdecl);
3227       if (TREE_CODE (olddecl) == TREE_LIST)
3228         olddecl = TREE_VALUE (olddecl);
3229       cp_error_at ("previous declaration of `%#D'", olddecl);
3230
3231       /* New decl is completely inconsistent with the old one =>
3232          tell caller to replace the old one.  */
3233
3234       return 0;
3235     }
3236   else if (!types_match)
3237     {
3238       if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl))
3239         /* These are certainly not duplicate declarations; they're
3240            from different scopes.  */
3241         return 0;
3242
3243       if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3244         {
3245           /* The name of a class template may not be declared to refer to
3246              any other template, class, function, object, namespace, value,
3247              or type in the same scope.  */
3248           if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == TYPE_DECL
3249               || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
3250             {
3251               cp_error ("declaration of template `%#D'", newdecl);
3252               cp_error_at ("conflicts with previous declaration `%#D'",
3253                            olddecl);
3254             }
3255           else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == FUNCTION_DECL
3256                    && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
3257                    && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl))),
3258                                  TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl))))
3259                    && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
3260                                            DECL_TEMPLATE_PARMS (olddecl)))
3261             {
3262               cp_error ("new declaration `%#D'", newdecl);
3263               cp_error_at ("ambiguates old declaration `%#D'", olddecl);
3264             }
3265           return 0;
3266         }
3267       if (TREE_CODE (newdecl) == FUNCTION_DECL)
3268         {
3269           if (DECL_EXTERN_C_P (newdecl) && DECL_EXTERN_C_P (olddecl))
3270             {
3271               cp_error ("declaration of C function `%#D' conflicts with",
3272                         newdecl);
3273               cp_error_at ("previous declaration `%#D' here", olddecl);
3274             }
3275           else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
3276                               TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
3277             {
3278               cp_error ("new declaration `%#D'", newdecl);
3279               cp_error_at ("ambiguates old declaration `%#D'", olddecl);
3280             }
3281           else
3282             return 0;
3283         }
3284
3285       /* Already complained about this, so don't do so again.  */
3286       else if (current_class_type == NULL_TREE
3287           || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl)) != current_class_type)
3288         {
3289           cp_error ("conflicting types for `%#D'", newdecl);
3290           cp_error_at ("previous declaration as `%#D'", olddecl);
3291         }
3292     }
3293   else if (TREE_CODE (newdecl) == FUNCTION_DECL
3294             && ((DECL_TEMPLATE_SPECIALIZATION (olddecl)
3295                  && (!DECL_TEMPLATE_INFO (newdecl)
3296                      || (DECL_TI_TEMPLATE (newdecl)
3297                          != DECL_TI_TEMPLATE (olddecl))))
3298                 || (DECL_TEMPLATE_SPECIALIZATION (newdecl)
3299                     && (!DECL_TEMPLATE_INFO (olddecl)
3300                         || (DECL_TI_TEMPLATE (olddecl)
3301                             != DECL_TI_TEMPLATE (newdecl))))))
3302     /* It's OK to have a template specialization and a non-template
3303        with the same type, or to have specializations of two
3304        different templates with the same type.  Note that if one is a
3305        specialization, and the other is an instantiation of the same
3306        template, that we do not exit at this point.  That situation
3307        can occur if we instantiate a template class, and then
3308        specialize one of its methods.  This situation is legal, but
3309        the declarations must be merged in the usual way.  */
3310     return 0;
3311   else if (TREE_CODE (newdecl) == FUNCTION_DECL
3312            && ((DECL_TEMPLATE_INSTANTIATION (olddecl)
3313                 && !DECL_USE_TEMPLATE (newdecl))
3314                || (DECL_TEMPLATE_INSTANTIATION (newdecl)
3315                    && !DECL_USE_TEMPLATE (olddecl))))
3316     /* One of the declarations is a template instantiation, and the
3317        other is not a template at all.  That's OK.  */
3318     return 0;
3319   else if (TREE_CODE (newdecl) == NAMESPACE_DECL
3320            && DECL_NAMESPACE_ALIAS (newdecl)
3321            && DECL_NAMESPACE_ALIAS (newdecl) == DECL_NAMESPACE_ALIAS (olddecl))
3322     /* Redeclaration of namespace alias, ignore it. */
3323     return 1;
3324   else
3325     {
3326       const char *errmsg = redeclaration_error_message (newdecl, olddecl);
3327       if (errmsg)
3328         {
3329           cp_error (errmsg, newdecl);
3330           if (DECL_NAME (olddecl) != NULL_TREE)
3331             cp_error_at ((DECL_INITIAL (olddecl)
3332                           && namespace_bindings_p ())
3333                          ? "`%#D' previously defined here"
3334                          : "`%#D' previously declared here", olddecl);
3335         }
3336       else if (TREE_CODE (olddecl) == FUNCTION_DECL
3337                && DECL_INITIAL (olddecl) != NULL_TREE
3338                && TYPE_ARG_TYPES (TREE_TYPE (olddecl)) == NULL_TREE
3339                && TYPE_ARG_TYPES (TREE_TYPE (newdecl)) != NULL_TREE)
3340         {
3341           /* Prototype decl follows defn w/o prototype.  */
3342           cp_warning_at ("prototype for `%#D'", newdecl);
3343           cp_warning_at ("follows non-prototype definition here", olddecl);
3344         }
3345       else if (TREE_CODE (olddecl) == FUNCTION_DECL
3346                && DECL_LANGUAGE (newdecl) != DECL_LANGUAGE (olddecl))
3347         {
3348           /* extern "C" int foo ();
3349              int foo () { bar (); }
3350              is OK.  */
3351           if (current_lang_stack
3352               == &VARRAY_TREE (current_lang_base, 0))
3353             DECL_LANGUAGE (newdecl) = DECL_LANGUAGE (olddecl);
3354           else
3355             {
3356               cp_error_at ("previous declaration of `%#D' with %L linkage",
3357                            olddecl, DECL_LANGUAGE (olddecl));
3358               cp_error ("conflicts with new declaration with %L linkage",
3359                         DECL_LANGUAGE (newdecl));
3360             }
3361         }
3362
3363       if (DECL_LANG_SPECIFIC (olddecl) && DECL_USE_TEMPLATE (olddecl))
3364         ;
3365       else if (TREE_CODE (olddecl) == FUNCTION_DECL)
3366         {
3367           tree t1 = TYPE_ARG_TYPES (TREE_TYPE (olddecl));
3368           tree t2 = TYPE_ARG_TYPES (TREE_TYPE (newdecl));
3369           int i = 1;
3370
3371           if (TREE_CODE (TREE_TYPE (newdecl)) == METHOD_TYPE)
3372             t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2);
3373
3374           for (; t1 && t1 != void_list_node;
3375                t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2), i++)
3376             if (TREE_PURPOSE (t1) && TREE_PURPOSE (t2))
3377               {
3378                 if (1 == simple_cst_equal (TREE_PURPOSE (t1),
3379                                            TREE_PURPOSE (t2)))
3380                   {
3381                     if (pedantic)
3382                       {
3383                         cp_pedwarn ("default argument given for parameter %d of `%#D'",
3384                                     i, newdecl);
3385                         cp_pedwarn_at ("after previous specification in `%#D'",
3386                                        olddecl);
3387                       }
3388                   }
3389                 else
3390                   {
3391                     cp_error ("default argument given for parameter %d of `%#D'",
3392                               i, newdecl);
3393                     cp_error_at ("after previous specification in `%#D'",
3394                                  olddecl);
3395                   }
3396               }
3397
3398           if (DECL_THIS_INLINE (newdecl) && ! DECL_THIS_INLINE (olddecl)
3399               && TREE_ADDRESSABLE (olddecl) && warn_inline)
3400             {
3401               cp_warning ("`%#D' was used before it was declared inline",
3402                           newdecl);
3403               cp_warning_at ("previous non-inline declaration here",
3404                              olddecl);
3405             }
3406         }
3407     }
3408
3409   /* If new decl is `static' and an `extern' was seen previously,
3410      warn about it.  */
3411   warn_extern_redeclared_static (newdecl, olddecl);
3412
3413   /* We have committed to returning 1 at this point.  */
3414   if (TREE_CODE (newdecl) == FUNCTION_DECL)
3415     {
3416       /* Now that functions must hold information normally held
3417          by field decls, there is extra work to do so that
3418          declaration information does not get destroyed during
3419          definition.  */
3420       if (DECL_VINDEX (olddecl))
3421         DECL_VINDEX (newdecl) = DECL_VINDEX (olddecl);
3422       if (DECL_VIRTUAL_CONTEXT (olddecl))
3423         DECL_VIRTUAL_CONTEXT (newdecl) = DECL_VIRTUAL_CONTEXT (olddecl);
3424       if (DECL_CONTEXT (olddecl))
3425         DECL_CONTEXT (newdecl) = DECL_CONTEXT (olddecl);
3426       if (DECL_PENDING_INLINE_INFO (newdecl) == 0)
3427         DECL_PENDING_INLINE_INFO (newdecl) = DECL_PENDING_INLINE_INFO (olddecl);
3428       DECL_STATIC_CONSTRUCTOR (newdecl) |= DECL_STATIC_CONSTRUCTOR (olddecl);
3429       DECL_STATIC_DESTRUCTOR (newdecl) |= DECL_STATIC_DESTRUCTOR (olddecl);
3430       DECL_PURE_VIRTUAL_P (newdecl) |= DECL_PURE_VIRTUAL_P (olddecl);
3431       DECL_VIRTUAL_P (newdecl) |= DECL_VIRTUAL_P (olddecl);
3432       DECL_NEEDS_FINAL_OVERRIDER_P (newdecl) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl);
3433       DECL_THIS_STATIC (newdecl) |= DECL_THIS_STATIC (olddecl);
3434       DECL_LANG_SPECIFIC (newdecl)->u2 = DECL_LANG_SPECIFIC (olddecl)->u2;
3435       new_defines_function = DECL_INITIAL (newdecl) != NULL_TREE;
3436
3437       /* Optionally warn about more than one declaration for the same
3438          name, but don't warn about a function declaration followed by a
3439          definition.  */
3440       if (warn_redundant_decls && ! DECL_ARTIFICIAL (olddecl)
3441           && !(new_defines_function && DECL_INITIAL (olddecl) == NULL_TREE)
3442           /* Don't warn about extern decl followed by definition. */
3443           && !(DECL_EXTERNAL (olddecl) && ! DECL_EXTERNAL (newdecl))
3444           /* Don't warn about friends, let add_friend take care of it. */
3445           && ! DECL_FRIEND_P (newdecl))
3446         {
3447           cp_warning ("redundant redeclaration of `%D' in same scope", newdecl);
3448           cp_warning_at ("previous declaration of `%D'", olddecl);
3449         }
3450     }
3451
3452   /* Deal with C++: must preserve virtual function table size.  */
3453   if (TREE_CODE (olddecl) == TYPE_DECL)
3454     {
3455       register tree newtype = TREE_TYPE (newdecl);
3456       register tree oldtype = TREE_TYPE (olddecl);
3457
3458       if (newtype != error_mark_node && oldtype != error_mark_node
3459           && TYPE_LANG_SPECIFIC (newtype) && TYPE_LANG_SPECIFIC (oldtype))
3460         {
3461           CLASSTYPE_VSIZE (newtype) = CLASSTYPE_VSIZE (oldtype);
3462           CLASSTYPE_FRIEND_CLASSES (newtype)
3463             = CLASSTYPE_FRIEND_CLASSES (oldtype);
3464         }
3465
3466       DECL_ORIGINAL_TYPE (newdecl) = DECL_ORIGINAL_TYPE (olddecl);
3467     }
3468
3469   /* Copy all the DECL_... slots specified in the new decl
3470      except for any that we copy here from the old type.  */
3471   DECL_MACHINE_ATTRIBUTES (newdecl)
3472     = merge_machine_decl_attributes (olddecl, newdecl);
3473
3474   if (TREE_CODE (newdecl) == TEMPLATE_DECL)
3475     {
3476       TREE_TYPE (olddecl) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl));
3477       DECL_TEMPLATE_SPECIALIZATIONS (olddecl)
3478         = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl),
3479                    DECL_TEMPLATE_SPECIALIZATIONS (newdecl));
3480
3481       return 1;
3482     }
3483
3484   if (types_match)
3485     {
3486       /* Automatically handles default parameters.  */
3487       tree oldtype = TREE_TYPE (olddecl);
3488       tree newtype;
3489
3490       /* Merge the data types specified in the two decls.  */
3491       newtype = common_type (TREE_TYPE (newdecl), TREE_TYPE (olddecl));
3492
3493       /* If common_type produces a non-typedef type, just use the old type.  */
3494       if (TREE_CODE (newdecl) == TYPE_DECL
3495           && newtype == DECL_ORIGINAL_TYPE (newdecl))
3496         newtype = oldtype;
3497
3498       if (TREE_CODE (newdecl) == VAR_DECL)
3499         DECL_THIS_EXTERN (newdecl) |= DECL_THIS_EXTERN (olddecl);
3500       /* Do this after calling `common_type' so that default
3501          parameters don't confuse us.  */
3502       else if (TREE_CODE (newdecl) == FUNCTION_DECL
3503           && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl))
3504               != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl))))
3505         {
3506           TREE_TYPE (newdecl) = build_exception_variant (newtype,
3507                                                          TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)));
3508           TREE_TYPE (olddecl) = build_exception_variant (newtype,
3509                                                          TYPE_RAISES_EXCEPTIONS (oldtype));
3510
3511           if ((pedantic || ! DECL_IN_SYSTEM_HEADER (olddecl))
3512               && DECL_SOURCE_LINE (olddecl) != 0
3513               && flag_exceptions
3514               && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)),
3515                                      TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl)), 1))
3516             {
3517               cp_error ("declaration of `%F' throws different exceptions",
3518                         newdecl);
3519               cp_error_at ("than previous declaration `%F'", olddecl);
3520             }
3521         }
3522       TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = newtype;
3523
3524       /* Lay the type out, unless already done.  */
3525       if (! same_type_p (newtype, oldtype)
3526           && TREE_TYPE (newdecl) != error_mark_node
3527           && !(processing_template_decl && uses_template_parms (newdecl)))
3528         layout_type (TREE_TYPE (newdecl));
3529
3530       if ((TREE_CODE (newdecl) == VAR_DECL
3531            || TREE_CODE (newdecl) == PARM_DECL
3532            || TREE_CODE (newdecl) == RESULT_DECL
3533            || TREE_CODE (newdecl) == FIELD_DECL
3534            || TREE_CODE (newdecl) == TYPE_DECL)
3535           && !(processing_template_decl && uses_template_parms (newdecl)))
3536         layout_decl (newdecl, 0);
3537
3538       /* Merge the type qualifiers.  */
3539       if (TREE_READONLY (newdecl))
3540         TREE_READONLY (olddecl) = 1;
3541       if (TREE_THIS_VOLATILE (newdecl))
3542         TREE_THIS_VOLATILE (olddecl) = 1;
3543
3544       /* Merge the initialization information.  */
3545       if (DECL_INITIAL (newdecl) == NULL_TREE
3546           && DECL_INITIAL (olddecl) != NULL_TREE)
3547         {
3548           DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
3549           DECL_SOURCE_FILE (newdecl) = DECL_SOURCE_FILE (olddecl);
3550           DECL_SOURCE_LINE (newdecl) = DECL_SOURCE_LINE (olddecl);
3551           if (CAN_HAVE_FULL_LANG_DECL_P (newdecl)
3552               && DECL_LANG_SPECIFIC (newdecl)
3553               && DECL_LANG_SPECIFIC (olddecl))
3554             DECL_SAVED_TREE (newdecl) = DECL_SAVED_TREE (olddecl);
3555         }
3556
3557       /* Merge the section attribute.
3558          We want to issue an error if the sections conflict but that must be
3559          done later in decl_attributes since we are called before attributes
3560          are assigned.  */
3561       if (DECL_SECTION_NAME (newdecl) == NULL_TREE)
3562         DECL_SECTION_NAME (newdecl) = DECL_SECTION_NAME (olddecl);
3563
3564       /* Keep the old rtl since we can safely use it.  */
3565       DECL_RTL (newdecl) = DECL_RTL (olddecl);
3566
3567       if (TREE_CODE (newdecl) == FUNCTION_DECL)
3568         {
3569           DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl)
3570             |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl);
3571           DECL_NO_CHECK_MEMORY_USAGE (newdecl)
3572             |= DECL_NO_CHECK_MEMORY_USAGE (olddecl);
3573           DECL_NO_LIMIT_STACK (newdecl)
3574             |= DECL_NO_LIMIT_STACK (olddecl);
3575         }
3576     }
3577   /* If cannot merge, then use the new type and qualifiers,
3578      and don't preserve the old rtl.  */
3579   else
3580     {
3581       /* Clean out any memory we had of the old declaration.  */
3582       tree oldstatic = value_member (olddecl, static_aggregates);
3583       if (oldstatic)
3584         TREE_VALUE (oldstatic) = error_mark_node;
3585
3586       TREE_TYPE (olddecl) = TREE_TYPE (newdecl);
3587       TREE_READONLY (olddecl) = TREE_READONLY (newdecl);
3588       TREE_THIS_VOLATILE (olddecl) = TREE_THIS_VOLATILE (newdecl);
3589       TREE_SIDE_EFFECTS (olddecl) = TREE_SIDE_EFFECTS (newdecl);
3590     }
3591
3592   /* Merge the storage class information.  */
3593   DECL_WEAK (newdecl) |= DECL_WEAK (olddecl);
3594   DECL_ONE_ONLY (newdecl) |= DECL_ONE_ONLY (olddecl);
3595   DECL_DEFER_OUTPUT (newdecl) |= DECL_DEFER_OUTPUT (olddecl);
3596   TREE_PUBLIC (newdecl) = TREE_PUBLIC (olddecl);
3597   TREE_STATIC (olddecl) = TREE_STATIC (newdecl) |= TREE_STATIC (olddecl);
3598   if (! DECL_EXTERNAL (olddecl))
3599     DECL_EXTERNAL (newdecl) = 0;
3600
3601   if (DECL_LANG_SPECIFIC (newdecl) && DECL_LANG_SPECIFIC (olddecl))
3602     {
3603       DECL_INTERFACE_KNOWN (newdecl) |= DECL_INTERFACE_KNOWN (olddecl);
3604       DECL_NOT_REALLY_EXTERN (newdecl) |= DECL_NOT_REALLY_EXTERN (olddecl);
3605       DECL_COMDAT (newdecl) |= DECL_COMDAT (olddecl);
3606       DECL_TEMPLATE_INSTANTIATED (newdecl)
3607         |= DECL_TEMPLATE_INSTANTIATED (olddecl);
3608       /* Don't really know how much of the language-specific
3609          values we should copy from old to new.  */
3610       DECL_IN_AGGR_P (newdecl) = DECL_IN_AGGR_P (olddecl);
3611       DECL_ACCESS (newdecl) = DECL_ACCESS (olddecl);
3612       DECL_NONCONVERTING_P (newdecl) = DECL_NONCONVERTING_P (olddecl);
3613       DECL_TEMPLATE_INFO (newdecl) = DECL_TEMPLATE_INFO (olddecl);
3614       olddecl_friend = DECL_FRIEND_P (olddecl);
3615
3616       /* Only functions have DECL_BEFRIENDING_CLASSES.  */
3617       if (TREE_CODE (newdecl) == FUNCTION_DECL
3618           || DECL_FUNCTION_TEMPLATE_P (newdecl))
3619         DECL_BEFRIENDING_CLASSES (newdecl)
3620           = chainon (DECL_BEFRIENDING_CLASSES (newdecl),
3621                      DECL_BEFRIENDING_CLASSES (olddecl));
3622     }
3623
3624   if (TREE_CODE (newdecl) == FUNCTION_DECL)
3625     {
3626       if (DECL_TEMPLATE_INSTANTIATION (olddecl)
3627           && !DECL_TEMPLATE_INSTANTIATION (newdecl))
3628         {
3629           /* If newdecl is not a specialization, then it is not a
3630              template-related function at all.  And that means that we
3631              shoud have exited above, returning 0.  */
3632           my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl),
3633                               0);
3634
3635           if (TREE_USED (olddecl))
3636             /* From [temp.expl.spec]:
3637
3638                If a template, a member template or the member of a class
3639                template is explicitly specialized then that
3640                specialization shall be declared before the first use of
3641                that specialization that would cause an implicit
3642                instantiation to take place, in every translation unit in
3643                which such a use occurs.  */
3644             cp_error ("explicit specialization of %D after first use",
3645                       olddecl);
3646
3647           SET_DECL_TEMPLATE_SPECIALIZATION (olddecl);
3648         }
3649       DECL_THIS_INLINE (newdecl) |= DECL_THIS_INLINE (olddecl);
3650
3651       /* If either decl says `inline', this fn is inline, unless its
3652          definition was passed already.  */
3653       if (DECL_INLINE (newdecl) && DECL_INITIAL (olddecl) == NULL_TREE)
3654         DECL_INLINE (olddecl) = 1;
3655       DECL_INLINE (newdecl) = DECL_INLINE (olddecl);
3656
3657       if (! types_match)
3658         {
3659           DECL_LANGUAGE (olddecl) = DECL_LANGUAGE (newdecl);
3660           DECL_ASSEMBLER_NAME (olddecl) = DECL_ASSEMBLER_NAME (newdecl);
3661           DECL_RTL (olddecl) = DECL_RTL (newdecl);
3662         }
3663       if (! types_match || new_defines_function)
3664         {
3665           /* These need to be copied so that the names are available.
3666              Note that if the types do match, we'll preserve inline
3667              info and other bits, but if not, we won't.  */
3668           DECL_ARGUMENTS (olddecl) = DECL_ARGUMENTS (newdecl);
3669           DECL_RESULT (olddecl) = DECL_RESULT (newdecl);
3670         }
3671       if (new_defines_function)
3672         /* If defining a function declared with other language
3673            linkage, use the previously declared language linkage.  */
3674         DECL_LANGUAGE (newdecl) = DECL_LANGUAGE (olddecl);
3675       else if (types_match)
3676         {
3677           /* If redeclaring a builtin function, and not a definition,
3678              it stays built in.  */
3679           if (DECL_BUILT_IN (olddecl))
3680             {
3681               DECL_BUILT_IN_CLASS (newdecl) = DECL_BUILT_IN_CLASS (olddecl);
3682               DECL_FUNCTION_CODE (newdecl) = DECL_FUNCTION_CODE (olddecl);
3683               /* If we're keeping the built-in definition, keep the rtl,
3684                  regardless of declaration matches.  */
3685               DECL_RTL (newdecl) = DECL_RTL (olddecl);
3686             }
3687           else
3688             DECL_FRAME_SIZE (newdecl) = DECL_FRAME_SIZE (olddecl);
3689
3690           DECL_RESULT (newdecl) = DECL_RESULT (olddecl);
3691           if ((DECL_SAVED_INSNS (newdecl) = DECL_SAVED_INSNS (olddecl)))
3692             /* Previously saved insns go together with
3693                the function's previous definition.  */
3694             DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
3695           /* Don't clear out the arguments if we're redefining a function.  */
3696           if (DECL_ARGUMENTS (olddecl))
3697             DECL_ARGUMENTS (newdecl) = DECL_ARGUMENTS (olddecl);
3698         }
3699     }
3700
3701   if (TREE_CODE (newdecl) == NAMESPACE_DECL)
3702     {
3703       NAMESPACE_LEVEL (newdecl) = NAMESPACE_LEVEL (olddecl);
3704     }
3705
3706   /* Now preserve various other info from the definition.  */
3707   TREE_ADDRESSABLE (newdecl) = TREE_ADDRESSABLE (olddecl);
3708   TREE_ASM_WRITTEN (newdecl) = TREE_ASM_WRITTEN (olddecl);
3709   DECL_COMMON (newdecl) = DECL_COMMON (olddecl);
3710   DECL_ASSEMBLER_NAME (newdecl) = DECL_ASSEMBLER_NAME (olddecl);
3711
3712   if (TREE_CODE (newdecl) == FUNCTION_DECL)
3713     {
3714       int function_size;
3715
3716       function_size = sizeof (struct tree_decl);
3717
3718       bcopy ((char *) newdecl + sizeof (struct tree_common),
3719              (char *) olddecl + sizeof (struct tree_common),
3720              function_size - sizeof (struct tree_common));
3721
3722       if (DECL_TEMPLATE_INSTANTIATION (newdecl))
3723         {
3724           /* If newdecl is a template instantiation, it is possible that
3725              the following sequence of events has occurred:
3726
3727              o A friend function was declared in a class template.  The
3728              class template was instantiated.
3729
3730              o The instantiation of the friend declaration was
3731              recorded on the instantiation list, and is newdecl.
3732
3733              o Later, however, instantiate_class_template called pushdecl
3734              on the newdecl to perform name injection.  But, pushdecl in
3735              turn called duplicate_decls when it discovered that another
3736              declaration of a global function with the same name already
3737              existed.
3738
3739              o Here, in duplicate_decls, we decided to clobber newdecl.
3740
3741              If we're going to do that, we'd better make sure that
3742              olddecl, and not newdecl, is on the list of
3743              instantiations so that if we try to do the instantiation
3744              again we won't get the clobbered declaration.  */
3745
3746           tree tmpl = DECL_TI_TEMPLATE (newdecl);
3747           tree decls = DECL_TEMPLATE_SPECIALIZATIONS (tmpl);
3748
3749           for (; decls; decls = TREE_CHAIN (decls))
3750             if (TREE_VALUE (decls) == newdecl)
3751               TREE_VALUE (decls) = olddecl;
3752         }
3753     }
3754   else
3755     {
3756       bcopy ((char *) newdecl + sizeof (struct tree_common),
3757              (char *) olddecl + sizeof (struct tree_common),
3758              sizeof (struct tree_decl) - sizeof (struct tree_common)
3759              + tree_code_length [(int)TREE_CODE (newdecl)] * sizeof (char *));
3760     }
3761
3762   DECL_UID (olddecl) = olddecl_uid;
3763   if (olddecl_friend)
3764     DECL_FRIEND_P (olddecl) = 1;
3765
3766   /* NEWDECL contains the merged attribute lists.
3767      Update OLDDECL to be the same.  */
3768   DECL_MACHINE_ATTRIBUTES (olddecl) = DECL_MACHINE_ATTRIBUTES (newdecl);
3769
3770   return 1;
3771 }
3772
3773 /* Record a decl-node X as belonging to the current lexical scope.
3774    Check for errors (such as an incompatible declaration for the same
3775    name already seen in the same scope).
3776
3777    Returns either X or an old decl for the same name.
3778    If an old decl is returned, it may have been smashed
3779    to agree with what X says.  */
3780
3781 tree
3782 pushdecl (x)
3783      tree x;
3784 {
3785   register tree t;
3786   register tree name;
3787   int need_new_binding;
3788
3789   /* We shouldn't be calling pushdecl when we're generating RTL for a
3790      function that we already did semantic analysis on previously.  */
3791   my_friendly_assert (!cfun || doing_semantic_analysis_p (),
3792                       19990913);
3793
3794   need_new_binding = 1;
3795
3796   if (DECL_TEMPLATE_PARM_P (x))
3797     /* Template parameters have no context; they are not X::T even
3798        when declared within a class or namespace.  */
3799     ;
3800   else
3801     {
3802       if (current_function_decl && x != current_function_decl
3803           /* A local declaration for a function doesn't constitute
3804              nesting.  */
3805           && !(TREE_CODE (x) == FUNCTION_DECL && !DECL_INITIAL (x))
3806           /* A local declaration for an `extern' variable is in the
3807              scope of the current namespace, not the current
3808              function.  */
3809           && !(TREE_CODE (x) == VAR_DECL && DECL_EXTERNAL (x))
3810           && !DECL_CONTEXT (x))
3811         DECL_CONTEXT (x) = current_function_decl;
3812
3813       /* If this is the declaration for a namespace-scope function,
3814          but the declaration itself is in a local scope, mark the
3815          declaration.  */
3816       if (TREE_CODE (x) == FUNCTION_DECL
3817           && DECL_NAMESPACE_SCOPE_P (x)
3818           && current_function_decl
3819           && x != current_function_decl)
3820         DECL_LOCAL_FUNCTION_P (x) = 1;
3821     }
3822
3823   name = DECL_NAME (x);
3824   if (name)
3825     {
3826       int different_binding_level = 0;
3827
3828       if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
3829         name = TREE_OPERAND (name, 0);
3830
3831       /* In case this decl was explicitly namespace-qualified, look it
3832          up in its namespace context.  */
3833       if (TREE_CODE (x) == VAR_DECL && DECL_NAMESPACE_SCOPE_P (x)
3834           && namespace_bindings_p ())
3835         t = namespace_binding (name, DECL_CONTEXT (x));
3836       else
3837         t = lookup_name_current_level (name);
3838
3839       /* [basic.link] If there is a visible declaration of an entity
3840          with linkage having the same name and type, ignoring entities
3841          declared outside the innermost enclosing namespace scope, the
3842          block scope declaration declares that same entity and
3843          receives the linkage of the previous declaration.  */
3844       if (! t && current_function_decl && x != current_function_decl
3845           && (TREE_CODE (x) == FUNCTION_DECL || TREE_CODE (x) == VAR_DECL)
3846           && DECL_EXTERNAL (x))
3847         {
3848           /* Look in block scope.  */
3849           t = IDENTIFIER_VALUE (name);
3850           /* Or in the innermost namespace.  */
3851           if (! t)
3852             t = namespace_binding (name, DECL_CONTEXT (x));
3853           /* Does it have linkage?  */
3854           if (t && ! (TREE_STATIC (t) || DECL_EXTERNAL (t)))
3855             t = NULL_TREE;
3856           if (t)
3857             different_binding_level = 1;
3858         }
3859
3860       /* If we are declaring a function, and the result of name-lookup
3861          was an OVERLOAD, look for an overloaded instance that is
3862          actually the same as the function we are declaring.  (If
3863          there is one, we have to merge our declaration with the
3864          previous declaration.)  */
3865       if (t && TREE_CODE (t) == OVERLOAD)
3866         {
3867           tree match;
3868
3869           if (TREE_CODE (x) == FUNCTION_DECL)
3870             for (match = t; match; match = OVL_NEXT (match))
3871               {
3872                 if (DECL_ASSEMBLER_NAME (OVL_CURRENT (t))
3873                     == DECL_ASSEMBLER_NAME (x))
3874                   break;
3875               }
3876           else
3877             /* Just choose one.  */
3878             match = t;
3879
3880           if (match)
3881             t = OVL_CURRENT (match);
3882           else
3883             t = NULL_TREE;
3884         }
3885
3886       if (t == error_mark_node)
3887         {
3888           /* error_mark_node is 0 for a while during initialization!  */
3889           t = NULL_TREE;
3890           cp_error_at ("`%#D' used prior to declaration", x);
3891         }
3892       else if (t != NULL_TREE)
3893         {
3894           if (different_binding_level)
3895             {
3896               if (decls_match (x, t))
3897                 /* The standard only says that the local extern
3898                    inherits linkage from the previous decl; in
3899                    particular, default args are not shared.  It would
3900                    be nice to propagate inlining info, though.  FIXME.  */
3901                 TREE_PUBLIC (x) = TREE_PUBLIC (t);
3902             }
3903           else if (TREE_CODE (t) == PARM_DECL)
3904             {
3905               if (DECL_CONTEXT (t) == NULL_TREE)
3906                 fatal ("parse errors have confused me too much");
3907
3908               /* Check for duplicate params.  */
3909               if (duplicate_decls (x, t))
3910                 return t;
3911             }
3912           else if ((DECL_EXTERN_C_FUNCTION_P (x)
3913                     || DECL_FUNCTION_TEMPLATE_P (x))
3914                    && is_overloaded_fn (t))
3915             /* Don't do anything just yet. */;
3916           else if (t == wchar_decl_node)
3917             {
3918               if (pedantic && ! DECL_IN_SYSTEM_HEADER (x))
3919                 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x));
3920
3921               /* Throw away the redeclaration.  */
3922               return t;
3923             }
3924           else if (TREE_CODE (t) != TREE_CODE (x))
3925             {
3926               if (duplicate_decls (x, t))
3927                 return t;
3928             }
3929           else if (duplicate_decls (x, t))
3930             {
3931               if (TREE_CODE (t) == TYPE_DECL)
3932                 SET_IDENTIFIER_TYPE_VALUE (name, TREE_TYPE (t));
3933               else if (TREE_CODE (t) == FUNCTION_DECL)
3934                 check_default_args (t);
3935
3936               return t;
3937             }
3938           else if (DECL_MAIN_P (x))
3939             {
3940               /* A redeclaration of main, but not a duplicate of the
3941                  previous one.
3942
3943                  [basic.start.main]
3944
3945                  This function shall not be overloaded.  */
3946               cp_error_at ("invalid redeclaration of `%D'", t);
3947               cp_error ("as `%D'", x);
3948               /* We don't try to push this declaration since that
3949                  causes a crash.  */
3950               return x;
3951             }
3952         }
3953
3954       check_template_shadow (x);
3955
3956       /* If this is a function conjured up by the backend, massage it
3957          so it looks friendly.  */
3958       if (DECL_NON_THUNK_FUNCTION_P (x) && ! DECL_LANG_SPECIFIC (x))
3959         {
3960           retrofit_lang_decl (x);
3961           DECL_LANGUAGE (x) = lang_c;
3962         }
3963
3964       if (DECL_NON_THUNK_FUNCTION_P (x) && ! DECL_FUNCTION_MEMBER_P (x))
3965         {
3966           t = push_overloaded_decl (x, PUSH_LOCAL);
3967           if (t != x)
3968             return t;
3969           if (!namespace_bindings_p ())
3970             /* We do not need to create a binding for this name;
3971                push_overloaded_decl will have already done so if
3972                necessary.  */
3973             need_new_binding = 0;
3974         }
3975       else if (DECL_FUNCTION_TEMPLATE_P (x) && DECL_NAMESPACE_SCOPE_P (x))
3976         {
3977           t = push_overloaded_decl (x, PUSH_GLOBAL);
3978           if (t == x)
3979             add_decl_to_level (x, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t)));
3980           return t;
3981         }
3982
3983       /* If declaring a type as a typedef, copy the type (unless we're
3984          at line 0), and install this TYPE_DECL as the new type's typedef
3985          name.  See the extensive comment in ../c-decl.c (pushdecl). */
3986       if (TREE_CODE (x) == TYPE_DECL)
3987         {
3988           tree type = TREE_TYPE (x);
3989           if (DECL_SOURCE_LINE (x) == 0)
3990             {
3991               if (TYPE_NAME (type) == 0)
3992                 TYPE_NAME (type) = x;
3993             }
3994           else if (type != error_mark_node && TYPE_NAME (type) != x
3995                    /* We don't want to copy the type when all we're
3996                       doing is making a TYPE_DECL for the purposes of
3997                       inlining.  */
3998                    && (!TYPE_NAME (type)
3999                        || TYPE_NAME (type) != DECL_ABSTRACT_ORIGIN (x)))
4000             {
4001               DECL_ORIGINAL_TYPE (x) = type;
4002               type = build_type_copy (type);
4003               TYPE_STUB_DECL (type) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x));
4004               TYPE_NAME (type) = x;
4005               TREE_TYPE (x) = type;
4006             }
4007
4008           if (type != error_mark_node
4009               && TYPE_NAME (type)
4010               && TYPE_IDENTIFIER (type))
4011             set_identifier_type_value_with_scope (DECL_NAME (x), type,
4012                                                   current_binding_level);
4013
4014         }
4015
4016       /* Multiple external decls of the same identifier ought to match.
4017
4018          We get warnings about inline functions where they are defined.
4019          We get warnings about other functions from push_overloaded_decl.
4020
4021          Avoid duplicate warnings where they are used.  */
4022       if (TREE_PUBLIC (x) && TREE_CODE (x) != FUNCTION_DECL)
4023         {
4024           tree decl;
4025
4026           decl = IDENTIFIER_NAMESPACE_VALUE (name);
4027           if (decl && TREE_CODE (decl) == OVERLOAD)
4028             decl = OVL_FUNCTION (decl);
4029
4030           if (decl && decl != error_mark_node
4031               && (DECL_EXTERNAL (decl) || TREE_PUBLIC (decl))
4032               /* If different sort of thing, we already gave an error.  */
4033               && TREE_CODE (decl) == TREE_CODE (x)
4034               && !same_type_p (TREE_TYPE (x), TREE_TYPE (decl)))
4035             {
4036               cp_pedwarn ("type mismatch with previous external decl", x);
4037               cp_pedwarn_at ("previous external decl of `%#D'", decl);
4038             }
4039         }
4040
4041       /* This name is new in its binding level.
4042          Install the new declaration and return it.  */
4043       if (namespace_bindings_p ())
4044         {
4045           /* Install a global value.  */
4046
4047           /* If the first global decl has external linkage,
4048              warn if we later see static one.  */
4049           if (IDENTIFIER_GLOBAL_VALUE (name) == NULL_TREE && TREE_PUBLIC (x))
4050             TREE_PUBLIC (name) = 1;
4051
4052           /* Bind the mangled name for the entity.  In the future, we
4053              should not need to do this; mangled names are an
4054              implementation detail of which the front-end should not
4055              need to be aware.  */
4056           if (!(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)
4057                 && t != NULL_TREE)
4058               /* For an ordinary function, we create a binding from
4059                  the mangled name (i.e., NAME) to the DECL.  But, for
4060                  an `extern "C"' function, the mangled name and the
4061                  ordinary name are the same so we need not do this.  */
4062               && !DECL_EXTERN_C_FUNCTION_P (x))
4063             {
4064               tree mangled_name;
4065
4066               if (TREE_CODE (x) == TYPE_DECL || TREE_CODE (x) == VAR_DECL
4067                   || TREE_CODE (x) == NAMESPACE_DECL)
4068                 mangled_name = name;
4069               else
4070                 mangled_name = DECL_ASSEMBLER_NAME (x);
4071
4072               if (TREE_CODE (x) == FUNCTION_DECL)
4073                 my_friendly_assert
4074                   ((IDENTIFIER_GLOBAL_VALUE (mangled_name) == NULL_TREE)
4075                   || (IDENTIFIER_GLOBAL_VALUE (mangled_name) == x), 378);
4076               SET_IDENTIFIER_NAMESPACE_VALUE (mangled_name, x);
4077             }
4078
4079           /* Don't forget if the function was used via an implicit decl.  */
4080           if (IDENTIFIER_IMPLICIT_DECL (name)
4081               && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name)))
4082             TREE_USED (x) = 1;
4083
4084           /* Don't forget if its address was taken in that way.  */
4085           if (IDENTIFIER_IMPLICIT_DECL (name)
4086               && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name)))
4087             TREE_ADDRESSABLE (x) = 1;
4088
4089           /* Warn about mismatches against previous implicit decl.  */
4090           if (IDENTIFIER_IMPLICIT_DECL (name) != NULL_TREE
4091               /* If this real decl matches the implicit, don't complain.  */
4092               && ! (TREE_CODE (x) == FUNCTION_DECL
4093                     && TREE_TYPE (TREE_TYPE (x)) == integer_type_node))
4094             cp_warning
4095               ("`%D' was previously implicitly declared to return `int'", x);
4096
4097           /* If new decl is `static' and an `extern' was seen previously,
4098              warn about it.  */
4099           if (x != NULL_TREE && t != NULL_TREE && decls_match (x, t))
4100             warn_extern_redeclared_static (x, t);
4101         }
4102       else
4103         {
4104           /* Here to install a non-global value.  */
4105           tree oldlocal = IDENTIFIER_VALUE (name);
4106           tree oldglobal = IDENTIFIER_NAMESPACE_VALUE (name);
4107
4108           if (need_new_binding)
4109             {
4110               push_local_binding (name, x, 0);
4111               /* Because push_local_binding will hook X on to the
4112                  current_binding_level's name list, we don't want to
4113                  do that again below.  */
4114               need_new_binding = 0;
4115             }
4116
4117           /* If this is a TYPE_DECL, push it into the type value slot.  */
4118           if (TREE_CODE (x) == TYPE_DECL)
4119             set_identifier_type_value_with_scope (name, TREE_TYPE (x),
4120                                                   current_binding_level);
4121
4122           /* Clear out any TYPE_DECL shadowed by a namespace so that
4123              we won't think this is a type.  The C struct hack doesn't
4124              go through namespaces.  */
4125           if (TREE_CODE (x) == NAMESPACE_DECL)
4126             set_identifier_type_value_with_scope (name, NULL_TREE,
4127                                                   current_binding_level);
4128
4129           if (oldlocal)
4130             {
4131               tree d = oldlocal;
4132
4133               while (oldlocal
4134                      && TREE_CODE (oldlocal) == VAR_DECL
4135                      && DECL_DEAD_FOR_LOCAL (oldlocal))
4136                 oldlocal = DECL_SHADOWED_FOR_VAR (oldlocal);
4137
4138               if (oldlocal == NULL_TREE)
4139                 oldlocal = IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d));
4140             }
4141
4142           /* If this is an extern function declaration, see if we
4143              have a global definition or declaration for the function.  */
4144           if (oldlocal == NULL_TREE
4145               && DECL_EXTERNAL (x)
4146               && oldglobal != NULL_TREE
4147               && TREE_CODE (x) == FUNCTION_DECL
4148               && TREE_CODE (oldglobal) == FUNCTION_DECL)
4149             {
4150               /* We have one.  Their types must agree.  */
4151               if (decls_match (x, oldglobal))
4152                 /* OK */;
4153               else
4154                 {
4155                   cp_warning ("extern declaration of `%#D' doesn't match", x);
4156                   cp_warning_at ("global declaration `%#D'", oldglobal);
4157                 }
4158             }
4159           /* If we have a local external declaration,
4160              and no file-scope declaration has yet been seen,
4161              then if we later have a file-scope decl it must not be static.  */
4162           if (oldlocal == NULL_TREE
4163               && oldglobal == NULL_TREE
4164               && DECL_EXTERNAL (x)
4165               && TREE_PUBLIC (x))
4166             TREE_PUBLIC (name) = 1;
4167
4168           /* Warn if shadowing an argument at the top level of the body.  */
4169           if (oldlocal != NULL_TREE && !DECL_EXTERNAL (x)
4170               /* Inline decls shadow nothing.  */
4171               && !DECL_FROM_INLINE (x)
4172               && TREE_CODE (oldlocal) == PARM_DECL
4173               /* Don't complain if it's from an enclosing function.  */
4174               && DECL_CONTEXT (oldlocal) == current_function_decl
4175               && TREE_CODE (x) != PARM_DECL)
4176             {
4177               /* Go to where the parms should be and see if we
4178                  find them there.  */
4179               struct binding_level *b = current_binding_level->level_chain;
4180
4181               if (cleanup_label)
4182                 b = b->level_chain;
4183
4184               /* ARM $8.3 */
4185               if (b->parm_flag == 1)
4186                 cp_error ("declaration of `%#D' shadows a parameter", name);
4187             }
4188
4189           /* Maybe warn if shadowing something else.  */
4190           if (warn_shadow && !DECL_EXTERNAL (x)
4191               /* Inline decls shadow nothing.  */
4192               && !DECL_FROM_INLINE (x)
4193               /* No shadow warnings for internally generated vars.  */
4194               && ! DECL_ARTIFICIAL (x)
4195               /* No shadow warnings for vars made for inlining.  */
4196               && ! DECL_FROM_INLINE (x))
4197             {
4198               if (oldlocal != NULL_TREE && TREE_CODE (oldlocal) == PARM_DECL)
4199                 warning ("declaration of `%s' shadows a parameter",
4200                         IDENTIFIER_POINTER (name));
4201               else if (IDENTIFIER_CLASS_VALUE (name) != NULL_TREE
4202                        && current_class_ptr
4203                        && !TREE_STATIC (name))
4204                 warning ("declaration of `%s' shadows a member of `this'",
4205                         IDENTIFIER_POINTER (name));
4206               else if (oldlocal != NULL_TREE)
4207                 warning ("declaration of `%s' shadows previous local",
4208                         IDENTIFIER_POINTER (name));
4209               else if (oldglobal != NULL_TREE)
4210                 /* XXX shadow warnings in outer-more namespaces */
4211                 warning ("declaration of `%s' shadows global declaration",
4212                         IDENTIFIER_POINTER (name));
4213             }
4214         }
4215
4216       if (TREE_CODE (x) == FUNCTION_DECL)
4217         check_default_args (x);
4218
4219       /* Keep count of variables in this level with incomplete type.  */
4220       if (TREE_CODE (x) == VAR_DECL
4221           && TREE_TYPE (x) != error_mark_node
4222           && ((!COMPLETE_TYPE_P (TREE_TYPE (x))
4223                && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x), ARRAY_TYPE))
4224               /* RTTI TD entries are created while defining the type_info.  */
4225               || (TYPE_LANG_SPECIFIC (TREE_TYPE (x))
4226                   && TYPE_BEING_DEFINED (TREE_TYPE (x)))))
4227         {
4228           if (namespace_bindings_p ())
4229             namespace_scope_incomplete
4230               = tree_cons (NULL_TREE, x, namespace_scope_incomplete);
4231           else
4232             current_binding_level->incomplete
4233               = tree_cons (NULL_TREE, x, current_binding_level->incomplete);
4234         }
4235     }
4236
4237   if (need_new_binding)
4238     add_decl_to_level (x,
4239                        DECL_NAMESPACE_SCOPE_P (x)
4240                        ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x))
4241                        : current_binding_level);
4242
4243   return x;
4244 }
4245
4246 /* Same as pushdecl, but define X in binding-level LEVEL.  We rely on the
4247    caller to set DECL_CONTEXT properly.  */
4248
4249 static tree
4250 pushdecl_with_scope (x, level)
4251      tree x;
4252      struct binding_level *level;
4253 {
4254   register struct binding_level *b;
4255   tree function_decl = current_function_decl;
4256
4257   current_function_decl = NULL_TREE;
4258   if (level->parm_flag == 2)
4259     {
4260       b = class_binding_level;
4261       class_binding_level = level;
4262       pushdecl_class_level (x);
4263       class_binding_level = b;
4264     }
4265   else
4266     {
4267       b = current_binding_level;
4268       current_binding_level = level;
4269       x = pushdecl (x);
4270       current_binding_level = b;
4271     }
4272   current_function_decl = function_decl;
4273   return x;
4274 }
4275
4276 /* Like pushdecl, only it places X in the current namespace,
4277    if appropriate.  */
4278
4279 tree
4280 pushdecl_namespace_level (x)
4281      tree x;
4282 {
4283   register struct binding_level *b = current_binding_level;
4284   register tree t;
4285
4286   t = pushdecl_with_scope (x, NAMESPACE_LEVEL (current_namespace));
4287
4288   /* Now, the type_shadowed stack may screw us.  Munge it so it does
4289      what we want.  */
4290   if (TREE_CODE (x) == TYPE_DECL)
4291     {
4292       tree name = DECL_NAME (x);
4293       tree newval;
4294       tree *ptr = (tree *)0;
4295       for (; b != global_binding_level; b = b->level_chain)
4296         {
4297           tree shadowed = b->type_shadowed;
4298           for (; shadowed; shadowed = TREE_CHAIN (shadowed))
4299             if (TREE_PURPOSE (shadowed) == name)
4300               {
4301                 ptr = &TREE_VALUE (shadowed);
4302                 /* Can't break out of the loop here because sometimes
4303                    a binding level will have duplicate bindings for
4304                    PT names.  It's gross, but I haven't time to fix it.  */
4305               }
4306         }
4307       newval = TREE_TYPE (x);
4308       if (ptr == (tree *)0)
4309         {
4310           /* @@ This shouldn't be needed.  My test case "zstring.cc" trips
4311              up here if this is changed to an assertion.  --KR  */
4312           SET_IDENTIFIER_TYPE_VALUE (name, newval);
4313         }
4314       else
4315         {
4316           *ptr = newval;
4317         }
4318     }
4319   return t;
4320 }
4321
4322 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4323    if appropriate.  */
4324
4325 tree
4326 pushdecl_top_level (x)
4327      tree x;
4328 {
4329   push_to_top_level ();
4330   x = pushdecl_namespace_level (x);
4331   pop_from_top_level ();
4332   return x;
4333 }
4334
4335 /* Make the declaration of X appear in CLASS scope.  */
4336
4337 void
4338 pushdecl_class_level (x)
4339      tree x;
4340 {
4341   /* Don't use DECL_ASSEMBLER_NAME here!  Everything that looks in class
4342      scope looks for the pre-mangled name.  */
4343   register tree name;
4344
4345   if (TREE_CODE (x) == OVERLOAD)
4346     x = OVL_CURRENT (x);
4347   name = DECL_NAME (x);
4348
4349   if (name)
4350     {
4351       push_class_level_binding (name, x);
4352       if (TREE_CODE (x) == TYPE_DECL)
4353         set_identifier_type_value (name, TREE_TYPE (x));
4354     }
4355   else if (ANON_AGGR_TYPE_P (TREE_TYPE (x)))
4356     {
4357       tree f;
4358
4359       for (f = TYPE_FIELDS (TREE_TYPE (x));
4360            f;
4361            f = TREE_CHAIN (f))
4362         pushdecl_class_level (f);
4363     }
4364 }
4365
4366 /* Enter DECL into the symbol table, if that's appropriate.  Returns
4367    DECL, or a modified version thereof.  */
4368
4369 tree
4370 maybe_push_decl (decl)
4371      tree decl;
4372 {
4373   tree type = TREE_TYPE (decl);
4374
4375   /* Add this decl to the current binding level, but not if it comes
4376      from another scope, e.g. a static member variable.  TEM may equal
4377      DECL or it may be a previous decl of the same name.  */
4378   if (decl == error_mark_node
4379       || (TREE_CODE (decl) != PARM_DECL
4380           && DECL_CONTEXT (decl) != NULL_TREE
4381           /* Definitions of namespace members outside their namespace are
4382              possible. */
4383           && TREE_CODE (DECL_CONTEXT (decl)) != NAMESPACE_DECL)
4384       || (TREE_CODE (decl) == TEMPLATE_DECL && !namespace_bindings_p ())
4385       || TREE_CODE (type) == UNKNOWN_TYPE
4386       /* The declaration of a template specialization does not affect
4387          the functions available for overload resolution, so we do not
4388          call pushdecl.  */
4389       || (TREE_CODE (decl) == FUNCTION_DECL
4390           && DECL_TEMPLATE_SPECIALIZATION (decl)))
4391     return decl;
4392   else
4393     return pushdecl (decl);
4394 }
4395
4396 /* Make the declaration(s) of X appear in CLASS scope
4397    under the name NAME.  */
4398
4399 void
4400 push_class_level_binding (name, x)
4401      tree name;
4402      tree x;
4403 {
4404   tree binding;
4405   /* The class_binding_level will be NULL if x is a template
4406      parameter name in a member template.  */
4407   if (!class_binding_level)
4408     return;
4409
4410   /* Make sure that this new member does not have the same name
4411      as a template parameter.  */
4412   if (TYPE_BEING_DEFINED (current_class_type))
4413     check_template_shadow (x);
4414
4415   /* If this declaration shadows a declaration from an enclosing
4416      class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4417      we leave this class.  Record the shadowed declaration here.  */
4418   binding = IDENTIFIER_BINDING (name);
4419   if (binding
4420       && ((TREE_CODE (x) == OVERLOAD
4421            && BINDING_VALUE (binding)
4422            && is_overloaded_fn (BINDING_VALUE (binding)))
4423           || INHERITED_VALUE_BINDING_P (binding)))
4424     {
4425       tree shadow;
4426       tree old_decl;
4427
4428       /* If the old binding was from a base class, and was for a tag
4429          name, slide it over to make room for the new binding.  The
4430          old binding is still visible if explicitly qualified with a
4431          class-key.  */
4432       if (INHERITED_VALUE_BINDING_P (binding)
4433           && BINDING_VALUE (binding)
4434           && TREE_CODE (BINDING_VALUE (binding)) == TYPE_DECL
4435           && DECL_ARTIFICIAL (BINDING_VALUE (binding))
4436           && !(TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x)))
4437         {
4438           old_decl = BINDING_TYPE (binding);
4439           BINDING_TYPE (binding) = BINDING_VALUE (binding);
4440           BINDING_VALUE (binding) = NULL_TREE;
4441           INHERITED_VALUE_BINDING_P (binding) = 0;
4442         }
4443       else
4444         old_decl = BINDING_VALUE (binding);
4445
4446       /* There was already a binding for X containing fewer
4447          functions than are named in X.  Find the previous
4448          declaration of X on the class-shadowed list, and update it.  */
4449       for (shadow = class_binding_level->class_shadowed;
4450            shadow;
4451            shadow = TREE_CHAIN (shadow))
4452         if (TREE_PURPOSE (shadow) == name
4453             && TREE_TYPE (shadow) == old_decl)
4454           {
4455             BINDING_VALUE (binding) = x;
4456             INHERITED_VALUE_BINDING_P (binding) = 0;
4457             TREE_TYPE (shadow) = x;
4458             return;
4459           }
4460     }
4461
4462   /* If we didn't replace an existing binding, put the binding on the
4463      stack of bindings for the identifier, and update
4464      IDENTIFIER_CLASS_VALUE.  */
4465   if (push_class_binding (name, x))
4466     {
4467       class_binding_level->class_shadowed
4468         = tree_cons (name, IDENTIFIER_CLASS_VALUE (name),
4469                      class_binding_level->class_shadowed);
4470       /* Record the value we are binding NAME to so that we can know
4471          what to pop later.  */
4472       TREE_TYPE (class_binding_level->class_shadowed) = x;
4473     }
4474 }
4475
4476 /* Insert another USING_DECL into the current binding level, returning
4477    this declaration. If this is a redeclaration, do nothing, and
4478    return NULL_TREE if this not in namespace scope (in namespace
4479    scope, a using decl might extend any previous bindings).  */
4480
4481 tree
4482 push_using_decl (scope, name)
4483      tree scope;
4484      tree name;
4485 {
4486   tree decl;
4487
4488   my_friendly_assert (TREE_CODE (scope) == NAMESPACE_DECL, 383);
4489   my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 384);
4490   for (decl = current_binding_level->usings; decl; decl = TREE_CHAIN (decl))
4491     if (DECL_INITIAL (decl) == scope && DECL_NAME (decl) == name)
4492       break;
4493   if (decl)
4494     return namespace_bindings_p () ? decl : NULL_TREE;
4495   decl = build_lang_decl (USING_DECL, name, void_type_node);
4496   DECL_INITIAL (decl) = scope;
4497   TREE_CHAIN (decl) = current_binding_level->usings;
4498   current_binding_level->usings = decl;
4499   return decl;
4500 }
4501
4502 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4503    changed (i.e. there was already a directive), or the fresh
4504    TREE_LIST otherwise.  */
4505
4506 tree
4507 push_using_directive (used)
4508      tree used;
4509 {
4510   tree ud = current_binding_level->using_directives;
4511   tree iter, ancestor;
4512
4513   /* Check if we already have this. */
4514   if (purpose_member (used, ud) != NULL_TREE)
4515     return NULL_TREE;
4516
4517   /* Recursively add all namespaces used. */
4518   for (iter = DECL_NAMESPACE_USING (used); iter; iter = TREE_CHAIN (iter))
4519     push_using_directive (TREE_PURPOSE (iter));
4520
4521   ancestor = namespace_ancestor (current_decl_namespace (), used);
4522   ud = current_binding_level->using_directives;
4523   ud = tree_cons (used, ancestor, ud);
4524   current_binding_level->using_directives = ud;
4525   return ud;
4526 }
4527
4528 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4529    other definitions already in place.  We get around this by making
4530    the value of the identifier point to a list of all the things that
4531    want to be referenced by that name.  It is then up to the users of
4532    that name to decide what to do with that list.
4533
4534    DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4535    DECL_TEMPLATE_RESULT.  It is dealt with the same way.
4536
4537    FLAGS is a bitwise-or of the following values:
4538      PUSH_LOCAL: Bind DECL in the current scope, rather than at
4539                  namespace scope.
4540      PUSH_USING: DECL is being pushed as the result of a using
4541                  declaration.
4542
4543    The value returned may be a previous declaration if we guessed wrong
4544    about what language DECL should belong to (C or C++).  Otherwise,
4545    it's always DECL (and never something that's not a _DECL).  */
4546
4547 tree
4548 push_overloaded_decl (decl, flags)
4549      tree decl;
4550      int flags;
4551 {
4552   tree name = DECL_NAME (decl);
4553   tree old;
4554   tree new_binding;
4555   int doing_global = (namespace_bindings_p () || !(flags & PUSH_LOCAL));
4556
4557   if (doing_global)
4558     old = namespace_binding (name, DECL_CONTEXT (decl));
4559   else
4560     old = lookup_name_current_level (name);
4561
4562   if (old)
4563     {
4564       if (TREE_CODE (old) == TYPE_DECL && DECL_ARTIFICIAL (old))
4565         {
4566           tree t = TREE_TYPE (old);
4567           if (IS_AGGR_TYPE (t) && warn_shadow
4568               && (! DECL_IN_SYSTEM_HEADER (decl)
4569                   || ! DECL_IN_SYSTEM_HEADER (old)))
4570             cp_warning ("`%#D' hides constructor for `%#T'", decl, t);
4571           old = NULL_TREE;
4572         }
4573       else if (is_overloaded_fn (old))
4574         {
4575           tree tmp;
4576
4577           for (tmp = old; tmp; tmp = OVL_NEXT (tmp))
4578             {
4579               tree fn = OVL_CURRENT (tmp);
4580
4581               if (TREE_CODE (tmp) == OVERLOAD && OVL_USED (tmp)
4582                   && !(flags & PUSH_USING)
4583                   && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn)),
4584                                 TYPE_ARG_TYPES (TREE_TYPE (decl))))
4585                 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4586                           decl, fn);
4587
4588               if (duplicate_decls (decl, fn))
4589                 return fn;
4590             }
4591         }
4592       else if (old == error_mark_node)
4593         /* Ignore the undefined symbol marker.  */
4594         old = NULL_TREE;
4595       else
4596         {
4597           cp_error_at ("previous non-function declaration `%#D'", old);
4598           cp_error ("conflicts with function declaration `%#D'", decl);
4599           return decl;
4600         }
4601     }
4602
4603   if (old || TREE_CODE (decl) == TEMPLATE_DECL)
4604     {
4605       if (old && TREE_CODE (old) != OVERLOAD)
4606         new_binding = ovl_cons (decl, ovl_cons (old, NULL_TREE));
4607       else
4608         new_binding = ovl_cons (decl, old);
4609       if (flags & PUSH_USING)
4610         OVL_USED (new_binding) = 1;
4611     }
4612   else
4613     /* NAME is not ambiguous.  */
4614     new_binding = decl;
4615
4616   if (doing_global)
4617     set_namespace_binding (name, current_namespace, new_binding);
4618   else
4619     {
4620       /* We only create an OVERLOAD if there was a previous binding at
4621          this level, or if decl is a template. In the former case, we
4622          need to remove the old binding and replace it with the new
4623          binding.  We must also run through the NAMES on the binding
4624          level where the name was bound to update the chain.  */
4625
4626       if (TREE_CODE (new_binding) == OVERLOAD && old)
4627         {
4628           tree *d;
4629
4630           for (d = &BINDING_LEVEL (IDENTIFIER_BINDING (name))->names;
4631                *d;
4632                d = &TREE_CHAIN (*d))
4633             if (*d == old
4634                 || (TREE_CODE (*d) == TREE_LIST
4635                     && TREE_VALUE (*d) == old))
4636               {
4637                 if (TREE_CODE (*d) == TREE_LIST)
4638                   /* Just replace the old binding with the new.  */
4639                   TREE_VALUE (*d) = new_binding;
4640                 else
4641                   /* Build a TREE_LIST to wrap the OVERLOAD.  */
4642                   *d = tree_cons (NULL_TREE, new_binding,
4643                                   TREE_CHAIN (*d));
4644
4645                 /* And update the CPLUS_BINDING node.  */
4646                 BINDING_VALUE (IDENTIFIER_BINDING (name))
4647                   = new_binding;
4648                 return decl;
4649               }
4650
4651           /* We should always find a previous binding in this case.  */
4652           my_friendly_abort (0);
4653         }
4654
4655       /* Install the new binding.  */
4656       push_local_binding (name, new_binding, flags);
4657     }
4658
4659   return decl;
4660 }
4661 \f
4662 /* Generate an implicit declaration for identifier FUNCTIONID
4663    as a function of type int ().  Print a warning if appropriate.  */
4664
4665 tree
4666 implicitly_declare (functionid)
4667      tree functionid;
4668 {
4669   register tree decl;
4670
4671   /* We used to reuse an old implicit decl here,
4672      but this loses with inline functions because it can clobber
4673      the saved decl chains.  */
4674   decl = build_lang_decl (FUNCTION_DECL, functionid, default_function_type);
4675
4676   DECL_EXTERNAL (decl) = 1;
4677   TREE_PUBLIC (decl) = 1;
4678
4679   /* ISO standard says implicit declarations are in the innermost block.
4680      So we record the decl in the standard fashion.  */
4681   pushdecl (decl);
4682   rest_of_decl_compilation (decl, NULL_PTR, 0, 0);
4683
4684   if (warn_implicit
4685       /* Only one warning per identifier.  */
4686       && IDENTIFIER_IMPLICIT_DECL (functionid) == NULL_TREE)
4687     {
4688       cp_pedwarn ("implicit declaration of function `%#D'", decl);
4689     }
4690
4691   SET_IDENTIFIER_IMPLICIT_DECL (functionid, decl);
4692
4693   return decl;
4694 }
4695
4696 /* Return zero if the declaration NEWDECL is valid
4697    when the declaration OLDDECL (assumed to be for the same name)
4698    has already been seen.
4699    Otherwise return an error message format string with a %s
4700    where the identifier should go.  */
4701
4702 static const char *
4703 redeclaration_error_message (newdecl, olddecl)
4704      tree newdecl, olddecl;
4705 {
4706   if (TREE_CODE (newdecl) == TYPE_DECL)
4707     {
4708       /* Because C++ can put things into name space for free,
4709          constructs like "typedef struct foo { ... } foo"
4710          would look like an erroneous redeclaration.  */
4711       if (same_type_p (TREE_TYPE (newdecl), TREE_TYPE (olddecl)))
4712         return 0;
4713       else
4714         return "redefinition of `%#D'";
4715     }
4716   else if (TREE_CODE (newdecl) == FUNCTION_DECL)
4717     {
4718       /* If this is a pure function, its olddecl will actually be
4719          the original initialization to `0' (which we force to call
4720          abort()).  Don't complain about redefinition in this case.  */
4721       if (DECL_LANG_SPECIFIC (olddecl) && DECL_PURE_VIRTUAL_P (olddecl))
4722         return 0;
4723
4724       /* If both functions come from different namespaces, this is not
4725          a redeclaration - this is a conflict with a used function. */
4726       if (DECL_NAMESPACE_SCOPE_P (olddecl)
4727           && DECL_CONTEXT (olddecl) != DECL_CONTEXT (newdecl))
4728         return "`%D' conflicts with used function";
4729
4730       /* We'll complain about linkage mismatches in
4731          warn_extern_redeclared_static.  */
4732
4733       /* Defining the same name twice is no good.  */
4734       if (DECL_INITIAL (olddecl) != NULL_TREE
4735           && DECL_INITIAL (newdecl) != NULL_TREE)
4736         {
4737           if (DECL_NAME (olddecl) == NULL_TREE)
4738             return "`%#D' not declared in class";
4739           else
4740             return "redefinition of `%#D'";
4741         }
4742       return 0;
4743     }
4744   else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
4745     {
4746       if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
4747            && (DECL_TEMPLATE_RESULT (newdecl)
4748                != DECL_TEMPLATE_RESULT (olddecl))
4749            && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl))
4750            && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl)))
4751           || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL
4752               && COMPLETE_TYPE_P (TREE_TYPE (newdecl))
4753               && COMPLETE_TYPE_P (TREE_TYPE (olddecl))))
4754         return "redefinition of `%#D'";
4755       return 0;
4756     }
4757   else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl))
4758     {
4759       /* Objects declared at top level:  */
4760       /* If at least one is a reference, it's ok.  */
4761       if (DECL_EXTERNAL (newdecl) || DECL_EXTERNAL (olddecl))
4762         return 0;
4763       /* Reject two definitions.  */
4764       return "redefinition of `%#D'";
4765     }
4766   else
4767     {
4768       /* Objects declared with block scope:  */
4769       /* Reject two definitions, and reject a definition
4770          together with an external reference.  */
4771       if (!(DECL_EXTERNAL (newdecl) && DECL_EXTERNAL (olddecl)))
4772         return "redeclaration of `%#D'";
4773       return 0;
4774     }
4775 }
4776 \f
4777 /* Create a new label, named ID.  */
4778
4779 static tree
4780 make_label_decl (id, local_p)
4781      tree id;
4782      int local_p;
4783 {
4784   tree decl;
4785
4786   decl = build_decl (LABEL_DECL, id, void_type_node);
4787   if (expanding_p)
4788     /* Make sure every label has an rtx.  */
4789     label_rtx (decl);
4790
4791   DECL_CONTEXT (decl) = current_function_decl;
4792   DECL_MODE (decl) = VOIDmode;
4793   C_DECLARED_LABEL_FLAG (decl) = local_p;
4794
4795   /* Say where one reference is to the label, for the sake of the
4796      error if it is not defined.  */
4797   DECL_SOURCE_LINE (decl) = lineno;
4798   DECL_SOURCE_FILE (decl) = input_filename;
4799
4800   /* Record the fact that this identifier is bound to this label.  */
4801   SET_IDENTIFIER_LABEL_VALUE (id, decl);
4802
4803   return decl;
4804 }
4805
4806 /* Record this label on the list of used labels so that we can check
4807    at the end of the function to see whether or not the label was
4808    actually defined, and so we can check when the label is defined whether
4809    this use is valid.  */
4810
4811 static void
4812 use_label (decl)
4813      tree decl;
4814 {
4815   if (named_label_uses == NULL
4816       || named_label_uses->names_in_scope != current_binding_level->names
4817       || named_label_uses->label_decl != decl)
4818     {
4819       struct named_label_use_list *new_ent;
4820       new_ent = ((struct named_label_use_list *)
4821                  ggc_alloc (sizeof (struct named_label_use_list)));
4822       new_ent->label_decl = decl;
4823       new_ent->names_in_scope = current_binding_level->names;
4824       new_ent->binding_level = current_binding_level;
4825       new_ent->lineno_o_goto = lineno;
4826       new_ent->filename_o_goto = input_filename;
4827       new_ent->next = named_label_uses;
4828       named_label_uses = new_ent;
4829     }
4830 }
4831
4832 /* Look for a label named ID in the current function.  If one cannot
4833    be found, create one.  (We keep track of used, but undefined,
4834    labels, and complain about them at the end of a function.)  */
4835
4836 tree
4837 lookup_label (id)
4838      tree id;
4839 {
4840   tree decl;
4841   struct named_label_list *ent;
4842
4843   /* You can't use labels at global scope.  */
4844   if (current_function_decl == NULL_TREE)
4845     {
4846       error ("label `%s' referenced outside of any function",
4847              IDENTIFIER_POINTER (id));
4848       return NULL_TREE;
4849     }
4850
4851   /* See if we've already got this label.  */
4852   decl = IDENTIFIER_LABEL_VALUE (id);
4853   if (decl != NULL_TREE && DECL_CONTEXT (decl) == current_function_decl)
4854     return decl;
4855
4856   /* Record this label on the list of labels used in this function.
4857      We do this before calling make_label_decl so that we get the
4858      IDENTIFIER_LABEL_VALUE before the new label is declared.  */
4859   ent = ((struct named_label_list *)
4860          ggc_alloc_cleared (sizeof (struct named_label_list)));
4861   ent->old_value = IDENTIFIER_LABEL_VALUE (id);
4862   ent->next = named_labels;
4863   named_labels = ent;
4864
4865   /* We need a new label.  */
4866   decl = make_label_decl (id, /*local_p=*/0);
4867
4868   /* Now fill in the information we didn't have before.  */
4869   ent->label_decl = decl;
4870
4871   return decl;
4872 }
4873
4874 /* Declare a local label named ID.  */
4875
4876 tree
4877 declare_local_label (id)
4878      tree id;
4879 {
4880   tree decl;
4881
4882   /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4883      this scope we can restore the old value of
4884      IDENTIFIER_TYPE_VALUE.  */
4885   current_binding_level->shadowed_labels
4886     = tree_cons (IDENTIFIER_LABEL_VALUE (id), NULL_TREE,
4887                  current_binding_level->shadowed_labels);
4888   /* Look for the label.  */
4889   decl = make_label_decl (id, /*local_p=*/1);
4890   /* Now fill in the information we didn't have before.  */
4891   TREE_VALUE (current_binding_level->shadowed_labels) = decl;
4892
4893   return decl;
4894 }
4895
4896 /* Returns nonzero if it is ill-formed to jump past the declaration of
4897    DECL.  Returns 2 if it's also a real problem.  */
4898
4899 static int
4900 decl_jump_unsafe (decl)
4901      tree decl;
4902 {
4903   if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
4904     return 0;
4905
4906   if (DECL_INITIAL (decl) == NULL_TREE
4907       && pod_type_p (TREE_TYPE (decl)))
4908     return 0;
4909
4910   /* This is really only important if we're crossing an initialization.
4911      The POD stuff is just pedantry; why should it matter if the class
4912      contains a field of pointer to member type?  */
4913   if (DECL_INITIAL (decl)
4914       || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl))))
4915     return 2;
4916   return 1;
4917 }
4918
4919 /* Check that a single previously seen jump to a newly defined label
4920    is OK.  DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4921    the jump context; NAMES are the names in scope in LEVEL at the jump
4922    context; FILE and LINE are the source position of the jump or 0.  */
4923
4924 static void
4925 check_previous_goto_1 (decl, level, names, file, line)
4926      tree decl;
4927      struct binding_level *level;
4928      tree names;
4929      const char *file;
4930      int line;
4931 {
4932   int identified = 0;
4933   int saw_eh = 0;
4934   struct binding_level *b = current_binding_level;
4935   for (; b; b = b->level_chain)
4936     {
4937       tree new_decls = b->names;
4938       tree old_decls = (b == level ? names : NULL_TREE);
4939       for (; new_decls != old_decls;
4940            new_decls = TREE_CHAIN (new_decls))
4941         {
4942           int problem = decl_jump_unsafe (new_decls);
4943           if (! problem)
4944             continue;
4945
4946           if (! identified)
4947             {
4948               if (decl)
4949                 cp_pedwarn ("jump to label `%D'", decl);
4950               else
4951                 pedwarn ("jump to case label");
4952
4953               if (file)
4954                 pedwarn_with_file_and_line (file, line, "  from here");
4955               identified = 1;
4956             }
4957
4958           if (problem > 1 && DECL_ARTIFICIAL (new_decls))
4959             /* Can't skip init of __exception_info.  */
4960             cp_error_at ("  enters catch block", new_decls);
4961           else if (problem > 1)
4962             cp_error_at ("  crosses initialization of `%#D'",
4963                          new_decls);
4964           else
4965             cp_pedwarn_at ("  enters scope of non-POD `%#D'",
4966                            new_decls);
4967         }
4968
4969       if (b == level)
4970         break;
4971       if (b->eh_region && ! saw_eh)
4972         {
4973           if (! identified)
4974             {
4975               if (decl)
4976                 cp_pedwarn ("jump to label `%D'", decl);
4977               else
4978                 pedwarn ("jump to case label");
4979
4980               if (file)
4981                 pedwarn_with_file_and_line (file, line, "  from here");
4982               identified = 1;
4983             }
4984           error ("  enters try block");
4985           saw_eh = 1;
4986         }
4987     }
4988 }
4989
4990 static void
4991 check_previous_goto (use)
4992      struct named_label_use_list *use;
4993 {
4994   check_previous_goto_1 (use->label_decl, use->binding_level,
4995                          use->names_in_scope, use->filename_o_goto,
4996                          use->lineno_o_goto);
4997 }
4998
4999 static void
5000 check_switch_goto (level)
5001      struct binding_level *level;
5002 {
5003   check_previous_goto_1 (NULL_TREE, level, level->names, NULL, 0);
5004 }
5005
5006 /* Check that any previously seen jumps to a newly defined label DECL
5007    are OK.  Called by define_label.  */
5008
5009 static void
5010 check_previous_gotos (decl)
5011      tree decl;
5012 {
5013   struct named_label_use_list **usep;
5014
5015   if (! TREE_USED (decl))
5016     return;
5017
5018   for (usep = &named_label_uses; *usep; )
5019     {
5020       struct named_label_use_list *use = *usep;
5021       if (use->label_decl == decl)
5022         {
5023           check_previous_goto (use);
5024           *usep = use->next;
5025         }
5026       else
5027         usep = &(use->next);
5028     }
5029 }
5030
5031 /* Check that a new jump to a label DECL is OK.  Called by
5032    finish_goto_stmt.  */
5033
5034 void
5035 check_goto (decl)
5036      tree decl;
5037 {
5038   int identified = 0;
5039   tree bad;
5040   struct named_label_list *lab;
5041
5042   /* We can't know where a computed goto is jumping.  So we assume
5043      that it's OK.  */
5044   if (! DECL_P (decl))
5045     return;
5046
5047   /* If the label hasn't been defined yet, defer checking.  */
5048   if (! DECL_INITIAL (decl))
5049     {
5050       use_label (decl);
5051       return;
5052     }
5053
5054   for (lab = named_labels; lab; lab = lab->next)
5055     if (decl == lab->label_decl)
5056       break;
5057
5058   /* If the label is not on named_labels it's a gcc local label, so
5059      it must be in an outer scope, so jumping to it is always OK.  */
5060   if (lab == 0)
5061     return;
5062
5063   if ((lab->eh_region || lab->bad_decls) && !identified)
5064     {
5065       cp_pedwarn_at ("jump to label `%D'", decl);
5066       pedwarn ("  from here");
5067       identified = 1;
5068     }
5069
5070   for (bad = lab->bad_decls; bad; bad = TREE_CHAIN (bad))
5071     {
5072       tree b = TREE_VALUE (bad);
5073       int u = decl_jump_unsafe (b);
5074
5075       if (u > 1 && DECL_ARTIFICIAL (b))
5076         /* Can't skip init of __exception_info.  */
5077         cp_error_at ("  enters catch block", b);
5078       else if (u > 1)
5079         cp_error_at ("  skips initialization of `%#D'", b);
5080       else
5081         cp_pedwarn_at ("  enters scope of non-POD `%#D'", b);
5082     }
5083
5084   if (lab->eh_region)
5085     error ("  enters try block");
5086 }
5087
5088 /* Define a label, specifying the location in the source file.
5089    Return the LABEL_DECL node for the label, if the definition is valid.
5090    Otherwise return 0.  */
5091
5092 tree
5093 define_label (filename, line, name)
5094      const char *filename;
5095      int line;
5096      tree name;
5097 {
5098   tree decl = lookup_label (name);
5099   struct named_label_list *ent;
5100
5101   for (ent = named_labels; ent; ent = ent->next)
5102     if (ent->label_decl == decl)
5103       break;
5104
5105   /* After labels, make any new cleanups go into their
5106      own new (temporary) binding contour.  */
5107   current_binding_level->more_cleanups_ok = 0;
5108
5109   if (name == get_identifier ("wchar_t"))
5110     cp_pedwarn ("label named wchar_t");
5111
5112   if (DECL_INITIAL (decl) != NULL_TREE)
5113     {
5114       cp_error ("duplicate label `%D'", decl);
5115       return 0;
5116     }
5117   else
5118     {
5119       /* Mark label as having been defined.  */
5120       DECL_INITIAL (decl) = error_mark_node;
5121       /* Say where in the source.  */
5122       DECL_SOURCE_FILE (decl) = filename;
5123       DECL_SOURCE_LINE (decl) = line;
5124       if (ent)
5125         {
5126           ent->names_in_scope = current_binding_level->names;
5127           ent->binding_level = current_binding_level;
5128         }
5129       check_previous_gotos (decl);
5130       current_function_return_value = NULL_TREE;
5131       return decl;
5132     }
5133 }
5134
5135 struct cp_switch
5136 {
5137   struct binding_level *level;
5138   struct cp_switch *next;
5139   /* The SWITCH_STMT being built.  */
5140   tree switch_stmt;
5141   /* A splay-tree mapping the low element of a case range to the high
5142      element, or NULL_TREE if there is no high element.  Used to
5143      determine whether or not a new case label duplicates an old case
5144      label.  We need a tree, rather than simply a hash table, because
5145      of the GNU case range extension.  */
5146   splay_tree cases;
5147 };
5148
5149 /* A stack of the currently active switch statements.  The innermost
5150    switch statement is on the top of the stack.  There is no need to
5151    mark the stack for garbage collection because it is only active
5152    during the processing of the body of a function, and we never
5153    collect at that point.  */
5154
5155 static struct cp_switch *switch_stack;
5156
5157 /* Called right after a switch-statement condition is parsed.
5158    SWITCH_STMT is the switch statement being parsed.  */
5159
5160 void
5161 push_switch (switch_stmt)
5162      tree switch_stmt;
5163 {
5164   struct cp_switch *p
5165     = (struct cp_switch *) xmalloc (sizeof (struct cp_switch));
5166   p->level = current_binding_level;
5167   p->next = switch_stack;
5168   p->switch_stmt = switch_stmt;
5169   p->cases = splay_tree_new (case_compare, NULL, NULL);
5170   switch_stack = p;
5171 }
5172
5173 void
5174 pop_switch ()
5175 {
5176   struct cp_switch *cs;
5177
5178   cs = switch_stack;
5179   splay_tree_delete (cs->cases);
5180   switch_stack = switch_stack->next;
5181   free (cs);
5182 }
5183
5184 /* Note that we've seen a definition of a case label, and complain if this
5185    is a bad place for one.  */
5186
5187 void
5188 finish_case_label (low_value, high_value)
5189      tree low_value;
5190      tree high_value;
5191 {
5192   tree cond;
5193
5194   if (! switch_stack)
5195     {
5196       if (high_value)
5197         error ("case label not within a switch statement");
5198       else if (low_value)
5199         cp_error ("case label `%E' not within a switch statement",
5200                   low_value);
5201       else
5202         error ("`default' label not within a switch statement");
5203       return;
5204     }
5205
5206   if (processing_template_decl)
5207     {
5208       tree label;
5209
5210       /* For templates, just add the case label; we'll do semantic
5211          analysis at instantiation-time.  */
5212       label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
5213       add_stmt (build_case_label (low_value, high_value, label));
5214       return;
5215     }
5216
5217   /* Find the condition on which this switch statement depends.  */
5218   cond = SWITCH_COND (switch_stack->switch_stmt);
5219   if (cond && TREE_CODE (cond) == TREE_LIST)
5220     cond = TREE_VALUE (cond);
5221
5222   c_add_case_label (switch_stack->cases, cond, low_value, high_value);
5223
5224   check_switch_goto (switch_stack->level);
5225
5226   /* After labels, make any new cleanups go into their
5227      own new (temporary) binding contour.  */
5228   current_binding_level->more_cleanups_ok = 0;
5229   current_function_return_value = NULL_TREE;
5230 }
5231 \f
5232 /* Return the list of declarations of the current level.
5233    Note that this list is in reverse order unless/until
5234    you nreverse it; and when you do nreverse it, you must
5235    store the result back using `storedecls' or you will lose.  */
5236
5237 tree
5238 getdecls ()
5239 {
5240   return current_binding_level->names;
5241 }
5242
5243 /* Return the list of type-tags (for structs, etc) of the current level.  */
5244
5245 tree
5246 gettags ()
5247 {
5248   return current_binding_level->tags;
5249 }
5250
5251 /* Store the list of declarations of the current level.
5252    This is done for the parameter declarations of a function being defined,
5253    after they are modified in the light of any missing parameters.  */
5254
5255 static void
5256 storedecls (decls)
5257      tree decls;
5258 {
5259   current_binding_level->names = decls;
5260 }
5261
5262 /* Similarly, store the list of tags of the current level.  */
5263
5264 void
5265 storetags (tags)
5266      tree tags;
5267 {
5268   current_binding_level->tags = tags;
5269 }
5270 \f
5271 /* Given NAME, an IDENTIFIER_NODE,
5272    return the structure (or union or enum) definition for that name.
5273    Searches binding levels from BINDING_LEVEL up to the global level.
5274    If THISLEVEL_ONLY is nonzero, searches only the specified context
5275    (but skips any tag-transparent contexts to find one that is
5276    meaningful for tags).
5277    FORM says which kind of type the caller wants;
5278    it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5279    If the wrong kind of type is found, and it's not a template, an error is
5280    reported.  */
5281
5282 static tree
5283 lookup_tag (form, name, binding_level, thislevel_only)
5284      enum tree_code form;
5285      tree name;
5286      struct binding_level *binding_level;
5287      int thislevel_only;
5288 {
5289   register struct binding_level *level;
5290   /* Non-zero if, we should look past a template parameter level, even
5291      if THISLEVEL_ONLY.  */
5292   int allow_template_parms_p = 1;
5293
5294   for (level = binding_level; level; level = level->level_chain)
5295     {
5296       register tree tail;
5297       if (ANON_AGGRNAME_P (name))
5298         for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5299           {
5300             /* There's no need for error checking here, because
5301                anon names are unique throughout the compilation.  */
5302             if (TYPE_IDENTIFIER (TREE_VALUE (tail)) == name)
5303               return TREE_VALUE (tail);
5304           }
5305       else if (level->namespace_p)
5306         /* Do namespace lookup. */
5307         for (tail = current_namespace; 1; tail = CP_DECL_CONTEXT (tail))
5308           {
5309             tree old = binding_for_name (name, tail);
5310
5311             /* If we just skipped past a template parameter level,
5312                even though THISLEVEL_ONLY, and we find a template
5313                class declaration, then we use the _TYPE node for the
5314                template.  See the example below.  */
5315             if (thislevel_only && !allow_template_parms_p
5316                 && old && BINDING_VALUE (old)
5317                 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old)))
5318               old = TREE_TYPE (BINDING_VALUE (old));
5319             else
5320               old = BINDING_TYPE (old);
5321
5322             /* If it has an original type, it is a typedef, and we
5323                should not return it.  */
5324             if (old && DECL_ORIGINAL_TYPE (TYPE_NAME (old)))
5325               old = NULL_TREE;
5326             if (old && TREE_CODE (old) != form
5327                 && !(form != ENUMERAL_TYPE && TREE_CODE (old) == TEMPLATE_DECL))
5328               {
5329                 cp_error ("`%#D' redeclared as %C", old, form);
5330                 return NULL_TREE;
5331               }
5332             if (old)
5333               return old;
5334             if (thislevel_only || tail == global_namespace)
5335               return NULL_TREE;
5336           }
5337       else
5338         for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5339           {
5340             if (TREE_PURPOSE (tail) == name)
5341               {
5342                 enum tree_code code = TREE_CODE (TREE_VALUE (tail));
5343                 /* Should tighten this up; it'll probably permit
5344                    UNION_TYPE and a struct template, for example.  */
5345                 if (code != form
5346                     && !(form != ENUMERAL_TYPE && code == TEMPLATE_DECL))
5347                   {
5348                     /* Definition isn't the kind we were looking for.  */
5349                     cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail),
5350                               form);
5351                     return NULL_TREE;
5352                   }
5353                 return TREE_VALUE (tail);
5354               }
5355           }
5356       if (thislevel_only && ! level->tag_transparent)
5357         {
5358           if (level->template_parms_p && allow_template_parms_p)
5359             {
5360               /* We must deal with cases like this:
5361
5362                    template <class T> struct S;
5363                    template <class T> struct S {};
5364
5365                  When looking up `S', for the second declaration, we
5366                  would like to find the first declaration.  But, we
5367                  are in the pseudo-global level created for the
5368                  template parameters, rather than the (surrounding)
5369                  namespace level.  Thus, we keep going one more level,
5370                  even though THISLEVEL_ONLY is non-zero.  */
5371               allow_template_parms_p = 0;
5372               continue;
5373             }
5374           else
5375             return NULL_TREE;
5376         }
5377     }
5378   return NULL_TREE;
5379 }
5380
5381 #if 0
5382 void
5383 set_current_level_tags_transparency (tags_transparent)
5384      int tags_transparent;
5385 {
5386   current_binding_level->tag_transparent = tags_transparent;
5387 }
5388 #endif
5389
5390 /* Given a type, find the tag that was defined for it and return the tag name.
5391    Otherwise return 0.  However, the value can never be 0
5392    in the cases in which this is used.
5393
5394    C++: If NAME is non-zero, this is the new name to install.  This is
5395    done when replacing anonymous tags with real tag names.  */
5396
5397 static tree
5398 lookup_tag_reverse (type, name)
5399      tree type;
5400      tree name;
5401 {
5402   register struct binding_level *level;
5403
5404   for (level = current_binding_level; level; level = level->level_chain)
5405     {
5406       register tree tail;
5407       for (tail = level->tags; tail; tail = TREE_CHAIN (tail))
5408         {
5409           if (TREE_VALUE (tail) == type)
5410             {
5411               if (name)
5412                 TREE_PURPOSE (tail) = name;
5413               return TREE_PURPOSE (tail);
5414             }
5415         }
5416     }
5417   return NULL_TREE;
5418 }
5419 \f
5420 /* Look up NAME in the NAMESPACE.  */
5421
5422 tree
5423 lookup_namespace_name (namespace, name)
5424      tree namespace, name;
5425 {
5426   tree val;
5427   tree template_id = NULL_TREE;
5428
5429   my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL, 370);
5430
5431   if (TREE_CODE (name) == NAMESPACE_DECL)
5432     /* This happens for A::B<int> when B is a namespace. */
5433     return name;
5434   else if (TREE_CODE (name) == TEMPLATE_DECL)
5435     {
5436       /* This happens for A::B where B is a template, and there are no
5437          template arguments.  */
5438       cp_error ("invalid use of `%D'", name);
5439       return error_mark_node;
5440     }
5441
5442   namespace = ORIGINAL_NAMESPACE (namespace);
5443
5444   if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
5445     {
5446       template_id = name;
5447       name = TREE_OPERAND (name, 0);
5448       if (TREE_CODE (name) == OVERLOAD)
5449         name = DECL_NAME (OVL_CURRENT (name));
5450       else if (DECL_P (name))
5451         name = DECL_NAME (name);
5452     }
5453
5454   my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 373);
5455
5456   val = make_node (CPLUS_BINDING);
5457   if (!qualified_lookup_using_namespace (name, namespace, val, 0))
5458     return error_mark_node;
5459
5460   if (BINDING_VALUE (val))
5461     {
5462       val = BINDING_VALUE (val);
5463
5464       if (template_id)
5465         {
5466           if (DECL_CLASS_TEMPLATE_P (val))
5467             val = lookup_template_class (val,
5468                                          TREE_OPERAND (template_id, 1),
5469                                          /*in_decl=*/NULL_TREE,
5470                                          /*context=*/NULL_TREE,
5471                                          /*entering_scope=*/0);
5472           else if (DECL_FUNCTION_TEMPLATE_P (val)
5473                    || TREE_CODE (val) == OVERLOAD)
5474             val = lookup_template_function (val,
5475                                             TREE_OPERAND (template_id, 1));
5476           else
5477             {
5478               cp_error ("`%D::%D' is not a template",
5479                         namespace, name);
5480               return error_mark_node;
5481             }
5482         }
5483
5484       /* If we have a single function from a using decl, pull it out.  */
5485       if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
5486         val = OVL_FUNCTION (val);
5487       return val;
5488     }
5489
5490   cp_error ("`%D' undeclared in namespace `%D'", name, namespace);
5491   return error_mark_node;
5492 }
5493
5494 /* Hash a TYPENAME_TYPE.  K is really of type `tree'.  */
5495
5496 static unsigned long
5497 typename_hash (k)
5498      hash_table_key k;
5499 {
5500   unsigned long hash;
5501   tree t;
5502
5503   t = (tree) k;
5504   hash = (((unsigned long) TYPE_CONTEXT (t))
5505           ^ ((unsigned long) DECL_NAME (TYPE_NAME (t))));
5506
5507   return hash;
5508 }
5509
5510 /* Compare two TYPENAME_TYPEs.  K1 and K2 are really of type `tree'.  */
5511
5512 static boolean
5513 typename_compare (k1, k2)
5514      hash_table_key k1;
5515      hash_table_key k2;
5516 {
5517   tree t1;
5518   tree t2;
5519   tree d1;
5520   tree d2;
5521
5522   t1 = (tree) k1;
5523   t2 = (tree) k2;
5524   d1 = TYPE_NAME (t1);
5525   d2 = TYPE_NAME (t2);
5526
5527   return (DECL_NAME (d1) == DECL_NAME (d2)
5528           && same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2))
5529           && ((TREE_TYPE (t1) != NULL_TREE)
5530               == (TREE_TYPE (t2) != NULL_TREE))
5531           && same_type_p (TREE_TYPE (t1), TREE_TYPE (t2))
5532           && TYPENAME_TYPE_FULLNAME (t1) == TYPENAME_TYPE_FULLNAME (t2));
5533 }
5534
5535 /* Build a TYPENAME_TYPE.  If the type is `typename T::t', CONTEXT is
5536    the type of `T', NAME is the IDENTIFIER_NODE for `t'.  If BASE_TYPE
5537    is non-NULL, this type is being created by the implicit typename
5538    extension, and BASE_TYPE is a type named `t' in some base class of
5539    `T' which depends on template parameters.
5540
5541    Returns the new TYPENAME_TYPE.  */
5542
5543 tree
5544 build_typename_type (context, name, fullname, base_type)
5545      tree context;
5546      tree name;
5547      tree fullname;
5548      tree base_type;
5549 {
5550   tree t;
5551   tree d;
5552   struct hash_entry* e;
5553
5554   static struct hash_table ht;
5555
5556   if (!ht.table)
5557     {
5558       static struct hash_table *h = &ht;
5559       if (!hash_table_init (&ht, &hash_newfunc, &typename_hash,
5560                             &typename_compare))
5561         fatal ("virtual memory exhausted");
5562       ggc_add_tree_hash_table_root (&h, 1);
5563     }
5564
5565   /* Build the TYPENAME_TYPE.  */
5566   t = make_aggr_type (TYPENAME_TYPE);
5567   TYPE_CONTEXT (t) = FROB_CONTEXT (context);
5568   TYPENAME_TYPE_FULLNAME (t) = fullname;
5569   TREE_TYPE (t) = base_type;
5570
5571   /* Build the corresponding TYPE_DECL.  */
5572   d = build_decl (TYPE_DECL, name, t);
5573   TYPE_NAME (TREE_TYPE (d)) = d;
5574   TYPE_STUB_DECL (TREE_TYPE (d)) = d;
5575   DECL_CONTEXT (d) = FROB_CONTEXT (context);
5576   DECL_ARTIFICIAL (d) = 1;
5577
5578   /* See if we already have this type.  */
5579   e = hash_lookup (&ht, t, /*create=*/false, /*copy=*/0);
5580   if (e)
5581     t = (tree) e->key;
5582   else
5583     /* Insert the type into the table.  */
5584     hash_lookup (&ht, t, /*create=*/true, /*copy=*/0);
5585
5586   return t;
5587 }
5588
5589 /* Resolve `typename CONTEXT::NAME'.  Returns an appropriate type,
5590    unless an error occurs, in which case error_mark_node is returned.
5591    If COMPLAIN zero, don't complain about any errors that occur.  */
5592
5593 tree
5594 make_typename_type (context, name, complain)
5595      tree context, name;
5596      int complain;
5597 {
5598   tree fullname;
5599
5600   if (TYPE_P (name))
5601     {
5602       if (!(TYPE_LANG_SPECIFIC (name)
5603             && (CLASSTYPE_IS_TEMPLATE (name)
5604                 || CLASSTYPE_USE_TEMPLATE (name))))
5605         name = TYPE_IDENTIFIER (name);
5606       else
5607         /* Create a TEMPLATE_ID_EXPR for the type.  */
5608         name = build_nt (TEMPLATE_ID_EXPR,
5609                          CLASSTYPE_TI_TEMPLATE (name),
5610                          CLASSTYPE_TI_ARGS (name));
5611     }
5612   else if (TREE_CODE (name) == TYPE_DECL)
5613     name = DECL_NAME (name);
5614
5615   fullname = name;
5616
5617   if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
5618     {
5619       name = TREE_OPERAND (name, 0);
5620       if (TREE_CODE (name) == TEMPLATE_DECL)
5621         name = TREE_OPERAND (fullname, 0) = DECL_NAME (name);
5622     }
5623   if (TREE_CODE (name) != IDENTIFIER_NODE)
5624     my_friendly_abort (2000);
5625
5626   if (TREE_CODE (context) == NAMESPACE_DECL)
5627     {
5628       /* We can get here from typename_sub0 in the explicit_template_type
5629          expansion.  Just fail.  */
5630       if (complain)
5631         cp_error ("no class template named `%#T' in `%#T'",
5632                   name, context);
5633       return error_mark_node;
5634     }
5635
5636   if (! uses_template_parms (context)
5637       || currently_open_class (context))
5638     {
5639       if (TREE_CODE (fullname) == TEMPLATE_ID_EXPR)
5640         {
5641           tree tmpl = NULL_TREE;
5642           if (IS_AGGR_TYPE (context))
5643             tmpl = lookup_field (context, name, 0, 0);
5644           if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
5645             {
5646               if (complain)
5647                 cp_error ("no class template named `%#T' in `%#T'",
5648                           name, context);
5649               return error_mark_node;
5650             }
5651
5652           return lookup_template_class (tmpl,
5653                                         TREE_OPERAND (fullname, 1),
5654                                         NULL_TREE, context,
5655                                         /*entering_scope=*/0);
5656         }
5657       else
5658         {
5659           tree t;
5660
5661           if (!IS_AGGR_TYPE (context))
5662             {
5663               if (complain)
5664                 cp_error ("no type named `%#T' in `%#T'", name, context);
5665               return error_mark_node;
5666             }
5667
5668           t = lookup_field (context, name, 0, 1);
5669           if (t)
5670             return TREE_TYPE (t);
5671         }
5672     }
5673
5674   /* If the CONTEXT is not a template type, then either the field is
5675      there now or its never going to be.  */
5676   if (!uses_template_parms (context))
5677     {
5678       if (complain)
5679         cp_error ("no type named `%#T' in `%#T'", name, context);
5680       return error_mark_node;
5681     }
5682
5683
5684   return build_typename_type (context, name, fullname,  NULL_TREE);
5685 }
5686
5687 /* Select the right _DECL from multiple choices. */
5688
5689 static tree
5690 select_decl (binding, flags)
5691      tree binding;
5692      int flags;
5693 {
5694   tree val;
5695   val = BINDING_VALUE (binding);
5696
5697   /* When we implicitly declare some builtin entity, we mark it
5698      DECL_ANTICIPATED, so that we know to ignore it until it is
5699      really declared.  */
5700   if (val && DECL_P (val)
5701       && DECL_LANG_SPECIFIC (val)
5702       && DECL_ANTICIPATED (val))
5703     return NULL_TREE;
5704
5705   if (LOOKUP_NAMESPACES_ONLY (flags))
5706     {
5707       /* We are not interested in types. */
5708       if (val && TREE_CODE (val) == NAMESPACE_DECL)
5709         return val;
5710       return NULL_TREE;
5711     }
5712
5713   /* If we could have a type and
5714      we have nothing or we need a type and have none.  */
5715   if (BINDING_TYPE (binding)
5716       && (!val || ((flags & LOOKUP_PREFER_TYPES)
5717                    && TREE_CODE (val) != TYPE_DECL)))
5718     val = TYPE_STUB_DECL (BINDING_TYPE (binding));
5719   /* Don't return non-types if we really prefer types. */
5720   else if (val && LOOKUP_TYPES_ONLY (flags)  && TREE_CODE (val) != TYPE_DECL
5721            && (TREE_CODE (val) != TEMPLATE_DECL
5722                || !DECL_CLASS_TEMPLATE_P (val)))
5723     val = NULL_TREE;
5724
5725   return val;
5726 }
5727
5728 /* Unscoped lookup of a global: iterate over current namespaces,
5729    considering using-directives.  If SPACESP is non-NULL, store a list
5730    of the namespaces we've considered in it.  */
5731
5732 tree
5733 unqualified_namespace_lookup (name, flags, spacesp)
5734      tree name;
5735      int flags;
5736      tree *spacesp;
5737 {
5738   tree b = make_node (CPLUS_BINDING);
5739   tree initial = current_decl_namespace();
5740   tree scope = initial;
5741   tree siter;
5742   struct binding_level *level;
5743   tree val = NULL_TREE;
5744
5745   if (spacesp)
5746     *spacesp = NULL_TREE;
5747
5748   for (; !val; scope = CP_DECL_CONTEXT (scope))
5749     {
5750       if (spacesp)
5751         *spacesp = tree_cons (scope, NULL_TREE, *spacesp);
5752       val = binding_for_name (name, scope);
5753
5754       /* Initialize binding for this context. */
5755       BINDING_VALUE (b) = BINDING_VALUE (val);
5756       BINDING_TYPE (b) = BINDING_TYPE (val);
5757
5758       /* Add all _DECLs seen through local using-directives. */
5759       for (level = current_binding_level;
5760            !level->namespace_p;
5761            level = level->level_chain)
5762         if (!lookup_using_namespace (name, b, level->using_directives,
5763                                      scope, flags, spacesp))
5764           /* Give up because of error. */
5765           return error_mark_node;
5766
5767       /* Add all _DECLs seen through global using-directives. */
5768       /* XXX local and global using lists should work equally. */
5769       siter = initial;
5770       while (1)
5771         {
5772           if (!lookup_using_namespace (name, b, DECL_NAMESPACE_USING (siter),
5773                                        scope, flags, spacesp))
5774             /* Give up because of error. */
5775             return error_mark_node;
5776           if (siter == scope) break;
5777           siter = CP_DECL_CONTEXT (siter);
5778         }
5779
5780       val = select_decl (b, flags);
5781       if (scope == global_namespace)
5782         break;
5783     }
5784   return val;
5785 }
5786
5787 /* Combine prefer_type and namespaces_only into flags.  */
5788
5789 static int
5790 lookup_flags (prefer_type, namespaces_only)
5791   int prefer_type, namespaces_only;
5792 {
5793   if (namespaces_only)
5794     return LOOKUP_PREFER_NAMESPACES;
5795   if (prefer_type > 1)
5796     return LOOKUP_PREFER_TYPES;
5797   if (prefer_type > 0)
5798     return LOOKUP_PREFER_BOTH;
5799   return 0;
5800 }
5801
5802 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5803    ignore it or not.  Subroutine of lookup_name_real.  */
5804
5805 static tree
5806 qualify_lookup (val, flags)
5807      tree val;
5808      int flags;
5809 {
5810   if (val == NULL_TREE)
5811     return val;
5812   if ((flags & LOOKUP_PREFER_NAMESPACES) && TREE_CODE (val) == NAMESPACE_DECL)
5813     return val;
5814   if ((flags & LOOKUP_PREFER_TYPES)
5815       && (TREE_CODE (val) == TYPE_DECL
5816           || ((flags & LOOKUP_TEMPLATES_EXPECTED)
5817               && DECL_CLASS_TEMPLATE_P (val))))
5818     return val;
5819   if (flags & (LOOKUP_PREFER_NAMESPACES | LOOKUP_PREFER_TYPES))
5820     return NULL_TREE;
5821   return val;
5822 }
5823
5824 /* Any other BINDING overrides an implicit TYPENAME.  Warn about
5825    that.  */
5826
5827 static void
5828 warn_about_implicit_typename_lookup (typename, binding)
5829      tree typename;
5830      tree binding;
5831 {
5832   tree subtype = TREE_TYPE (TREE_TYPE (typename));
5833   tree name = DECL_NAME (typename);
5834
5835   if (! (TREE_CODE (binding) == TEMPLATE_DECL
5836          && CLASSTYPE_TEMPLATE_INFO (subtype)
5837          && CLASSTYPE_TI_TEMPLATE (subtype) == binding)
5838       && ! (TREE_CODE (binding) == TYPE_DECL
5839             && same_type_p (TREE_TYPE (binding), subtype)))
5840     {
5841       cp_warning ("lookup of `%D' finds `%#D'",
5842                   name, binding);
5843       cp_warning ("  instead of `%D' from dependent base class",
5844                   typename);
5845       cp_warning ("  (use `typename %T::%D' if that's what you meant)",
5846                   constructor_name (current_class_type), name);
5847     }
5848 }
5849
5850 /* Look up NAME in the current binding level and its superiors in the
5851    namespace of variables, functions and typedefs.  Return a ..._DECL
5852    node of some kind representing its definition if there is only one
5853    such declaration, or return a TREE_LIST with all the overloaded
5854    definitions if there are many, or return 0 if it is undefined.
5855
5856    If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5857    If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5858    If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5859    Otherwise we prefer non-TYPE_DECLs.
5860
5861    If NONCLASS is non-zero, we don't look for the NAME in class scope,
5862    using IDENTIFIER_CLASS_VALUE.  */
5863
5864 static tree
5865 lookup_name_real (name, prefer_type, nonclass, namespaces_only)
5866      tree name;
5867      int prefer_type, nonclass, namespaces_only;
5868 {
5869   tree t;
5870   tree val = NULL_TREE;
5871   int yylex = 0;
5872   tree from_obj = NULL_TREE;
5873   int flags;
5874   int val_is_implicit_typename = 0;
5875
5876   /* Hack: copy flag set by parser, if set. */
5877   if (only_namespace_names)
5878     namespaces_only = 1;
5879
5880   if (prefer_type == -2)
5881     {
5882       extern int looking_for_typename;
5883       tree type = NULL_TREE;
5884
5885       yylex = 1;
5886       prefer_type = looking_for_typename;
5887
5888       flags = lookup_flags (prefer_type, namespaces_only);
5889       /* If the next thing is '<', class templates are types. */
5890       if (looking_for_template)
5891         flags |= LOOKUP_TEMPLATES_EXPECTED;
5892
5893       /* std:: becomes :: for now.  */
5894       if (got_scope && got_scope == fake_std_node)
5895         got_scope = void_type_node;
5896
5897       if (got_scope)
5898         type = got_scope;
5899       else if (got_object != error_mark_node)
5900         type = got_object;
5901
5902       if (type)
5903         {
5904           if (type == error_mark_node)
5905             return error_mark_node;
5906           if (TREE_CODE (type) == TYPENAME_TYPE && TREE_TYPE (type))
5907             type = TREE_TYPE (type);
5908
5909           if (TYPE_P (type))
5910             type = complete_type (type);
5911
5912           if (TREE_CODE (type) == VOID_TYPE)
5913             type = global_namespace;
5914           if (TREE_CODE (type) == NAMESPACE_DECL)
5915             {
5916               val = make_node (CPLUS_BINDING);
5917               flags |= LOOKUP_COMPLAIN;
5918               if (!qualified_lookup_using_namespace (name, type, val, flags))
5919                 return NULL_TREE;
5920               val = select_decl (val, flags);
5921             }
5922           else if (! IS_AGGR_TYPE (type)
5923                    || TREE_CODE (type) == TEMPLATE_TYPE_PARM
5924                    || TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM
5925                    || TREE_CODE (type) == TYPENAME_TYPE)
5926             /* Someone else will give an error about this if needed.  */
5927             val = NULL_TREE;
5928           else if (type == current_class_type)
5929             val = IDENTIFIER_CLASS_VALUE (name);
5930           else
5931             {
5932               val = lookup_member (type, name, 0, prefer_type);
5933               type_access_control (type, val);
5934
5935               /* Restore the containing TYPENAME_TYPE if we looked
5936                  through it before.  */
5937               if (got_scope && got_scope != type
5938                   && val && TREE_CODE (val) == TYPE_DECL
5939                   && TREE_CODE (TREE_TYPE (val)) == TYPENAME_TYPE)
5940                 TYPE_CONTEXT (TREE_TYPE (val)) = got_scope;
5941             }
5942         }
5943       else
5944         val = NULL_TREE;
5945
5946       if (got_scope)
5947         goto done;
5948       else if (got_object && val)
5949         {
5950           from_obj = val;
5951           val = NULL_TREE;
5952         }
5953     }
5954   else
5955     {
5956       flags = lookup_flags (prefer_type, namespaces_only);
5957       /* If we're not parsing, we need to complain. */
5958       flags |= LOOKUP_COMPLAIN;
5959     }
5960
5961   /* First, look in non-namespace scopes.  */
5962
5963   if (current_class_type == NULL_TREE)
5964     nonclass = 1;
5965
5966   for (t = IDENTIFIER_BINDING (name); t; t = TREE_CHAIN (t))
5967     {
5968       tree binding;
5969
5970       if (!LOCAL_BINDING_P (t) && nonclass)
5971         /* We're not looking for class-scoped bindings, so keep going.  */
5972         continue;
5973
5974       /* If this is the kind of thing we're looking for, we're done.  */
5975       if (qualify_lookup (BINDING_VALUE (t), flags))
5976         binding = BINDING_VALUE (t);
5977       else if ((flags & LOOKUP_PREFER_TYPES)
5978                && qualify_lookup (BINDING_TYPE (t), flags))
5979         binding = BINDING_TYPE (t);
5980       else
5981         binding = NULL_TREE;
5982
5983       /* Handle access control on types from enclosing or base classes.  */
5984       if (binding && ! yylex
5985           && BINDING_LEVEL (t) && BINDING_LEVEL (t)->parm_flag == 2)
5986         type_access_control (BINDING_LEVEL (t)->this_class, binding);
5987
5988       if (binding
5989           && (!val || !IMPLICIT_TYPENAME_TYPE_DECL_P (binding)))
5990         {
5991           if (val_is_implicit_typename && !yylex)
5992             warn_about_implicit_typename_lookup (val, binding);
5993           val = binding;
5994           val_is_implicit_typename
5995             = IMPLICIT_TYPENAME_TYPE_DECL_P (val);
5996           if (!val_is_implicit_typename)
5997             break;
5998         }
5999     }
6000
6001   /* Now lookup in namespace scopes.  */
6002   if (!val || val_is_implicit_typename)
6003     {
6004       t = unqualified_namespace_lookup (name, flags, 0);
6005       if (t)
6006         {
6007           if (val_is_implicit_typename && !yylex)
6008             warn_about_implicit_typename_lookup (val, t);
6009           val = t;
6010         }
6011     }
6012
6013  done:
6014   if (val)
6015     {
6016       /* This should only warn about types used in qualified-ids.  */
6017       if (from_obj && from_obj != val)
6018         {
6019           if (looking_for_typename && TREE_CODE (from_obj) == TYPE_DECL
6020               && TREE_CODE (val) == TYPE_DECL
6021               && ! same_type_p (TREE_TYPE (from_obj), TREE_TYPE (val)))
6022             cp_pedwarn ("\
6023 lookup of `%D' in the scope of `%#T' (`%#T') \
6024 does not match lookup in the current scope (`%#T')",
6025                         name, got_object, TREE_TYPE (from_obj),
6026                         TREE_TYPE (val));
6027
6028           /* We don't change val to from_obj if got_object depends on
6029              template parms because that breaks implicit typename for
6030              destructor calls.  */
6031           if (! uses_template_parms (got_object))
6032             val = from_obj;
6033         }
6034
6035       /* If we have a single function from a using decl, pull it out.  */
6036       if (TREE_CODE (val) == OVERLOAD && ! really_overloaded_fn (val))
6037         val = OVL_FUNCTION (val);
6038     }
6039   else if (from_obj)
6040     val = from_obj;
6041
6042   return val;
6043 }
6044
6045 tree
6046 lookup_name_nonclass (name)
6047      tree name;
6048 {
6049   return lookup_name_real (name, 0, 1, 0);
6050 }
6051
6052 tree
6053 lookup_function_nonclass (name, args)
6054      tree name;
6055      tree args;
6056 {
6057   return lookup_arg_dependent (name, lookup_name_nonclass (name), args);
6058 }
6059
6060 tree
6061 lookup_name_namespace_only (name)
6062      tree name;
6063 {
6064   /* type-or-namespace, nonclass, namespace_only */
6065   return lookup_name_real (name, 1, 1, 1);
6066 }
6067
6068 tree
6069 lookup_name (name, prefer_type)
6070      tree name;
6071      int prefer_type;
6072 {
6073   return lookup_name_real (name, prefer_type, 0, 0);
6074 }
6075
6076 /* Similar to `lookup_name' but look only in the innermost non-class
6077    binding level.  */
6078
6079 tree
6080 lookup_name_current_level (name)
6081      tree name;
6082 {
6083   struct binding_level *b;
6084   tree t = NULL_TREE;
6085
6086   b = current_binding_level;
6087   while (b->parm_flag == 2)
6088     b = b->level_chain;
6089
6090   if (b->namespace_p)
6091     {
6092       t = IDENTIFIER_NAMESPACE_VALUE (name);
6093
6094       /* extern "C" function() */
6095       if (t != NULL_TREE && TREE_CODE (t) == TREE_LIST)
6096         t = TREE_VALUE (t);
6097     }
6098   else if (IDENTIFIER_BINDING (name)
6099            && LOCAL_BINDING_P (IDENTIFIER_BINDING (name)))
6100     {
6101       while (1)
6102         {
6103           if (BINDING_LEVEL (IDENTIFIER_BINDING (name)) == b)
6104             return IDENTIFIER_VALUE (name);
6105
6106           if (b->keep == 2)
6107             b = b->level_chain;
6108           else
6109             break;
6110         }
6111     }
6112
6113   return t;
6114 }
6115
6116 /* Like lookup_name_current_level, but for types.  */
6117
6118 tree
6119 lookup_type_current_level (name)
6120      tree name;
6121 {
6122   register tree t = NULL_TREE;
6123
6124   my_friendly_assert (! current_binding_level->namespace_p, 980716);
6125
6126   if (REAL_IDENTIFIER_TYPE_VALUE (name) != NULL_TREE
6127       && REAL_IDENTIFIER_TYPE_VALUE (name) != global_type_node)
6128     {
6129       struct binding_level *b = current_binding_level;
6130       while (1)
6131         {
6132           if (purpose_member (name, b->type_shadowed))
6133             return REAL_IDENTIFIER_TYPE_VALUE (name);
6134           if (b->keep == 2)
6135             b = b->level_chain;
6136           else
6137             break;
6138         }
6139     }
6140
6141   return t;
6142 }
6143
6144 void
6145 begin_only_namespace_names ()
6146 {
6147   only_namespace_names = 1;
6148 }
6149
6150 void
6151 end_only_namespace_names ()
6152 {
6153   only_namespace_names = 0;
6154 }
6155 \f
6156 /* Push the declarations of builtin types into the namespace.
6157    RID_INDEX is the index of the builtin type
6158    in the array RID_POINTERS.  NAME is the name used when looking
6159    up the builtin type.  TYPE is the _TYPE node for the builtin type.  */
6160
6161 static void
6162 record_builtin_type (rid_index, name, type)
6163      enum rid rid_index;
6164      const char *name;
6165      tree type;
6166 {
6167   tree rname = NULL_TREE, tname = NULL_TREE;
6168   tree tdecl = NULL_TREE;
6169
6170   if ((int) rid_index < (int) RID_MAX)
6171     rname = ridpointers[(int) rid_index];
6172   if (name)
6173     tname = get_identifier (name);
6174
6175   TYPE_BUILT_IN (type) = 1;
6176
6177   if (tname)
6178     {
6179       tdecl = pushdecl (build_decl (TYPE_DECL, tname, type));
6180       set_identifier_type_value (tname, NULL_TREE);
6181       if ((int) rid_index < (int) RID_MAX)
6182         /* Built-in types live in the global namespace. */
6183         SET_IDENTIFIER_GLOBAL_VALUE (tname, tdecl);
6184     }
6185   if (rname != NULL_TREE)
6186     {
6187       if (tname != NULL_TREE)
6188         {
6189           set_identifier_type_value (rname, NULL_TREE);
6190           SET_IDENTIFIER_GLOBAL_VALUE (rname, tdecl);
6191         }
6192       else
6193         {
6194           tdecl = pushdecl (build_decl (TYPE_DECL, rname, type));
6195           set_identifier_type_value (rname, NULL_TREE);
6196         }
6197     }
6198 }
6199
6200 /* Record one of the standard Java types.
6201  * Declare it as having the given NAME.
6202  * If SIZE > 0, it is the size of one of the integral types;
6203  * otherwise it is the negative of the size of one of the other types.  */
6204
6205 static tree
6206 record_builtin_java_type (name, size)
6207      const char *name;
6208      int size;
6209 {
6210   tree type, decl;
6211   if (size > 0)
6212     type = make_signed_type (size);
6213   else if (size > -32)
6214     { /* "__java_char" or ""__java_boolean". */
6215       type = make_unsigned_type (-size);
6216       /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6217     }
6218   else
6219     { /* "__java_float" or ""__java_double". */
6220       type = make_node (REAL_TYPE);
6221       TYPE_PRECISION (type) = - size;
6222       layout_type (type);
6223     }
6224   record_builtin_type (RID_MAX, name, type);
6225   decl = TYPE_NAME (type);
6226
6227   /* Suppress generate debug symbol entries for these types,
6228      since for normal C++ they are just clutter.
6229      However, push_lang_context undoes this if extern "Java" is seen. */
6230   DECL_IGNORED_P (decl) = 1;
6231
6232   TYPE_FOR_JAVA (type) = 1;
6233   return type;
6234 }
6235
6236 /* Push a type into the namespace so that the back-ends ignore it. */
6237
6238 static void
6239 record_unknown_type (type, name)
6240      tree type;
6241      const char *name;
6242 {
6243   tree decl = pushdecl (build_decl (TYPE_DECL, get_identifier (name), type));
6244   /* Make sure the "unknown type" typedecl gets ignored for debug info.  */
6245   DECL_IGNORED_P (decl) = 1;
6246   TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
6247   TYPE_SIZE (type) = TYPE_SIZE (void_type_node);
6248   TYPE_ALIGN (type) = 1;
6249   TYPE_USER_ALIGN (type) = 0;
6250   TYPE_MODE (type) = TYPE_MODE (void_type_node);
6251 }
6252
6253 /* An string for which we should create an IDENTIFIER_NODE at
6254    startup.  */
6255
6256 typedef struct predefined_identifier
6257 {
6258   /* The name of the identifier.  */
6259   const char *name;
6260   /* The place where the IDENTIFIER_NODE should be stored.  */
6261   tree *node;
6262   /* Non-zero if this is the name of a constructor or destructor.  */
6263   int ctor_or_dtor_p;
6264 } predefined_identifier;
6265
6266 /* Create all the predefined identifiers.  */
6267
6268 static void
6269 initialize_predefined_identifiers ()
6270 {
6271   struct predefined_identifier *pid;
6272
6273   /* A table of identifiers to create at startup.  */
6274   static predefined_identifier predefined_identifiers[] = {
6275     { "C++", &lang_name_cplusplus, 0 },
6276     { "C", &lang_name_c, 0 },
6277     { "Java", &lang_name_java, 0 },
6278     { CTOR_NAME, &ctor_identifier, 1 },
6279     { "__base_ctor", &base_ctor_identifier, 1 },
6280     { "__comp_ctor", &complete_ctor_identifier, 1 },
6281     { DTOR_NAME, &dtor_identifier, 1 },
6282     { "__comp_dtor", &complete_dtor_identifier, 1 },
6283     { "__base_dtor", &base_dtor_identifier, 1 },
6284     { "__deleting_dtor", &deleting_dtor_identifier, 1 },
6285     { VTABLE_DELTA2_NAME, &delta2_identifier, 0 },
6286     { VTABLE_DELTA_NAME, &delta_identifier, 0 },
6287     { IN_CHARGE_NAME, &in_charge_identifier, 0 },
6288     { VTABLE_INDEX_NAME, &index_identifier, 0 },
6289     { "nelts", &nelts_identifier, 0 },
6290     { THIS_NAME, &this_identifier, 0 },
6291     { VTABLE_PFN_NAME, &pfn_identifier, 0 },
6292     { "__pfn_or_delta2", &pfn_or_delta2_identifier, 0 },
6293     { "_vptr", &vptr_identifier, 0 },
6294     { "__cp_push_exception", &cp_push_exception_identifier, 0 },
6295     { "__vtt_parm", &vtt_parm_identifier, 0 },
6296     { "std", &std_identifier, 0 },
6297     { NULL, NULL, 0 }
6298   };
6299
6300   for (pid = predefined_identifiers; pid->name; ++pid)
6301     {
6302       *pid->node = get_identifier (pid->name);
6303       if (pid->ctor_or_dtor_p)
6304         IDENTIFIER_CTOR_OR_DTOR_P (*pid->node) = 1;
6305     }
6306 }
6307
6308 /* Create the predefined scalar types of C,
6309    and some nodes representing standard constants (0, 1, (void *)0).
6310    Initialize the global binding level.
6311    Make definitions for built-in primitive functions.  */
6312
6313 void
6314 init_decl_processing ()
6315 {
6316   tree fields[20];
6317   int wchar_type_size;
6318   tree array_domain_type;
6319
6320   /* Check to see that the user did not specify an invalid combination
6321      of command-line options.  */
6322   if (flag_new_abi && !flag_vtable_thunks)
6323     fatal ("the new ABI requires vtable thunks");
6324
6325   /* Create all the identifiers we need.  */
6326   initialize_predefined_identifiers ();
6327
6328   /* Fill in back-end hooks.  */
6329   init_lang_status = &push_cp_function_context;
6330   free_lang_status = &pop_cp_function_context;
6331   mark_lang_status = &mark_cp_function_context;
6332   lang_safe_from_p = &c_safe_from_p;
6333
6334   cp_parse_init ();
6335   init_decl2 ();
6336   init_pt ();
6337
6338   /* Create the global variables.  */
6339   push_to_top_level ();
6340
6341   /* Enter the global namespace. */
6342   my_friendly_assert (global_namespace == NULL_TREE, 375);
6343   push_namespace (get_identifier ("::"));
6344   global_namespace = current_namespace;
6345   current_lang_name = NULL_TREE;
6346
6347   /* Adjust various flags based on command-line settings.  */
6348   if (! flag_permissive && ! pedantic)
6349     flag_pedantic_errors = 1;
6350   if (!flag_no_inline)
6351     flag_inline_trees = 1;
6352
6353   /* Initially, C.  */
6354   current_lang_name = lang_name_c;
6355
6356   current_function_decl = NULL_TREE;
6357   current_binding_level = NULL_BINDING_LEVEL;
6358   free_binding_level = NULL_BINDING_LEVEL;
6359
6360   build_common_tree_nodes (flag_signed_char);
6361
6362   error_mark_list = build_tree_list (error_mark_node, error_mark_node);
6363   TREE_TYPE (error_mark_list) = error_mark_node;
6364
6365   /* Make the binding_level structure for global names.  */
6366   pushlevel (0);
6367   global_binding_level = current_binding_level;
6368   /* The global level is the namespace level of ::.  */
6369   NAMESPACE_LEVEL (global_namespace) = global_binding_level;
6370   declare_namespace_level ();
6371
6372   /* Create the `std' namespace.  */
6373   if (flag_honor_std)
6374     {
6375       push_namespace (std_identifier);
6376       std_node = current_namespace;
6377       pop_namespace ();
6378       fake_std_node = error_mark_node;
6379     }
6380   else
6381     {
6382       fake_std_node = build_decl (NAMESPACE_DECL,
6383                                   std_identifier,
6384                                   void_type_node);
6385       pushdecl (fake_std_node);
6386     }
6387
6388   /* Define `int' and `char' first so that dbx will output them first.  */
6389   record_builtin_type (RID_INT, NULL_PTR, integer_type_node);
6390   record_builtin_type (RID_CHAR, "char", char_type_node);
6391
6392   /* `signed' is the same as `int' */
6393   record_builtin_type (RID_SIGNED, NULL_PTR, integer_type_node);
6394   record_builtin_type (RID_LONG, "long int", long_integer_type_node);
6395   record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
6396   record_builtin_type (RID_MAX, "long unsigned int",
6397                        long_unsigned_type_node);
6398   record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
6399   record_builtin_type (RID_MAX, "long long int",
6400                        long_long_integer_type_node);
6401   record_builtin_type (RID_MAX, "long long unsigned int",
6402                        long_long_unsigned_type_node);
6403   record_builtin_type (RID_MAX, "long long unsigned",
6404                        long_long_unsigned_type_node);
6405   record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
6406   record_builtin_type (RID_MAX, "short unsigned int",
6407                        short_unsigned_type_node);
6408   record_builtin_type (RID_MAX, "unsigned short",
6409                        short_unsigned_type_node);
6410
6411   ptrdiff_type_node
6412     = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE)));
6413   unsigned_ptrdiff_type_node = unsigned_type (ptrdiff_type_node);
6414
6415   /* Define both `signed char' and `unsigned char'.  */
6416   record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
6417   record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
6418
6419   /* `unsigned long' is the standard type for sizeof.
6420      Note that stddef.h uses `unsigned long',
6421      and this must agree, even if long and int are the same size.  */
6422   c_size_type_node =
6423     TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE)));
6424   signed_size_type_node = signed_type (c_size_type_node);
6425   set_sizetype (c_size_type_node);
6426
6427   /* Create the widest literal types. */
6428   widest_integer_literal_type_node = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
6429   pushdecl (build_decl (TYPE_DECL, NULL_TREE,
6430                         widest_integer_literal_type_node));
6431
6432   widest_unsigned_literal_type_node = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
6433   pushdecl (build_decl (TYPE_DECL, NULL_TREE,
6434                         widest_unsigned_literal_type_node));
6435
6436   /* These are types that type_for_size and type_for_mode use.  */
6437   pushdecl (build_decl (TYPE_DECL, NULL_TREE, intQI_type_node));
6438   pushdecl (build_decl (TYPE_DECL, NULL_TREE, intHI_type_node));
6439   pushdecl (build_decl (TYPE_DECL, NULL_TREE, intSI_type_node));
6440   pushdecl (build_decl (TYPE_DECL, NULL_TREE, intDI_type_node));
6441 #if HOST_BITS_PER_WIDE_INT >= 64
6442   pushdecl (build_decl (TYPE_DECL, get_identifier ("__int128_t"), intTI_type_node));
6443 #endif
6444   pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intQI_type_node));
6445   pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intHI_type_node));
6446   pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intSI_type_node));
6447   pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intDI_type_node));
6448 #if HOST_BITS_PER_WIDE_INT >= 64
6449   pushdecl (build_decl (TYPE_DECL, get_identifier ("__uint128_t"), unsigned_intTI_type_node));
6450 #endif
6451
6452   build_common_tree_nodes_2 (flag_short_double);
6453
6454   java_byte_type_node = record_builtin_java_type ("__java_byte", 8);
6455   java_short_type_node = record_builtin_java_type ("__java_short", 16);
6456   java_int_type_node = record_builtin_java_type ("__java_int", 32);
6457   java_long_type_node = record_builtin_java_type ("__java_long", 64);
6458   java_float_type_node = record_builtin_java_type ("__java_float", -32);
6459   java_double_type_node = record_builtin_java_type ("__java_double", -64);
6460   java_char_type_node = record_builtin_java_type ("__java_char", -16);
6461   java_boolean_type_node = record_builtin_java_type ("__java_boolean", -1);
6462
6463   integer_two_node = build_int_2 (2, 0);
6464   TREE_TYPE (integer_two_node) = integer_type_node;
6465   integer_three_node = build_int_2 (3, 0);
6466   TREE_TYPE (integer_three_node) = integer_type_node;
6467
6468   boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
6469   TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
6470   TYPE_MAX_VALUE (boolean_type_node) = build_int_2 (1, 0);
6471   TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node)) = boolean_type_node;
6472   TYPE_PRECISION (boolean_type_node) = 1;
6473   record_builtin_type (RID_BOOL, "bool", boolean_type_node);
6474   boolean_false_node = build_int_2 (0, 0);
6475   TREE_TYPE (boolean_false_node) = boolean_type_node;
6476   boolean_true_node = build_int_2 (1, 0);
6477   TREE_TYPE (boolean_true_node) = boolean_type_node;
6478
6479   signed_size_zero_node = build_int_2 (0, 0);
6480   record_builtin_type (RID_FLOAT, NULL_PTR, float_type_node);
6481   record_builtin_type (RID_DOUBLE, NULL_PTR, double_type_node);
6482   record_builtin_type (RID_MAX, "long double", long_double_type_node);
6483
6484   pushdecl (build_decl (TYPE_DECL, get_identifier ("complex int"),
6485                         complex_integer_type_node));
6486   pushdecl (build_decl (TYPE_DECL, get_identifier ("complex float"),
6487                         complex_float_type_node));
6488   pushdecl (build_decl (TYPE_DECL, get_identifier ("complex double"),
6489                         complex_double_type_node));
6490   pushdecl (build_decl (TYPE_DECL, get_identifier ("complex long double"),
6491                         complex_long_double_type_node));
6492
6493   TREE_TYPE (signed_size_zero_node) = make_signed_type (TYPE_PRECISION (sizetype));
6494
6495   record_builtin_type (RID_VOID, NULL_PTR, void_type_node);
6496   void_list_node = build_tree_list (NULL_TREE, void_type_node);
6497   TREE_PARMLIST (void_list_node) = 1;
6498
6499   string_type_node = build_pointer_type (char_type_node);
6500   const_string_type_node
6501     = build_pointer_type (build_qualified_type (char_type_node,
6502                                                 TYPE_QUAL_CONST));
6503   empty_except_spec = build_tree_list (NULL_TREE, NULL_TREE);
6504 #if 0
6505   record_builtin_type (RID_MAX, NULL_PTR, string_type_node);
6506 #endif
6507
6508   /* Make a type to be the domain of a few array types
6509      whose domains don't really matter.
6510      200 is small enough that it always fits in size_t.  */
6511   array_domain_type = build_index_type (build_int_2 (200, 0));
6512
6513   /* Make a type for arrays of characters.
6514      With luck nothing will ever really depend on the length of this
6515      array type.  */
6516   char_array_type_node
6517     = build_array_type (char_type_node, array_domain_type);
6518
6519   /* Likewise for arrays of ints.  */
6520   int_array_type_node
6521     = build_array_type (integer_type_node, array_domain_type);
6522
6523   if (flag_new_abi)
6524     delta_type_node = ptrdiff_type_node;
6525   else if (flag_huge_objects)
6526     delta_type_node = long_integer_type_node;
6527   else
6528     delta_type_node = short_integer_type_node;
6529
6530   if (flag_new_abi)
6531     vtable_index_type = ptrdiff_type_node;
6532   else
6533     vtable_index_type = delta_type_node;
6534
6535   default_function_type
6536     = build_function_type (integer_type_node, NULL_TREE);
6537
6538   ptr_type_node = build_pointer_type (void_type_node);
6539   const_ptr_type_node
6540     = build_pointer_type (build_qualified_type (void_type_node,
6541                                                 TYPE_QUAL_CONST));
6542   vtt_parm_type = build_pointer_type (const_ptr_type_node);
6543   c_common_nodes_and_builtins ();
6544   lang_type_promotes_to = convert_type_from_ellipsis;
6545
6546   void_ftype_ptr
6547     = build_exception_variant (void_ftype_ptr, empty_except_spec);
6548
6549   /* C++ extensions */
6550
6551   unknown_type_node = make_node (UNKNOWN_TYPE);
6552   record_unknown_type (unknown_type_node, "unknown type");
6553
6554   /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node.  */
6555   TREE_TYPE (unknown_type_node) = unknown_type_node;
6556
6557   TREE_TYPE (null_node) = type_for_size (POINTER_SIZE, 0);
6558
6559   /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6560      result.  */
6561   TYPE_POINTER_TO (unknown_type_node) = unknown_type_node;
6562   TYPE_REFERENCE_TO (unknown_type_node) = unknown_type_node;
6563
6564   /* This is special for C++ so functions can be overloaded.  */
6565   wchar_type_node = get_identifier (flag_short_wchar
6566                                     ? "short unsigned int"
6567                                     : WCHAR_TYPE);
6568   wchar_type_node = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node));
6569   wchar_type_size = TYPE_PRECISION (wchar_type_node);
6570   if (TREE_UNSIGNED (wchar_type_node))
6571     wchar_type_node = make_signed_type (wchar_type_size);
6572   else
6573     wchar_type_node = make_unsigned_type (wchar_type_size);
6574   record_builtin_type (RID_WCHAR, "__wchar_t", wchar_type_node);
6575
6576   /* Artificial declaration of wchar_t -- can be bashed */
6577   wchar_decl_node = build_decl (TYPE_DECL, get_identifier ("wchar_t"),
6578                                 wchar_type_node);
6579   pushdecl (wchar_decl_node);
6580
6581   /* This is for wide string constants.  */
6582   wchar_array_type_node
6583     = build_array_type (wchar_type_node, array_domain_type);
6584
6585   wint_type_node =
6586     TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WINT_TYPE)));
6587
6588   intmax_type_node =
6589     TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (INTMAX_TYPE)));
6590   uintmax_type_node =
6591     TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (UINTMAX_TYPE)));
6592
6593   if (flag_vtable_thunks)
6594     {
6595       /* Make sure we get a unique function type, so we can give
6596          its pointer type a name.  (This wins for gdb.) */
6597       tree vfunc_type = make_node (FUNCTION_TYPE);
6598       TREE_TYPE (vfunc_type) = integer_type_node;
6599       TYPE_ARG_TYPES (vfunc_type) = NULL_TREE;
6600       layout_type (vfunc_type);
6601
6602       vtable_entry_type = build_pointer_type (vfunc_type);
6603     }
6604   else
6605     {
6606       vtable_entry_type = make_aggr_type (RECORD_TYPE);
6607       fields[0] = build_decl (FIELD_DECL, delta_identifier,
6608                               delta_type_node);
6609       fields[1] = build_decl (FIELD_DECL, index_identifier,
6610                               delta_type_node);
6611       fields[2] = build_decl (FIELD_DECL, pfn_identifier,
6612                               ptr_type_node);
6613       finish_builtin_type (vtable_entry_type, VTBL_PTR_TYPE, fields, 2,
6614                            double_type_node);
6615
6616       /* Make this part of an invisible union.  */
6617       fields[3] = copy_node (fields[2]);
6618       TREE_TYPE (fields[3]) = delta_type_node;
6619       DECL_NAME (fields[3]) = delta2_identifier;
6620       DECL_MODE (fields[3]) = TYPE_MODE (delta_type_node);
6621       DECL_SIZE (fields[3]) = TYPE_SIZE (delta_type_node);
6622       DECL_SIZE_UNIT (fields[3]) = TYPE_SIZE_UNIT (delta_type_node);
6623       TREE_UNSIGNED (fields[3]) = 0;
6624       TREE_CHAIN (fields[2]) = fields[3];
6625       vtable_entry_type = build_qualified_type (vtable_entry_type,
6626                                                 TYPE_QUAL_CONST);
6627     }
6628   record_builtin_type (RID_MAX, VTBL_PTR_TYPE, vtable_entry_type);
6629
6630   vtbl_type_node
6631     = build_cplus_array_type (vtable_entry_type, NULL_TREE);
6632   layout_type (vtbl_type_node);
6633   vtbl_type_node = build_qualified_type (vtbl_type_node, TYPE_QUAL_CONST);
6634   record_builtin_type (RID_MAX, NULL_PTR, vtbl_type_node);
6635   vtbl_ptr_type_node = build_pointer_type (vtable_entry_type);
6636   layout_type (vtbl_ptr_type_node);
6637   record_builtin_type (RID_MAX, NULL_PTR, vtbl_ptr_type_node);
6638
6639   if (flag_new_abi)
6640     {
6641       push_namespace (get_identifier ("__cxxabiv1"));
6642       abi_node = current_namespace;
6643       pop_namespace ();
6644     }
6645
6646   global_type_node = make_node (LANG_TYPE);
6647   record_unknown_type (global_type_node, "global type");
6648
6649   /* Now, C++.  */
6650   current_lang_name = lang_name_cplusplus;
6651
6652   {
6653     tree bad_alloc_type_node, newtype, deltype;
6654     if (flag_honor_std)
6655       push_namespace (std_identifier);
6656     bad_alloc_type_node = xref_tag
6657       (class_type_node, get_identifier ("bad_alloc"), 1);
6658     if (flag_honor_std)
6659       pop_namespace ();
6660     newtype = build_exception_variant
6661       (ptr_ftype_sizetype, add_exception_specifier (NULL_TREE, bad_alloc_type_node, -1));
6662     deltype = build_exception_variant (void_ftype_ptr, empty_except_spec);
6663     push_cp_library_fn (NEW_EXPR, newtype);
6664     push_cp_library_fn (VEC_NEW_EXPR, newtype);
6665     global_delete_fndecl = push_cp_library_fn (DELETE_EXPR, deltype);
6666     push_cp_library_fn (VEC_DELETE_EXPR, deltype);
6667   }
6668
6669   abort_fndecl
6670     = build_library_fn_ptr ("__pure_virtual", void_ftype);
6671
6672   /* Perform other language dependent initializations.  */
6673   init_class_processing ();
6674   init_init_processing ();
6675   init_search_processing ();
6676   init_rtti_processing ();
6677
6678   if (flag_exceptions)
6679     init_exception_processing ();
6680   if (flag_no_inline)
6681     {
6682       flag_inline_functions = 0;
6683     }
6684
6685   if (! supports_one_only ())
6686     flag_weak = 0;
6687
6688   /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__.  */
6689   function_id_node = get_identifier ("__FUNCTION__");
6690   pretty_function_id_node = get_identifier ("__PRETTY_FUNCTION__");
6691   func_id_node = get_identifier ("__func__");
6692
6693   make_fname_decl = cp_make_fname_decl;
6694   declare_function_name ();
6695
6696   /* Prepare to check format strings against argument lists.  */
6697   init_function_format_info ();
6698
6699   /* Show we use EH for cleanups.  */
6700   using_eh_for_cleanups ();
6701
6702   valid_lang_attribute = cp_valid_lang_attribute;
6703
6704   /* Maintain consistency.  Perhaps we should just complain if they
6705      say -fwritable-strings?  */
6706   if (flag_writable_strings)
6707     flag_const_strings = 0;
6708
6709   /* Add GC roots for all of our global variables.  */
6710   ggc_add_tree_root (c_global_trees, sizeof c_global_trees / sizeof(tree));
6711   ggc_add_tree_root (cp_global_trees, sizeof cp_global_trees / sizeof(tree));
6712   ggc_add_tree_root (&integer_three_node, 1);
6713   ggc_add_tree_root (&integer_two_node, 1);
6714   ggc_add_tree_root (&signed_size_zero_node, 1);
6715   ggc_add_tree_root (&size_one_node, 1);
6716   ggc_add_tree_root (&size_zero_node, 1);
6717   ggc_add_root (&global_binding_level, 1, sizeof global_binding_level,
6718                 mark_binding_level);
6719   ggc_add_root (&scope_chain, 1, sizeof scope_chain, &mark_saved_scope);
6720   ggc_add_tree_root (&static_ctors, 1);
6721   ggc_add_tree_root (&static_dtors, 1);
6722   ggc_add_tree_root (&lastiddecl, 1);
6723
6724   ggc_add_tree_root (&last_function_parm_tags, 1);
6725   ggc_add_tree_root (&current_function_return_value, 1);
6726   ggc_add_tree_root (&current_function_parm_tags, 1);
6727   ggc_add_tree_root (&last_function_parms, 1);
6728   ggc_add_tree_root (&error_mark_list, 1);
6729
6730   ggc_add_tree_root (&global_namespace, 1);
6731   ggc_add_tree_root (&global_type_node, 1);
6732   ggc_add_tree_root (&anonymous_namespace_name, 1);
6733
6734   ggc_add_tree_root (&got_object, 1);
6735   ggc_add_tree_root (&got_scope, 1);
6736
6737   ggc_add_tree_root (&current_lang_name, 1);
6738   ggc_add_tree_root (&static_aggregates, 1);
6739 }
6740
6741 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6742    decl, NAME is the initialization string and TYPE_DEP indicates whether
6743    NAME depended on the type of the function. We make use of that to detect
6744    __PRETTY_FUNCTION__ inside a template fn.  Because we build a tree for
6745    the function before emitting any of it, we don't need to treat the
6746    VAR_DECL specially. We can decide whether to emit it later, if it was
6747    used.  */
6748
6749 static tree
6750 cp_make_fname_decl (id, name, type_dep)
6751      tree id;
6752      const char *name;
6753      int type_dep;
6754 {
6755   tree decl, type, init;
6756   size_t length = strlen (name);
6757   tree domain = NULL_TREE;
6758
6759   if (!processing_template_decl)
6760     type_dep = 0;
6761   if (!type_dep)
6762     domain = build_index_type (build_int_2 (length, 0));
6763
6764   type =  build_cplus_array_type
6765           (build_qualified_type (char_type_node, TYPE_QUAL_CONST),
6766            domain);
6767
6768   decl = build_decl (VAR_DECL, id, type);
6769   TREE_STATIC (decl) = 1;
6770   TREE_READONLY (decl) = 1;
6771   DECL_SOURCE_LINE (decl) = 0;
6772   DECL_ARTIFICIAL (decl) = 1;
6773   DECL_IN_SYSTEM_HEADER (decl) = 1;
6774   pushdecl (decl);
6775   if (processing_template_decl)
6776     decl = push_template_decl (decl);
6777   if (type_dep)
6778     {
6779       init = build (FUNCTION_NAME, type);
6780       DECL_PRETTY_FUNCTION_P (decl) = 1;
6781     }
6782   else
6783     {
6784       init = build_string (length + 1, name);
6785       TREE_TYPE (init) = type;
6786     }
6787   DECL_INITIAL (decl) = init;
6788   cp_finish_decl (decl, init, NULL_TREE, LOOKUP_ONLYCONVERTING);
6789
6790   /* We will have to make sure we only emit this, if it is actually used. */
6791   return decl;
6792 }
6793
6794 /* Entry point for the benefit of c_common_nodes_and_builtins.
6795
6796    Make a definition for a builtin function named NAME and whose data type
6797    is TYPE.  TYPE should be a function type with argument types.
6798
6799    CLASS and CODE tell later passes how to compile calls to this function.
6800    See tree.h for possible values.
6801
6802    If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6803    the name to be called if we can't opencode the function.  */
6804
6805 tree
6806 builtin_function (name, type, code, class, libname)
6807      const char *name;
6808      tree type;
6809      int code;
6810      enum built_in_class class;
6811      const char *libname;
6812 {
6813   tree decl = build_library_fn_1 (get_identifier (name), ERROR_MARK, type);
6814   DECL_BUILT_IN_CLASS (decl) = class;
6815   DECL_FUNCTION_CODE (decl) = code;
6816
6817   my_friendly_assert (DECL_CONTEXT (decl) == NULL_TREE, 392);
6818
6819   /* All builtins that don't begin with an `_' should go in the `std'
6820      namespace.  */
6821   if (flag_honor_std && name[0] != '_')
6822     {
6823       push_namespace (std_identifier);
6824       DECL_CONTEXT (decl) = std_node;
6825     }
6826   pushdecl (decl);
6827   if (flag_honor_std && name[0] != '_')
6828     pop_namespace ();
6829
6830   /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6831      we cannot change DECL_ASSEMBLER_NAME until we have installed this
6832      function in the namespace.  */
6833   if (libname)
6834     DECL_ASSEMBLER_NAME (decl) = get_identifier (libname);
6835   make_function_rtl (decl);
6836
6837   /* Warn if a function in the namespace for users
6838      is used without an occasion to consider it declared.  */
6839   if (name[0] != '_' || name[1] != '_')
6840     DECL_ANTICIPATED (decl) = 1;
6841
6842   return decl;
6843 }
6844
6845 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6846    function.  Not called directly.  */
6847
6848 static tree
6849 build_library_fn_1 (name, operator_code, type)
6850      tree name;
6851      enum tree_code operator_code;
6852      tree type;
6853 {
6854   tree fn = build_lang_decl (FUNCTION_DECL, name, type);
6855   DECL_EXTERNAL (fn) = 1;
6856   TREE_PUBLIC (fn) = 1;
6857   DECL_ARTIFICIAL (fn) = 1;
6858   TREE_NOTHROW (fn) = 1;
6859   SET_OVERLOADED_OPERATOR_CODE (fn, operator_code);
6860   return fn;
6861 }
6862
6863 /* Returns the _DECL for a library function with C linkage.
6864    We assume that such functions never throw; if this is incorrect,
6865    callers should unset TREE_NOTHROW.  */
6866
6867 tree
6868 build_library_fn (name, type)
6869      tree name;
6870      tree type;
6871 {
6872   tree fn = build_library_fn_1 (name, ERROR_MARK, type);
6873   make_function_rtl (fn);
6874   return fn;
6875 }
6876
6877 /* Returns the _DECL for a library function with C++ linkage.  */
6878
6879 static tree
6880 build_cp_library_fn (name, operator_code, type)
6881      tree name;
6882      enum tree_code operator_code;
6883      tree type;
6884 {
6885   tree fn = build_library_fn_1 (name, operator_code, type);
6886   TREE_NOTHROW (fn) = TYPE_NOTHROW_P (type);
6887   DECL_CONTEXT (fn) = FROB_CONTEXT (current_namespace);
6888   set_mangled_name_for_decl (fn);
6889   make_function_rtl (fn);
6890   return fn;
6891 }
6892
6893 /* Like build_library_fn, but takes a C string instead of an
6894    IDENTIFIER_NODE.  */
6895
6896 tree
6897 build_library_fn_ptr (name, type)
6898      const char *name;
6899      tree type;
6900 {
6901   return build_library_fn (get_identifier (name), type);
6902 }
6903
6904 /* Like build_cp_library_fn, but takes a C string instead of an
6905    IDENTIFIER_NODE.  */
6906
6907 tree
6908 build_cp_library_fn_ptr (name, type)
6909      const char *name;
6910      tree type;
6911 {
6912   return build_cp_library_fn (get_identifier (name), ERROR_MARK, type);
6913 }
6914
6915 /* Like build_library_fn, but also pushes the function so that we will
6916    be able to find it via IDENTIFIER_GLOBAL_VALUE.  */
6917
6918 tree
6919 push_library_fn (name, type)
6920      tree name, type;
6921 {
6922   tree fn = build_library_fn (name, type);
6923   pushdecl_top_level (fn);
6924   return fn;
6925 }
6926
6927 /* Like build_cp_library_fn, but also pushes the function so that it
6928    will be found by normal lookup.  */
6929
6930 static tree
6931 push_cp_library_fn (operator_code, type)
6932      enum tree_code operator_code;
6933      tree type;
6934 {
6935   tree fn = build_cp_library_fn (ansi_opname (operator_code),
6936                                  operator_code,
6937                                  type);
6938   pushdecl (fn);
6939   return fn;
6940 }
6941
6942 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6943    a FUNCTION_TYPE.  */
6944
6945 tree
6946 push_void_library_fn (name, parmtypes)
6947      tree name, parmtypes;
6948 {
6949   tree type = build_function_type (void_type_node, parmtypes);
6950   return push_library_fn (name, type);
6951 }
6952
6953 /* Like push_library_fn, but also note that this function throws
6954    and does not return.  Used for __throw_foo and the like.  */
6955
6956 tree
6957 push_throw_library_fn (name, type)
6958      tree name, type;
6959 {
6960   tree fn = push_library_fn (name, type);
6961   TREE_THIS_VOLATILE (fn) = 1;
6962   TREE_NOTHROW (fn) = 0;
6963   return fn;
6964 }
6965 \f
6966 /* When we call finish_struct for an anonymous union, we create
6967    default copy constructors and such.  But, an anonymous union
6968    shouldn't have such things; this function undoes the damage to the
6969    anonymous union type T.
6970
6971    (The reason that we create the synthesized methods is that we don't
6972    distinguish `union { int i; }' from `typedef union { int i; } U'.
6973    The first is an anonymous union; the second is just an ordinary
6974    union type.)  */
6975
6976 void
6977 fixup_anonymous_aggr (t)
6978      tree t;
6979 {
6980   tree *q;
6981
6982   /* Wipe out memory of synthesized methods */
6983   TYPE_HAS_CONSTRUCTOR (t) = 0;
6984   TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 0;
6985   TYPE_HAS_INIT_REF (t) = 0;
6986   TYPE_HAS_CONST_INIT_REF (t) = 0;
6987   TYPE_HAS_ASSIGN_REF (t) = 0;
6988   TYPE_HAS_CONST_ASSIGN_REF (t) = 0;
6989
6990   /* Splice the implicitly generated functions out of the TYPE_METHODS
6991      list.  */
6992   q = &TYPE_METHODS (t);
6993   while (*q)
6994     {
6995       if (DECL_ARTIFICIAL (*q))
6996         *q = TREE_CHAIN (*q);
6997       else
6998         q = &TREE_CHAIN (*q);
6999     }
7000
7001   /* ISO C++ 9.5.3.  Anonymous unions may not have function members.  */
7002   if (TYPE_METHODS (t))
7003     error ("an anonymous union cannot have function members");
7004 }
7005
7006 /* Make sure that a declaration with no declarator is well-formed, i.e.
7007    just defines a tagged type or anonymous union.
7008
7009    Returns the type defined, if any.  */
7010
7011 tree
7012 check_tag_decl (declspecs)
7013      tree declspecs;
7014 {
7015   int found_type = 0;
7016   int saw_friend = 0;
7017   tree ob_modifier = NULL_TREE;
7018   register tree link;
7019   register tree t = NULL_TREE;
7020
7021   for (link = declspecs; link; link = TREE_CHAIN (link))
7022     {
7023       register tree value = TREE_VALUE (link);
7024
7025       if (TYPE_P (value)
7026           || (TREE_CODE (value) == IDENTIFIER_NODE
7027               && IDENTIFIER_GLOBAL_VALUE (value)
7028               && TYPE_P (IDENTIFIER_GLOBAL_VALUE (value))))
7029         {
7030           ++found_type;
7031
7032           if ((TREE_CODE (value) != TYPENAME_TYPE && IS_AGGR_TYPE (value))
7033               || TREE_CODE (value) == ENUMERAL_TYPE)
7034             {
7035               my_friendly_assert (TYPE_MAIN_DECL (value) != NULL_TREE, 261);
7036               t = value;
7037             }
7038         }
7039       else if (value == ridpointers[(int) RID_FRIEND])
7040         {
7041           if (current_class_type == NULL_TREE
7042               || current_scope () != current_class_type)
7043             ob_modifier = value;
7044           else
7045             saw_friend = 1;
7046         }
7047       else if (value == ridpointers[(int) RID_STATIC]
7048                || value == ridpointers[(int) RID_EXTERN]
7049                || value == ridpointers[(int) RID_AUTO]
7050                || value == ridpointers[(int) RID_REGISTER]
7051                || value == ridpointers[(int) RID_INLINE]
7052                || value == ridpointers[(int) RID_VIRTUAL]
7053                || value == ridpointers[(int) RID_CONST]
7054                || value == ridpointers[(int) RID_VOLATILE]
7055                || value == ridpointers[(int) RID_EXPLICIT])
7056         ob_modifier = value;
7057     }
7058
7059   if (found_type > 1)
7060     error ("multiple types in one declaration");
7061
7062   if (t == NULL_TREE && ! saw_friend)
7063     pedwarn ("declaration does not declare anything");
7064
7065   /* Check for an anonymous union.  We're careful
7066      accessing TYPE_IDENTIFIER because some built-in types, like
7067      pointer-to-member types, do not have TYPE_NAME.  */
7068   else if (t && IS_AGGR_TYPE_CODE (TREE_CODE (t))
7069            && TYPE_NAME (t)
7070            && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
7071     {
7072       /* Anonymous unions are objects, so they can have specifiers.  */;
7073       SET_ANON_AGGR_TYPE_P (t);
7074
7075       if (TREE_CODE (t) != UNION_TYPE && pedantic && ! in_system_header)
7076         pedwarn ("ISO C++ prohibits anonymous structs");
7077     }
7078
7079   else if (ob_modifier)
7080     {
7081       if (ob_modifier == ridpointers[(int) RID_INLINE]
7082           || ob_modifier == ridpointers[(int) RID_VIRTUAL])
7083         cp_error ("`%D' can only be specified for functions", ob_modifier);
7084       else if (ob_modifier == ridpointers[(int) RID_FRIEND])
7085         cp_error ("`%D' can only be specified inside a class", ob_modifier);
7086       else if (ob_modifier == ridpointers[(int) RID_EXPLICIT])
7087         cp_error ("`%D' can only be specified for constructors",
7088                   ob_modifier);
7089       else
7090         cp_error ("`%D' can only be specified for objects and functions",
7091                   ob_modifier);
7092     }
7093
7094   return t;
7095 }
7096
7097 /* Called when a declaration is seen that contains no names to declare.
7098    If its type is a reference to a structure, union or enum inherited
7099    from a containing scope, shadow that tag name for the current scope
7100    with a forward reference.
7101    If its type defines a new named structure or union
7102    or defines an enum, it is valid but we need not do anything here.
7103    Otherwise, it is an error.
7104
7105    C++: may have to grok the declspecs to learn about static,
7106    complain for anonymous unions.  */
7107
7108 void
7109 shadow_tag (declspecs)
7110      tree declspecs;
7111 {
7112   tree t = check_tag_decl (declspecs);
7113
7114   if (t)
7115     maybe_process_partial_specialization (t);
7116
7117   /* This is where the variables in an anonymous union are
7118      declared.  An anonymous union declaration looks like:
7119      union { ... } ;
7120      because there is no declarator after the union, the parser
7121      sends that declaration here.  */
7122   if (t && ANON_AGGR_TYPE_P (t))
7123     {
7124       fixup_anonymous_aggr (t);
7125
7126       if (TYPE_FIELDS (t))
7127         {
7128           tree decl = grokdeclarator (NULL_TREE, declspecs, NORMAL, 0,
7129                                       NULL_TREE);
7130           finish_anon_union (decl);
7131         }
7132     }
7133 }
7134 \f
7135 /* Decode a "typename", such as "int **", returning a ..._TYPE node.  */
7136
7137 tree
7138 groktypename (typename)
7139      tree typename;
7140 {
7141   if (TREE_CODE (typename) != TREE_LIST)
7142     return typename;
7143   return grokdeclarator (TREE_VALUE (typename),
7144                          TREE_PURPOSE (typename),
7145                          TYPENAME, 0, NULL_TREE);
7146 }
7147
7148 /* Decode a declarator in an ordinary declaration or data definition.
7149    This is called as soon as the type information and variable name
7150    have been parsed, before parsing the initializer if any.
7151    Here we create the ..._DECL node, fill in its type,
7152    and put it on the list of decls for the current context.
7153    The ..._DECL node is returned as the value.
7154
7155    Exception: for arrays where the length is not specified,
7156    the type is left null, to be filled in by `cp_finish_decl'.
7157
7158    Function definitions do not come here; they go to start_function
7159    instead.  However, external and forward declarations of functions
7160    do go through here.  Structure field declarations are done by
7161    grokfield and not through here.  */
7162
7163 tree
7164 start_decl (declarator, declspecs, initialized, attributes, prefix_attributes)
7165      tree declarator, declspecs;
7166      int initialized;
7167      tree attributes, prefix_attributes;
7168 {
7169   register tree decl;
7170   register tree type, tem;
7171   tree context;
7172   extern int have_extern_spec;
7173   extern int used_extern_spec;
7174   tree attrlist;
7175
7176 #if 0
7177   /* See code below that used this.  */
7178   int init_written = initialized;
7179 #endif
7180
7181   /* This should only be done once on the top most decl.  */
7182   if (have_extern_spec && !used_extern_spec)
7183     {
7184       declspecs = tree_cons (NULL_TREE, get_identifier ("extern"),
7185                              declspecs);
7186       used_extern_spec = 1;
7187     }
7188
7189   if (attributes || prefix_attributes)
7190     attrlist = build_tree_list (attributes, prefix_attributes);
7191   else
7192     attrlist = NULL_TREE;
7193
7194   decl = grokdeclarator (declarator, declspecs, NORMAL, initialized,
7195                          attrlist);
7196
7197   if (decl == NULL_TREE || TREE_CODE (decl) == VOID_TYPE)
7198     return NULL_TREE;
7199
7200   type = TREE_TYPE (decl);
7201
7202   if (type == error_mark_node)
7203     return NULL_TREE;
7204
7205   context = DECL_CONTEXT (decl);
7206
7207   if (initialized && context && TREE_CODE (context) == NAMESPACE_DECL
7208       && context != current_namespace && TREE_CODE (decl) == VAR_DECL)
7209     {
7210       /* When parsing the initializer, lookup should use the object's
7211          namespace. */
7212       push_decl_namespace (context);
7213     }
7214
7215   /* We are only interested in class contexts, later. */
7216   if (context && TREE_CODE (context) == NAMESPACE_DECL)
7217     context = NULL_TREE;
7218
7219   if (initialized)
7220     /* Is it valid for this decl to have an initializer at all?
7221        If not, set INITIALIZED to zero, which will indirectly
7222        tell `cp_finish_decl' to ignore the initializer once it is parsed.  */
7223     switch (TREE_CODE (decl))
7224       {
7225       case TYPE_DECL:
7226         /* typedef foo = bar  means give foo the same type as bar.
7227            We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7228            Any other case of an initialization in a TYPE_DECL is an error.  */
7229         if (pedantic || list_length (declspecs) > 1)
7230           {
7231             cp_error ("typedef `%D' is initialized", decl);
7232             initialized = 0;
7233           }
7234         break;
7235
7236       case FUNCTION_DECL:
7237         cp_error ("function `%#D' is initialized like a variable", decl);
7238         initialized = 0;
7239         break;
7240
7241       default:
7242         break;
7243       }
7244
7245   if (initialized)
7246     {
7247       if (! toplevel_bindings_p ()
7248           && DECL_EXTERNAL (decl))
7249         cp_warning ("declaration of `%#D' has `extern' and is initialized",
7250                     decl);
7251       DECL_EXTERNAL (decl) = 0;
7252       if (toplevel_bindings_p ())
7253         TREE_STATIC (decl) = 1;
7254
7255       /* Tell `pushdecl' this is an initialized decl
7256          even though we don't yet have the initializer expression.
7257          Also tell `cp_finish_decl' it may store the real initializer.  */
7258       DECL_INITIAL (decl) = error_mark_node;
7259     }
7260
7261 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7262   SET_DEFAULT_DECL_ATTRIBUTES (decl, attributes);
7263 #endif
7264
7265   /* Set attributes here so if duplicate decl, will have proper attributes.  */
7266   cplus_decl_attributes (decl, attributes, prefix_attributes);
7267
7268   if (context && COMPLETE_TYPE_P (complete_type (context)))
7269     {
7270       push_nested_class (context, 2);
7271
7272       if (TREE_CODE (decl) == VAR_DECL)
7273         {
7274           tree field = lookup_field (context, DECL_NAME (decl), 0, 0);
7275           if (field == NULL_TREE || TREE_CODE (field) != VAR_DECL)
7276             cp_error ("`%#D' is not a static member of `%#T'", decl, context);
7277           else
7278             {
7279               if (DECL_CONTEXT (field) != context)
7280                 {
7281                   cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7282                               DECL_CONTEXT (field), DECL_NAME (decl),
7283                               context, DECL_NAME (decl));
7284                   DECL_CONTEXT (decl) = DECL_CONTEXT (field);
7285                 }
7286               /* Static data member are tricky; an in-class initialization
7287                  still doesn't provide a definition, so the in-class
7288                  declaration will have DECL_EXTERNAL set, but will have an
7289                  initialization.  Thus, duplicate_decls won't warn
7290                  about this situation, and so we check here.  */
7291               if (DECL_INITIAL (decl) && DECL_INITIAL (field))
7292                 cp_error ("duplicate initialization of %D", decl);
7293               if (duplicate_decls (decl, field))
7294                 decl = field;
7295             }
7296         }
7297       else
7298         {
7299           tree field = check_classfn (context, decl);
7300           if (field && duplicate_decls (decl, field))
7301             decl = field;
7302         }
7303
7304       /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set.  */
7305       DECL_IN_AGGR_P (decl) = 0;
7306       if ((DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl))
7307           || CLASSTYPE_TEMPLATE_INSTANTIATION (context))
7308         {
7309           SET_DECL_TEMPLATE_SPECIALIZATION (decl);
7310           /* [temp.expl.spec] An explicit specialization of a static data
7311              member of a template is a definition if the declaration
7312              includes an initializer; otherwise, it is a declaration.
7313
7314              We check for processing_specialization so this only applies
7315              to the new specialization syntax.  */
7316           if (DECL_INITIAL (decl) == NULL_TREE && processing_specialization)
7317             DECL_EXTERNAL (decl) = 1;
7318         }
7319
7320       if (DECL_EXTERNAL (decl) && ! DECL_TEMPLATE_SPECIALIZATION (decl))
7321         cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7322                     decl);
7323     }
7324
7325   /* Enter this declaration into the symbol table.  */
7326   tem = maybe_push_decl (decl);
7327
7328   if (processing_template_decl)
7329     tem = push_template_decl (tem);
7330
7331 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7332   /* Tell the back-end to use or not use .common as appropriate.  If we say
7333      -fconserve-space, we want this to save .data space, at the expense of
7334      wrong semantics.  If we say -fno-conserve-space, we want this to
7335      produce errors about redefs; to do this we force variables into the
7336      data segment.  */
7337   DECL_COMMON (tem) = flag_conserve_space || ! TREE_PUBLIC (tem);
7338 #endif
7339
7340   if (! processing_template_decl)
7341     start_decl_1 (tem);
7342
7343   return tem;
7344 }
7345
7346 void
7347 start_decl_1 (decl)
7348      tree decl;
7349 {
7350   tree type = TREE_TYPE (decl);
7351   int initialized = (DECL_INITIAL (decl) != NULL_TREE);
7352
7353   if (type == error_mark_node)
7354     return;
7355
7356   /* If this type of object needs a cleanup, but we're not allowed to
7357      add any more objects with cleanups to the current scope, create a
7358      new binding level.  */
7359   if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
7360       && current_binding_level->more_cleanups_ok == 0)
7361     {
7362       keep_next_level (2);
7363       pushlevel (1);
7364       clear_last_expr ();
7365       add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
7366     }
7367
7368   if (initialized)
7369     /* Is it valid for this decl to have an initializer at all?
7370        If not, set INITIALIZED to zero, which will indirectly
7371        tell `cp_finish_decl' to ignore the initializer once it is parsed.  */
7372     {
7373       /* Don't allow initializations for incomplete types except for
7374          arrays which might be completed by the initialization.  */
7375       if (COMPLETE_TYPE_P (complete_type (type)))
7376         ;                       /* A complete type is ok.  */
7377       else if (TREE_CODE (type) != ARRAY_TYPE)
7378         {
7379           cp_error ("variable `%#D' has initializer but incomplete type",
7380                     decl);
7381           initialized = 0;
7382           type = TREE_TYPE (decl) = error_mark_node;
7383         }
7384       else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type))))
7385         {
7386           if (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl))
7387             cp_error ("elements of array `%#D' have incomplete type", decl);
7388           /* else we already gave an error in start_decl.  */
7389           initialized = 0;
7390         }
7391     }
7392
7393   if (!initialized
7394       && TREE_CODE (decl) != TYPE_DECL
7395       && TREE_CODE (decl) != TEMPLATE_DECL
7396       && type != error_mark_node
7397       && IS_AGGR_TYPE (type)
7398       && ! DECL_EXTERNAL (decl))
7399     {
7400       if ((! processing_template_decl || ! uses_template_parms (type))
7401           && !COMPLETE_TYPE_P (complete_type (type)))
7402         {
7403           cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7404                  decl);
7405           /* Change the type so that assemble_variable will give
7406              DECL an rtl we can live with: (mem (const_int 0)).  */
7407           type = TREE_TYPE (decl) = error_mark_node;
7408         }
7409       else
7410         {
7411           /* If any base type in the hierarchy of TYPE needs a constructor,
7412              then we set initialized to 1.  This way any nodes which are
7413              created for the purposes of initializing this aggregate
7414              will live as long as it does.  This is necessary for global
7415              aggregates which do not have their initializers processed until
7416              the end of the file.  */
7417           initialized = TYPE_NEEDS_CONSTRUCTING (type);
7418         }
7419     }
7420
7421   if (! initialized)
7422     DECL_INITIAL (decl) = NULL_TREE;
7423 }
7424
7425 /* Handle initialization of references.
7426    These three arguments are from `cp_finish_decl', and have the
7427    same meaning here that they do there.
7428
7429    Quotes on semantics can be found in ARM 8.4.3.  */
7430
7431 static void
7432 grok_reference_init (decl, type, init)
7433      tree decl, type, init;
7434 {
7435   tree tmp;
7436
7437   if (init == NULL_TREE)
7438     {
7439       if ((DECL_LANG_SPECIFIC (decl) == 0
7440            || DECL_IN_AGGR_P (decl) == 0)
7441           && ! DECL_THIS_EXTERN (decl))
7442         cp_error ("`%D' declared as reference but not initialized", decl);
7443       return;
7444     }
7445
7446   if (init == error_mark_node)
7447     return;
7448
7449   if (TREE_CODE (init) == CONSTRUCTOR)
7450     {
7451       cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl);
7452       return;
7453     }
7454
7455   if (TREE_CODE (init) == TREE_LIST)
7456     init = build_compound_expr (init);
7457
7458   if (TREE_CODE (TREE_TYPE (init)) == REFERENCE_TYPE)
7459     init = convert_from_reference (init);
7460
7461   if (TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE
7462       && TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE)
7463     {
7464       /* Note: default conversion is only called in very special cases.  */
7465       init = default_conversion (init);
7466     }
7467
7468   /* Convert INIT to the reference type TYPE.  This may involve the
7469      creation of a temporary, whose lifetime must be the same as that
7470      of the reference.  If so, a DECL_STMT for the temporary will be
7471      added just after the DECL_STMT for DECL.  That's why we don't set
7472      DECL_INITIAL for local references (instead assigning to them
7473      explicitly); we need to allow the temporary to be initialized
7474      first.  */
7475   tmp = convert_to_reference
7476     (type, init, CONV_IMPLICIT,
7477      LOOKUP_ONLYCONVERTING|LOOKUP_SPECULATIVELY|LOOKUP_NORMAL|DIRECT_BIND,
7478      decl);
7479
7480   if (tmp == error_mark_node)
7481     return;
7482   else if (tmp != NULL_TREE)
7483     {
7484       init = tmp;
7485       tmp = save_expr (tmp);
7486       if (building_stmt_tree ())
7487         {
7488           /* Initialize the declaration.  */
7489           tmp = build (INIT_EXPR, TREE_TYPE (decl), decl, tmp);
7490           finish_expr_stmt (tmp);
7491         }
7492       else
7493         DECL_INITIAL (decl) = tmp;
7494     }
7495   else
7496     {
7497       cp_error ("cannot initialize `%T' from `%T'", type, TREE_TYPE (init));
7498       return;
7499     }
7500
7501   if (TREE_STATIC (decl) && ! TREE_CONSTANT (DECL_INITIAL (decl)))
7502     {
7503       expand_static_init (decl, DECL_INITIAL (decl));
7504       DECL_INITIAL (decl) = NULL_TREE;
7505     }
7506   return;
7507 }
7508
7509 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7510    mucking with forces it does not comprehend (i.e. initialization with a
7511    constructor).  If we are at global scope and won't go into COMMON, fill
7512    it in with a dummy CONSTRUCTOR to force the variable into .data;
7513    otherwise we can use error_mark_node.  */
7514
7515 static tree
7516 obscure_complex_init (decl, init)
7517      tree decl, init;
7518 {
7519   if (! flag_no_inline && TREE_STATIC (decl))
7520     {
7521       if (extract_init (decl, init))
7522         return NULL_TREE;
7523     }
7524
7525 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7526   if (toplevel_bindings_p () && ! DECL_COMMON (decl))
7527     DECL_INITIAL (decl) = build (CONSTRUCTOR, TREE_TYPE (decl), NULL_TREE,
7528                                  NULL_TREE);
7529   else
7530 #endif
7531     DECL_INITIAL (decl) = error_mark_node;
7532
7533   return init;
7534 }
7535
7536 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7537    array until we finish parsing the initializer.  If that's the
7538    situation we're in, update DECL accordingly.  */
7539
7540 static void
7541 maybe_deduce_size_from_array_init (decl, init)
7542      tree decl;
7543      tree init;
7544 {
7545   tree type = TREE_TYPE (decl);
7546
7547   if (TREE_CODE (type) == ARRAY_TYPE
7548       && TYPE_DOMAIN (type) == NULL_TREE
7549       && TREE_CODE (decl) != TYPE_DECL)
7550     {
7551       /* do_default is really a C-ism to deal with tentative definitions.
7552          But let's leave it here to ease the eventual merge.  */
7553       int do_default = !DECL_EXTERNAL (decl);
7554       tree initializer = init ? init : DECL_INITIAL (decl);
7555       int failure = complete_array_type (type, initializer, do_default);
7556
7557       if (failure == 1)
7558         cp_error ("initializer fails to determine size of `%D'", decl);
7559
7560       if (failure == 2)
7561         {
7562           if (do_default)
7563             cp_error ("array size missing in `%D'", decl);
7564           /* If a `static' var's size isn't known, make it extern as
7565              well as static, so it does not get allocated.  If it's not
7566              `static', then don't mark it extern; finish_incomplete_decl
7567              will give it a default size and it will get allocated.  */
7568           else if (!pedantic && TREE_STATIC (decl) && !TREE_PUBLIC (decl))
7569             DECL_EXTERNAL (decl) = 1;
7570         }
7571
7572       if (pedantic && TYPE_DOMAIN (type) != NULL_TREE
7573           && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type)),
7574                               integer_zero_node))
7575         cp_error ("zero-size array `%D'", decl);
7576
7577       layout_decl (decl, 0);
7578     }
7579 }
7580
7581 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7582    any appropriate error messages regarding the layout.  */
7583
7584 static void
7585 layout_var_decl (decl)
7586      tree decl;
7587 {
7588   tree type = TREE_TYPE (decl);
7589 #if 0
7590   tree ttype = target_type (type);
7591 #endif
7592
7593   /* If we haven't already layed out this declaration, do so now.
7594      Note that we must not call complete type for an external object
7595      because it's type might involve templates that we are not
7596      supposed to isntantiate yet.  (And it's perfectly legal to say
7597      `extern X x' for some incomplete type `X'.)  */
7598   if (!DECL_EXTERNAL (decl))
7599     complete_type (type);
7600   if (!DECL_SIZE (decl) && COMPLETE_TYPE_P (type))
7601     layout_decl (decl, 0);
7602
7603   if (!DECL_EXTERNAL (decl) && DECL_SIZE (decl) == NULL_TREE)
7604     {
7605       /* An automatic variable with an incomplete type: that is an error.
7606          Don't talk about array types here, since we took care of that
7607          message in grokdeclarator.  */
7608       cp_error ("storage size of `%D' isn't known", decl);
7609       TREE_TYPE (decl) = error_mark_node;
7610     }
7611 #if 0
7612   /* Keep this code around in case we later want to control debug info
7613      based on whether a type is "used".  (jason 1999-11-11) */
7614
7615   else if (!DECL_EXTERNAL (decl) && IS_AGGR_TYPE (ttype))
7616     /* Let debugger know it should output info for this type.  */
7617     note_debug_info_needed (ttype);
7618
7619   if (TREE_STATIC (decl) && DECL_CLASS_SCOPE_P (decl))
7620     note_debug_info_needed (DECL_CONTEXT (decl));
7621 #endif
7622
7623   if ((DECL_EXTERNAL (decl) || TREE_STATIC (decl))
7624       && DECL_SIZE (decl) != NULL_TREE
7625       && ! TREE_CONSTANT (DECL_SIZE (decl)))
7626     {
7627       if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST)
7628         constant_expression_warning (DECL_SIZE (decl));
7629       else
7630         cp_error ("storage size of `%D' isn't constant", decl);
7631     }
7632 }
7633
7634 /* If a local static variable is declared in an inline function, or if
7635    we have a weak definition, we must endeavor to create only one
7636    instance of the variable at link-time.  */
7637
7638 static void
7639 maybe_commonize_var (decl)
7640      tree decl;
7641 {
7642   /* Static data in a function with comdat linkage also has comdat
7643      linkage.  */
7644   if (TREE_STATIC (decl)
7645       /* Don't mess with __FUNCTION__.  */
7646       && ! DECL_ARTIFICIAL (decl)
7647       && current_function_decl
7648       && DECL_CONTEXT (decl) == current_function_decl
7649       && (DECL_THIS_INLINE (current_function_decl)
7650           || DECL_TEMPLATE_INSTANTIATION (current_function_decl))
7651       && TREE_PUBLIC (current_function_decl))
7652     {
7653       /* Rather than try to get this right with inlining, we suppress
7654          inlining of such functions.  */
7655       current_function_cannot_inline
7656         = "function with static variable cannot be inline";
7657
7658       /* If flag_weak, we don't need to mess with this, as we can just
7659          make the function weak, and let it refer to its unique local
7660          copy.  This works because we don't allow the function to be
7661          inlined.  */
7662       if (! flag_weak)
7663         {
7664           if (DECL_INTERFACE_KNOWN (current_function_decl))
7665             {
7666               TREE_PUBLIC (decl) = 1;
7667               DECL_EXTERNAL (decl) = DECL_EXTERNAL (current_function_decl);
7668             }
7669           else if (DECL_INITIAL (decl) == NULL_TREE
7670                    || DECL_INITIAL (decl) == error_mark_node)
7671             {
7672               TREE_PUBLIC (decl) = 1;
7673               DECL_COMMON (decl) = 1;
7674             }
7675           /* else we lose. We can only do this if we can use common,
7676              which we can't if it has been initialized.  */
7677
7678           if (TREE_PUBLIC (decl))
7679             DECL_ASSEMBLER_NAME (decl)
7680               = build_static_name (current_function_decl, DECL_NAME (decl));
7681           else
7682             {
7683               cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl);
7684               cp_warning_at ("  you can work around this by removing the initializer", decl);
7685             }
7686         }
7687     }
7688   else if (DECL_LANG_SPECIFIC (decl) && DECL_COMDAT (decl))
7689     /* Set it up again; we might have set DECL_INITIAL since the last
7690        time.  */
7691     comdat_linkage (decl);
7692 }
7693
7694 /* Issue an error message if DECL is an uninitialized const variable.  */
7695
7696 static void
7697 check_for_uninitialized_const_var (decl)
7698      tree decl;
7699 {
7700   tree type = TREE_TYPE (decl);
7701
7702   /* ``Unless explicitly declared extern, a const object does not have
7703      external linkage and must be initialized. ($8.4; $12.1)'' ARM
7704      7.1.6 */
7705   if (TREE_CODE (decl) == VAR_DECL
7706       && TREE_CODE (type) != REFERENCE_TYPE
7707       && CP_TYPE_CONST_P (type)
7708       && !TYPE_NEEDS_CONSTRUCTING (type)
7709       && !DECL_INITIAL (decl))
7710     cp_error ("uninitialized const `%D'", decl);
7711 }
7712
7713 /* Verify INIT (the initializer for DECL), and record the
7714    initialization in DECL_INITIAL, if appropriate.  Returns a new
7715    value for INIT.  */
7716
7717 static tree
7718 check_initializer (decl, init)
7719      tree decl;
7720      tree init;
7721 {
7722   tree type;
7723
7724   if (TREE_CODE (decl) == FIELD_DECL)
7725     return init;
7726
7727   type = TREE_TYPE (decl);
7728
7729   /* If `start_decl' didn't like having an initialization, ignore it now.  */
7730   if (init != NULL_TREE && DECL_INITIAL (decl) == NULL_TREE)
7731     init = NULL_TREE;
7732
7733   /* Check the initializer.  */
7734   if (init)
7735     {
7736       /* Things that are going to be initialized need to have complete
7737          type.  */
7738       TREE_TYPE (decl) = type = complete_type (TREE_TYPE (decl));
7739
7740       if (type == error_mark_node)
7741         /* We will have already complained.  */
7742         init = NULL_TREE;
7743       else if (COMPLETE_TYPE_P (type) && !TREE_CONSTANT (TYPE_SIZE (type)))
7744         {
7745           cp_error ("variable-sized object `%D' may not be initialized", decl);
7746           init = NULL_TREE;
7747         }
7748       else if (TREE_CODE (type) == ARRAY_TYPE
7749                && !COMPLETE_TYPE_P (TREE_TYPE (type)))
7750         {
7751           cp_error ("elements of array `%#D' have incomplete type", decl);
7752           init = NULL_TREE;
7753         }
7754       else if (!COMPLETE_TYPE_P (type))
7755         {
7756           cp_error ("`%D' has incomplete type", decl);
7757           TREE_TYPE (decl) = error_mark_node;
7758           init = NULL_TREE;
7759         }
7760     }
7761
7762   if (TREE_CODE (decl) == CONST_DECL)
7763     {
7764       my_friendly_assert (TREE_CODE (decl) != REFERENCE_TYPE, 148);
7765
7766       DECL_INITIAL (decl) = init;
7767
7768       /* This will keep us from needing to worry about our obstacks.  */
7769       my_friendly_assert (init != NULL_TREE, 149);
7770       init = NULL_TREE;
7771     }
7772   else if (!DECL_EXTERNAL (decl) && TREE_CODE (type) == REFERENCE_TYPE)
7773     {
7774       if (TREE_STATIC (decl))
7775         make_decl_rtl (decl, NULL_PTR, toplevel_bindings_p ());
7776       grok_reference_init (decl, type, init);
7777       init = NULL_TREE;
7778     }
7779   else if (init)
7780     {
7781       if (TYPE_HAS_CONSTRUCTOR (type) || TYPE_NEEDS_CONSTRUCTING (type))
7782         {
7783           if (TREE_CODE (type) == ARRAY_TYPE)
7784             init = digest_init (type, init, (tree *) 0);
7785           else if (TREE_CODE (init) == CONSTRUCTOR
7786                    && TREE_HAS_CONSTRUCTOR (init))
7787             {
7788               if (TYPE_NON_AGGREGATE_CLASS (type))
7789                 {
7790                   cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7791                             decl);
7792                   init = error_mark_node;
7793                 }
7794               else
7795                 goto dont_use_constructor;
7796             }
7797         }
7798       else
7799         {
7800         dont_use_constructor:
7801           if (TREE_CODE (init) != TREE_VEC)
7802             init = store_init_value (decl, init);
7803         }
7804
7805       if (init)
7806         /* We must hide the initializer so that expand_decl
7807            won't try to do something it does not understand.  */
7808         init = obscure_complex_init (decl, init);
7809     }
7810   else if (DECL_EXTERNAL (decl))
7811     ;
7812   else if (TYPE_P (type)
7813            && (IS_AGGR_TYPE (type) || TYPE_NEEDS_CONSTRUCTING (type)))
7814     {
7815       tree core_type = strip_array_types (type);
7816
7817       if (! TYPE_NEEDS_CONSTRUCTING (core_type))
7818         {
7819           if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type))
7820             cp_error ("structure `%D' with uninitialized const members", decl);
7821           if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type))
7822             cp_error ("structure `%D' with uninitialized reference members",
7823                       decl);
7824         }
7825
7826       check_for_uninitialized_const_var (decl);
7827
7828       if (COMPLETE_TYPE_P (type) && TYPE_NEEDS_CONSTRUCTING (type))
7829         init = obscure_complex_init (decl, NULL_TREE);
7830
7831     }
7832   else
7833     check_for_uninitialized_const_var (decl);
7834
7835   return init;
7836 }
7837
7838 /* If DECL is not a local variable, give it RTL.  */
7839
7840 static void
7841 make_rtl_for_nonlocal_decl (decl, init, asmspec)
7842      tree decl;
7843      tree init;
7844      const char *asmspec;
7845 {
7846   int toplev = toplevel_bindings_p ();
7847   int defer_p;
7848
7849   /* Handle non-variables up front.  */
7850   if (TREE_CODE (decl) != VAR_DECL)
7851     {
7852       rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7853       return;
7854     }
7855
7856   /* If we see a class member here, it should be a static data
7857      member.  */
7858   if (DECL_LANG_SPECIFIC (decl) && DECL_IN_AGGR_P (decl))
7859     {
7860       my_friendly_assert (TREE_STATIC (decl), 19990828);
7861       /* An in-class declaration of a static data member should be
7862          external; it is only a declaration, and not a definition.  */
7863       if (init == NULL_TREE)
7864         my_friendly_assert (DECL_EXTERNAL (decl), 20000723);
7865     }
7866
7867   /* Set the DECL_ASSEMBLER_NAME for the variable.  */
7868   if (asmspec)
7869     DECL_ASSEMBLER_NAME (decl) = get_identifier (asmspec);
7870
7871   /* We don't create any RTL for local variables.  */
7872   if (DECL_FUNCTION_SCOPE_P (decl) && !TREE_STATIC (decl))
7873     return;
7874
7875   /* We defer emission of local statics until the corresponding
7876      DECL_STMT is expanded.  */
7877   defer_p = DECL_FUNCTION_SCOPE_P (decl) || DECL_VIRTUAL_P (decl);
7878
7879   /* We try to defer namespace-scope static constants so that they are
7880      not emitted into the object file unncessarily.  */
7881   if (!DECL_VIRTUAL_P (decl)
7882       && TREE_READONLY (decl)
7883       && DECL_INITIAL (decl) != NULL_TREE
7884       && DECL_INITIAL (decl) != error_mark_node
7885       && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl))
7886       && toplev
7887       && !TREE_PUBLIC (decl))
7888     {
7889       /* Fool with the linkage according to #pragma interface.  */
7890       if (!interface_unknown)
7891         {
7892           TREE_PUBLIC (decl) = 1;
7893           DECL_EXTERNAL (decl) = interface_only;
7894         }
7895
7896       defer_p = 1;
7897     }
7898
7899   /* If we're deferring the variable, just make RTL.  Do not actually
7900      emit the variable.  */
7901   if (defer_p)
7902     make_decl_rtl (decl, asmspec, toplev);
7903   /* If we're not deferring, go ahead and assemble the variable.  */
7904   else
7905     rest_of_decl_compilation (decl, asmspec, toplev, at_eof);
7906 }
7907
7908 /* The old ARM scoping rules injected variables declared in the
7909    initialization statement of a for-statement into the surrounding
7910    scope.  We support this usage, in order to be backward-compatible.
7911    DECL is a just-declared VAR_DECL; if necessary inject its
7912    declaration into the surrounding scope.  */
7913
7914 void
7915 maybe_inject_for_scope_var (decl)
7916      tree decl;
7917 {
7918   if (!DECL_NAME (decl))
7919     return;
7920
7921   if (current_binding_level->is_for_scope)
7922     {
7923       struct binding_level *outer
7924         = current_binding_level->level_chain;
7925
7926       /* Check to see if the same name is already bound at the outer
7927          level, either because it was directly declared, or because a
7928          dead for-decl got preserved.  In either case, the code would
7929          not have been valid under the ARM scope rules, so clear
7930          is_for_scope for the current_binding_level.
7931
7932          Otherwise, we need to preserve the temp slot for decl to last
7933          into the outer binding level.  */
7934
7935       tree outer_binding
7936         = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl)));
7937
7938       if (outer_binding && BINDING_LEVEL (outer_binding) == outer
7939           && (TREE_CODE (BINDING_VALUE (outer_binding))
7940               == VAR_DECL)
7941           && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding)))
7942         {
7943           BINDING_VALUE (outer_binding)
7944             = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding));
7945           current_binding_level->is_for_scope = 0;
7946         }
7947       else if (DECL_IN_MEMORY_P (decl))
7948         preserve_temp_slots (DECL_RTL (decl));
7949     }
7950 }
7951
7952 /* Generate code to initialize DECL (a local variable).  */
7953
7954 void
7955 initialize_local_var (decl, init, flags)
7956      tree decl;
7957      tree init;
7958      int flags;
7959 {
7960   tree type = TREE_TYPE (decl);
7961
7962   /* If the type is bogus, don't bother initializing the variable.  */
7963   if (type == error_mark_node)
7964     return;
7965
7966   if (DECL_SIZE (decl) == NULL_TREE && !TREE_STATIC (decl))
7967     {
7968       /* If we used it already as memory, it must stay in memory.  */
7969       DECL_INITIAL (decl) = NULL_TREE;
7970       TREE_ADDRESSABLE (decl) = TREE_USED (decl);
7971     }
7972
7973   /* Local statics are handled differently from ordinary automatic
7974      variables.  */
7975   if (TREE_STATIC (decl))
7976     {
7977       if (TYPE_NEEDS_CONSTRUCTING (type) || init != NULL_TREE
7978           || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
7979         expand_static_init (decl, init);
7980       return;
7981     }
7982
7983   if (DECL_SIZE (decl) && type != error_mark_node)
7984     {
7985       int already_used;
7986
7987       /* Compute and store the initial value.  */
7988       already_used = TREE_USED (decl) || TREE_USED (type);
7989
7990       if (init || TYPE_NEEDS_CONSTRUCTING (type))
7991         {
7992           int saved_stmts_are_full_exprs_p;
7993
7994           my_friendly_assert (building_stmt_tree (), 20000906);
7995           saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p ();
7996           current_stmt_tree ()->stmts_are_full_exprs_p = 1;
7997           finish_expr_stmt (build_aggr_init (decl, init, flags));
7998           current_stmt_tree ()->stmts_are_full_exprs_p =
7999             saved_stmts_are_full_exprs_p;
8000         }
8001
8002       /* Set this to 0 so we can tell whether an aggregate which was
8003          initialized was ever used.  Don't do this if it has a
8004          destructor, so we don't complain about the 'resource
8005          allocation is initialization' idiom.  Now set
8006          attribute((unused)) on types so decls of that type will be
8007          marked used. (see TREE_USED, above.)  */
8008       if (TYPE_NEEDS_CONSTRUCTING (type)
8009           && ! already_used
8010           && TYPE_HAS_TRIVIAL_DESTRUCTOR (type)
8011           && DECL_NAME (decl))
8012         TREE_USED (decl) = 0;
8013       else if (already_used)
8014         TREE_USED (decl) = 1;
8015     }
8016 }
8017
8018 /* Generate code to destroy DECL (a local variable).  */
8019
8020 static void
8021 destroy_local_var (decl)
8022      tree decl;
8023 {
8024   tree type = TREE_TYPE (decl);
8025   tree cleanup;
8026
8027   /* Only variables get cleaned up.  */
8028   if (TREE_CODE (decl) != VAR_DECL)
8029     return;
8030
8031   /* And only things with destructors need cleaning up.  */
8032   if (type == error_mark_node
8033       || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
8034     return;
8035
8036   if (TREE_CODE (decl) == VAR_DECL &&
8037       (DECL_EXTERNAL (decl) || TREE_STATIC (decl)))
8038     /* We don't clean up things that aren't defined in this
8039        translation unit, or that need a static cleanup.  The latter
8040        are handled by finish_file.  */
8041     return;
8042
8043   /* Compute the cleanup.  */
8044   cleanup = maybe_build_cleanup (decl);
8045
8046   /* Record the cleanup required for this declaration.  */
8047   if (DECL_SIZE (decl) && TREE_TYPE (decl) != error_mark_node
8048       && cleanup)
8049     finish_decl_cleanup (decl, cleanup);
8050 }
8051
8052 /* Finish processing of a declaration;
8053    install its line number and initial value.
8054    If the length of an array type is not known before,
8055    it must be determined now, from the initial value, or it is an error.
8056
8057    INIT holds the value of an initializer that should be allowed to escape
8058    the normal rules.
8059
8060    FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
8061    if the (init) syntax was used.  */
8062
8063 void
8064 cp_finish_decl (decl, init, asmspec_tree, flags)
8065      tree decl, init;
8066      tree asmspec_tree;
8067      int flags;
8068 {
8069   register tree type;
8070   tree ttype = NULL_TREE;
8071   const char *asmspec = NULL;
8072   int was_readonly = 0;
8073
8074   if (! decl)
8075     {
8076       if (init)
8077         error ("assignment (not initialization) in declaration");
8078       return;
8079     }
8080
8081   /* If a name was specified, get the string.  */
8082   if (asmspec_tree)
8083       asmspec = TREE_STRING_POINTER (asmspec_tree);
8084
8085   if (init && TREE_CODE (init) == NAMESPACE_DECL)
8086     {
8087       cp_error ("cannot initialize `%D' to namespace `%D'",
8088                 decl, init);
8089       init = NULL_TREE;
8090     }
8091
8092   if (current_class_type
8093       && CP_DECL_CONTEXT (decl) == current_class_type
8094       && TYPE_BEING_DEFINED (current_class_type)
8095       && (DECL_INITIAL (decl) || init))
8096     DECL_DEFINED_IN_CLASS_P (decl) = 1;
8097
8098   if (TREE_CODE (decl) == VAR_DECL
8099       && DECL_CONTEXT (decl)
8100       && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL
8101       && DECL_CONTEXT (decl) != current_namespace
8102       && init)
8103     {
8104       /* Leave the namespace of the object. */
8105       pop_decl_namespace ();
8106     }
8107
8108   type = TREE_TYPE (decl);
8109
8110   if (type == error_mark_node)
8111     return;
8112
8113   /* Add this declaration to the statement-tree.  */
8114   if (building_stmt_tree ()
8115       && at_function_scope_p ()
8116       && TREE_CODE (decl) != RESULT_DECL)
8117     add_decl_stmt (decl);
8118
8119   if (TYPE_HAS_MUTABLE_P (type))
8120     TREE_READONLY (decl) = 0;
8121
8122   if (processing_template_decl)
8123     {
8124       if (init && DECL_INITIAL (decl))
8125         DECL_INITIAL (decl) = init;
8126       goto finish_end0;
8127     }
8128
8129   /* Parameters are handled by store_parm_decls, not cp_finish_decl.  */
8130   my_friendly_assert (TREE_CODE (decl) != PARM_DECL, 19990828);
8131
8132   /* Take care of TYPE_DECLs up front.  */
8133   if (TREE_CODE (decl) == TYPE_DECL)
8134     {
8135       if (init && DECL_INITIAL (decl))
8136         {
8137           /* typedef foo = bar; store the type of bar as the type of foo.  */
8138           TREE_TYPE (decl) = type = TREE_TYPE (init);
8139           DECL_INITIAL (decl) = init = NULL_TREE;
8140         }
8141       if (type != error_mark_node
8142           && IS_AGGR_TYPE (type) && DECL_NAME (decl))
8143         {
8144           if (TREE_TYPE (DECL_NAME (decl)) && TREE_TYPE (decl) != type)
8145             cp_warning ("shadowing previous type declaration of `%#D'", decl);
8146           set_identifier_type_value (DECL_NAME (decl), type);
8147           CLASSTYPE_GOT_SEMICOLON (type) = 1;
8148         }
8149       GNU_xref_decl (current_function_decl, decl);
8150
8151       /* If we have installed this as the canonical typedef for this
8152          type, and that type has not been defined yet, delay emitting
8153          the debug information for it, as we will emit it later.  */
8154       if (TYPE_MAIN_DECL (TREE_TYPE (decl)) == decl
8155           && !COMPLETE_TYPE_P (TREE_TYPE (decl)))
8156         TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
8157
8158       rest_of_decl_compilation (decl, NULL_PTR,
8159                                 DECL_CONTEXT (decl) == NULL_TREE, at_eof);
8160       goto finish_end;
8161     }
8162
8163   if (TREE_CODE (decl) != FUNCTION_DECL)
8164     ttype = target_type (type);
8165
8166   if (! DECL_EXTERNAL (decl) && TREE_READONLY (decl)
8167       && TYPE_NEEDS_CONSTRUCTING (type))
8168     {
8169       /* Currently, GNU C++ puts constants in text space, making them
8170          impossible to initialize.  In the future, one would hope for
8171          an operating system which understood the difference between
8172          initialization and the running of a program.  */
8173       was_readonly = 1;
8174       TREE_READONLY (decl) = 0;
8175     }
8176
8177   if (TREE_CODE (decl) == FIELD_DECL && asmspec)
8178     {
8179       /* This must override the asm specifier which was placed by
8180          grokclassfn.  Lay this out fresh.  */
8181       DECL_RTL (TREE_TYPE (decl)) = NULL_RTX;
8182       DECL_ASSEMBLER_NAME (decl) = get_identifier (asmspec);
8183       make_decl_rtl (decl, asmspec, 0);
8184     }
8185
8186   /* Deduce size of array from initialization, if not already known.  */
8187   maybe_deduce_size_from_array_init (decl, init);
8188   init = check_initializer (decl, init);
8189
8190   GNU_xref_decl (current_function_decl, decl);
8191
8192   if (TREE_CODE (decl) == VAR_DECL)
8193     layout_var_decl (decl);
8194
8195   /* Output the assembler code and/or RTL code for variables and functions,
8196      unless the type is an undefined structure or union.
8197      If not, it will get done when the type is completed.  */
8198   if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL
8199       || TREE_CODE (decl) == RESULT_DECL)
8200     {
8201       if (TREE_CODE (decl) == VAR_DECL)
8202         maybe_commonize_var (decl);
8203
8204       make_rtl_for_nonlocal_decl (decl, init, asmspec);
8205
8206       if (TREE_CODE (type) == FUNCTION_TYPE
8207           || TREE_CODE (type) == METHOD_TYPE)
8208         abstract_virtuals_error (decl,
8209                                  strip_array_types (TREE_TYPE (type)));
8210       else
8211         abstract_virtuals_error (decl, strip_array_types (type));
8212
8213       if (TREE_CODE (decl) == FUNCTION_DECL)
8214         ;
8215       else if (DECL_EXTERNAL (decl)
8216                && ! (DECL_LANG_SPECIFIC (decl)
8217                      && DECL_NOT_REALLY_EXTERN (decl)))
8218         {
8219           if (init)
8220             DECL_INITIAL (decl) = init;
8221         }
8222       else if (TREE_CODE (CP_DECL_CONTEXT (decl)) == FUNCTION_DECL)
8223         {
8224           /* This is a local declaration.  */
8225           if (doing_semantic_analysis_p ())
8226             maybe_inject_for_scope_var (decl);
8227           /* Initialize the local variable.  But, if we're building a
8228              statement-tree, we'll do the initialization when we
8229              expand the tree.  */
8230           if (processing_template_decl)
8231             {
8232               if (init || DECL_INITIAL (decl) == error_mark_node)
8233                 DECL_INITIAL (decl) = init;
8234             }
8235           else
8236             {
8237               /* If we're not building RTL, then we need to do so
8238                  now.  */
8239               my_friendly_assert (building_stmt_tree (), 20000906);
8240               /* Initialize the variable.  */
8241               initialize_local_var (decl, init, flags);
8242               /* Clean up the variable.  */
8243               destroy_local_var (decl);
8244             }
8245         }
8246       else if (TREE_STATIC (decl) && type != error_mark_node)
8247         {
8248           /* Cleanups for static variables are handled by `finish_file'.  */
8249           if (TYPE_NEEDS_CONSTRUCTING (type) || init != NULL_TREE
8250               || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
8251             expand_static_init (decl, init);
8252         }
8253     finish_end0:
8254
8255       /* Undo call to `pushclass' that was done in `start_decl'
8256          due to initialization of qualified member variable.
8257          I.e., Foo::x = 10;  */
8258       {
8259         tree context = CP_DECL_CONTEXT (decl);
8260         if (context
8261             && TYPE_P (context)
8262             && (TREE_CODE (decl) == VAR_DECL
8263                 /* We also have a pushclass done that we need to undo here
8264                    if we're at top level and declare a method.  */
8265                 || TREE_CODE (decl) == FUNCTION_DECL)
8266             /* If size hasn't been set, we're still defining it,
8267                and therefore inside the class body; don't pop
8268                the binding level..  */
8269             && COMPLETE_TYPE_P (context)
8270             && context == current_class_type)
8271           pop_nested_class ();
8272       }
8273     }
8274
8275  finish_end:
8276
8277   if (was_readonly)
8278     TREE_READONLY (decl) = 1;
8279 }
8280
8281 /* This is here for a midend callback from c-common.c */
8282
8283 void
8284 finish_decl (decl, init, asmspec_tree)
8285      tree decl, init;
8286      tree asmspec_tree;
8287 {
8288   cp_finish_decl (decl, init, asmspec_tree, 0);
8289 }
8290
8291 /* Returns a declaration for a VAR_DECL as if:
8292
8293      extern "C" TYPE NAME;
8294
8295    had been seen.  Used to create compiler-generated global
8296    variables.  */
8297
8298 tree
8299 declare_global_var (name, type)
8300      tree name;
8301      tree type;
8302 {
8303   tree decl;
8304
8305   push_to_top_level ();
8306   decl = build_decl (VAR_DECL, name, type);
8307   TREE_PUBLIC (decl) = 1;
8308   DECL_EXTERNAL (decl) = 1;
8309   DECL_ARTIFICIAL (decl) = 1;
8310   pushdecl (decl);
8311   cp_finish_decl (decl, NULL_TREE, NULL_TREE, 0);
8312   pop_from_top_level ();
8313
8314   return decl;
8315 }
8316
8317 /* Returns a pointer to the `atexit' function.  Note that if
8318    FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8319    `__cxa_atexit' function specified in the IA64 C++ ABI.  */
8320
8321 static tree
8322 get_atexit_node ()
8323 {
8324   tree atexit_fndecl;
8325   tree arg_types;
8326   tree fn_type;
8327   tree fn_ptr_type;
8328   const char *name;
8329
8330   if (atexit_node)
8331     return atexit_node;
8332
8333   if (flag_use_cxa_atexit)
8334     {
8335       /* The declaration for `__cxa_atexit' is:
8336
8337            int __cxa_atexit (void (*)(void *), void *, void *)
8338
8339          We build up the argument types and then then function type
8340          itself.  */
8341
8342       /* First, build the pointer-to-function type for the first
8343          argument.  */
8344       arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8345       fn_type = build_function_type (void_type_node, arg_types);
8346       fn_ptr_type = build_pointer_type (fn_type);
8347       /* Then, build the rest of the argument types.  */
8348       arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8349       arg_types = tree_cons (NULL_TREE, ptr_type_node, arg_types);
8350       arg_types = tree_cons (NULL_TREE, fn_ptr_type, arg_types);
8351       /* And the final __cxa_atexit type.  */
8352       fn_type = build_function_type (integer_type_node, arg_types);
8353       fn_ptr_type = build_pointer_type (fn_type);
8354       name = "__cxa_atexit";
8355     }
8356   else
8357     {
8358       /* The declaration for `atexit' is:
8359
8360            int atexit (void (*)());
8361
8362          We build up the argument types and then then function type
8363          itself.  */
8364       fn_type = build_function_type (void_type_node, void_list_node);
8365       fn_ptr_type = build_pointer_type (fn_type);
8366       arg_types = tree_cons (NULL_TREE, fn_ptr_type, void_list_node);
8367       /* Build the final atexit type.  */
8368       fn_type = build_function_type (integer_type_node, arg_types);
8369       name = "atexit";
8370     }
8371
8372   /* Now, build the function declaration.  */
8373   push_lang_context (lang_name_c);
8374   atexit_fndecl = build_library_fn_ptr (name, fn_type);
8375   mark_used (atexit_fndecl);
8376   pop_lang_context ();
8377   atexit_node = default_conversion (atexit_fndecl);
8378
8379   return atexit_node;
8380 }
8381
8382 /* Returns the __dso_handle VAR_DECL.  */
8383
8384 static tree
8385 get_dso_handle_node ()
8386 {
8387   if (dso_handle_node)
8388     return dso_handle_node;
8389
8390   /* Declare the variable.  */
8391   dso_handle_node = declare_global_var (get_identifier ("__dso_handle"),
8392                                         ptr_type_node);
8393
8394   return dso_handle_node;
8395 }
8396
8397 /* Begin a new function with internal linkage whose job will be simply
8398    to destroy some particular variable.  */
8399
8400 static tree
8401 start_cleanup_fn ()
8402 {
8403   static int counter = 0;
8404   int old_interface_unknown = interface_unknown;
8405   char name[32];
8406   tree parmtypes;
8407   tree fntype;
8408   tree fndecl;
8409
8410   push_to_top_level ();
8411
8412   /* No need to mangle this.  */
8413   push_lang_context (lang_name_c);
8414
8415   interface_unknown = 1;
8416
8417   /* Build the parameter-types.  */
8418   parmtypes = void_list_node;
8419   /* Functions passed to __cxa_atexit take an additional parameter.
8420      We'll just ignore it.  After we implement the new calling
8421      convention for destructors, we can eliminate the use of
8422      additional cleanup functions entirely in the -fnew-abi case.  */
8423   if (flag_use_cxa_atexit)
8424     parmtypes = tree_cons (NULL_TREE, ptr_type_node, parmtypes);
8425   /* Build the function type itself.  */
8426   fntype = build_function_type (void_type_node, parmtypes);
8427   /* Build the name of the function.  */
8428   sprintf (name, "__tcf_%d", counter++);
8429   /* Build the function declaration.  */
8430   fndecl = build_lang_decl (FUNCTION_DECL, get_identifier (name), fntype);
8431   /* It's a function with internal linkage, generated by the
8432      compiler.  */
8433   TREE_PUBLIC (fndecl) = 0;
8434   DECL_ARTIFICIAL (fndecl) = 1;
8435   /* Make the function `inline' so that it is only emitted if it is
8436      actually needed.  It is unlikely that it will be inlined, since
8437      it is only called via a function pointer, but we avoid unncessary
8438      emissions this way.  */
8439   DECL_INLINE (fndecl) = 1;
8440   /* Build the parameter.  */
8441   if (flag_use_cxa_atexit)
8442     {
8443       tree parmdecl;
8444
8445       parmdecl = build_decl (PARM_DECL, NULL_TREE, ptr_type_node);
8446       DECL_CONTEXT (parmdecl) = fndecl;
8447       DECL_ARG_TYPE (parmdecl) = ptr_type_node;
8448       TREE_USED (parmdecl) = 1;
8449       DECL_ARGUMENTS (fndecl) = parmdecl;
8450     }
8451
8452   pushdecl (fndecl);
8453   start_function (/*specs=*/NULL_TREE, fndecl, NULL_TREE, SF_PRE_PARSED);
8454   do_pushlevel ();
8455
8456   interface_unknown = old_interface_unknown;
8457
8458   pop_lang_context ();
8459
8460   return current_function_decl;
8461 }
8462
8463 /* Finish the cleanup function begun by start_cleanup_fn.  */
8464
8465 static void
8466 end_cleanup_fn ()
8467 {
8468   do_poplevel ();
8469
8470   expand_body (finish_function (0));
8471
8472   pop_from_top_level ();
8473 }
8474
8475 /* Generate code to handle the destruction of DECL, an object with
8476    static storage duration.  */
8477
8478 void
8479 register_dtor_fn (decl)
8480      tree decl;
8481 {
8482   tree cleanup;
8483   tree compound_stmt;
8484   tree args;
8485   tree fcall;
8486
8487   int saved_flag_access_control;
8488
8489   if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
8490     return;
8491
8492   /* Call build_cleanup before we enter the anonymous function so that
8493      any access checks will be done relative to the current scope,
8494      rather than the scope of the anonymous function.  */
8495   build_cleanup (decl);
8496
8497   /* Now start the function.  */
8498   cleanup = start_cleanup_fn ();
8499
8500   /* Now, recompute the cleanup.  It may contain SAVE_EXPRs that refer
8501      to the original function, rather than the anonymous one.  That
8502      will make the back-end think that nested functions are in use,
8503      which causes confusion.  */
8504   saved_flag_access_control = flag_access_control;
8505   flag_access_control = 0;
8506   fcall = build_cleanup (decl);
8507   flag_access_control = saved_flag_access_control;
8508
8509   /* Create the body of the anonymous function.  */
8510   compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
8511   finish_expr_stmt (fcall);
8512   finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
8513   end_cleanup_fn ();
8514
8515   /* Call atexit with the cleanup function.  */
8516   mark_addressable (cleanup);
8517   cleanup = build_unary_op (ADDR_EXPR, cleanup, 0);
8518   if (flag_use_cxa_atexit)
8519     {
8520       args = tree_cons (NULL_TREE, get_dso_handle_node (), NULL_TREE);
8521       args = tree_cons (NULL_TREE, null_pointer_node, args);
8522       args = tree_cons (NULL_TREE, cleanup, args);
8523     }
8524   else
8525     args = tree_cons (NULL_TREE, cleanup, NULL_TREE);
8526   finish_expr_stmt (build_function_call (get_atexit_node (), args));
8527 }
8528
8529 void
8530 expand_static_init (decl, init)
8531      tree decl;
8532      tree init;
8533 {
8534   tree oldstatic = value_member (decl, static_aggregates);
8535
8536   if (oldstatic)
8537     {
8538       if (TREE_PURPOSE (oldstatic) && init != NULL_TREE)
8539         cp_error ("multiple initializations given for `%D'", decl);
8540     }
8541   else if (! toplevel_bindings_p ())
8542     {
8543       /* Emit code to perform this initialization but once.  */
8544       tree if_stmt;
8545       tree then_clause;
8546       tree assignment;
8547       tree guard;
8548       tree guard_init;
8549
8550       /* Emit code to perform this initialization but once.  This code
8551          looks like:
8552
8553            static int guard = 0;
8554            if (!guard) {
8555              // Do initialization.
8556              guard = 1;
8557              // Register variable for destruction at end of program.
8558            }
8559
8560          Note that the `temp' variable is only set to 1 *after* the
8561          initialization is complete.  This ensures that an exception,
8562          thrown during the construction, will cause the variable to
8563          reinitialized when we pass through this code again, as per:
8564
8565            [stmt.dcl]
8566
8567            If the initialization exits by throwing an exception, the
8568            initialization is not complete, so it will be tried again
8569            the next time control enters the declaration.
8570
8571          In theory, this process should be thread-safe, too; multiple
8572          threads should not be able to initialize the variable more
8573          than once.  We don't yet attempt to ensure thread-safety.  */
8574
8575       /* Create the guard variable.  */
8576       guard = get_guard (decl);
8577
8578       /* Begin the conditional initialization.  */
8579       if_stmt = begin_if_stmt ();
8580       finish_if_stmt_cond (get_guard_cond (guard), if_stmt);
8581       then_clause = begin_compound_stmt (/*has_no_scope=*/0);
8582
8583       /* Do the initialization itself.  */
8584       if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl))
8585           || (init && TREE_CODE (init) == TREE_LIST))
8586         assignment = build_aggr_init (decl, init, 0);
8587       else if (init)
8588         /* The initialization we're doing here is just a bitwise
8589            copy.  */
8590         assignment = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
8591       else
8592         assignment = NULL_TREE;
8593
8594       /* Once the assignment is complete, set TEMP to 1.  Since the
8595          construction of the static object is complete at this point,
8596          we want to make sure TEMP is set to 1 even if a temporary
8597          constructed during the initialization throws an exception
8598          when it is destroyed.  So, we combine the initialization and
8599          the assignment to TEMP into a single expression, ensuring
8600          that when we call finish_expr_stmt the cleanups will not be
8601          run until after TEMP is set to 1.  */
8602       guard_init = set_guard (guard);
8603       if (assignment)
8604         {
8605           assignment = tree_cons (NULL_TREE, assignment,
8606                                   build_tree_list (NULL_TREE,
8607                                                    guard_init));
8608           assignment = build_compound_expr (assignment);
8609         }
8610       else
8611         assignment = guard_init;
8612       finish_expr_stmt (assignment);
8613
8614       /* Use atexit to register a function for destroying this static
8615          variable.  */
8616       register_dtor_fn (decl);
8617
8618       finish_compound_stmt (/*has_no_scope=*/0, then_clause);
8619       finish_then_clause (if_stmt);
8620       finish_if_stmt ();
8621     }
8622   else
8623     static_aggregates = tree_cons (init, decl, static_aggregates);
8624 }
8625
8626 /* Finish the declaration of a catch-parameter.  */
8627
8628 tree
8629 start_handler_parms (declspecs, declarator)
8630      tree declspecs;
8631      tree declarator;
8632 {
8633   tree decl;
8634   if (declspecs)
8635     {
8636       decl = grokdeclarator (declarator, declspecs, CATCHPARM,
8637                              1, NULL_TREE);
8638       if (decl == NULL_TREE)
8639         error ("invalid catch parameter");
8640     }
8641   else
8642     decl = NULL_TREE;
8643
8644   return decl;
8645 }
8646
8647 \f
8648 /* Make TYPE a complete type based on INITIAL_VALUE.
8649    Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8650    2 if there was no information (in which case assume 0 if DO_DEFAULT).  */
8651
8652 int
8653 complete_array_type (type, initial_value, do_default)
8654      tree type, initial_value;
8655      int do_default;
8656 {
8657   register tree maxindex = NULL_TREE;
8658   int value = 0;
8659
8660   if (initial_value)
8661     {
8662       /* An array of character type can be initialized from a
8663          brace-enclosed string constant.  */
8664       if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type)))
8665           && TREE_CODE (initial_value) == CONSTRUCTOR
8666           && CONSTRUCTOR_ELTS (initial_value)
8667           && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value)))
8668               == STRING_CST)
8669           && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value)) == NULL_TREE)
8670         initial_value = TREE_VALUE (CONSTRUCTOR_ELTS (initial_value));
8671
8672       /* Note MAXINDEX is really the maximum index, one less than the
8673          size.  */
8674       if (TREE_CODE (initial_value) == STRING_CST)
8675         {
8676           int eltsize
8677             = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value)));
8678           maxindex = build_int_2 ((TREE_STRING_LENGTH (initial_value)
8679                                    / eltsize) - 1, 0);
8680         }
8681       else if (TREE_CODE (initial_value) == CONSTRUCTOR)
8682         {
8683           tree elts = CONSTRUCTOR_ELTS (initial_value);
8684
8685           maxindex = ssize_int (-1);
8686           for (; elts; elts = TREE_CHAIN (elts))
8687             {
8688               if (TREE_PURPOSE (elts))
8689                 maxindex = TREE_PURPOSE (elts);
8690               else
8691                 maxindex = size_binop (PLUS_EXPR, maxindex, ssize_int (1));
8692             }
8693           maxindex = copy_node (maxindex);
8694         }
8695       else
8696         {
8697           /* Make an error message unless that happened already.  */
8698           if (initial_value != error_mark_node)
8699             value = 1;
8700           else
8701             initial_value = NULL_TREE;
8702
8703           /* Prevent further error messages.  */
8704           maxindex = build_int_2 (0, 0);
8705         }
8706     }
8707
8708   if (!maxindex)
8709     {
8710       if (do_default)
8711         maxindex = build_int_2 (0, 0);
8712       value = 2;
8713     }
8714
8715   if (maxindex)
8716     {
8717       tree itype;
8718       tree domain;
8719
8720       domain = build_index_type (maxindex);
8721       TYPE_DOMAIN (type) = domain;
8722
8723       if (! TREE_TYPE (maxindex))
8724         TREE_TYPE (maxindex) = domain;
8725       if (initial_value)
8726         itype = TREE_TYPE (initial_value);
8727       else
8728         itype = NULL;
8729       if (itype && !TYPE_DOMAIN (itype))
8730         TYPE_DOMAIN (itype) = domain;
8731       /* The type of the main variant should never be used for arrays
8732          of different sizes.  It should only ever be completed with the
8733          size of the array.  */
8734       if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)))
8735         TYPE_DOMAIN (TYPE_MAIN_VARIANT (type)) = domain;
8736     }
8737
8738   /* Lay out the type now that we can get the real answer.  */
8739
8740   layout_type (type);
8741
8742   return value;
8743 }
8744 \f
8745 /* Return zero if something is declared to be a member of type
8746    CTYPE when in the context of CUR_TYPE.  STRING is the error
8747    message to print in that case.  Otherwise, quietly return 1.  */
8748
8749 static int
8750 member_function_or_else (ctype, cur_type, flags)
8751      tree ctype, cur_type;
8752      enum overload_flags flags;
8753 {
8754   if (ctype && ctype != cur_type)
8755     {
8756       if (flags == DTOR_FLAG)
8757         cp_error ("destructor for alien class `%T' cannot be a member",
8758                   ctype);
8759       else
8760         cp_error ("constructor for alien class `%T' cannot be a member",
8761                   ctype);
8762       return 0;
8763     }
8764   return 1;
8765 }
8766 \f
8767 /* Subroutine of `grokdeclarator'.  */
8768
8769 /* Generate errors possibly applicable for a given set of specifiers.
8770    This is for ARM $7.1.2.  */
8771
8772 static void
8773 bad_specifiers (object, type, virtualp, quals, inlinep, friendp, raises)
8774      tree object;
8775      const char *type;
8776      int virtualp, quals, friendp, raises, inlinep;
8777 {
8778   if (virtualp)
8779     cp_error ("`%D' declared as a `virtual' %s", object, type);
8780   if (inlinep)
8781     cp_error ("`%D' declared as an `inline' %s", object, type);
8782   if (quals)
8783     cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8784               object, type);
8785   if (friendp)
8786     cp_error_at ("`%D' declared as a friend", object);
8787   if (raises)
8788     cp_error_at ("`%D' declared with an exception specification", object);
8789 }
8790
8791 /* CTYPE is class type, or null if non-class.
8792    TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8793    or METHOD_TYPE.
8794    DECLARATOR is the function's name.
8795    VIRTUALP is truthvalue of whether the function is virtual or not.
8796    FLAGS are to be passed through to `grokclassfn'.
8797    QUALS are qualifiers indicating whether the function is `const'
8798    or `volatile'.
8799    RAISES is a list of exceptions that this function can raise.
8800    CHECK is 1 if we must find this method in CTYPE, 0 if we should
8801    not look, and -1 if we should not call `grokclassfn' at all.
8802
8803    Returns `NULL_TREE' if something goes wrong, after issuing
8804    applicable error messages.  */
8805
8806 static tree
8807 grokfndecl (ctype, type, declarator, orig_declarator, virtualp, flags, quals,
8808             raises, check, friendp, publicp, inlinep, funcdef_flag,
8809             template_count, in_namespace)
8810      tree ctype, type;
8811      tree declarator;
8812      tree orig_declarator;
8813      int virtualp;
8814      enum overload_flags flags;
8815      tree quals, raises;
8816      int check, friendp, publicp, inlinep, funcdef_flag, template_count;
8817      tree in_namespace;
8818 {
8819   tree cname, decl;
8820   int staticp = ctype && TREE_CODE (type) == FUNCTION_TYPE;
8821   int has_default_arg = 0;
8822   tree t;
8823
8824   if (ctype)
8825     cname = TREE_CODE (TYPE_NAME (ctype)) == TYPE_DECL
8826       ? TYPE_IDENTIFIER (ctype) : TYPE_NAME (ctype);
8827   else
8828     cname = NULL_TREE;
8829
8830   if (raises)
8831     {
8832       type = build_exception_variant (type, raises);
8833     }
8834
8835   decl = build_lang_decl (FUNCTION_DECL, declarator, type);
8836   /* Propagate volatile out from type to decl. */
8837   if (TYPE_VOLATILE (type))
8838     TREE_THIS_VOLATILE (decl) = 1;
8839
8840   /* If this decl has namespace scope, set that up.  */
8841   if (in_namespace)
8842     set_decl_namespace (decl, in_namespace, friendp);
8843   else if (!ctype)
8844     DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
8845
8846   /* `main' and builtins have implicit 'C' linkage.  */
8847   if ((MAIN_NAME_P (declarator)
8848        || (IDENTIFIER_LENGTH (declarator) > 10
8849            && IDENTIFIER_POINTER (declarator)[0] == '_'
8850            && IDENTIFIER_POINTER (declarator)[1] == '_'
8851            && strncmp (IDENTIFIER_POINTER (declarator)+2, "builtin_", 8) == 0))
8852       && current_lang_name == lang_name_cplusplus
8853       && ctype == NULL_TREE
8854       /* NULL_TREE means global namespace.  */
8855       && DECL_CONTEXT (decl) == NULL_TREE)
8856     DECL_LANGUAGE (decl) = lang_c;
8857
8858   /* Should probably propagate const out from type to decl I bet (mrs).  */
8859   if (staticp)
8860     {
8861       DECL_STATIC_FUNCTION_P (decl) = 1;
8862       DECL_CONTEXT (decl) = ctype;
8863     }
8864
8865   if (ctype)
8866     DECL_CONTEXT (decl) = ctype;
8867
8868   if (ctype == NULL_TREE && DECL_MAIN_P (decl))
8869     {
8870       if (processing_template_decl)
8871         error ("cannot declare `::main' to be a template");
8872       if (inlinep)
8873         error ("cannot declare `::main' to be inline");
8874       if (!publicp)
8875         error ("cannot declare `::main' to be static");
8876       if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)),
8877                         integer_type_node))
8878         error ("`main' must return `int'");
8879       inlinep = 0;
8880       publicp = 1;
8881     }
8882
8883   /* Members of anonymous types and local classes have no linkage; make
8884      them internal.  */
8885   if (ctype && (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype))
8886                 || decl_function_context (TYPE_MAIN_DECL (ctype))))
8887     publicp = 0;
8888
8889   if (publicp)
8890     {
8891       /* [basic.link]: A name with no linkage (notably, the name of a class
8892          or enumeration declared in a local scope) shall not be used to
8893          declare an entity with linkage.
8894
8895          Only check this for public decls for now.  */
8896       t = no_linkage_check (TREE_TYPE (decl));
8897       if (t)
8898         {
8899           if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
8900             {
8901               if (DECL_EXTERN_C_P (decl))
8902                 /* Allow this; it's pretty common in C.  */;
8903               else
8904                 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8905                             decl);
8906             }
8907           else
8908             cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8909                         decl, t);
8910         }
8911     }
8912
8913   TREE_PUBLIC (decl) = publicp;
8914   if (! publicp)
8915     {
8916       DECL_INTERFACE_KNOWN (decl) = 1;
8917       DECL_NOT_REALLY_EXTERN (decl) = 1;
8918     }
8919
8920   if (inlinep)
8921     DECL_THIS_INLINE (decl) = DECL_INLINE (decl) = 1;
8922
8923   DECL_EXTERNAL (decl) = 1;
8924   if (quals != NULL_TREE && TREE_CODE (type) == FUNCTION_TYPE)
8925     {
8926       cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8927                 (ctype ? "static " : "non-"), decl, TREE_VALUE (quals));
8928       quals = NULL_TREE;
8929     }
8930
8931   if (IDENTIFIER_OPNAME_P (DECL_NAME (decl)))
8932     grok_op_properties (decl, virtualp, check < 0);
8933
8934   if (ctype && decl_function_context (decl))
8935     DECL_NO_STATIC_CHAIN (decl) = 1;
8936
8937   for (t = TYPE_ARG_TYPES (TREE_TYPE (decl)); t; t = TREE_CHAIN (t))
8938     if (TREE_PURPOSE (t)
8939         && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
8940       {
8941         has_default_arg = 1;
8942         break;
8943       }
8944
8945   if (friendp
8946       && TREE_CODE (orig_declarator) == TEMPLATE_ID_EXPR)
8947     {
8948       if (funcdef_flag)
8949         cp_error
8950           ("defining explicit specialization `%D' in friend declaration",
8951            orig_declarator);
8952       else
8953         {
8954           if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8955             {
8956               /* Something like `template <class T> friend void f<T>()'.  */
8957               cp_error ("invalid use of template-id `%D' in declaration of primary template",
8958                         orig_declarator);
8959               return NULL_TREE;
8960             }
8961
8962
8963           /* A friend declaration of the form friend void f<>().  Record
8964              the information in the TEMPLATE_ID_EXPR.  */
8965           SET_DECL_IMPLICIT_INSTANTIATION (decl);
8966           DECL_TEMPLATE_INFO (decl)
8967             = tree_cons (TREE_OPERAND (orig_declarator, 0),
8968                          TREE_OPERAND (orig_declarator, 1),
8969                          NULL_TREE);
8970
8971           if (has_default_arg)
8972             {
8973               cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8974                         decl);
8975               return NULL_TREE;
8976             }
8977
8978           if (inlinep)
8979             {
8980               cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8981                         decl);
8982               return NULL_TREE;
8983             }
8984         }
8985     }
8986
8987   if (has_default_arg)
8988     add_defarg_fn (decl);
8989
8990   /* Plain overloading: will not be grok'd by grokclassfn.  */
8991   if (! ctype && ! processing_template_decl
8992       && !DECL_EXTERN_C_P (decl)
8993       && (! DECL_USE_TEMPLATE (decl) || name_mangling_version < 1))
8994     set_mangled_name_for_decl (decl);
8995
8996   if (funcdef_flag)
8997     /* Make the init_value nonzero so pushdecl knows this is not
8998        tentative.  error_mark_node is replaced later with the BLOCK.  */
8999     DECL_INITIAL (decl) = error_mark_node;
9000
9001   if (TYPE_NOTHROW_P (type) || nothrow_libfn_p (decl))
9002     TREE_NOTHROW (decl) = 1;
9003
9004   /* Caller will do the rest of this.  */
9005   if (check < 0)
9006     return decl;
9007
9008   if (flags == NO_SPECIAL && ctype && constructor_name (cname) == declarator)
9009     DECL_CONSTRUCTOR_P (decl) = 1;
9010
9011   /* Function gets the ugly name, field gets the nice one.  This call
9012      may change the type of the function (because of default
9013      parameters)!  */
9014   if (ctype != NULL_TREE)
9015     grokclassfn (ctype, decl, flags, quals);
9016
9017   decl = check_explicit_specialization (orig_declarator, decl,
9018                                         template_count,
9019                                         2 * (funcdef_flag != 0) +
9020                                         4 * (friendp != 0));
9021   if (decl == error_mark_node)
9022     return NULL_TREE;
9023
9024   if (ctype != NULL_TREE
9025       && (! TYPE_FOR_JAVA (ctype) || check_java_method (decl))
9026       && check)
9027     {
9028       tree old_decl;
9029
9030       old_decl = check_classfn (ctype, decl);
9031
9032       if (old_decl && TREE_CODE (old_decl) == TEMPLATE_DECL)
9033         /* Because grokfndecl is always supposed to return a
9034            FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
9035            here.  We depend on our callers to figure out that its
9036            really a template that's being returned.  */
9037         old_decl = DECL_TEMPLATE_RESULT (old_decl);
9038
9039       if (old_decl && DECL_STATIC_FUNCTION_P (old_decl)
9040           && TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE)
9041         {
9042           /* Remove the `this' parm added by grokclassfn.
9043              XXX Isn't this done in start_function, too?  */
9044           revert_static_member_fn (decl);
9045           last_function_parms = TREE_CHAIN (last_function_parms);
9046         }
9047       if (old_decl && DECL_ARTIFICIAL (old_decl))
9048         cp_error ("definition of implicitly-declared `%D'", old_decl);
9049
9050       if (old_decl)
9051         {
9052           /* Since we've smashed OLD_DECL to its
9053              DECL_TEMPLATE_RESULT, we must do the same to DECL.  */
9054           if (TREE_CODE (decl) == TEMPLATE_DECL)
9055             decl = DECL_TEMPLATE_RESULT (decl);
9056
9057           /* Attempt to merge the declarations.  This can fail, in
9058              the case of some illegal specialization declarations.  */
9059           if (!duplicate_decls (decl, old_decl))
9060             cp_error ("no `%#D' member function declared in class `%T'",
9061                       decl, ctype);
9062           return old_decl;
9063         }
9064     }
9065
9066   if (DECL_CONSTRUCTOR_P (decl) && !grok_ctor_properties (ctype, decl))
9067     return NULL_TREE;
9068
9069   if (ctype == NULL_TREE || check)
9070     return decl;
9071
9072   if (virtualp)
9073     {
9074       DECL_VIRTUAL_P (decl) = 1;
9075       if (DECL_VINDEX (decl) == NULL_TREE)
9076         DECL_VINDEX (decl) = error_mark_node;
9077       IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1;
9078     }
9079
9080   return decl;
9081 }
9082
9083 static tree
9084 grokvardecl (type, declarator, specbits_in, initialized, constp, in_namespace)
9085      tree type;
9086      tree declarator;
9087      RID_BIT_TYPE *specbits_in;
9088      int initialized;
9089      int constp;
9090      tree in_namespace;
9091 {
9092   tree decl;
9093   RID_BIT_TYPE specbits;
9094
9095   specbits = *specbits_in;
9096
9097   if (TREE_CODE (type) == OFFSET_TYPE)
9098     {
9099       /* If you declare a static member so that it
9100          can be initialized, the code will reach here.  */
9101       tree basetype = TYPE_OFFSET_BASETYPE (type);
9102       type = TREE_TYPE (type);
9103       decl = build_lang_decl (VAR_DECL, declarator, type);
9104       DECL_CONTEXT (decl) = basetype;
9105       /* DECL_ASSEMBLER_NAME is needed only for full-instantiated
9106          templates.  */
9107       if (!uses_template_parms (decl))
9108         {
9109           if (flag_new_abi)
9110             DECL_ASSEMBLER_NAME (decl) = mangle_decl (decl);
9111           else
9112             DECL_ASSEMBLER_NAME (decl) = build_static_name (basetype,
9113                                                             declarator);
9114         }
9115     }
9116   else
9117     {
9118       tree context;
9119
9120       if (in_namespace)
9121         context = in_namespace;
9122       else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN, specbits))
9123         context = current_namespace;
9124       else
9125         context = NULL_TREE;
9126
9127       if (processing_template_decl && context)
9128         /* For global variables, declared in a template, we need the
9129            full lang_decl.  */
9130         decl = build_lang_decl (VAR_DECL, declarator, type);
9131       else
9132         decl = build_decl (VAR_DECL, declarator, type);
9133
9134       if (context)
9135         set_decl_namespace (decl, context, 0);
9136
9137       context = DECL_CONTEXT (decl);
9138       if (declarator && context && current_lang_name != lang_name_c)
9139         {
9140           if (flag_new_abi)
9141             DECL_ASSEMBLER_NAME (decl) = mangle_decl (decl);
9142           else
9143             DECL_ASSEMBLER_NAME (decl)
9144               = build_static_name (context, declarator);
9145         }
9146     }
9147
9148   if (in_namespace)
9149     set_decl_namespace (decl, in_namespace, 0);
9150
9151   if (RIDBIT_SETP (RID_EXTERN, specbits))
9152     {
9153       DECL_THIS_EXTERN (decl) = 1;
9154       DECL_EXTERNAL (decl) = !initialized;
9155     }
9156
9157   /* In class context, static means one per class,
9158      public access, and static storage.  */
9159   if (DECL_CLASS_SCOPE_P (decl))
9160     {
9161       TREE_PUBLIC (decl) = 1;
9162       TREE_STATIC (decl) = 1;
9163       DECL_EXTERNAL (decl) = 0;
9164     }
9165   /* At top level, either `static' or no s.c. makes a definition
9166      (perhaps tentative), and absence of `static' makes it public.  */
9167   else if (toplevel_bindings_p ())
9168     {
9169       TREE_PUBLIC (decl) = (RIDBIT_NOTSETP (RID_STATIC, specbits)
9170                             && (DECL_THIS_EXTERN (decl) || ! constp));
9171       TREE_STATIC (decl) = ! DECL_EXTERNAL (decl);
9172     }
9173   /* Not at top level, only `static' makes a static definition.  */
9174   else
9175     {
9176       TREE_STATIC (decl) = !! RIDBIT_SETP (RID_STATIC, specbits);
9177       TREE_PUBLIC (decl) = DECL_EXTERNAL (decl);
9178     }
9179
9180   if (TREE_PUBLIC (decl))
9181     {
9182       /* [basic.link]: A name with no linkage (notably, the name of a class
9183          or enumeration declared in a local scope) shall not be used to
9184          declare an entity with linkage.
9185
9186          Only check this for public decls for now.  */
9187       tree t = no_linkage_check (TREE_TYPE (decl));
9188       if (t)
9189         {
9190           if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
9191             /* Ignore for now; `enum { foo } e' is pretty common.  */;
9192           else
9193             cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9194                         decl, t);
9195         }
9196     }
9197
9198   return decl;
9199 }
9200
9201 /* Create and return a canonical pointer to member function type, for
9202    TYPE, which is a POINTER_TYPE to a METHOD_TYPE.  */
9203
9204 tree
9205 build_ptrmemfunc_type (type)
9206      tree type;
9207 {
9208   tree fields[4];
9209   tree t;
9210   tree u;
9211   tree unqualified_variant = NULL_TREE;
9212
9213   /* If a canonical type already exists for this type, use it.  We use
9214      this method instead of type_hash_canon, because it only does a
9215      simple equality check on the list of field members.  */
9216
9217   if ((t = TYPE_GET_PTRMEMFUNC_TYPE (type)))
9218     return t;
9219
9220   /* Make sure that we always have the unqualified pointer-to-member
9221      type first.  */
9222   if (CP_TYPE_QUALS (type) != TYPE_UNQUALIFIED)
9223     unqualified_variant
9224       = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type));
9225
9226   t = make_aggr_type (RECORD_TYPE);
9227   /* Let the front-end know this is a pointer to member function...  */
9228   TYPE_PTRMEMFUNC_FLAG (t) = 1;
9229   /* ... and not really an aggregate.  */
9230   SET_IS_AGGR_TYPE (t, 0);
9231
9232   if (!flag_new_abi)
9233     {
9234       u = make_aggr_type (UNION_TYPE);
9235       SET_IS_AGGR_TYPE (u, 0);
9236       fields[0] = build_decl (FIELD_DECL, pfn_identifier, type);
9237       fields[1] = build_decl (FIELD_DECL, delta2_identifier,
9238                               delta_type_node);
9239       finish_builtin_type (u, "__ptrmemfunc_type", fields, 1, ptr_type_node);
9240       TYPE_NAME (u) = NULL_TREE;
9241
9242       fields[0] = build_decl (FIELD_DECL, delta_identifier,
9243                               delta_type_node);
9244       fields[1] = build_decl (FIELD_DECL, index_identifier,
9245                               delta_type_node);
9246       fields[2] = build_decl (FIELD_DECL, pfn_or_delta2_identifier, u);
9247       finish_builtin_type (t, "__ptrmemfunc_type", fields, 2, ptr_type_node);
9248     }
9249   else
9250     {
9251       fields[0] = build_decl (FIELD_DECL, pfn_identifier, type);
9252       fields[1] = build_decl (FIELD_DECL, delta_identifier,
9253                               delta_type_node);
9254       finish_builtin_type (t, "__ptrmemfunc_type", fields, 1, ptr_type_node);
9255     }
9256
9257   /* Zap out the name so that the back-end will give us the debugging
9258      information for this anonymous RECORD_TYPE.  */
9259   TYPE_NAME (t) = NULL_TREE;
9260
9261   /* If this is not the unqualified form of this pointer-to-member
9262      type, set the TYPE_MAIN_VARIANT for this type to be the
9263      unqualified type.  Since they are actually RECORD_TYPEs that are
9264      not variants of each other, we must do this manually.  */
9265   if (CP_TYPE_QUALS (type) != TYPE_UNQUALIFIED)
9266     {
9267       t = build_qualified_type (t, CP_TYPE_QUALS (type));
9268       TYPE_MAIN_VARIANT (t) = unqualified_variant;
9269       TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (unqualified_variant);
9270       TYPE_NEXT_VARIANT (unqualified_variant) = t;
9271     }
9272
9273   /* Cache this pointer-to-member type so that we can find it again
9274      later.  */
9275   TYPE_SET_PTRMEMFUNC_TYPE (type, t);
9276
9277   /* Seems to be wanted.  */
9278   CLASSTYPE_GOT_SEMICOLON (t) = 1;
9279
9280   return t;
9281 }
9282
9283 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9284    Check to see that the definition is valid.  Issue appropriate error
9285    messages.  Return 1 if the definition is particularly bad, or 0
9286    otherwise.  */
9287
9288 int
9289 check_static_variable_definition (decl, type)
9290      tree decl;
9291      tree type;
9292 {
9293   /* Motion 10 at San Diego: If a static const integral data member is
9294      initialized with an integral constant expression, the initializer
9295      may appear either in the declaration (within the class), or in
9296      the definition, but not both.  If it appears in the class, the
9297      member is a member constant.  The file-scope definition is always
9298      required.  */
9299   if (CLASS_TYPE_P (type) || TREE_CODE (type) == REFERENCE_TYPE)
9300     {
9301       cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9302                 type);
9303       /* If we just return the declaration, crashes will sometimes
9304          occur.  We therefore return void_type_node, as if this was a
9305          friend declaration, to cause callers to completely ignore
9306          this declaration.  */
9307       return 1;
9308     }
9309   else if (!CP_TYPE_CONST_P (type))
9310     cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9311               decl);
9312   else if (pedantic && !INTEGRAL_TYPE_P (type))
9313     cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl, type);
9314
9315   return 0;
9316 }
9317
9318 /* Given the SIZE (i.e., number of elements) in an array, compute an
9319    appropriate index type for the array.  If non-NULL, NAME is the
9320    name of the thing being declared.  */
9321
9322 tree
9323 compute_array_index_type (name, size)
9324      tree name;
9325      tree size;
9326 {
9327   tree itype;
9328
9329   /* The size might be the result of a cast. */
9330   STRIP_TYPE_NOPS (size);
9331
9332   /* It might be a const variable or enumeration constant.  */
9333   size = decl_constant_value (size);
9334
9335   /* If this involves a template parameter, it will be a constant at
9336      instantiation time, but we don't know what the value is yet.
9337      Even if no template parameters are involved, we may an expression
9338      that is not a constant; we don't even simplify `1 + 2' when
9339      processing a template.  */
9340   if (processing_template_decl)
9341     {
9342       /* Resolve a qualified reference to an enumerator or static
9343          const data member of ours.  */
9344       if (TREE_CODE (size) == SCOPE_REF
9345           && TREE_OPERAND (size, 0) == current_class_type)
9346         {
9347           tree t = lookup_field (current_class_type,
9348                                  TREE_OPERAND (size, 1), 0, 0);
9349           if (t)
9350             size = t;
9351         }
9352
9353       return build_index_type (build_min (MINUS_EXPR, sizetype,
9354                                           size, integer_one_node));
9355     }
9356
9357   /* The array bound must be an integer type.  */
9358   if (TREE_CODE (TREE_TYPE (size)) != INTEGER_TYPE
9359       && TREE_CODE (TREE_TYPE (size)) != ENUMERAL_TYPE
9360       && TREE_CODE (TREE_TYPE (size)) != BOOLEAN_TYPE)
9361     {
9362       if (name)
9363         cp_error ("size of array `%D' has non-integer type", name);
9364       else
9365         cp_error ("size of array has non-integer type");
9366       size = integer_one_node;
9367     }
9368
9369   /* Normally, the array-bound will be a constant.  */
9370   if (TREE_CODE (size) == INTEGER_CST)
9371     {
9372       /* Check to see if the array bound overflowed.  Make that an
9373          error, no matter how generous we're being.  */
9374       int old_flag_pedantic_errors = flag_pedantic_errors;
9375       int old_pedantic = pedantic;
9376       pedantic = flag_pedantic_errors = 1;
9377       constant_expression_warning (size);
9378       pedantic = old_pedantic;
9379       flag_pedantic_errors = old_flag_pedantic_errors;
9380
9381       /* An array must have a positive number of elements.  */
9382       if (INT_CST_LT (size, integer_zero_node))
9383         {
9384           if (name)
9385             cp_error ("size of array `%D' is negative", name);
9386           else
9387             cp_error ("size of array is negative");
9388           size = integer_one_node;
9389         }
9390       /* Except that an extension we allow zero-sized arrays.  We
9391          always allow them in system headers because glibc uses
9392          them.  */
9393       else if (integer_zerop (size) && pedantic && !in_system_header)
9394         {
9395           if (name)
9396             cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name);
9397           else
9398             cp_pedwarn ("ISO C++ forbids zero-size array");
9399         }
9400     }
9401   else if (TREE_CONSTANT (size))
9402     {
9403       /* `(int) &fn' is not a valid array bound.  */
9404       if (name)
9405         cp_error ("size of array `%D' is not an integral constant-expression",
9406                   name);
9407       else
9408         cp_error ("size of array is not an integral constant-expression");
9409     }
9410
9411   /* Compute the index of the largest element in the array.  It is
9412      one less than the number of elements in the array.  */
9413   itype
9414     = fold (cp_build_binary_op (MINUS_EXPR,
9415                                 cp_convert (ssizetype, size),
9416                                 cp_convert (ssizetype,
9417                                             integer_one_node)));
9418
9419   /* Check for variable-sized arrays.  We allow such things as an
9420      extension, even though they are not allowed in ANSI/ISO C++.  */
9421   if (!TREE_CONSTANT (itype))
9422     {
9423       if (pedantic)
9424         {
9425           if (name)
9426             cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9427                         name);
9428           else
9429             cp_pedwarn ("ISO C++ forbids variable-size array");
9430         }
9431
9432       /* Create a variable-sized array index type.  */
9433       itype = variable_size (itype);
9434     }
9435   /* Make sure that there was no overflow when creating to a signed
9436      index type.  (For example, on a 32-bit machine, an array with
9437      size 2^32 - 1 is too big.)  */
9438   else if (TREE_OVERFLOW (itype))
9439     {
9440       error ("overflow in array dimension");
9441       TREE_OVERFLOW (itype) = 0;
9442     }
9443
9444   /* Create and return the appropriate index type.  */
9445   return build_index_type (itype);
9446 }
9447
9448 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9449    indicated TYPE.  If non-NULL, NAME is the NAME of the declaration
9450    with this type.  */
9451
9452 static tree
9453 create_array_type_for_decl (name, type, size)
9454      tree name;
9455      tree type;
9456      tree size;
9457 {
9458   tree itype = NULL_TREE;
9459   const char* error_msg;
9460
9461   /* If things have already gone awry, bail now.  */
9462   if (type == error_mark_node || size == error_mark_node)
9463     return error_mark_node;
9464
9465   /* Assume that everything will go OK.  */
9466   error_msg = NULL;
9467
9468   /* There are some types which cannot be array elements.  */
9469   switch (TREE_CODE (type))
9470     {
9471     case VOID_TYPE:
9472       error_msg = "array of void";
9473       break;
9474
9475     case FUNCTION_TYPE:
9476       error_msg = "array of functions";
9477       break;
9478
9479     case REFERENCE_TYPE:
9480       error_msg = "array of references";
9481       break;
9482
9483     case OFFSET_TYPE:
9484       error_msg = "array of data members";
9485       break;
9486
9487     case METHOD_TYPE:
9488       error_msg = "array of function members";
9489       break;
9490
9491     default:
9492       break;
9493     }
9494
9495   /* If something went wrong, issue an error-message and return.  */
9496   if (error_msg)
9497     {
9498       if (name)
9499         cp_error ("declaration of `%D' as %s", name, error_msg);
9500       else
9501         cp_error ("creating %s", error_msg);
9502
9503       return error_mark_node;
9504     }
9505
9506   /* [dcl.array]
9507
9508      The constant expressions that specify the bounds of the arrays
9509      can be omitted only for the first member of the sequence.  */
9510   if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
9511     {
9512       cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9513                 name);
9514
9515       return error_mark_node;
9516     }
9517
9518   /* Figure out the index type for the array.  */
9519   if (size)
9520     itype = compute_array_index_type (name, size);
9521
9522   return build_cplus_array_type (type, itype);
9523 }
9524
9525 /* Check that it's OK to declare a function with the indicated TYPE.
9526    SFK indicates the kind of special function (if any) that this
9527    function is.  CTYPE is the class of which this function is a
9528    member.  OPTYPE is the type given in a conversion operator
9529    declaration.  Returns the actual return type of the function; that
9530    may be different than TYPE if an error occurs, or for certain
9531    special functions.  */
9532
9533 static tree
9534 check_special_function_return_type (sfk, type, ctype, optype)
9535      special_function_kind sfk;
9536      tree type;
9537      tree ctype;
9538      tree optype;
9539 {
9540   switch (sfk)
9541     {
9542     case sfk_constructor:
9543       if (type)
9544         cp_error ("return type specification for constructor invalid");
9545
9546       /* In the old ABI, we return `this'; in the new ABI we don't
9547          bother.  */
9548       type = flag_new_abi ? void_type_node : build_pointer_type (ctype);
9549       break;
9550
9551     case sfk_destructor:
9552       if (type)
9553         cp_error ("return type specification for destructor invalid");
9554       type = void_type_node;
9555       break;
9556
9557     case sfk_conversion:
9558       if (type && !same_type_p (type, optype))
9559         cp_error ("operator `%T' declared to return `%T'", optype, type);
9560       else if (type)
9561         cp_pedwarn ("return type specified for `operator %T'",  optype);
9562       type = optype;
9563       break;
9564
9565     default:
9566       my_friendly_abort (20000408);
9567       break;
9568     }
9569
9570   return type;
9571 }
9572
9573 /* Given declspecs and a declarator,
9574    determine the name and type of the object declared
9575    and construct a ..._DECL node for it.
9576    (In one case we can return a ..._TYPE node instead.
9577     For invalid input we sometimes return 0.)
9578
9579    DECLSPECS is a chain of tree_list nodes whose value fields
9580     are the storage classes and type specifiers.
9581
9582    DECL_CONTEXT says which syntactic context this declaration is in:
9583      NORMAL for most contexts.  Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9584      FUNCDEF for a function definition.  Like NORMAL but a few different
9585       error messages in each case.  Return value may be zero meaning
9586       this definition is too screwy to try to parse.
9587      MEMFUNCDEF for a function definition.  Like FUNCDEF but prepares to
9588       handle member functions (which have FIELD context).
9589       Return value may be zero meaning this definition is too screwy to
9590       try to parse.
9591      PARM for a parameter declaration (either within a function prototype
9592       or before a function body).  Make a PARM_DECL, or return void_type_node.
9593      CATCHPARM for a parameter declaration before a catch clause.
9594      TYPENAME if for a typename (in a cast or sizeof).
9595       Don't make a DECL node; just return the ..._TYPE node.
9596      FIELD for a struct or union field; make a FIELD_DECL.
9597      BITFIELD for a field with specified width.
9598    INITIALIZED is 1 if the decl has an initializer.
9599
9600    ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9601    normal attributes in TREE_PURPOSE, or NULL_TREE.
9602
9603    In the TYPENAME case, DECLARATOR is really an abstract declarator.
9604    It may also be so in the PARM case, for a prototype where the
9605    argument type is specified but not the name.
9606
9607    This function is where the complicated C meanings of `static'
9608    and `extern' are interpreted.
9609
9610    For C++, if there is any monkey business to do, the function which
9611    calls this one must do it, i.e., prepending instance variables,
9612    renaming overloaded function names, etc.
9613
9614    Note that for this C++, it is an error to define a method within a class
9615    which does not belong to that class.
9616
9617    Except in the case where SCOPE_REFs are implicitly known (such as
9618    methods within a class being redundantly qualified),
9619    declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9620    (class_name::decl_name).  The caller must also deal with this.
9621
9622    If a constructor or destructor is seen, and the context is FIELD,
9623    then the type gains the attribute TREE_HAS_x.  If such a declaration
9624    is erroneous, NULL_TREE is returned.
9625
9626    QUALS is used only for FUNCDEF and MEMFUNCDEF cases.  For a member
9627    function, these are the qualifiers to give to the `this' pointer. We
9628    apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9629
9630    May return void_type_node if the declarator turned out to be a friend.
9631    See grokfield for details.  */
9632
9633 tree
9634 grokdeclarator (declarator, declspecs, decl_context, initialized, attrlist)
9635      tree declspecs;
9636      tree declarator;
9637      enum decl_context decl_context;
9638      int initialized;
9639      tree attrlist;
9640 {
9641   RID_BIT_TYPE specbits;
9642   int nclasses = 0;
9643   tree spec;
9644   tree type = NULL_TREE;
9645   int longlong = 0;
9646   int constp;
9647   int restrictp;
9648   int volatilep;
9649   int type_quals;
9650   int virtualp, explicitp, friendp, inlinep, staticp;
9651   int explicit_int = 0;
9652   int explicit_char = 0;
9653   int defaulted_int = 0;
9654   tree typedef_decl = NULL_TREE;
9655   const char *name;
9656   tree typedef_type = NULL_TREE;
9657   int funcdef_flag = 0;
9658   enum tree_code innermost_code = ERROR_MARK;
9659   int bitfield = 0;
9660 #if 0
9661   /* See the code below that used this.  */
9662   tree decl_machine_attr = NULL_TREE;
9663 #endif
9664   /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9665      All FIELD_DECLs we build here have `init' put into their DECL_INITIAL.  */
9666   tree init = NULL_TREE;
9667
9668   /* Keep track of what sort of function is being processed
9669      so that we can warn about default return values, or explicit
9670      return values which do not match prescribed defaults.  */
9671   special_function_kind sfk = sfk_none;
9672
9673   tree dname = NULL_TREE;
9674   tree ctype = current_class_type;
9675   tree ctor_return_type = NULL_TREE;
9676   enum overload_flags flags = NO_SPECIAL;
9677   tree quals = NULL_TREE;
9678   tree raises = NULL_TREE;
9679   int template_count = 0;
9680   tree in_namespace = NULL_TREE;
9681   tree inner_attrs;
9682   int ignore_attrs;
9683
9684   RIDBIT_RESET_ALL (specbits);
9685   if (decl_context == FUNCDEF)
9686     funcdef_flag = 1, decl_context = NORMAL;
9687   else if (decl_context == MEMFUNCDEF)
9688     funcdef_flag = -1, decl_context = FIELD;
9689   else if (decl_context == BITFIELD)
9690     bitfield = 1, decl_context = FIELD;
9691
9692   /* Look inside a declarator for the name being declared
9693      and get it as a string, for an error message.  */
9694   {
9695     tree *next = &declarator;
9696     register tree decl;
9697     name = NULL;
9698
9699     while (next && *next)
9700       {
9701         decl = *next;
9702         switch (TREE_CODE (decl))
9703           {
9704           case TREE_LIST:
9705             /* For attributes.  */
9706             next = &TREE_VALUE (decl);
9707             break;
9708
9709           case COND_EXPR:
9710             ctype = NULL_TREE;
9711             next = &TREE_OPERAND (decl, 0);
9712             break;
9713
9714           case BIT_NOT_EXPR:    /* For C++ destructors!  */
9715             {
9716               tree name = TREE_OPERAND (decl, 0);
9717               tree rename = NULL_TREE;
9718
9719               my_friendly_assert (flags == NO_SPECIAL, 152);
9720               flags = DTOR_FLAG;
9721               sfk = sfk_destructor;
9722               if (TREE_CODE (name) == TYPE_DECL)
9723                 TREE_OPERAND (decl, 0) = name = constructor_name (name);
9724               my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 153);
9725               if (ctype == NULL_TREE)
9726                 {
9727                   if (current_class_type == NULL_TREE)
9728                     {
9729                       error ("destructors must be member functions");
9730                       flags = NO_SPECIAL;
9731                     }
9732                   else
9733                     {
9734                       tree t = constructor_name (current_class_name);
9735                       if (t != name)
9736                         rename = t;
9737                     }
9738                 }
9739               else
9740                 {
9741                   tree t = constructor_name (ctype);
9742                   if (t != name)
9743                     rename = t;
9744                 }
9745
9746               if (rename)
9747                 {
9748                   cp_error ("destructor `%T' must match class name `%T'",
9749                             name, rename);
9750                   TREE_OPERAND (decl, 0) = rename;
9751                 }
9752               next = &name;
9753             }
9754             break;
9755
9756           case ADDR_EXPR:       /* C++ reference declaration */
9757             /* Fall through. */
9758           case ARRAY_REF:
9759           case INDIRECT_REF:
9760             ctype = NULL_TREE;
9761             innermost_code = TREE_CODE (decl);
9762             next = &TREE_OPERAND (decl, 0);
9763             break;
9764
9765           case CALL_EXPR:
9766             if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl)))
9767               {
9768                 /* This is actually a variable declaration using
9769                    constructor syntax.  We need to call start_decl and
9770                    cp_finish_decl so we can get the variable
9771                    initialized...  */
9772
9773                 tree attributes, prefix_attributes;
9774
9775                 *next = TREE_OPERAND (decl, 0);
9776                 init = CALL_DECLARATOR_PARMS (decl);
9777
9778                 if (attrlist)
9779                   {
9780                     attributes = TREE_PURPOSE (attrlist);
9781                     prefix_attributes = TREE_VALUE (attrlist);
9782                   }
9783                 else
9784                   {
9785                     attributes = NULL_TREE;
9786                     prefix_attributes = NULL_TREE;
9787                   }
9788
9789                 decl = start_decl (declarator, declspecs, 1,
9790                                    attributes, prefix_attributes);
9791                 decl_type_access_control (decl);
9792                 if (decl)
9793                   {
9794                     /* Look for __unused__ attribute */
9795                     if (TREE_USED (TREE_TYPE (decl)))
9796                       TREE_USED (decl) = 1;
9797                     finish_decl (decl, init, NULL_TREE);
9798                   }
9799                 else
9800                   cp_error ("invalid declarator");
9801                 return 0;
9802               }
9803             innermost_code = TREE_CODE (decl);
9804             if (decl_context == FIELD && ctype == NULL_TREE)
9805               ctype = current_class_type;
9806             if (ctype
9807                 && TREE_OPERAND (decl, 0)
9808                 && (TREE_CODE (TREE_OPERAND (decl, 0)) == TYPE_DECL
9809                     && ((DECL_NAME (TREE_OPERAND (decl, 0))
9810                          == constructor_name_full (ctype))
9811                         || (DECL_NAME (TREE_OPERAND (decl, 0))
9812                             == constructor_name (ctype)))))
9813               TREE_OPERAND (decl, 0) = constructor_name (ctype);
9814             next = &TREE_OPERAND (decl, 0);
9815             decl = *next;
9816             if (ctype != NULL_TREE
9817                 && decl != NULL_TREE && flags != DTOR_FLAG
9818                 && decl == constructor_name (ctype))
9819               {
9820                 sfk = sfk_constructor;
9821                 ctor_return_type = ctype;
9822               }
9823             ctype = NULL_TREE;
9824             break;
9825
9826           case TEMPLATE_ID_EXPR:
9827               {
9828                 tree fns = TREE_OPERAND (decl, 0);
9829
9830                 if (TREE_CODE (fns) == LOOKUP_EXPR)
9831                   fns = TREE_OPERAND (fns, 0);
9832
9833                 dname = fns;
9834                 if (TREE_CODE (dname) == COMPONENT_REF)
9835                   dname = TREE_OPERAND (dname, 1);
9836                 if (TREE_CODE (dname) != IDENTIFIER_NODE)
9837                   {
9838                     my_friendly_assert (is_overloaded_fn (dname),
9839                                         19990331);
9840                     dname = DECL_NAME (get_first_fn (dname));
9841                   }
9842               }
9843           /* Fall through. */
9844
9845           case IDENTIFIER_NODE:
9846             if (TREE_CODE (decl) == IDENTIFIER_NODE)
9847               dname = decl;
9848
9849             next = 0;
9850
9851             if (C_IS_RESERVED_WORD (dname))
9852               {
9853                 cp_error ("declarator-id missing; using reserved word `%D'",
9854                           dname);
9855                 name = IDENTIFIER_POINTER (dname);
9856               }
9857             else if (!IDENTIFIER_TYPENAME_P (dname))
9858               name = IDENTIFIER_POINTER (dname);
9859             else
9860               {
9861                 my_friendly_assert (flags == NO_SPECIAL, 154);
9862                 flags = TYPENAME_FLAG;
9863                 ctor_return_type = TREE_TYPE (dname);
9864                 sfk = sfk_conversion;
9865                 if (IDENTIFIER_GLOBAL_VALUE (dname)
9866                     && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname))
9867                         == TYPE_DECL))
9868                   name = IDENTIFIER_POINTER (dname);
9869                 else
9870                   name = "<invalid operator>";
9871               }
9872             break;
9873
9874             /* C++ extension */
9875           case SCOPE_REF:
9876             {
9877               /* Perform error checking, and decide on a ctype.  */
9878               tree cname = TREE_OPERAND (decl, 0);
9879               if (cname == NULL_TREE)
9880                 ctype = NULL_TREE;
9881               else if (TREE_CODE (cname) == NAMESPACE_DECL)
9882                 {
9883                   ctype = NULL_TREE;
9884                   in_namespace = TREE_OPERAND (decl, 0);
9885                   TREE_OPERAND (decl, 0) = NULL_TREE;
9886                 }
9887               else if (! is_aggr_type (cname, 1))
9888                 TREE_OPERAND (decl, 0) = NULL_TREE;
9889               /* Must test TREE_OPERAND (decl, 1), in case user gives
9890                  us `typedef (class::memfunc)(int); memfunc *memfuncptr;'  */
9891               else if (TREE_OPERAND (decl, 1)
9892                        && TREE_CODE (TREE_OPERAND (decl, 1)) == INDIRECT_REF)
9893                 ctype = cname;
9894               else if (TREE_CODE (cname) == TEMPLATE_TYPE_PARM
9895                        || TREE_CODE (cname) == BOUND_TEMPLATE_TEMPLATE_PARM)
9896                 {
9897                   cp_error ("`%T::%D' is not a valid declarator", cname,
9898                             TREE_OPERAND (decl, 1));
9899                   cp_error ("  perhaps you want `typename %T::%D' to make it a type",
9900                             cname, TREE_OPERAND (decl, 1));
9901                   return void_type_node;
9902                 }
9903               else if (ctype == NULL_TREE)
9904                 ctype = cname;
9905               else if (TREE_COMPLEXITY (decl) == current_class_depth)
9906                 TREE_OPERAND (decl, 0) = ctype;
9907               else
9908                 {
9909                   if (! UNIQUELY_DERIVED_FROM_P (cname, ctype))
9910                     {
9911                       cp_error ("type `%T' is not derived from type `%T'",
9912                                 cname, ctype);
9913                       TREE_OPERAND (decl, 0) = NULL_TREE;
9914                     }
9915                   else
9916                     ctype = cname;
9917                 }
9918
9919               if (ctype && TREE_CODE (TREE_OPERAND (decl, 1)) == TYPE_DECL
9920                   && ((DECL_NAME (TREE_OPERAND (decl, 1))
9921                        == constructor_name_full (ctype))
9922                       || (DECL_NAME (TREE_OPERAND (decl, 1))
9923                           == constructor_name (ctype))))
9924                 TREE_OPERAND (decl, 1) = constructor_name (ctype);
9925               next = &TREE_OPERAND (decl, 1);
9926               decl = *next;
9927               if (ctype)
9928                 {
9929                   if (TREE_CODE (decl) == IDENTIFIER_NODE
9930                       && constructor_name (ctype) == decl)
9931                     {
9932                       sfk = sfk_constructor;
9933                       ctor_return_type = ctype;
9934                     }
9935                   else if (TREE_CODE (decl) == BIT_NOT_EXPR
9936                            && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
9937                            && (constructor_name (ctype) == TREE_OPERAND (decl, 0)
9938                                || constructor_name_full (ctype) == TREE_OPERAND (decl, 0)))
9939                     {
9940                       sfk = sfk_destructor;
9941                       ctor_return_type = ctype;
9942                       flags = DTOR_FLAG;
9943                       TREE_OPERAND (decl, 0) = constructor_name (ctype);
9944                       next = &TREE_OPERAND (decl, 0);
9945                     }
9946                 }
9947             }
9948             break;
9949
9950           case ERROR_MARK:
9951             next = 0;
9952             break;
9953
9954           case TYPE_DECL:
9955             /* Parse error puts this typespec where
9956                a declarator should go.  */
9957             cp_error ("`%T' specified as declarator-id", DECL_NAME (decl));
9958             if (TREE_TYPE (decl) == current_class_type)
9959               cp_error ("  perhaps you want `%T' for a constructor",
9960                         current_class_name);
9961             dname = DECL_NAME (decl);
9962             name = IDENTIFIER_POINTER (dname);
9963
9964             /* Avoid giving two errors for this.  */
9965             IDENTIFIER_CLASS_VALUE (dname) = NULL_TREE;
9966
9967             declspecs = tree_cons (NULL_TREE, integer_type_node, declspecs);
9968             *next = dname;
9969             next = 0;
9970             break;
9971
9972           default:
9973             cp_compiler_error ("`%D' as declarator", decl);
9974             return 0; /* We used to do a 155 abort here.  */
9975           }
9976       }
9977   }
9978
9979   /* A function definition's declarator must have the form of
9980      a function declarator.  */
9981
9982   if (funcdef_flag && innermost_code != CALL_EXPR)
9983     return 0;
9984
9985   if (((dname && IDENTIFIER_OPNAME_P (dname)) || flags == TYPENAME_FLAG)
9986       && innermost_code != CALL_EXPR
9987       && ! (ctype && declspecs == NULL_TREE))
9988     {
9989       cp_error ("declaration of `%D' as non-function", dname);
9990       return void_type_node;
9991     }
9992
9993   /* Anything declared one level down from the top level
9994      must be one of the parameters of a function
9995      (because the body is at least two levels down).  */
9996
9997   /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9998      by not allowing C++ class definitions to specify their parameters
9999      with xdecls (must be spec.d in the parmlist).
10000
10001      Since we now wait to push a class scope until we are sure that
10002      we are in a legitimate method context, we must set oldcname
10003      explicitly (since current_class_name is not yet alive).
10004
10005      We also want to avoid calling this a PARM if it is in a namespace.  */
10006
10007   if (decl_context == NORMAL && !toplevel_bindings_p ())
10008     {
10009       struct binding_level *b = current_binding_level;
10010       current_binding_level = b->level_chain;
10011       if (current_binding_level != 0 && toplevel_bindings_p ())
10012         decl_context = PARM;
10013       current_binding_level = b;
10014     }
10015
10016   if (name == NULL)
10017     name = decl_context == PARM ? "parameter" : "type name";
10018
10019   /* Look through the decl specs and record which ones appear.
10020      Some typespecs are defined as built-in typenames.
10021      Others, the ones that are modifiers of other types,
10022      are represented by bits in SPECBITS: set the bits for
10023      the modifiers that appear.  Storage class keywords are also in SPECBITS.
10024
10025      If there is a typedef name or a type, store the type in TYPE.
10026      This includes builtin typedefs such as `int'.
10027
10028      Set EXPLICIT_INT if the type is `int' or `char' and did not
10029      come from a user typedef.
10030
10031      Set LONGLONG if `long' is mentioned twice.
10032
10033      For C++, constructors and destructors have their own fast treatment.  */
10034
10035   for (spec = declspecs; spec; spec = TREE_CHAIN (spec))
10036     {
10037       register int i;
10038       register tree id;
10039
10040       /* Certain parse errors slip through.  For example,
10041          `int class;' is not caught by the parser. Try
10042          weakly to recover here.  */
10043       if (TREE_CODE (spec) != TREE_LIST)
10044         return 0;
10045
10046       id = TREE_VALUE (spec);
10047
10048       if (TREE_CODE (id) == IDENTIFIER_NODE)
10049         {
10050           if (id == ridpointers[(int) RID_INT]
10051               || id == ridpointers[(int) RID_CHAR]
10052               || id == ridpointers[(int) RID_BOOL]
10053               || id == ridpointers[(int) RID_WCHAR])
10054             {
10055               if (type)
10056                 {
10057                   if (id == ridpointers[(int) RID_BOOL])
10058                     error ("`bool' is now a keyword");
10059                   else
10060                     cp_error ("extraneous `%T' ignored", id);
10061                 }
10062               else
10063                 {
10064                   if (id == ridpointers[(int) RID_INT])
10065                     explicit_int = 1;
10066                   else if (id == ridpointers[(int) RID_CHAR])
10067                     explicit_char = 1;
10068                   type = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id));
10069                 }
10070               goto found;
10071             }
10072           /* C++ aggregate types.  */
10073           if (IDENTIFIER_HAS_TYPE_VALUE (id))
10074             {
10075               if (type)
10076                 cp_error ("multiple declarations `%T' and `%T'", type, id);
10077               else
10078                 type = IDENTIFIER_TYPE_VALUE (id);
10079               goto found;
10080             }
10081
10082           for (i = (int) RID_FIRST_MODIFIER; i <= (int) RID_LAST_MODIFIER; i++)
10083             {
10084               if (ridpointers[i] == id)
10085                 {
10086                   if (i == (int) RID_LONG && RIDBIT_SETP (i, specbits))
10087                     {
10088                       if (pedantic && ! in_system_header && warn_long_long)
10089                         pedwarn ("ISO C++ does not support `long long'");
10090                       if (longlong)
10091                         error ("`long long long' is too long for GCC");
10092                       else
10093                         longlong = 1;
10094                     }
10095                   else if (RIDBIT_SETP (i, specbits))
10096                     pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id));
10097                   RIDBIT_SET (i, specbits);
10098                   goto found;
10099                 }
10100             }
10101         }
10102       /* C++ aggregate types.  */
10103       else if (TREE_CODE (id) == TYPE_DECL)
10104         {
10105           if (type)
10106             cp_error ("multiple declarations `%T' and `%T'", type,
10107                       TREE_TYPE (id));
10108           else
10109             {
10110               type = TREE_TYPE (id);
10111               TREE_VALUE (spec) = type;
10112             }
10113           goto found;
10114         }
10115       if (type)
10116         error ("two or more data types in declaration of `%s'", name);
10117       else if (TREE_CODE (id) == IDENTIFIER_NODE)
10118         {
10119           register tree t = lookup_name (id, 1);
10120           if (!t || TREE_CODE (t) != TYPE_DECL)
10121             error ("`%s' fails to be a typedef or built in type",
10122                    IDENTIFIER_POINTER (id));
10123           else
10124             {
10125               type = TREE_TYPE (t);
10126 #if 0
10127               /* See the code below that used this.  */
10128               decl_machine_attr = DECL_MACHINE_ATTRIBUTES (id);
10129 #endif
10130               typedef_decl = t;
10131             }
10132         }
10133       else if (id != error_mark_node)
10134         /* Can't change CLASS nodes into RECORD nodes here!  */
10135         type = id;
10136
10137     found: ;
10138     }
10139
10140   typedef_type = type;
10141
10142   /* No type at all: default to `int', and set DEFAULTED_INT
10143      because it was not a user-defined typedef.  */
10144
10145   if (type == NULL_TREE
10146       && (RIDBIT_SETP (RID_SIGNED, specbits)
10147           || RIDBIT_SETP (RID_UNSIGNED, specbits)
10148           || RIDBIT_SETP (RID_LONG, specbits)
10149           || RIDBIT_SETP (RID_SHORT, specbits)))
10150     {
10151       /* These imply 'int'.  */
10152       type = integer_type_node;
10153       defaulted_int = 1;
10154     }
10155
10156   if (sfk != sfk_none)
10157     type = check_special_function_return_type (sfk, type,
10158                                                ctor_return_type,
10159                                                ctor_return_type);
10160   else if (type == NULL_TREE)
10161     {
10162       int is_main;
10163
10164       explicit_int = -1;
10165
10166           /* We handle `main' specially here, because 'main () { }' is so
10167              common.  With no options, it is allowed.  With -Wreturn-type,
10168              it is a warning.  It is only an error with -pedantic-errors.  */
10169       is_main = (funcdef_flag
10170                  && MAIN_NAME_P (dname)
10171                  && ctype == NULL_TREE
10172                  && in_namespace == NULL_TREE
10173                  && current_namespace == global_namespace);
10174
10175       if (in_system_header || flag_ms_extensions)
10176         /* Allow it, sigh.  */;
10177       else if (pedantic || ! is_main)
10178         cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10179                     name);
10180       else if (warn_return_type)
10181         cp_warning ("ISO C++ forbids declaration of `%s' with no type",
10182                     name);
10183
10184       type = integer_type_node;
10185     }
10186
10187   ctype = NULL_TREE;
10188
10189   /* Now process the modifiers that were specified
10190      and check for invalid combinations.  */
10191
10192   /* Long double is a special combination.  */
10193
10194   if (RIDBIT_SETP (RID_LONG, specbits)
10195       && TYPE_MAIN_VARIANT (type) == double_type_node)
10196     {
10197       RIDBIT_RESET (RID_LONG, specbits);
10198       type = build_qualified_type (long_double_type_node,
10199                                    CP_TYPE_QUALS (type));
10200     }
10201
10202   /* Check all other uses of type modifiers.  */
10203
10204   if (RIDBIT_SETP (RID_UNSIGNED, specbits)
10205       || RIDBIT_SETP (RID_SIGNED, specbits)
10206       || RIDBIT_SETP (RID_LONG, specbits)
10207       || RIDBIT_SETP (RID_SHORT, specbits))
10208     {
10209       int ok = 0;
10210
10211       if (TREE_CODE (type) == REAL_TYPE)
10212         error ("short, signed or unsigned invalid for `%s'", name);
10213       else if (TREE_CODE (type) != INTEGER_TYPE)
10214         error ("long, short, signed or unsigned invalid for `%s'", name);
10215       else if (RIDBIT_SETP (RID_LONG, specbits)
10216                && RIDBIT_SETP (RID_SHORT, specbits))
10217         error ("long and short specified together for `%s'", name);
10218       else if ((RIDBIT_SETP (RID_LONG, specbits)
10219                 || RIDBIT_SETP (RID_SHORT, specbits))
10220                && explicit_char)
10221         error ("long or short specified with char for `%s'", name);
10222       else if ((RIDBIT_SETP (RID_LONG, specbits)
10223                 || RIDBIT_SETP (RID_SHORT, specbits))
10224                && TREE_CODE (type) == REAL_TYPE)
10225         error ("long or short specified with floating type for `%s'", name);
10226       else if (RIDBIT_SETP (RID_SIGNED, specbits)
10227                && RIDBIT_SETP (RID_UNSIGNED, specbits))
10228         error ("signed and unsigned given together for `%s'", name);
10229       else
10230         {
10231           ok = 1;
10232           if (!explicit_int && !defaulted_int && !explicit_char && pedantic)
10233             {
10234               pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10235                        name);
10236               if (flag_pedantic_errors)
10237                 ok = 0;
10238             }
10239         }
10240
10241       /* Discard the type modifiers if they are invalid.  */
10242       if (! ok)
10243         {
10244           RIDBIT_RESET (RID_UNSIGNED, specbits);
10245           RIDBIT_RESET (RID_SIGNED, specbits);
10246           RIDBIT_RESET (RID_LONG, specbits);
10247           RIDBIT_RESET (RID_SHORT, specbits);
10248           longlong = 0;
10249         }
10250     }
10251
10252   if (RIDBIT_SETP (RID_COMPLEX, specbits)
10253       && TREE_CODE (type) != INTEGER_TYPE && TREE_CODE (type) != REAL_TYPE)
10254     {
10255       error ("complex invalid for `%s'", name);
10256       RIDBIT_RESET (RID_COMPLEX, specbits);
10257     }
10258
10259   /* Decide whether an integer type is signed or not.
10260      Optionally treat bitfields as signed by default.  */
10261   if (RIDBIT_SETP (RID_UNSIGNED, specbits)
10262       /* [class.bit]
10263
10264          It is implementation-defined whether a plain (neither
10265          explicitly signed or unsigned) char, short, int, or long
10266          bit-field is signed or unsigned.
10267
10268          Naturally, we extend this to long long as well.  Note that
10269          this does not include wchar_t.  */
10270       || (bitfield && !flag_signed_bitfields
10271           && RIDBIT_NOTSETP (RID_SIGNED, specbits)
10272           /* A typedef for plain `int' without `signed' can be
10273              controlled just like plain `int', but a typedef for
10274              `signed int' cannot be so controlled.  */
10275           && !(typedef_decl
10276                && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl))
10277           && (TREE_CODE (type) == INTEGER_TYPE
10278               || TREE_CODE (type) == CHAR_TYPE)
10279           && !same_type_p (TYPE_MAIN_VARIANT (type), wchar_type_node)))
10280     {
10281       if (longlong)
10282         type = long_long_unsigned_type_node;
10283       else if (RIDBIT_SETP (RID_LONG, specbits))
10284         type = long_unsigned_type_node;
10285       else if (RIDBIT_SETP (RID_SHORT, specbits))
10286         type = short_unsigned_type_node;
10287       else if (type == char_type_node)
10288         type = unsigned_char_type_node;
10289       else if (typedef_decl)
10290         type = unsigned_type (type);
10291       else
10292         type = unsigned_type_node;
10293     }
10294   else if (RIDBIT_SETP (RID_SIGNED, specbits)
10295            && type == char_type_node)
10296     type = signed_char_type_node;
10297   else if (longlong)
10298     type = long_long_integer_type_node;
10299   else if (RIDBIT_SETP (RID_LONG, specbits))
10300     type = long_integer_type_node;
10301   else if (RIDBIT_SETP (RID_SHORT, specbits))
10302     type = short_integer_type_node;
10303
10304   if (RIDBIT_SETP (RID_COMPLEX, specbits))
10305     {
10306       /* If we just have "complex", it is equivalent to
10307          "complex double", but if any modifiers at all are specified it is
10308          the complex form of TYPE.  E.g, "complex short" is
10309          "complex short int".  */
10310
10311       if (defaulted_int && ! longlong
10312           && ! (RIDBIT_SETP (RID_LONG, specbits)
10313                 || RIDBIT_SETP (RID_SHORT, specbits)
10314                 || RIDBIT_SETP (RID_SIGNED, specbits)
10315                 || RIDBIT_SETP (RID_UNSIGNED, specbits)))
10316         type = complex_double_type_node;
10317       else if (type == integer_type_node)
10318         type = complex_integer_type_node;
10319       else if (type == float_type_node)
10320         type = complex_float_type_node;
10321       else if (type == double_type_node)
10322         type = complex_double_type_node;
10323       else if (type == long_double_type_node)
10324         type = complex_long_double_type_node;
10325       else
10326         type = build_complex_type (type);
10327     }
10328
10329   if (sfk == sfk_conversion
10330       && (RIDBIT_SETP (RID_CONST, specbits)
10331           || RIDBIT_SETP (RID_VOLATILE, specbits)
10332           || RIDBIT_SETP (RID_RESTRICT, specbits)))
10333     cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10334               ctor_return_type);
10335
10336   /* Set CONSTP if this declaration is `const', whether by
10337      explicit specification or via a typedef.
10338      Likewise for VOLATILEP.  */
10339
10340   constp = !! RIDBIT_SETP (RID_CONST, specbits) + CP_TYPE_CONST_P (type);
10341   restrictp =
10342     !! RIDBIT_SETP (RID_RESTRICT, specbits) + CP_TYPE_RESTRICT_P (type);
10343   volatilep =
10344     !! RIDBIT_SETP (RID_VOLATILE, specbits) + CP_TYPE_VOLATILE_P (type);
10345   type_quals = ((constp ? TYPE_QUAL_CONST : 0)
10346                 | (restrictp ? TYPE_QUAL_RESTRICT : 0)
10347                 | (volatilep ? TYPE_QUAL_VOLATILE : 0));
10348   type = cp_build_qualified_type (type, type_quals);
10349   staticp = 0;
10350   inlinep = !! RIDBIT_SETP (RID_INLINE, specbits);
10351   virtualp = RIDBIT_SETP (RID_VIRTUAL, specbits);
10352   RIDBIT_RESET (RID_VIRTUAL, specbits);
10353   explicitp = RIDBIT_SETP (RID_EXPLICIT, specbits) != 0;
10354   RIDBIT_RESET (RID_EXPLICIT, specbits);
10355
10356   if (RIDBIT_SETP (RID_STATIC, specbits))
10357     staticp = 1 + (decl_context == FIELD);
10358
10359   if (virtualp && staticp == 2)
10360     {
10361       cp_error ("member `%D' cannot be declared both virtual and static",
10362                 dname);
10363       staticp = 0;
10364     }
10365   friendp = RIDBIT_SETP (RID_FRIEND, specbits);
10366   RIDBIT_RESET (RID_FRIEND, specbits);
10367
10368   /* Warn if two storage classes are given. Default to `auto'.  */
10369
10370   if (RIDBIT_ANY_SET (specbits))
10371     {
10372       if (RIDBIT_SETP (RID_STATIC, specbits)) nclasses++;
10373       if (RIDBIT_SETP (RID_EXTERN, specbits)) nclasses++;
10374       if (decl_context == PARM && nclasses > 0)
10375         error ("storage class specifiers invalid in parameter declarations");
10376       if (RIDBIT_SETP (RID_TYPEDEF, specbits))
10377         {
10378           if (decl_context == PARM)
10379             error ("typedef declaration invalid in parameter declaration");
10380           nclasses++;
10381         }
10382       if (RIDBIT_SETP (RID_AUTO, specbits)) nclasses++;
10383       if (RIDBIT_SETP (RID_REGISTER, specbits)) nclasses++;
10384     }
10385
10386   /* Give error if `virtual' is used outside of class declaration.  */
10387   if (virtualp
10388       && (current_class_name == NULL_TREE || decl_context != FIELD))
10389     {
10390       error ("virtual outside class declaration");
10391       virtualp = 0;
10392     }
10393
10394   /* Static anonymous unions are dealt with here.  */
10395   if (staticp && decl_context == TYPENAME
10396       && TREE_CODE (declspecs) == TREE_LIST
10397       && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs)))
10398     decl_context = FIELD;
10399
10400   /* Warn about storage classes that are invalid for certain
10401      kinds of declarations (parameters, typenames, etc.).  */
10402
10403   if (nclasses > 1)
10404     error ("multiple storage classes in declaration of `%s'", name);
10405   else if (decl_context != NORMAL && nclasses > 0)
10406     {
10407       if ((decl_context == PARM || decl_context == CATCHPARM)
10408           && (RIDBIT_SETP (RID_REGISTER, specbits)
10409               || RIDBIT_SETP (RID_AUTO, specbits)))
10410         ;
10411       else if (RIDBIT_SETP (RID_TYPEDEF, specbits))
10412         ;
10413       else if (decl_context == FIELD
10414                /* C++ allows static class elements  */
10415                && RIDBIT_SETP (RID_STATIC, specbits))
10416         /* C++ also allows inlines and signed and unsigned elements,
10417            but in those cases we don't come in here.  */
10418         ;
10419       else
10420         {
10421           if (decl_context == FIELD)
10422             {
10423               tree tmp = NULL_TREE;
10424               register int op = 0;
10425
10426               if (declarator)
10427                 {
10428                   /* Avoid trying to get an operand off an identifier node.  */
10429                   if (TREE_CODE (declarator) == IDENTIFIER_NODE)
10430                     tmp = declarator;
10431                   else
10432                     tmp = TREE_OPERAND (declarator, 0);
10433                   op = IDENTIFIER_OPNAME_P (tmp);
10434                   if (IDENTIFIER_TYPENAME_P (tmp))
10435                     {
10436                       if (IDENTIFIER_GLOBAL_VALUE (tmp)
10437                           && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp))
10438                               == TYPE_DECL))
10439                         name = IDENTIFIER_POINTER (tmp);
10440                       else
10441                         name = "<invalid operator>";
10442                     }
10443                 }
10444               error ("storage class specified for %s `%s'",
10445                      op ? "member operator" : "field",
10446                      name);
10447             }
10448           else
10449             {
10450               if (decl_context == PARM || decl_context == CATCHPARM)
10451                 error ("storage class specified for parameter `%s'", name);
10452               else
10453                 error ("storage class specified for typename");
10454             }
10455           RIDBIT_RESET (RID_REGISTER, specbits);
10456           RIDBIT_RESET (RID_AUTO, specbits);
10457           RIDBIT_RESET (RID_EXTERN, specbits);
10458         }
10459     }
10460   else if (RIDBIT_SETP (RID_EXTERN, specbits) && initialized && !funcdef_flag)
10461     {
10462       if (toplevel_bindings_p ())
10463         {
10464           /* It's common practice (and completely valid) to have a const
10465              be initialized and declared extern.  */
10466           if (!(type_quals & TYPE_QUAL_CONST))
10467             warning ("`%s' initialized and declared `extern'", name);
10468         }
10469       else
10470         error ("`%s' has both `extern' and initializer", name);
10471     }
10472   else if (RIDBIT_SETP (RID_EXTERN, specbits) && funcdef_flag
10473            && ! toplevel_bindings_p ())
10474     error ("nested function `%s' declared `extern'", name);
10475   else if (toplevel_bindings_p ())
10476     {
10477       if (RIDBIT_SETP (RID_AUTO, specbits))
10478         error ("top-level declaration of `%s' specifies `auto'", name);
10479     }
10480
10481   if (nclasses > 0 && friendp)
10482     error ("storage class specifiers invalid in friend function declarations");
10483
10484   /* Now figure out the structure of the declarator proper.
10485      Descend through it, creating more complex types, until we reach
10486      the declared identifier (or NULL_TREE, in an absolute declarator).  */
10487
10488   inner_attrs = NULL_TREE;
10489   ignore_attrs = 0;
10490
10491   while (declarator && TREE_CODE (declarator) != IDENTIFIER_NODE
10492          && TREE_CODE (declarator) != TEMPLATE_ID_EXPR)
10493     {
10494       /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10495          an INDIRECT_REF (for *...),
10496          a CALL_EXPR (for ...(...)),
10497          an identifier (for the name being declared)
10498          or a null pointer (for the place in an absolute declarator
10499          where the name was omitted).
10500          For the last two cases, we have just exited the loop.
10501
10502          For C++ it could also be
10503          a SCOPE_REF (for class :: ...).  In this case, we have converted
10504          sensible names to types, and those are the values we use to
10505          qualify the member name.
10506          an ADDR_EXPR (for &...),
10507          a BIT_NOT_EXPR (for destructors)
10508
10509          At this point, TYPE is the type of elements of an array,
10510          or for a function to return, or for a pointer to point to.
10511          After this sequence of ifs, TYPE is the type of the
10512          array or function or pointer, and DECLARATOR has had its
10513          outermost layer removed.  */
10514
10515       if (type == error_mark_node)
10516         {
10517           if (TREE_CODE (declarator) == SCOPE_REF)
10518             declarator = TREE_OPERAND (declarator, 1);
10519           else
10520             declarator = TREE_OPERAND (declarator, 0);
10521           continue;
10522         }
10523       if (quals != NULL_TREE
10524           && (declarator == NULL_TREE
10525               || TREE_CODE (declarator) != SCOPE_REF))
10526         {
10527           if (ctype == NULL_TREE && TREE_CODE (type) == METHOD_TYPE)
10528             ctype = TYPE_METHOD_BASETYPE (type);
10529           if (ctype != NULL_TREE)
10530             {
10531               tree dummy = build_decl (TYPE_DECL, NULL_TREE, type);
10532               grok_method_quals (ctype, dummy, quals);
10533               type = TREE_TYPE (dummy);
10534               ctype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type)));
10535               quals = NULL_TREE;
10536             }
10537         }
10538
10539       /* See the comment for the TREE_LIST case, below.  */
10540       if (ignore_attrs)
10541         ignore_attrs = 0;
10542       else if (inner_attrs)
10543         {
10544           decl_attributes (type, inner_attrs, NULL_TREE);
10545           inner_attrs = NULL_TREE;
10546         }
10547
10548       switch (TREE_CODE (declarator))
10549         {
10550         case TREE_LIST:
10551           {
10552             /* We encode a declarator with embedded attributes using
10553                a TREE_LIST.  The attributes apply to the declarator
10554                directly inside them, so we have to skip an iteration
10555                before applying them to the type.  If the declarator just
10556                inside is the declarator-id, we apply the attrs to the
10557                decl itself.  */
10558             inner_attrs = TREE_PURPOSE (declarator);
10559             ignore_attrs = 1;
10560             declarator = TREE_VALUE (declarator);
10561           }
10562           break;
10563
10564         case ARRAY_REF:
10565           {
10566             register tree size;
10567
10568             size = TREE_OPERAND (declarator, 1);
10569
10570             /* VC++ spells a zero-sized array with [].  */
10571             if (size == NULL_TREE && decl_context == FIELD && ! staticp
10572                 && ! RIDBIT_SETP (RID_TYPEDEF, specbits))
10573               size = integer_zero_node;
10574
10575             declarator = TREE_OPERAND (declarator, 0);
10576
10577             type = create_array_type_for_decl (dname, type, size);
10578
10579             /* VLAs never work as fields. */
10580             if (decl_context == FIELD && !processing_template_decl
10581                 && TREE_CODE (type) == ARRAY_TYPE
10582                 && TYPE_DOMAIN (type) != NULL_TREE
10583                 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type))))
10584               {
10585                 cp_error ("size of member `%D' is not constant", dname);
10586                 /* Proceed with arbitrary constant size, so that offset
10587                    computations don't get confused. */
10588                 type = create_array_type_for_decl (dname, TREE_TYPE (type),
10589                                                    integer_one_node);
10590               }
10591
10592             ctype = NULL_TREE;
10593           }
10594           break;
10595
10596         case CALL_EXPR:
10597           {
10598             tree arg_types;
10599             int funcdecl_p;
10600             tree inner_parms = CALL_DECLARATOR_PARMS (declarator);
10601             tree inner_decl = TREE_OPERAND (declarator, 0);
10602
10603             /* Declaring a function type.
10604                Make sure we have a valid type for the function to return.  */
10605
10606             /* We now know that the TYPE_QUALS don't apply to the
10607                decl, but to its return type.  */
10608             type_quals = TYPE_UNQUALIFIED;
10609
10610             /* Warn about some types functions can't return.  */
10611
10612             if (TREE_CODE (type) == FUNCTION_TYPE)
10613               {
10614                 error ("`%s' declared as function returning a function", name);
10615                 type = integer_type_node;
10616               }
10617             if (TREE_CODE (type) == ARRAY_TYPE)
10618               {
10619                 error ("`%s' declared as function returning an array", name);
10620                 type = integer_type_node;
10621               }
10622
10623             if (inner_decl && TREE_CODE (inner_decl) == SCOPE_REF)
10624               inner_decl = TREE_OPERAND (inner_decl, 1);
10625
10626             if (inner_decl && TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR)
10627               inner_decl = dname;
10628
10629             /* Pick up type qualifiers which should be applied to `this'.  */
10630             quals = CALL_DECLARATOR_QUALS (declarator);
10631
10632             /* Pick up the exception specifications.  */
10633             raises = CALL_DECLARATOR_EXCEPTION_SPEC (declarator);
10634
10635             /* Say it's a definition only for the CALL_EXPR
10636                closest to the identifier.  */
10637             funcdecl_p
10638               = inner_decl
10639               && (TREE_CODE (inner_decl) == IDENTIFIER_NODE
10640                   || TREE_CODE (inner_decl) == TEMPLATE_ID_EXPR
10641                   || TREE_CODE (inner_decl) == BIT_NOT_EXPR);
10642
10643             if (ctype == NULL_TREE
10644                 && decl_context == FIELD
10645                 && funcdecl_p
10646                 && (friendp == 0 || dname == current_class_name))
10647               ctype = current_class_type;
10648
10649             if (ctype && sfk == sfk_conversion)
10650               TYPE_HAS_CONVERSION (ctype) = 1;
10651             if (ctype && constructor_name (ctype) == dname)
10652               {
10653                 /* We are within a class's scope. If our declarator name
10654                    is the same as the class name, and we are defining
10655                    a function, then it is a constructor/destructor, and
10656                    therefore returns a void type.  */
10657
10658                 if (flags == DTOR_FLAG)
10659                   {
10660                     /* ISO C++ 12.4/2.  A destructor may not be
10661                        declared const or volatile.  A destructor may
10662                        not be static.  */
10663                     if (staticp == 2)
10664                       error ("destructor cannot be static member function");
10665                     if (quals)
10666                       {
10667                         cp_error ("destructors may not be `%s'",
10668                                   IDENTIFIER_POINTER (TREE_VALUE (quals)));
10669                         quals = NULL_TREE;
10670                       }
10671                     if (decl_context == FIELD)
10672                       {
10673                         if (! member_function_or_else (ctype,
10674                                                        current_class_type,
10675                                                        flags))
10676                           return void_type_node;
10677                       }
10678                   }
10679                 else            /* It's a constructor.  */
10680                   {
10681                     if (explicitp == 1)
10682                       explicitp = 2;
10683                     /* ISO C++ 12.1.  A constructor may not be
10684                        declared const or volatile.  A constructor may
10685                        not be virtual.  A constructor may not be
10686                        static.  */
10687                     if (staticp == 2)
10688                       error ("constructor cannot be static member function");
10689                     if (virtualp)
10690                       {
10691                         pedwarn ("constructors cannot be declared virtual");
10692                         virtualp = 0;
10693                       }
10694                     if (quals)
10695                       {
10696                         cp_error ("constructors may not be `%s'",
10697                                   IDENTIFIER_POINTER (TREE_VALUE (quals)));
10698                         quals = NULL_TREE;
10699                       }
10700                     {
10701                       RID_BIT_TYPE tmp_bits;
10702                       bcopy ((void*)&specbits, (void*)&tmp_bits, sizeof (RID_BIT_TYPE));
10703                       RIDBIT_RESET (RID_INLINE, tmp_bits);
10704                       RIDBIT_RESET (RID_STATIC, tmp_bits);
10705                       if (RIDBIT_ANY_SET (tmp_bits))
10706                         error ("return value type specifier for constructor ignored");
10707                     }
10708                     if (decl_context == FIELD)
10709                       {
10710                         if (! member_function_or_else (ctype,
10711                                                        current_class_type,
10712                                                        flags))
10713                           return void_type_node;
10714                         TYPE_HAS_CONSTRUCTOR (ctype) = 1;
10715                         if (sfk != sfk_constructor)
10716                           return NULL_TREE;
10717                       }
10718                   }
10719                 if (decl_context == FIELD)
10720                   staticp = 0;
10721               }
10722             else if (friendp)
10723               {
10724                 if (initialized)
10725                   error ("can't initialize friend function `%s'", name);
10726                 if (virtualp)
10727                   {
10728                     /* Cannot be both friend and virtual.  */
10729                     error ("virtual functions cannot be friends");
10730                     RIDBIT_RESET (RID_FRIEND, specbits);
10731                     friendp = 0;
10732                   }
10733                 if (decl_context == NORMAL)
10734                   error ("friend declaration not in class definition");
10735                 if (current_function_decl && funcdef_flag)
10736                   cp_error ("can't define friend function `%s' in a local class definition",
10737                             name);
10738               }
10739
10740             /* Construct the function type and go to the next
10741                inner layer of declarator.  */
10742
10743             declarator = TREE_OPERAND (declarator, 0);
10744
10745             /* FIXME: This is where default args should be fully
10746                processed.  */
10747
10748             arg_types = grokparms (inner_parms, funcdecl_p ? funcdef_flag : 0);
10749
10750             if (declarator && flags == DTOR_FLAG)
10751               {
10752                 /* A destructor declared in the body of a class will
10753                    be represented as a BIT_NOT_EXPR.  But, we just
10754                    want the underlying IDENTIFIER.  */
10755                 if (TREE_CODE (declarator) == BIT_NOT_EXPR)
10756                   declarator = TREE_OPERAND (declarator, 0);
10757
10758                 if (arg_types != void_list_node)
10759                   {
10760                     cp_error ("destructors may not have parameters");
10761                     arg_types = void_list_node;
10762                     last_function_parms = NULL_TREE;
10763                   }
10764               }
10765
10766             /* ANSI says that `const int foo ();'
10767                does not make the function foo const.  */
10768             type = build_function_type (type, arg_types);
10769
10770             {
10771               tree t;
10772               for (t = arg_types; t; t = TREE_CHAIN (t))
10773                 if (TREE_PURPOSE (t)
10774                     && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
10775                   {
10776                     add_defarg_fn (type);
10777                     break;
10778                   }
10779             }
10780           }
10781           break;
10782
10783         case ADDR_EXPR:
10784         case INDIRECT_REF:
10785           /* Filter out pointers-to-references and references-to-references.
10786              We can get these if a TYPE_DECL is used.  */
10787
10788           if (TREE_CODE (type) == REFERENCE_TYPE)
10789             {
10790               error ("cannot declare %s to references",
10791                      TREE_CODE (declarator) == ADDR_EXPR
10792                      ? "references" : "pointers");
10793               declarator = TREE_OPERAND (declarator, 0);
10794               continue;
10795             }
10796
10797           if (TREE_CODE (type) == OFFSET_TYPE
10798               && (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE
10799                   || TREE_CODE (TREE_TYPE (type)) == REFERENCE_TYPE))
10800             {
10801               cp_error ("cannot declare pointer to `%#T' member",
10802                         TREE_TYPE (type));
10803               type = TREE_TYPE (type);
10804             }
10805
10806           /* Merge any constancy or volatility into the target type
10807              for the pointer.  */
10808
10809           /* We now know that the TYPE_QUALS don't apply to the decl,
10810              but to the target of the pointer.  */
10811           type_quals = TYPE_UNQUALIFIED;
10812
10813           if (TREE_CODE (declarator) == ADDR_EXPR)
10814             {
10815               if (TREE_CODE (type) == VOID_TYPE)
10816                 error ("invalid type: `void &'");
10817               else
10818                 type = build_reference_type (type);
10819             }
10820           else if (TREE_CODE (type) == METHOD_TYPE)
10821             type = build_ptrmemfunc_type (build_pointer_type (type));
10822           else
10823             type = build_pointer_type (type);
10824
10825           /* Process a list of type modifier keywords (such as
10826              const or volatile) that were given inside the `*' or `&'.  */
10827
10828           if (TREE_TYPE (declarator))
10829             {
10830               register tree typemodlist;
10831               int erred = 0;
10832
10833               constp = 0;
10834               volatilep = 0;
10835               restrictp = 0;
10836               for (typemodlist = TREE_TYPE (declarator); typemodlist;
10837                    typemodlist = TREE_CHAIN (typemodlist))
10838                 {
10839                   tree qualifier = TREE_VALUE (typemodlist);
10840
10841                   if (qualifier == ridpointers[(int) RID_CONST])
10842                     constp++;
10843                   else if (qualifier == ridpointers[(int) RID_VOLATILE])
10844                     volatilep++;
10845                   else if (qualifier == ridpointers[(int) RID_RESTRICT])
10846                     restrictp++;
10847                   else if (!erred)
10848                     {
10849                       erred = 1;
10850                       error ("invalid type modifier within pointer declarator");
10851                     }
10852                 }
10853               if (constp > 1)
10854                 pedwarn ("duplicate `const'");
10855               if (volatilep > 1)
10856                 pedwarn ("duplicate `volatile'");
10857               if (restrictp > 1)
10858                 pedwarn ("duplicate `restrict'");
10859
10860               type_quals = ((constp ? TYPE_QUAL_CONST : 0)
10861                             | (restrictp ? TYPE_QUAL_RESTRICT : 0)
10862                             | (volatilep ? TYPE_QUAL_VOLATILE : 0));
10863               if (TREE_CODE (declarator) == ADDR_EXPR
10864                   && (constp || volatilep))
10865                 {
10866                   if (constp)
10867                     pedwarn ("discarding `const' applied to a reference");
10868                   if (volatilep)
10869                     pedwarn ("discarding `volatile' applied to a reference");
10870                   type_quals &= ~(TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE);
10871                 }
10872               type = cp_build_qualified_type (type, type_quals);
10873             }
10874           declarator = TREE_OPERAND (declarator, 0);
10875           ctype = NULL_TREE;
10876           break;
10877
10878         case SCOPE_REF:
10879           {
10880             /* We have converted type names to NULL_TREE if the
10881                name was bogus, or to a _TYPE node, if not.
10882
10883                The variable CTYPE holds the type we will ultimately
10884                resolve to.  The code here just needs to build
10885                up appropriate member types.  */
10886             tree sname = TREE_OPERAND (declarator, 1);
10887             tree t;
10888
10889             /* Destructors can have their visibilities changed as well.  */
10890             if (TREE_CODE (sname) == BIT_NOT_EXPR)
10891               sname = TREE_OPERAND (sname, 0);
10892
10893             if (TREE_COMPLEXITY (declarator) == 0)
10894               /* This needs to be here, in case we are called
10895                  multiple times.  */ ;
10896             else if (TREE_COMPLEXITY (declarator) == -1)
10897               /* Namespace member. */
10898               pop_decl_namespace ();
10899             else if (friendp && (TREE_COMPLEXITY (declarator) < 2))
10900               /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10901             else if (! IS_AGGR_TYPE_CODE
10902                      (TREE_CODE (TREE_OPERAND (declarator, 0))))
10903               ;
10904             else if (TREE_COMPLEXITY (declarator) == current_class_depth)
10905               {
10906                 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10907                    that refer to ctype.  They couldn't be resolved earlier
10908                    because we hadn't pushed into the class yet.
10909                    Example: resolve 'B<T>::type' in
10910                    'B<typename B<T>::type> B<T>::f () { }'.  */
10911                 if (current_template_parms
10912                     && uses_template_parms (type)
10913                     && uses_template_parms (current_class_type))
10914                   {
10915                     tree args = current_template_args ();
10916                     type = tsubst (type, args, /*complain=*/1, NULL_TREE);
10917                   }
10918
10919                 /* This pop_nested_class corresponds to the
10920                    push_nested_class used to push into class scope for
10921                    parsing the argument list of a function decl, in
10922                    qualified_id.  */
10923                 pop_nested_class ();
10924                 TREE_COMPLEXITY (declarator) = current_class_depth;
10925               }
10926             else
10927               my_friendly_abort (16);
10928
10929             if (TREE_OPERAND (declarator, 0) == NULL_TREE)
10930               {
10931                 /* We had a reference to a global decl, or
10932                    perhaps we were given a non-aggregate typedef,
10933                    in which case we cleared this out, and should just
10934                    keep going as though it wasn't there.  */
10935                 declarator = sname;
10936                 continue;
10937               }
10938             ctype = TREE_OPERAND (declarator, 0);
10939
10940             t = ctype;
10941             while (t != NULL_TREE && CLASS_TYPE_P (t))
10942               {
10943                 /* You're supposed to have one `template <...>'
10944                    for every template class, but you don't need one
10945                    for a full specialization.  For example:
10946
10947                      template <class T> struct S{};
10948                      template <> struct S<int> { void f(); };
10949                      void S<int>::f () {}
10950
10951                    is correct; there shouldn't be a `template <>' for
10952                    the definition of `S<int>::f'.  */
10953                 if (CLASSTYPE_TEMPLATE_INFO (t)
10954                     && (CLASSTYPE_TEMPLATE_INSTANTIATION (t)
10955                         || uses_template_parms (CLASSTYPE_TI_ARGS (t))))
10956                   template_count += 1;
10957
10958                 t = TYPE_MAIN_DECL (t);
10959                 if (DECL_LANG_SPECIFIC (t))
10960                   t = DECL_CONTEXT (t);
10961                 else
10962                   t = NULL_TREE;
10963               }
10964
10965             if (sname == NULL_TREE)
10966               goto done_scoping;
10967
10968             if (TREE_CODE (sname) == IDENTIFIER_NODE)
10969               {
10970                 /* This is the `standard' use of the scoping operator:
10971                    basetype :: member .  */
10972
10973                 if (ctype == current_class_type)
10974                   {
10975                     /* class A {
10976                          void A::f ();
10977                        };
10978
10979                        Is this ill-formed?  */
10980
10981                     if (pedantic)
10982                       cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10983                                   ctype, name);
10984                   }
10985                 else if (TREE_CODE (type) == FUNCTION_TYPE)
10986                   {
10987                     if (current_class_type == NULL_TREE
10988                         || friendp)
10989                       type = build_cplus_method_type (ctype, TREE_TYPE (type),
10990                                                       TYPE_ARG_TYPES (type));
10991                     else
10992                       {
10993                         cp_error ("cannot declare member function `%T::%s' within `%T'",
10994                                   ctype, name, current_class_type);
10995                         return void_type_node;
10996                       }
10997                   }
10998                 else if (RIDBIT_SETP (RID_TYPEDEF, specbits)
10999                          || COMPLETE_TYPE_P (complete_type (ctype)))
11000                   {
11001                     /* Have to move this code elsewhere in this function.
11002                        this code is used for i.e., typedef int A::M; M *pm;
11003
11004                        It is?  How? jason 10/2/94 */
11005
11006                     if (current_class_type)
11007                       {
11008                         cp_error ("cannot declare member `%T::%s' within `%T'",
11009                                   ctype, name, current_class_type);
11010                         return void_type_node;
11011                       }
11012                     type = build_offset_type (ctype, type);
11013                   }
11014                 else if (uses_template_parms (ctype))
11015                   {
11016                     if (TREE_CODE (type) == FUNCTION_TYPE)
11017                       type
11018                         = build_cplus_method_type (ctype, TREE_TYPE (type),
11019                                                    TYPE_ARG_TYPES (type));
11020                   }
11021                 else
11022                   {
11023                     cp_error ("structure `%T' not yet defined", ctype);
11024                     return error_mark_node;
11025                   }
11026
11027                 declarator = sname;
11028               }
11029             else if (TREE_CODE (sname) == SCOPE_REF)
11030               my_friendly_abort (17);
11031             else
11032               {
11033               done_scoping:
11034                 declarator = TREE_OPERAND (declarator, 1);
11035                 if (declarator && TREE_CODE (declarator) == CALL_EXPR)
11036                   /* In this case, we will deal with it later.  */
11037                   ;
11038                 else
11039                   {
11040                     if (TREE_CODE (type) == FUNCTION_TYPE)
11041                       type = build_cplus_method_type (ctype, TREE_TYPE (type),
11042                                                       TYPE_ARG_TYPES (type));
11043                     else
11044                       type = build_offset_type (ctype, type);
11045                   }
11046               }
11047           }
11048           break;
11049
11050         case BIT_NOT_EXPR:
11051           declarator = TREE_OPERAND (declarator, 0);
11052           break;
11053
11054         case RECORD_TYPE:
11055         case UNION_TYPE:
11056         case ENUMERAL_TYPE:
11057           declarator = NULL_TREE;
11058           break;
11059
11060         case ERROR_MARK:
11061           declarator = NULL_TREE;
11062           break;
11063
11064         default:
11065           my_friendly_abort (158);
11066         }
11067     }
11068
11069   /* See the comment for the TREE_LIST case, above.  */
11070   if (inner_attrs)
11071     {
11072       if (! ignore_attrs)
11073         decl_attributes (type, inner_attrs, NULL_TREE);
11074       else if (attrlist)
11075         TREE_VALUE (attrlist) = chainon (inner_attrs, TREE_VALUE (attrlist));
11076       else
11077         attrlist = build_tree_list (NULL_TREE, inner_attrs);
11078     }
11079
11080   /* Now TYPE has the actual type.  */
11081
11082   if (explicitp == 1 || (explicitp && friendp))
11083     {
11084       /* [dcl.fct.spec] The explicit specifier shall only be used in
11085          declarations of constructors within a class definition.  */
11086       error ("only declarations of constructors can be `explicit'");
11087       explicitp = 0;
11088     }
11089
11090   if (RIDBIT_SETP (RID_MUTABLE, specbits))
11091     {
11092       if (current_class_name == NULL_TREE || decl_context == PARM || friendp)
11093         {
11094           error ("non-member `%s' cannot be declared `mutable'", name);
11095           RIDBIT_RESET (RID_MUTABLE, specbits);
11096         }
11097       else if (decl_context == TYPENAME || RIDBIT_SETP (RID_TYPEDEF, specbits))
11098         {
11099           error ("non-object member `%s' cannot be declared `mutable'", name);
11100           RIDBIT_RESET (RID_MUTABLE, specbits);
11101         }
11102       else if (TREE_CODE (type) == FUNCTION_TYPE
11103                || TREE_CODE (type) == METHOD_TYPE)
11104         {
11105           error ("function `%s' cannot be declared `mutable'", name);
11106           RIDBIT_RESET (RID_MUTABLE, specbits);
11107         }
11108       else if (staticp)
11109         {
11110           error ("static `%s' cannot be declared `mutable'", name);
11111           RIDBIT_RESET (RID_MUTABLE, specbits);
11112         }
11113       else if (type_quals & TYPE_QUAL_CONST)
11114         {
11115           error ("const `%s' cannot be declared `mutable'", name);
11116           RIDBIT_RESET (RID_MUTABLE, specbits);
11117         }
11118     }
11119
11120   if (declarator == NULL_TREE
11121       || TREE_CODE (declarator) == IDENTIFIER_NODE
11122       || (TREE_CODE (declarator) == TEMPLATE_ID_EXPR
11123           && (TREE_CODE (type) == FUNCTION_TYPE
11124               || TREE_CODE (type) == METHOD_TYPE)))
11125     /* OK */;
11126   else if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
11127     {
11128       cp_error ("template-id `%D' used as a declarator", declarator);
11129       declarator = dname;
11130     }
11131   else
11132     /* Unexpected declarator format.  */
11133     my_friendly_abort (990210);
11134
11135   /* If this is declaring a typedef name, return a TYPE_DECL.  */
11136
11137   if (RIDBIT_SETP (RID_TYPEDEF, specbits) && decl_context != TYPENAME)
11138     {
11139       tree decl;
11140
11141       /* Note that the grammar rejects storage classes
11142          in typenames, fields or parameters.  */
11143       if (current_lang_name == lang_name_java)
11144         TYPE_FOR_JAVA (type) = 1;
11145
11146       if (decl_context == FIELD)
11147         {
11148           if (declarator == constructor_name (current_class_type))
11149             cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
11150                         declarator);
11151           decl = build_lang_decl (TYPE_DECL, declarator, type);
11152         }
11153       else
11154         decl = build_decl (TYPE_DECL, declarator, type);
11155
11156       /* If the user declares "typedef struct {...} foo" then the
11157          struct will have an anonymous name.  Fill that name in now.
11158          Nothing can refer to it, so nothing needs know about the name
11159          change.  */
11160       if (type != error_mark_node
11161           && declarator
11162           && TYPE_NAME (type)
11163           && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
11164           && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type))
11165           && CP_TYPE_QUALS (type) == TYPE_UNQUALIFIED)
11166         {
11167           tree oldname = TYPE_NAME (type);
11168           tree t;
11169
11170           /* Replace the anonymous name with the real name everywhere.  */
11171           lookup_tag_reverse (type, declarator);
11172           for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
11173             if (TYPE_NAME (t) == oldname)
11174               TYPE_NAME (t) = decl;
11175
11176           if (TYPE_LANG_SPECIFIC (type))
11177             TYPE_WAS_ANONYMOUS (type) = 1;
11178
11179           /* If this is a typedef within a template class, the nested
11180              type is a (non-primary) template.  The name for the
11181              template needs updating as well.  */
11182           if (TYPE_LANG_SPECIFIC (type) && CLASSTYPE_TEMPLATE_INFO (type))
11183             DECL_NAME (CLASSTYPE_TI_TEMPLATE (type))
11184               = TYPE_IDENTIFIER (type);
11185
11186           if (flag_new_abi)
11187             DECL_ASSEMBLER_NAME (decl) = mangle_type (type);
11188           else
11189             {
11190               /* XXX Temporarily set the scope.
11191                  When returning, start_decl expects it as NULL_TREE,
11192                  and will then then set it using pushdecl. */
11193               my_friendly_assert (DECL_CONTEXT (decl) == NULL_TREE, 980404);
11194               if (current_class_type)
11195                 DECL_CONTEXT (decl) = current_class_type;
11196               else
11197                 DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);
11198
11199               DECL_ASSEMBLER_NAME (decl) = DECL_NAME (decl);
11200               DECL_ASSEMBLER_NAME (decl)
11201                 = get_identifier (build_overload_name (type, 1, 1));
11202               DECL_CONTEXT (decl) = NULL_TREE;
11203             }
11204
11205           /* FIXME remangle member functions; member functions of a
11206              type with external linkage have external linkage.  */
11207         }
11208
11209       if (TREE_CODE (type) == OFFSET_TYPE || TREE_CODE (type) == METHOD_TYPE)
11210         {
11211           cp_error_at ("typedef name may not be class-qualified", decl);
11212           return NULL_TREE;
11213         }
11214       else if (quals)
11215         {
11216           if (ctype == NULL_TREE)
11217             {
11218               if (TREE_CODE (type) != METHOD_TYPE)
11219                 cp_error_at ("invalid type qualifier for non-member function type", decl);
11220               else
11221                 ctype = TYPE_METHOD_BASETYPE (type);
11222             }
11223           if (ctype != NULL_TREE)
11224             grok_method_quals (ctype, decl, quals);
11225         }
11226
11227       if (RIDBIT_SETP (RID_SIGNED, specbits)
11228           || (typedef_decl && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl)))
11229         C_TYPEDEF_EXPLICITLY_SIGNED (decl) = 1;
11230
11231       bad_specifiers (decl, "type", virtualp, quals != NULL_TREE,
11232                       inlinep, friendp, raises != NULL_TREE);
11233
11234       if (initialized)
11235         error ("typedef declaration includes an initializer");
11236
11237       return decl;
11238     }
11239
11240   /* Detect the case of an array type of unspecified size
11241      which came, as such, direct from a typedef name.
11242      We must copy the type, so that each identifier gets
11243      a distinct type, so that each identifier's size can be
11244      controlled separately by its own initializer.  */
11245
11246   if (type == typedef_type && TREE_CODE (type) == ARRAY_TYPE
11247       && TYPE_DOMAIN (type) == NULL_TREE)
11248     {
11249       type = build_cplus_array_type (TREE_TYPE (type), TYPE_DOMAIN (type));
11250     }
11251
11252   /* If this is a type name (such as, in a cast or sizeof),
11253      compute the type and return it now.  */
11254
11255   if (decl_context == TYPENAME)
11256     {
11257       /* Note that the grammar rejects storage classes
11258          in typenames, fields or parameters.  */
11259       if (type_quals != TYPE_UNQUALIFIED)
11260         type_quals = TYPE_UNQUALIFIED;
11261
11262       /* Special case: "friend class foo" looks like a TYPENAME context.  */
11263       if (friendp)
11264         {
11265           if (type_quals != TYPE_UNQUALIFIED)
11266             {
11267               cp_error ("type qualifiers specified for friend class declaration");
11268               type_quals = TYPE_UNQUALIFIED;
11269             }
11270           if (inlinep)
11271             {
11272               cp_error ("`inline' specified for friend class declaration");
11273               inlinep = 0;
11274             }
11275
11276           /* Until core issue 180 is resolved, allow 'friend typename A::B'.
11277              But don't allow implicit typenames.  */
11278           if (!current_aggr && (TREE_CODE (type) != TYPENAME_TYPE
11279                                 || IMPLICIT_TYPENAME_P (type)))
11280             {
11281               if (TREE_CODE (type) == TEMPLATE_TYPE_PARM)
11282                 cp_pedwarn ("template parameters cannot be friends");
11283               else if (TREE_CODE (type) == TYPENAME_TYPE)
11284                 cp_pedwarn ("\
11285 friend declaration requires class-key, i.e. `friend class %T::%T'",
11286                             constructor_name (current_class_type),
11287                             TYPE_IDENTIFIER (type));
11288               else
11289                 cp_pedwarn ("\
11290 friend declaration requires class-key, i.e. `friend %#T'",
11291                             type);
11292             }
11293
11294           /* Only try to do this stuff if we didn't already give up.  */
11295           if (type != integer_type_node)
11296             {
11297               /* A friendly class?  */
11298               if (current_class_type)
11299                 make_friend_class (current_class_type, TYPE_MAIN_VARIANT (type));
11300               else
11301                 cp_error ("trying to make class `%T' a friend of global scope",
11302                           type);
11303               type = void_type_node;
11304             }
11305         }
11306       else if (quals)
11307         {
11308           if (ctype == NULL_TREE)
11309             {
11310               if (TREE_CODE (type) != METHOD_TYPE)
11311                 cp_error ("invalid qualifiers on non-member function type");
11312               else
11313                 ctype = TYPE_METHOD_BASETYPE (type);
11314             }
11315           if (ctype)
11316             {
11317               tree dummy = build_decl (TYPE_DECL, declarator, type);
11318               grok_method_quals (ctype, dummy, quals);
11319               type = TREE_TYPE (dummy);
11320             }
11321         }
11322
11323       return type;
11324     }
11325   else if (declarator == NULL_TREE && decl_context != PARM
11326            && decl_context != CATCHPARM
11327            && TREE_CODE (type) != UNION_TYPE
11328            && ! bitfield)
11329     {
11330       cp_error ("abstract declarator `%T' used as declaration", type);
11331       declarator = make_anon_name ();
11332     }
11333
11334   /* `void' at top level (not within pointer)
11335      is allowed only in typedefs or type names.
11336      We don't complain about parms either, but that is because
11337      a better error message can be made later.  */
11338
11339   if (TREE_CODE (type) == VOID_TYPE && decl_context != PARM)
11340     {
11341       if (! declarator)
11342         error ("unnamed variable or field declared void");
11343       else if (TREE_CODE (declarator) == IDENTIFIER_NODE)
11344         {
11345           if (IDENTIFIER_OPNAME_P (declarator))
11346             my_friendly_abort (356);
11347           else
11348             error ("variable or field `%s' declared void", name);
11349         }
11350       else
11351         error ("variable or field declared void");
11352       type = integer_type_node;
11353     }
11354
11355   /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11356      or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE.  */
11357
11358   if (decl_context == PARM || decl_context == CATCHPARM)
11359     {
11360       if (ctype || in_namespace)
11361         error ("cannot use `::' in parameter declaration");
11362
11363       /* A parameter declared as an array of T is really a pointer to T.
11364          One declared as a function is really a pointer to a function.
11365          One declared as a member is really a pointer to member.  */
11366
11367       if (TREE_CODE (type) == ARRAY_TYPE)
11368         {
11369           /* Transfer const-ness of array into that of type pointed to.  */
11370           type = build_pointer_type (TREE_TYPE (type));
11371           type_quals = TYPE_UNQUALIFIED;
11372         }
11373       else if (TREE_CODE (type) == FUNCTION_TYPE)
11374         type = build_pointer_type (type);
11375       else if (TREE_CODE (type) == OFFSET_TYPE)
11376         type = build_pointer_type (type);
11377       else if (TREE_CODE (type) == VOID_TYPE && declarator)
11378         {
11379           error ("declaration of `%s' as void", name);
11380           return NULL_TREE;
11381         }
11382     }
11383
11384   {
11385     register tree decl;
11386
11387     if (decl_context == PARM)
11388       {
11389         decl = build_decl (PARM_DECL, declarator, type);
11390
11391         bad_specifiers (decl, "parameter", virtualp, quals != NULL_TREE,
11392                         inlinep, friendp, raises != NULL_TREE);
11393
11394         /* Compute the type actually passed in the parmlist,
11395            for the case where there is no prototype.
11396            (For example, shorts and chars are passed as ints.)
11397            When there is a prototype, this is overridden later.  */
11398
11399         DECL_ARG_TYPE (decl) = type_promotes_to (type);
11400       }
11401     else if (decl_context == FIELD)
11402       {
11403         if (type == error_mark_node)
11404           {
11405             /* Happens when declaring arrays of sizes which
11406                are error_mark_node, for example.  */
11407             decl = NULL_TREE;
11408           }
11409         else if (in_namespace && !friendp)
11410           {
11411             /* Something like struct S { int N::j; };  */
11412             cp_error ("invalid use of `::'");
11413             decl = NULL_TREE;
11414           }
11415         else if (TREE_CODE (type) == FUNCTION_TYPE)
11416           {
11417             int publicp = 0;
11418             tree function_context;
11419
11420             /* We catch the others as conflicts with the builtin
11421                typedefs.  */
11422             if (friendp && declarator == ridpointers[(int) RID_SIGNED])
11423               {
11424                 cp_error ("function `%D' cannot be declared friend",
11425                           declarator);
11426                 friendp = 0;
11427               }
11428
11429             if (friendp == 0)
11430               {
11431                 if (ctype == NULL_TREE)
11432                   ctype = current_class_type;
11433
11434                 if (ctype == NULL_TREE)
11435                   {
11436                     cp_error ("can't make `%D' into a method -- not in a class",
11437                               declarator);
11438                     return void_type_node;
11439                   }
11440
11441                 /* ``A union may [ ... ] not [ have ] virtual functions.''
11442                    ARM 9.5 */
11443                 if (virtualp && TREE_CODE (ctype) == UNION_TYPE)
11444                   {
11445                     cp_error ("function `%D' declared virtual inside a union",
11446                               declarator);
11447                     return void_type_node;
11448                   }
11449
11450                 if (declarator == ansi_opname (NEW_EXPR)
11451                     || declarator == ansi_opname (VEC_NEW_EXPR)
11452                     || declarator == ansi_opname (DELETE_EXPR)
11453                     || declarator == ansi_opname (VEC_DELETE_EXPR))
11454                   {
11455                     if (virtualp)
11456                       {
11457                         cp_error ("`%D' cannot be declared virtual, since it is always static",
11458                                   declarator);
11459                         virtualp = 0;
11460                       }
11461                   }
11462                 else if (staticp < 2)
11463                   type = build_cplus_method_type (ctype, TREE_TYPE (type),
11464                                                   TYPE_ARG_TYPES (type));
11465               }
11466
11467             /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node.  */
11468             function_context = (ctype != NULL_TREE) ?
11469               decl_function_context (TYPE_MAIN_DECL (ctype)) : NULL_TREE;
11470             publicp = (! friendp || ! staticp)
11471               && function_context == NULL_TREE;
11472             decl = grokfndecl (ctype, type,
11473                                TREE_CODE (declarator) != TEMPLATE_ID_EXPR
11474                                ? declarator : dname,
11475                                declarator,
11476                                virtualp, flags, quals, raises,
11477                                friendp ? -1 : 0, friendp, publicp, inlinep,
11478                                funcdef_flag, template_count, in_namespace);
11479             if (decl == NULL_TREE)
11480               return decl;
11481 #if 0
11482             /* This clobbers the attrs stored in `decl' from `attrlist'.  */
11483             /* The decl and setting of decl_machine_attr is also turned off.  */
11484             decl = build_decl_attribute_variant (decl, decl_machine_attr);
11485 #endif
11486
11487             /* [class.conv.ctor]
11488
11489                A constructor declared without the function-specifier
11490                explicit that can be called with a single parameter
11491                specifies a conversion from the type of its first
11492                parameter to the type of its class.  Such a constructor
11493                is called a converting constructor.  */
11494             if (explicitp == 2)
11495               DECL_NONCONVERTING_P (decl) = 1;
11496             else if (DECL_CONSTRUCTOR_P (decl))
11497               {
11498                 /* The constructor can be called with exactly one
11499                    parameter if there is at least one parameter, and
11500                    any subsequent parameters have default arguments.
11501                    We don't look at the first parameter, which is
11502                    really just the `this' parameter for the new
11503                    object.  */
11504                 tree arg_types =
11505                   TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl)));
11506
11507                 /* Skip the `in_chrg' argument too, if present.  */
11508                 if (DECL_HAS_IN_CHARGE_PARM_P (decl))
11509                   arg_types = TREE_CHAIN (arg_types);
11510
11511                 if (arg_types == void_list_node
11512                     || (arg_types
11513                         && TREE_CHAIN (arg_types)
11514                         && TREE_CHAIN (arg_types) != void_list_node
11515                         && !TREE_PURPOSE (TREE_CHAIN (arg_types))))
11516                   DECL_NONCONVERTING_P (decl) = 1;
11517               }
11518           }
11519         else if (TREE_CODE (type) == METHOD_TYPE)
11520           {
11521             /* We only get here for friend declarations of
11522                members of other classes.  */
11523             /* All method decls are public, so tell grokfndecl to set
11524                TREE_PUBLIC, also.  */
11525             decl = grokfndecl (ctype, type, declarator, declarator,
11526                                virtualp, flags, quals, raises,
11527                                friendp ? -1 : 0, friendp, 1, 0, funcdef_flag,
11528                                template_count, in_namespace);
11529             if (decl == NULL_TREE)
11530               return NULL_TREE;
11531           }
11532         else if (!staticp && ! processing_template_decl
11533                  && !COMPLETE_TYPE_P (complete_type (type))
11534                  && (TREE_CODE (type) != ARRAY_TYPE || initialized == 0))
11535           {
11536             if (declarator)
11537               cp_error ("field `%D' has incomplete type", declarator);
11538             else
11539               cp_error ("name `%T' has incomplete type", type);
11540
11541             /* If we're instantiating a template, tell them which
11542                instantiation made the field's type be incomplete.  */
11543             if (current_class_type
11544                 && TYPE_NAME (current_class_type)
11545                 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type))
11546                 && declspecs && TREE_VALUE (declspecs)
11547                 && TREE_TYPE (TREE_VALUE (declspecs)) == type)
11548               cp_error ("  in instantiation of template `%T'",
11549                         current_class_type);
11550
11551             type = error_mark_node;
11552             decl = NULL_TREE;
11553           }
11554         else
11555           {
11556             if (friendp)
11557               {
11558                 error ("`%s' is neither function nor member function; cannot be declared friend",
11559                        IDENTIFIER_POINTER (declarator));
11560                 friendp = 0;
11561               }
11562             decl = NULL_TREE;
11563           }
11564
11565         if (friendp)
11566           {
11567             /* Friends are treated specially.  */
11568             if (ctype == current_class_type)
11569               warning ("member functions are implicitly friends of their class");
11570             else
11571               {
11572                 tree t = NULL_TREE;
11573                 if (decl && DECL_NAME (decl))
11574                   {
11575                     if (template_class_depth (current_class_type) == 0)
11576                       {
11577                         decl
11578                           = check_explicit_specialization
11579                           (declarator, decl,
11580                            template_count, 2 * (funcdef_flag != 0) + 4);
11581                         if (decl == error_mark_node)
11582                           return error_mark_node;
11583                       }
11584
11585                     t = do_friend (ctype, declarator, decl,
11586                                    last_function_parms, attrlist, flags, quals,
11587                                    funcdef_flag);
11588                   }
11589                 if (t && funcdef_flag)
11590                   return t;
11591
11592                 return void_type_node;
11593               }
11594           }
11595
11596         /* Structure field.  It may not be a function, except for C++ */
11597
11598         if (decl == NULL_TREE)
11599           {
11600             if (initialized)
11601               {
11602                 if (!staticp)
11603                   {
11604                     /* An attempt is being made to initialize a non-static
11605                        member.  But, from [class.mem]:
11606
11607                        4 A member-declarator can contain a
11608                        constant-initializer only if it declares a static
11609                        member (_class.static_) of integral or enumeration
11610                        type, see _class.static.data_.
11611
11612                        This used to be relatively common practice, but
11613                        the rest of the compiler does not correctly
11614                        handle the initialization unless the member is
11615                        static so we make it static below.  */
11616                     cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11617                                 declarator);
11618                     cp_pedwarn ("making `%D' static", declarator);
11619                     staticp = 1;
11620                   }
11621
11622                 if (uses_template_parms (type))
11623                   /* We'll check at instantiation time.  */
11624                   ;
11625                 else if (check_static_variable_definition (declarator,
11626                                                            type))
11627                   /* If we just return the declaration, crashes
11628                      will sometimes occur.  We therefore return
11629                      void_type_node, as if this was a friend
11630                      declaration, to cause callers to completely
11631                      ignore this declaration.  */
11632                   return void_type_node;
11633               }
11634
11635             /* 9.2p13 [class.mem] */
11636             if (declarator == constructor_name (current_class_type)
11637                 /* The standard does not allow non-static data members
11638                    here either, but we agreed at the 10/99 meeting
11639                    to change that in TC 1 so that they are allowed in
11640                    classes with no user-defined constructors.  */
11641                 && staticp)
11642               cp_pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11643                           declarator);
11644
11645             if (staticp)
11646               {
11647                 /* C++ allows static class members.  All other work
11648                    for this is done by grokfield.  */
11649                 decl = build_lang_decl (VAR_DECL, declarator, type);
11650                 TREE_STATIC (decl) = 1;
11651                 /* In class context, 'static' means public access.  */
11652                 TREE_PUBLIC (decl) = DECL_EXTERNAL (decl) = 1;
11653               }
11654             else
11655               {
11656                 decl = build_decl (FIELD_DECL, declarator, type);
11657                 DECL_NONADDRESSABLE_P (decl) = bitfield;
11658                 if (RIDBIT_SETP (RID_MUTABLE, specbits))
11659                   {
11660                     DECL_MUTABLE_P (decl) = 1;
11661                     RIDBIT_RESET (RID_MUTABLE, specbits);
11662                   }
11663               }
11664
11665             bad_specifiers (decl, "field", virtualp, quals != NULL_TREE,
11666                             inlinep, friendp, raises != NULL_TREE);
11667           }
11668       }
11669     else if (TREE_CODE (type) == FUNCTION_TYPE || TREE_CODE (type) == METHOD_TYPE)
11670       {
11671         tree original_name;
11672         int publicp = 0;
11673
11674         if (! declarator)
11675           return NULL_TREE;
11676
11677         if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
11678           original_name = dname;
11679         else
11680           original_name = declarator;
11681
11682         if (RIDBIT_SETP (RID_AUTO, specbits))
11683           error ("storage class `auto' invalid for function `%s'", name);
11684         else if (RIDBIT_SETP (RID_REGISTER, specbits))
11685           error ("storage class `register' invalid for function `%s'", name);
11686
11687         /* Function declaration not at top level.
11688            Storage classes other than `extern' are not allowed
11689            and `extern' makes no difference.  */
11690         if (! toplevel_bindings_p ()
11691             && (RIDBIT_SETP (RID_STATIC, specbits)
11692                 || RIDBIT_SETP (RID_INLINE, specbits))
11693             && pedantic)
11694           {
11695             if (RIDBIT_SETP (RID_STATIC, specbits))
11696               pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name);
11697             else
11698               pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name);
11699           }
11700
11701         if (ctype == NULL_TREE)
11702           {
11703             if (virtualp)
11704               {
11705                 error ("virtual non-class function `%s'", name);
11706                 virtualp = 0;
11707               }
11708           }
11709         else if (TREE_CODE (type) == FUNCTION_TYPE && staticp < 2)
11710           type = build_cplus_method_type (ctype, TREE_TYPE (type),
11711                                           TYPE_ARG_TYPES (type));
11712
11713         /* Record presence of `static'.  */
11714         publicp = (ctype != NULL_TREE
11715                    || RIDBIT_SETP (RID_EXTERN, specbits)
11716                    || !RIDBIT_SETP (RID_STATIC, specbits));
11717
11718         decl = grokfndecl (ctype, type, original_name, declarator,
11719                            virtualp, flags, quals, raises,
11720                            1, friendp,
11721                            publicp, inlinep, funcdef_flag,
11722                            template_count, in_namespace);
11723         if (decl == NULL_TREE)
11724           return NULL_TREE;
11725
11726         if (staticp == 1)
11727           {
11728             int illegal_static = 0;
11729
11730             /* Don't allow a static member function in a class, and forbid
11731                declaring main to be static.  */
11732             if (TREE_CODE (type) == METHOD_TYPE)
11733               {
11734                 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl);
11735                 illegal_static = 1;
11736               }
11737             else if (current_function_decl)
11738               {
11739                 /* FIXME need arm citation */
11740                 error ("cannot declare static function inside another function");
11741                 illegal_static = 1;
11742               }
11743
11744             if (illegal_static)
11745               {
11746                 staticp = 0;
11747                 RIDBIT_RESET (RID_STATIC, specbits);
11748               }
11749           }
11750       }
11751     else
11752       {
11753         /* It's a variable.  */
11754
11755         /* An uninitialized decl with `extern' is a reference.  */
11756         decl = grokvardecl (type, declarator, &specbits,
11757                             initialized,
11758                             (type_quals & TYPE_QUAL_CONST) != 0,
11759                             in_namespace);
11760         bad_specifiers (decl, "variable", virtualp, quals != NULL_TREE,
11761                         inlinep, friendp, raises != NULL_TREE);
11762
11763         if (ctype)
11764           {
11765             DECL_CONTEXT (decl) = ctype;
11766             if (staticp == 1)
11767               {
11768                 cp_pedwarn ("static member `%D' re-declared as static", decl);
11769                 staticp = 0;
11770                 RIDBIT_RESET (RID_STATIC, specbits);
11771               }
11772             if (RIDBIT_SETP (RID_REGISTER, specbits) && TREE_STATIC (decl))
11773               {
11774                 cp_error ("static member `%D' declared `register'", decl);
11775                 RIDBIT_RESET (RID_REGISTER, specbits);
11776               }
11777             if (RIDBIT_SETP (RID_EXTERN, specbits) && pedantic)
11778               {
11779                 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11780                             decl);
11781                 RIDBIT_RESET (RID_EXTERN, specbits);
11782               }
11783           }
11784       }
11785
11786     my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE, specbits), 19990927);
11787
11788     /* Record `register' declaration for warnings on &
11789        and in case doing stupid register allocation.  */
11790
11791     if (RIDBIT_SETP (RID_REGISTER, specbits))
11792       DECL_REGISTER (decl) = 1;
11793
11794     if (RIDBIT_SETP (RID_EXTERN, specbits))
11795       DECL_THIS_EXTERN (decl) = 1;
11796
11797     if (RIDBIT_SETP (RID_STATIC, specbits))
11798       DECL_THIS_STATIC (decl) = 1;
11799
11800     /* Record constancy and volatility.  There's no need to do this
11801        when processing a template; we'll do this for the instantiated
11802        declaration based on the type of DECL.  */
11803     if (!processing_template_decl)
11804       c_apply_type_quals_to_decl (type_quals, decl);
11805
11806     return decl;
11807   }
11808 }
11809 \f
11810 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11811    An empty exprlist is a parmlist.  An exprlist which
11812    contains only identifiers at the global level
11813    is a parmlist.  Otherwise, it is an exprlist.  */
11814
11815 int
11816 parmlist_is_exprlist (exprs)
11817      tree exprs;
11818 {
11819   if (exprs == NULL_TREE || TREE_PARMLIST (exprs))
11820     return 0;
11821
11822   if (toplevel_bindings_p ())
11823     {
11824       /* At the global level, if these are all identifiers,
11825          then it is a parmlist.  */
11826       while (exprs)
11827         {
11828           if (TREE_CODE (TREE_VALUE (exprs)) != IDENTIFIER_NODE)
11829             return 1;
11830           exprs = TREE_CHAIN (exprs);
11831         }
11832       return 0;
11833     }
11834   return 1;
11835 }
11836
11837 /* Subroutine of start_function.  Ensure that each of the parameter
11838    types (as listed in PARMS) is complete, as is required for a
11839    function definition.  */
11840
11841 static void
11842 require_complete_types_for_parms (parms)
11843      tree parms;
11844 {
11845   for (; parms; parms = TREE_CHAIN (parms))
11846     {
11847       tree type = TREE_TYPE (parms);
11848
11849       /* Try to complete the TYPE.  */
11850       type = complete_type (type);
11851
11852       if (type == error_mark_node)
11853         continue;
11854
11855       if (!COMPLETE_TYPE_P (type))
11856         {
11857           if (DECL_NAME (parms))
11858             error ("parameter `%s' has incomplete type",
11859                    IDENTIFIER_POINTER (DECL_NAME (parms)));
11860           else
11861             error ("parameter has incomplete type");
11862           TREE_TYPE (parms) = error_mark_node;
11863         }
11864       else
11865         layout_decl (parms, 0);
11866     }
11867 }
11868
11869 /* Returns non-zero if T is a local variable.  */
11870
11871 int
11872 local_variable_p (t)
11873      tree t;
11874 {
11875   if ((TREE_CODE (t) == VAR_DECL
11876        /* A VAR_DECL with a context that is a _TYPE is a static data
11877           member.  */
11878        && !TYPE_P (CP_DECL_CONTEXT (t))
11879        /* Any other non-local variable must be at namespace scope.  */
11880        && !DECL_NAMESPACE_SCOPE_P (t))
11881       || (TREE_CODE (t) == PARM_DECL))
11882     return 1;
11883
11884   return 0;
11885 }
11886
11887 /* Returns non-zero if T is an automatic local variable or a label.
11888    (These are the declarations that need to be remapped when the code
11889    containing them is duplicated.)  */
11890
11891 int
11892 nonstatic_local_decl_p (t)
11893      tree t;
11894 {
11895   return ((local_variable_p (t) && !TREE_STATIC (t))
11896           || TREE_CODE (t) == LABEL_DECL
11897           || TREE_CODE (t) == RESULT_DECL);
11898 }
11899
11900 /* Like local_variable_p, but suitable for use as a tree-walking
11901    function.  */
11902
11903 static tree
11904 local_variable_p_walkfn (tp, walk_subtrees, data)
11905      tree *tp;
11906      int *walk_subtrees ATTRIBUTE_UNUSED;
11907      void *data ATTRIBUTE_UNUSED;
11908 {
11909   return ((local_variable_p (*tp) && !DECL_ARTIFICIAL (*tp))
11910           ? *tp : NULL_TREE);
11911 }
11912
11913 /* Check that ARG, which is a default-argument expression for a
11914    parameter DECL, is legal.  Returns ARG, or ERROR_MARK_NODE, if
11915    something goes wrong.  DECL may also be a _TYPE node, rather than a
11916    DECL, if there is no DECL available.  */
11917
11918 tree
11919 check_default_argument (decl, arg)
11920      tree decl;
11921      tree arg;
11922 {
11923   tree var;
11924   tree decl_type;
11925
11926   if (TREE_CODE (arg) == DEFAULT_ARG)
11927     /* We get a DEFAULT_ARG when looking at an in-class declaration
11928        with a default argument.  Ignore the argument for now; we'll
11929        deal with it after the class is complete.  */
11930     return arg;
11931
11932   if (processing_template_decl || uses_template_parms (arg))
11933     /* We don't do anything checking until instantiation-time.  Note
11934        that there may be uninstantiated arguments even for an
11935        instantiated function, since default arguments are not
11936        instantiated until they are needed.  */
11937     return arg;
11938
11939   if (TYPE_P (decl))
11940     {
11941       decl_type = decl;
11942       decl = NULL_TREE;
11943     }
11944   else
11945     decl_type = TREE_TYPE (decl);
11946
11947   if (arg == error_mark_node
11948       || decl == error_mark_node
11949       || TREE_TYPE (arg) == error_mark_node
11950       || decl_type == error_mark_node)
11951     /* Something already went wrong.  There's no need to check
11952        further.  */
11953     return error_mark_node;
11954
11955   /* [dcl.fct.default]
11956
11957      A default argument expression is implicitly converted to the
11958      parameter type.  */
11959   if (!TREE_TYPE (arg)
11960       || !can_convert_arg (decl_type, TREE_TYPE (arg), arg))
11961     {
11962       if (decl)
11963         cp_error ("default argument for `%#D' has type `%T'",
11964                   decl, TREE_TYPE (arg));
11965       else
11966         cp_error ("default argument for parameter of type `%T' has type `%T'",
11967                   decl_type, TREE_TYPE (arg));
11968
11969       return error_mark_node;
11970     }
11971
11972   /* [dcl.fct.default]
11973
11974      Local variables shall not be used in default argument
11975      expressions.
11976
11977      The keyword `this' shall not be used in a default argument of a
11978      member function.  */
11979   var = walk_tree_without_duplicates (&arg, local_variable_p_walkfn,
11980                                       NULL);
11981   if (var)
11982     {
11983       cp_error ("default argument `%E' uses local variable `%D'",
11984                 arg, var);
11985       return error_mark_node;
11986     }
11987
11988   /* All is well.  */
11989   return arg;
11990 }
11991
11992 /* Decode the list of parameter types for a function type.
11993    Given the list of things declared inside the parens,
11994    return a list of types.
11995
11996    The list we receive can have three kinds of elements:
11997    an IDENTIFIER_NODE for names given without types,
11998    a TREE_LIST node for arguments given as typespecs or names with typespecs,
11999    or void_type_node, to mark the end of an argument list
12000    when additional arguments are not permitted (... was not used).
12001
12002    FUNCDEF_FLAG is nonzero for a function definition, 0 for
12003    a mere declaration.  A nonempty identifier-list gets an error message
12004    when FUNCDEF_FLAG is zero.
12005    If FUNCDEF_FLAG is 1, then parameter types must be complete.
12006    If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
12007
12008    If all elements of the input list contain types,
12009    we return a list of the types.
12010    If all elements contain no type (except perhaps a void_type_node
12011    at the end), we return a null list.
12012    If some have types and some do not, it is an error, and we
12013    return a null list.
12014
12015    Also set last_function_parms to either
12016    a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
12017    A list of names is converted to a chain of PARM_DECLs
12018    by store_parm_decls so that ultimately it is always a chain of decls.
12019
12020    Note that in C++, parameters can take default values.  These default
12021    values are in the TREE_PURPOSE field of the TREE_LIST.  It is
12022    an error to specify default values which are followed by parameters
12023    that have no default values, or an ELLIPSES.  For simplicities sake,
12024    only parameters which are specified with their types can take on
12025    default values.  */
12026
12027 static tree
12028 grokparms (first_parm, funcdef_flag)
12029      tree first_parm;
12030      int funcdef_flag;
12031 {
12032   tree result = NULL_TREE;
12033   tree decls = NULL_TREE;
12034
12035   if (first_parm != NULL_TREE
12036       && TREE_CODE (TREE_VALUE (first_parm)) == IDENTIFIER_NODE)
12037     {
12038       if (! funcdef_flag)
12039         pedwarn ("parameter names (without types) in function declaration");
12040       last_function_parms = first_parm;
12041       return NULL_TREE;
12042     }
12043   else if (first_parm != NULL_TREE
12044            && TREE_CODE (TREE_VALUE (first_parm)) != TREE_LIST
12045            && TREE_CODE (TREE_VALUE (first_parm)) != VOID_TYPE)
12046     my_friendly_abort (145);
12047   else
12048     {
12049       /* Types were specified.  This is a list of declarators
12050          each represented as a TREE_LIST node.  */
12051       register tree parm, chain;
12052       int any_init = 0, any_error = 0;
12053
12054       if (first_parm != NULL_TREE)
12055         {
12056           tree last_result = NULL_TREE;
12057           tree last_decl = NULL_TREE;
12058
12059           for (parm = first_parm; parm != NULL_TREE; parm = chain)
12060             {
12061               tree type = NULL_TREE, list_node = parm;
12062               register tree decl = TREE_VALUE (parm);
12063               tree init = TREE_PURPOSE (parm);
12064
12065               chain = TREE_CHAIN (parm);
12066               /* @@ weak defense against parse errors.  */
12067               if (TREE_CODE (decl) != VOID_TYPE
12068                   && TREE_CODE (decl) != TREE_LIST)
12069                 {
12070                   /* Give various messages as the need arises.  */
12071                   if (TREE_CODE (decl) == STRING_CST)
12072                     cp_error ("invalid string constant `%E'", decl);
12073                   else if (TREE_CODE (decl) == INTEGER_CST)
12074                     error ("invalid integer constant in parameter list, did you forget to give parameter name?");
12075                   continue;
12076                 }
12077
12078               if (TREE_CODE (decl) != VOID_TYPE)
12079                 {
12080                   decl = grokdeclarator (TREE_VALUE (decl),
12081                                          TREE_PURPOSE (decl),
12082                                          PARM, init != NULL_TREE,
12083                                          NULL_TREE);
12084                   if (! decl || TREE_TYPE (decl) == error_mark_node)
12085                     continue;
12086
12087                   /* Top-level qualifiers on the parameters are
12088                      ignored for function types.  */
12089                   type = TYPE_MAIN_VARIANT (TREE_TYPE (decl));
12090
12091                   if (TREE_CODE (type) == VOID_TYPE)
12092                     decl = void_type_node;
12093                   else if (TREE_CODE (type) == METHOD_TYPE)
12094                     {
12095                       if (DECL_NAME (decl))
12096                         /* Cannot use the decl here because
12097                            we don't have DECL_CONTEXT set up yet.  */
12098                         cp_error ("parameter `%D' invalidly declared method type",
12099                                   DECL_NAME (decl));
12100                       else
12101                         error ("parameter invalidly declared method type");
12102                       type = build_pointer_type (type);
12103                       TREE_TYPE (decl) = type;
12104                     }
12105                   else if (TREE_CODE (type) == OFFSET_TYPE)
12106                     {
12107                       if (DECL_NAME (decl))
12108                         cp_error ("parameter `%D' invalidly declared offset type",
12109                                   DECL_NAME (decl));
12110                       else
12111                         error ("parameter invalidly declared offset type");
12112                       type = build_pointer_type (type);
12113                       TREE_TYPE (decl) = type;
12114                     }
12115                   else if (abstract_virtuals_error (decl, type))
12116                     any_error = 1;  /* Seems like a good idea. */
12117                   else if (POINTER_TYPE_P (type))
12118                     {
12119                       tree t = type;
12120                       while (POINTER_TYPE_P (t)
12121                              || (TREE_CODE (t) == ARRAY_TYPE
12122                                  && TYPE_DOMAIN (t) != NULL_TREE))
12123                         t = TREE_TYPE (t);
12124                       if (TREE_CODE (t) == ARRAY_TYPE)
12125                         cp_error ("parameter type `%T' includes %s to array of unknown bound",
12126                                   type,
12127                                   TYPE_PTR_P (type) ? "pointer" : "reference");
12128                     }
12129                 }
12130
12131               if (TREE_CODE (decl) == VOID_TYPE)
12132                 {
12133                   if (result == NULL_TREE)
12134                     {
12135                       result = void_list_node;
12136                       last_result = result;
12137                     }
12138                   else
12139                     {
12140                       TREE_CHAIN (last_result) = void_list_node;
12141                       last_result = void_list_node;
12142                     }
12143                   if (chain
12144                       && (chain != void_list_node || TREE_CHAIN (chain)))
12145                     error ("`void' in parameter list must be entire list");
12146                   break;
12147                 }
12148
12149               /* Since there is a prototype, args are passed in their own types.  */
12150               DECL_ARG_TYPE (decl) = TREE_TYPE (decl);
12151               if (PROMOTE_PROTOTYPES
12152                   && (TREE_CODE (type) == INTEGER_TYPE
12153                       || TREE_CODE (type) == ENUMERAL_TYPE)
12154                   && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node))
12155                 DECL_ARG_TYPE (decl) = integer_type_node;
12156               if (!any_error && init)
12157                 {
12158                   any_init++;
12159                   init = check_default_argument (decl, init);
12160                 }
12161               else
12162                 init = NULL_TREE;
12163
12164               if (decls == NULL_TREE)
12165                 {
12166                   decls = decl;
12167                   last_decl = decls;
12168                 }
12169               else
12170                 {
12171                   TREE_CHAIN (last_decl) = decl;
12172                   last_decl = decl;
12173                 }
12174               list_node = tree_cons (init, type, NULL_TREE);
12175               if (result == NULL_TREE)
12176                 {
12177                   result = list_node;
12178                   last_result = result;
12179                 }
12180               else
12181                 {
12182                   TREE_CHAIN (last_result) = list_node;
12183                   last_result = list_node;
12184                 }
12185             }
12186           if (last_result)
12187             TREE_CHAIN (last_result) = NULL_TREE;
12188           /* If there are no parameters, and the function does not end
12189              with `...', then last_decl will be NULL_TREE.  */
12190           if (last_decl != NULL_TREE)
12191             TREE_CHAIN (last_decl) = NULL_TREE;
12192         }
12193     }
12194
12195   last_function_parms = decls;
12196
12197   return result;
12198 }
12199
12200 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
12201    FUNCTION_TYPE with the newly parsed version of its default argument, which
12202    was previously digested as text.  See snarf_defarg et al in lex.c.  */
12203
12204 void
12205 replace_defarg (arg, init)
12206      tree arg, init;
12207 {
12208   if (! processing_template_decl
12209       && ! can_convert_arg (TREE_VALUE (arg), TREE_TYPE (init), init))
12210     cp_pedwarn ("invalid type `%T' for default argument to `%T'",
12211                 TREE_TYPE (init), TREE_VALUE (arg));
12212   TREE_PURPOSE (arg) = init;
12213 }
12214 \f
12215 /* D is a constructor or overloaded `operator='.  Returns non-zero if
12216    D's arguments allow it to be a copy constructor, or copy assignment
12217    operator.  */
12218
12219 int
12220 copy_args_p (d)
12221      tree d;
12222 {
12223   tree t;
12224
12225   if (!DECL_FUNCTION_MEMBER_P (d))
12226     return 0;
12227
12228   t = FUNCTION_ARG_CHAIN (d);
12229   if (DECL_CONSTRUCTOR_P (d) && DECL_HAS_IN_CHARGE_PARM_P (d))
12230     t = TREE_CHAIN (t);
12231   if (t && TREE_CODE (TREE_VALUE (t)) == REFERENCE_TYPE
12232       && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t)))
12233           == DECL_CONTEXT (d))
12234       && (TREE_CHAIN (t) == NULL_TREE
12235           || TREE_CHAIN (t) == void_list_node
12236           || TREE_PURPOSE (TREE_CHAIN (t))))
12237     return 1;
12238   return 0;
12239 }
12240
12241 /* These memoizing functions keep track of special properties which
12242    a class may have.  `grok_ctor_properties' notices whether a class
12243    has a constructor of the form X(X&), and also complains
12244    if the class has a constructor of the form X(X).
12245    `grok_op_properties' takes notice of the various forms of
12246    operator= which are defined, as well as what sorts of type conversion
12247    may apply.  Both functions take a FUNCTION_DECL as an argument.  */
12248
12249 int
12250 grok_ctor_properties (ctype, decl)
12251      tree ctype, decl;
12252 {
12253   tree parmtypes = FUNCTION_ARG_CHAIN (decl);
12254   tree parmtype = parmtypes ? TREE_VALUE (parmtypes) : void_type_node;
12255
12256   /* When a type has virtual baseclasses, a magical first int argument is
12257      added to any ctor so we can tell if the class has been initialized
12258      yet.  This could screw things up in this function, so we deliberately
12259      ignore the leading int if we're in that situation.  */
12260   if (DECL_HAS_IN_CHARGE_PARM_P (decl))
12261     {
12262       my_friendly_assert (parmtypes
12263                           && TREE_VALUE (parmtypes) == integer_type_node,
12264                           980529);
12265       parmtypes = TREE_CHAIN (parmtypes);
12266       parmtype = TREE_VALUE (parmtypes);
12267     }
12268
12269   /* [class.copy]
12270
12271      A non-template constructor for class X is a copy constructor if
12272      its first parameter is of type X&, const X&, volatile X& or const
12273      volatile X&, and either there are no other parameters or else all
12274      other parameters have default arguments.  */
12275   if (TREE_CODE (parmtype) == REFERENCE_TYPE
12276       && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype)) == ctype
12277       && (TREE_CHAIN (parmtypes) == NULL_TREE
12278           || TREE_CHAIN (parmtypes) == void_list_node
12279           || TREE_PURPOSE (TREE_CHAIN (parmtypes)))
12280       && !(DECL_TEMPLATE_INSTANTIATION (decl)
12281            && is_member_template (DECL_TI_TEMPLATE (decl))))
12282     {
12283       TYPE_HAS_INIT_REF (ctype) = 1;
12284       if (CP_TYPE_CONST_P (TREE_TYPE (parmtype)))
12285         TYPE_HAS_CONST_INIT_REF (ctype) = 1;
12286     }
12287   /* [class.copy]
12288
12289      A declaration of a constructor for a class X is ill-formed if its
12290      first parameter is of type (optionally cv-qualified) X and either
12291      there are no other parameters or else all other parameters have
12292      default arguments.
12293
12294      We *don't* complain about member template instantiations that
12295      have this form, though; they can occur as we try to decide what
12296      constructor to use during overload resolution.  Since overload
12297      resolution will never prefer such a constructor to the
12298      non-template copy constructor (which is either explicitly or
12299      implicitly defined), there's no need to worry about their
12300      existence.  Theoretically, they should never even be
12301      instantiated, but that's hard to forestall.  */
12302   else if (TYPE_MAIN_VARIANT (parmtype) == ctype
12303            && (TREE_CHAIN (parmtypes) == NULL_TREE
12304                || TREE_CHAIN (parmtypes) == void_list_node
12305                || TREE_PURPOSE (TREE_CHAIN (parmtypes)))
12306            && !(DECL_TEMPLATE_INSTANTIATION (decl)
12307                 && is_member_template (DECL_TI_TEMPLATE (decl))))
12308     {
12309       cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
12310                 ctype, ctype);
12311       SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl), ctype);
12312       return 0;
12313     }
12314   else if (TREE_CODE (parmtype) == VOID_TYPE
12315            || TREE_PURPOSE (parmtypes) != NULL_TREE)
12316     TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype) = 1;
12317
12318   return 1;
12319 }
12320
12321 /* An operator with this code is unary, but can also be binary.  */
12322
12323 static int
12324 ambi_op_p (code)
12325      enum tree_code code;
12326 {
12327   return (code == INDIRECT_REF
12328           || code == ADDR_EXPR
12329           || code == CONVERT_EXPR
12330           || code == NEGATE_EXPR
12331           || code == PREINCREMENT_EXPR
12332           || code == PREDECREMENT_EXPR);
12333 }
12334
12335 /* An operator with this name can only be unary.  */
12336
12337 static int
12338 unary_op_p (code)
12339      enum tree_code code;
12340 {
12341   return (code == TRUTH_NOT_EXPR
12342           || code == BIT_NOT_EXPR
12343           || code == COMPONENT_REF
12344           || code == TYPE_EXPR);
12345 }
12346
12347 /* Do a little sanity-checking on how they declared their operator.  */
12348
12349 void
12350 grok_op_properties (decl, virtualp, friendp)
12351      tree decl;
12352      int virtualp, friendp;
12353 {
12354   tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl));
12355   tree argtype;
12356   int methodp = (TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE);
12357   tree name = DECL_NAME (decl);
12358   enum tree_code operator_code;
12359   int arity;
12360
12361   /* Count the number of arguments.  */
12362   for (argtype = argtypes, arity = 0;
12363        argtype && argtype != void_list_node;
12364        argtype = TREE_CHAIN (argtype))
12365     ++arity;
12366
12367   if (current_class_type == NULL_TREE)
12368     friendp = 1;
12369
12370   if (DECL_CONV_FN_P (decl))
12371     operator_code = TYPE_EXPR;
12372   else
12373     do
12374       {
12375 #define DEF_OPERATOR(NAME, CODE, NEW_MANGLING, OLD_MANGING, ARITY, ASSN_P)  \
12376         if (ansi_opname (CODE) == name)                                     \
12377           {                                                                 \
12378             operator_code = CODE;                                           \
12379             break;                                                          \
12380           }                                                                 \
12381         else if (ansi_assopname (CODE) == name)                             \
12382           {                                                                 \
12383             operator_code = CODE;                                           \
12384             DECL_ASSIGNMENT_OPERATOR_P (decl) = 1;                          \
12385             break;                                                          \
12386           }
12387
12388 #include "operators.def"
12389 #undef DEF_OPERATOR
12390
12391         my_friendly_abort (20000527);
12392       }
12393     while (0);
12394   my_friendly_assert (operator_code != LAST_CPLUS_TREE_CODE, 20000526);
12395   SET_OVERLOADED_OPERATOR_CODE (decl, operator_code);
12396
12397   if (! friendp)
12398     {
12399       switch (operator_code)
12400         {
12401         case CALL_EXPR:
12402           TYPE_OVERLOADS_CALL_EXPR (current_class_type) = 1;
12403           break;
12404
12405         case ARRAY_REF:
12406           TYPE_OVERLOADS_ARRAY_REF (current_class_type) = 1;
12407           break;
12408
12409         case COMPONENT_REF:
12410         case MEMBER_REF:
12411           TYPE_OVERLOADS_ARROW (current_class_type) = 1;
12412           break;
12413
12414         case NEW_EXPR:
12415           TYPE_HAS_NEW_OPERATOR (current_class_type) = 1;
12416           break;
12417
12418         case DELETE_EXPR:
12419           TYPE_GETS_DELETE (current_class_type) |= 1;
12420           break;
12421
12422         case VEC_NEW_EXPR:
12423           TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type) = 1;
12424           break;
12425
12426         case VEC_DELETE_EXPR:
12427           TYPE_GETS_DELETE (current_class_type) |= 2;
12428           break;
12429
12430         default:
12431           break;
12432         }
12433     }
12434
12435   if (operator_code == NEW_EXPR || operator_code == VEC_NEW_EXPR)
12436     {
12437       /* When the compiler encounters the definition of A::operator new, it
12438          doesn't look at the class declaration to find out if it's static.  */
12439       if (methodp)
12440         revert_static_member_fn (decl);
12441
12442       /* Take care of function decl if we had syntax errors.  */
12443       if (argtypes == NULL_TREE)
12444         TREE_TYPE (decl)
12445           = build_function_type (ptr_type_node,
12446                                  hash_tree_chain (integer_type_node,
12447                                                   void_list_node));
12448       else
12449         TREE_TYPE (decl) = coerce_new_type (TREE_TYPE (decl));
12450     }
12451   else if (operator_code == DELETE_EXPR || operator_code == VEC_DELETE_EXPR)
12452     {
12453       if (methodp)
12454         revert_static_member_fn (decl);
12455
12456       if (argtypes == NULL_TREE)
12457         TREE_TYPE (decl)
12458           = build_function_type (void_type_node,
12459                                  hash_tree_chain (ptr_type_node,
12460                                                   void_list_node));
12461       else
12462         TREE_TYPE (decl) = coerce_delete_type (TREE_TYPE (decl));
12463     }
12464   else
12465     {
12466       /* An operator function must either be a non-static member function
12467          or have at least one parameter of a class, a reference to a class,
12468          an enumeration, or a reference to an enumeration.  13.4.0.6 */
12469       if (! methodp || DECL_STATIC_FUNCTION_P (decl))
12470         {
12471           if (operator_code == TYPE_EXPR
12472               || operator_code == CALL_EXPR
12473               || operator_code == COMPONENT_REF
12474               || operator_code == ARRAY_REF
12475               || operator_code == NOP_EXPR)
12476             cp_error ("`%D' must be a nonstatic member function", decl);
12477           else
12478             {
12479               tree p = argtypes;
12480
12481               if (DECL_STATIC_FUNCTION_P (decl))
12482                 cp_error ("`%D' must be either a non-static member function or a non-member function", decl);
12483
12484               if (p)
12485                 for (; TREE_CODE (TREE_VALUE (p)) != VOID_TYPE ; p = TREE_CHAIN (p))
12486                   {
12487                     tree arg = TREE_VALUE (p);
12488                     if (TREE_CODE (arg) == REFERENCE_TYPE)
12489                       arg = TREE_TYPE (arg);
12490
12491                     /* This lets bad template code slip through.  */
12492                     if (IS_AGGR_TYPE (arg)
12493                         || TREE_CODE (arg) == ENUMERAL_TYPE
12494                         || TREE_CODE (arg) == TEMPLATE_TYPE_PARM
12495                         || TREE_CODE (arg) == BOUND_TEMPLATE_TEMPLATE_PARM)
12496                       goto foundaggr;
12497                   }
12498               cp_error
12499                 ("`%D' must have an argument of class or enumerated type",
12500                  decl);
12501             foundaggr:
12502               ;
12503             }
12504         }
12505
12506       if (operator_code == CALL_EXPR)
12507         return;                 /* No restrictions on args. */
12508
12509       if (IDENTIFIER_TYPENAME_P (name) && ! DECL_TEMPLATE_INFO (decl))
12510         {
12511           tree t = TREE_TYPE (name);
12512           if (! friendp)
12513             {
12514               int ref = (TREE_CODE (t) == REFERENCE_TYPE);
12515               const char *what = 0;
12516
12517               if (ref)
12518                 t = TYPE_MAIN_VARIANT (TREE_TYPE (t));
12519
12520               if (TREE_CODE (t) == VOID_TYPE)
12521                 what = "void";
12522               else if (t == current_class_type)
12523                 what = "the same type";
12524               /* Don't force t to be complete here.  */
12525               else if (IS_AGGR_TYPE (t)
12526                        && COMPLETE_TYPE_P (t)
12527                        && DERIVED_FROM_P (t, current_class_type))
12528                 what = "a base class";
12529
12530               if (what)
12531                 warning ("conversion to %s%s will never use a type conversion operator",
12532                          ref ? "a reference to " : "", what);
12533             }
12534         }
12535
12536       if (DECL_ASSIGNMENT_OPERATOR_P (decl)
12537           && operator_code == NOP_EXPR)
12538         {
12539           tree parmtype;
12540
12541           if (arity != 2 && methodp)
12542             {
12543               cp_error ("`%D' must take exactly one argument", decl);
12544               return;
12545             }
12546           parmtype = TREE_VALUE (TREE_CHAIN (argtypes));
12547
12548           /* [class.copy]
12549
12550              A user-declared copy assignment operator X::operator= is
12551              a non-static non-template member function of class X with
12552              exactly one parameter of type X, X&, const X&, volatile
12553              X& or const volatile X&.  */
12554           if (copy_assignment_arg_p (parmtype, virtualp)
12555               && !(DECL_TEMPLATE_INSTANTIATION (decl)
12556                    && is_member_template (DECL_TI_TEMPLATE (decl)))
12557               && ! friendp)
12558             {
12559               TYPE_HAS_ASSIGN_REF (current_class_type) = 1;
12560               if (TREE_CODE (parmtype) != REFERENCE_TYPE
12561                   || CP_TYPE_CONST_P (TREE_TYPE (parmtype)))
12562                 TYPE_HAS_CONST_ASSIGN_REF (current_class_type) = 1;
12563             }
12564         }
12565       else if (operator_code == COND_EXPR)
12566         {
12567           /* 13.4.0.3 */
12568           cp_error ("ISO C++ prohibits overloading operator ?:");
12569         }
12570       else if (ambi_op_p (operator_code))
12571         {
12572           if (arity == 1)
12573             /* We pick the one-argument operator codes by default, so
12574                we don't have to change anything.  */
12575             ;
12576           else if (arity == 2)
12577             {
12578               /* If we thought this was a unary operator, we now know
12579                  it to be a binary operator.  */
12580               switch (operator_code)
12581                 {
12582                 case INDIRECT_REF:
12583                   operator_code = MULT_EXPR;
12584                   break;
12585
12586                 case ADDR_EXPR:
12587                   operator_code = BIT_AND_EXPR;
12588                   break;
12589
12590                 case CONVERT_EXPR:
12591                   operator_code = PLUS_EXPR;
12592                   break;
12593
12594                 case NEGATE_EXPR:
12595                   operator_code = MINUS_EXPR;
12596                   break;
12597
12598                 case PREINCREMENT_EXPR:
12599                   operator_code = POSTINCREMENT_EXPR;
12600                   break;
12601
12602                 case PREDECREMENT_EXPR:
12603                   operator_code = POSTDECREMENT_EXPR;
12604                   break;
12605
12606                 default:
12607                   my_friendly_abort (20000527);
12608                 }
12609
12610               SET_OVERLOADED_OPERATOR_CODE (decl, operator_code);
12611
12612               if ((operator_code == POSTINCREMENT_EXPR
12613                    || operator_code == POSTDECREMENT_EXPR)
12614                   && ! processing_template_decl
12615                   && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes)), integer_type_node))
12616                 {
12617                   if (methodp)
12618                     cp_error ("postfix `%D' must take `int' as its argument",
12619                               decl);
12620                   else
12621                     cp_error
12622                       ("postfix `%D' must take `int' as its second argument",
12623                        decl);
12624                 }
12625             }
12626           else
12627             {
12628               if (methodp)
12629                 cp_error ("`%D' must take either zero or one argument", decl);
12630               else
12631                 cp_error ("`%D' must take either one or two arguments", decl);
12632             }
12633
12634           /* More Effective C++ rule 6.  */
12635           if (warn_ecpp
12636               && (operator_code == POSTINCREMENT_EXPR
12637                   || operator_code == POSTDECREMENT_EXPR
12638                   || operator_code == PREINCREMENT_EXPR
12639                   || operator_code == PREDECREMENT_EXPR))
12640             {
12641               tree arg = TREE_VALUE (argtypes);
12642               tree ret = TREE_TYPE (TREE_TYPE (decl));
12643               if (methodp || TREE_CODE (arg) == REFERENCE_TYPE)
12644                 arg = TREE_TYPE (arg);
12645               arg = TYPE_MAIN_VARIANT (arg);
12646               if (operator_code == PREINCREMENT_EXPR
12647                   || operator_code == PREDECREMENT_EXPR)
12648                 {
12649                   if (TREE_CODE (ret) != REFERENCE_TYPE
12650                       || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret)),
12651                                        arg))
12652                     cp_warning ("prefix `%D' should return `%T'", decl,
12653                                 build_reference_type (arg));
12654                 }
12655               else
12656                 {
12657                   if (!same_type_p (TYPE_MAIN_VARIANT (ret), arg))
12658                     cp_warning ("postfix `%D' should return `%T'", decl, arg);
12659                 }
12660             }
12661         }
12662       else if (unary_op_p (operator_code))
12663         {
12664           if (arity != 1)
12665             {
12666               if (methodp)
12667                 cp_error ("`%D' must take `void'", decl);
12668               else
12669                 cp_error ("`%D' must take exactly one argument", decl);
12670             }
12671         }
12672       else /* if (binary_op_p (operator_code)) */
12673         {
12674           if (arity != 2)
12675             {
12676               if (methodp)
12677                 cp_error ("`%D' must take exactly one argument", decl);
12678               else
12679                 cp_error ("`%D' must take exactly two arguments", decl);
12680             }
12681
12682           /* More Effective C++ rule 7.  */
12683           if (warn_ecpp
12684               && (operator_code == TRUTH_ANDIF_EXPR
12685                   || operator_code == TRUTH_ORIF_EXPR
12686                   || operator_code == COMPOUND_EXPR))
12687             cp_warning ("user-defined `%D' always evaluates both arguments",
12688                         decl);
12689         }
12690
12691       /* Effective C++ rule 23.  */
12692       if (warn_ecpp
12693           && arity == 2
12694           && (operator_code == PLUS_EXPR
12695               || operator_code == MINUS_EXPR
12696               || operator_code == TRUNC_DIV_EXPR
12697               || operator_code == MULT_EXPR)
12698           && TREE_CODE (TREE_TYPE (TREE_TYPE (decl))) == REFERENCE_TYPE)
12699         cp_warning ("`%D' should return by value", decl);
12700
12701       /* 13.4.0.8 */
12702       for (; argtypes && argtypes != void_list_node;
12703           argtypes = TREE_CHAIN (argtypes))
12704         if (TREE_PURPOSE (argtypes))
12705           {
12706             TREE_PURPOSE (argtypes) = NULL_TREE;
12707             if (operator_code == POSTINCREMENT_EXPR
12708                 || operator_code == POSTDECREMENT_EXPR)
12709               {
12710                 if (pedantic)
12711                   cp_pedwarn ("`%D' cannot have default arguments", decl);
12712               }
12713             else
12714               cp_error ("`%D' cannot have default arguments", decl);
12715           }
12716
12717     }
12718 }
12719 \f
12720 static const char *
12721 tag_name (code)
12722      enum tag_types code;
12723 {
12724   switch (code)
12725     {
12726     case record_type:
12727       return "struct";
12728     case class_type:
12729       return "class";
12730     case union_type:
12731       return "union ";
12732     case enum_type:
12733       return "enum";
12734     default:
12735       my_friendly_abort (981122);
12736     }
12737 }
12738
12739 /* Get the struct, enum or union (CODE says which) with tag NAME.
12740    Define the tag as a forward-reference if it is not defined.
12741
12742    C++: If a class derivation is given, process it here, and report
12743    an error if multiple derivation declarations are not identical.
12744
12745    If this is a definition, come in through xref_tag and only look in
12746    the current frame for the name (since C++ allows new names in any
12747    scope.)  */
12748
12749 tree
12750 xref_tag (code_type_node, name, globalize)
12751      tree code_type_node;
12752      tree name;
12753      int globalize;
12754 {
12755   enum tag_types tag_code;
12756   enum tree_code code;
12757   register tree ref, t;
12758   struct binding_level *b = current_binding_level;
12759   int got_type = 0;
12760   tree attributes = NULL_TREE;
12761   tree context = NULL_TREE;
12762
12763   /* If we are called from the parser, code_type_node will sometimes be a
12764      TREE_LIST.  This indicates that the user wrote
12765      "class __attribute__ ((foo)) bar".  Extract the attributes so we can
12766      use them later.  */
12767   if (TREE_CODE (code_type_node) == TREE_LIST)
12768     {
12769       attributes = TREE_PURPOSE (code_type_node);
12770       code_type_node = TREE_VALUE (code_type_node);
12771     }
12772
12773   tag_code = (enum tag_types) tree_low_cst (code_type_node, 1);
12774   switch (tag_code)
12775     {
12776     case record_type:
12777     case class_type:
12778       code = RECORD_TYPE;
12779       break;
12780     case union_type:
12781       code = UNION_TYPE;
12782       break;
12783     case enum_type:
12784       code = ENUMERAL_TYPE;
12785       break;
12786     default:
12787       my_friendly_abort (18);
12788     }
12789
12790   /* If a cross reference is requested, look up the type
12791      already defined for this tag and return it.  */
12792   if (TYPE_P (name))
12793     {
12794       t = name;
12795       name = TYPE_IDENTIFIER (t);
12796       got_type = 1;
12797     }
12798   else
12799     t = IDENTIFIER_TYPE_VALUE (name);
12800
12801   /* Warn about 'friend struct Inherited;' doing the wrong thing.  */
12802   if (t && globalize && TREE_CODE (t) == TYPENAME_TYPE)
12803     {
12804       static int explained;
12805
12806       cp_warning ("`%s %T' declares a new type at namespace scope;\n\
12807 to refer to the inherited type, say `%s %T::%T'%s",
12808                   tag_name (tag_code), name, tag_name (tag_code),
12809                   constructor_name (current_class_type), TYPE_IDENTIFIER (t),
12810                   (!explained ? "\n\
12811 (names from dependent base classes are not visible to unqualified name lookup)"
12812                    : ""));
12813
12814       explained = 1;
12815     }
12816
12817   if (t && TREE_CODE (t) != code && TREE_CODE (t) != TEMPLATE_TYPE_PARM
12818       && TREE_CODE (t) != BOUND_TEMPLATE_TEMPLATE_PARM)
12819     t = NULL_TREE;
12820
12821   if (! globalize)
12822     {
12823       /* If we know we are defining this tag, only look it up in
12824          this scope and don't try to find it as a type.  */
12825       ref = lookup_tag (code, name, b, 1);
12826     }
12827   else
12828     {
12829       if (t)
12830         {
12831           /* [dcl.type.elab] If the identifier resolves to a
12832              typedef-name or a template type-parameter, the
12833              elaborated-type-specifier is ill-formed.  */
12834           if (t != TYPE_MAIN_VARIANT (t)
12835               || (CLASS_TYPE_P (t) && TYPE_WAS_ANONYMOUS (t)))
12836             cp_pedwarn ("using typedef-name `%D' after `%s'",
12837                         TYPE_NAME (t), tag_name (tag_code));
12838           else if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
12839             cp_error ("using template type parameter `%T' after `%s'",
12840                       t, tag_name (tag_code));
12841
12842           ref = t;
12843         }
12844       else
12845         ref = lookup_tag (code, name, b, 0);
12846
12847       if (! ref)
12848         {
12849           /* Try finding it as a type declaration.  If that wins,
12850              use it.  */
12851           ref = lookup_name (name, 1);
12852
12853           if (ref != NULL_TREE
12854               && processing_template_decl
12855               && DECL_CLASS_TEMPLATE_P (ref)
12856               && template_class_depth (current_class_type) == 0)
12857             /* Since GLOBALIZE is true, we're declaring a global
12858                template, so we want this type.  */
12859             ref = DECL_TEMPLATE_RESULT (ref);
12860
12861           if (ref && TREE_CODE (ref) == TYPE_DECL
12862               && TREE_CODE (TREE_TYPE (ref)) == code)
12863             ref = TREE_TYPE (ref);
12864           else
12865             ref = NULL_TREE;
12866         }
12867
12868       if (ref && current_class_type
12869           && template_class_depth (current_class_type)
12870           && PROCESSING_REAL_TEMPLATE_DECL_P ())
12871         {
12872           /* Since GLOBALIZE is non-zero, we are not looking at a
12873              definition of this tag.  Since, in addition, we are currently
12874              processing a (member) template declaration of a template
12875              class, we must be very careful; consider:
12876
12877                template <class X>
12878                struct S1
12879
12880                template <class U>
12881                struct S2
12882                { template <class V>
12883                friend struct S1; };
12884
12885              Here, the S2::S1 declaration should not be confused with the
12886              outer declaration.  In particular, the inner version should
12887              have a template parameter of level 2, not level 1.  This
12888              would be particularly important if the member declaration
12889              were instead:
12890
12891                template <class V = U> friend struct S1;
12892
12893              say, when we should tsubst into `U' when instantiating
12894              S2.  On the other hand, when presented with:
12895
12896                  template <class T>
12897                  struct S1 {
12898                    template <class U>
12899                    struct S2 {};
12900                    template <class U>
12901                    friend struct S2;
12902                  };
12903
12904               we must find the inner binding eventually.  We
12905               accomplish this by making sure that the new type we
12906               create to represent this declaration has the right
12907               TYPE_CONTEXT.  */
12908           context = TYPE_CONTEXT (ref);
12909           ref = NULL_TREE;
12910         }
12911     }
12912
12913   if (! ref)
12914     {
12915       /* If no such tag is yet defined, create a forward-reference node
12916          and record it as the "definition".
12917          When a real declaration of this type is found,
12918          the forward-reference will be altered into a real type.  */
12919       if (code == ENUMERAL_TYPE)
12920         {
12921           cp_error ("use of enum `%#D' without previous declaration", name);
12922
12923           ref = make_node (ENUMERAL_TYPE);
12924
12925           /* Give the type a default layout like unsigned int
12926              to avoid crashing if it does not get defined.  */
12927           TYPE_MODE (ref) = TYPE_MODE (unsigned_type_node);
12928           TYPE_ALIGN (ref) = TYPE_ALIGN (unsigned_type_node);
12929           TYPE_USER_ALIGN (ref) = 0;
12930           TREE_UNSIGNED (ref) = 1;
12931           TYPE_PRECISION (ref) = TYPE_PRECISION (unsigned_type_node);
12932           TYPE_MIN_VALUE (ref) = TYPE_MIN_VALUE (unsigned_type_node);
12933           TYPE_MAX_VALUE (ref) = TYPE_MAX_VALUE (unsigned_type_node);
12934
12935           /* Enable us to recognize when a type is created in class context.
12936              To do nested classes correctly, this should probably be cleared
12937              out when we leave this classes scope.  Currently this in only
12938              done in `start_enum'.  */
12939
12940           pushtag (name, ref, globalize);
12941         }
12942       else
12943         {
12944           struct binding_level *old_b = class_binding_level;
12945
12946           ref = make_aggr_type (code);
12947           TYPE_CONTEXT (ref) = context;
12948
12949 #ifdef NONNESTED_CLASSES
12950           /* Class types don't nest the way enums do.  */
12951           class_binding_level = (struct binding_level *)0;
12952 #endif
12953           pushtag (name, ref, globalize);
12954           class_binding_level = old_b;
12955         }
12956     }
12957   else
12958     {
12959       if (!globalize && processing_template_decl && IS_AGGR_TYPE (ref))
12960         redeclare_class_template (ref, current_template_parms);
12961     }
12962
12963   /* Until the type is defined, tentatively accept whatever
12964      structure tag the user hands us.  */
12965   if (!COMPLETE_TYPE_P (ref)
12966       && ref != current_class_type
12967       /* Have to check this, in case we have contradictory tag info.  */
12968       && IS_AGGR_TYPE_CODE (TREE_CODE (ref)))
12969     {
12970       if (tag_code == class_type)
12971         CLASSTYPE_DECLARED_CLASS (ref) = 1;
12972       else if (tag_code == record_type)
12973         CLASSTYPE_DECLARED_CLASS (ref) = 0;
12974     }
12975
12976   TREE_TYPE (ref) = attributes;
12977
12978   return ref;
12979 }
12980
12981 tree
12982 xref_tag_from_type (old, id, globalize)
12983      tree old, id;
12984      int globalize;
12985 {
12986   tree code_type_node;
12987
12988   if (TREE_CODE (old) == RECORD_TYPE)
12989     code_type_node = (CLASSTYPE_DECLARED_CLASS (old)
12990                       ? class_type_node : record_type_node);
12991   else
12992     code_type_node = union_type_node;
12993
12994   if (id == NULL_TREE)
12995     id = TYPE_IDENTIFIER (old);
12996
12997   return xref_tag (code_type_node, id, globalize);
12998 }
12999
13000 /* REF is a type (named NAME), for which we have just seen some
13001    baseclasses.  BINFO is a list of those baseclasses; the
13002    TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
13003    the base-class.  CODE_TYPE_NODE indicates whether REF is a class,
13004    struct, or union.  */
13005
13006 void
13007 xref_basetypes (code_type_node, name, ref, binfo)
13008      tree code_type_node;
13009      tree name, ref;
13010      tree binfo;
13011 {
13012   /* In the declaration `A : X, Y, ... Z' we mark all the types
13013      (A, X, Y, ..., Z) so we can check for duplicates.  */
13014   tree binfos;
13015   tree base;
13016
13017   int i, len;
13018   enum tag_types tag_code = (enum tag_types) tree_low_cst (code_type_node, 1);
13019
13020   if (tag_code == union_type)
13021     {
13022       cp_error ("derived union `%T' invalid", ref);
13023       return;
13024     }
13025
13026   len = list_length (binfo);
13027
13028   /* First, make sure that any templates in base-classes are
13029      instantiated.  This ensures that if we call ourselves recursively
13030      we do not get confused about which classes are marked and which
13031      are not.  */
13032   for (base = binfo; base; base = TREE_CHAIN (base))
13033     complete_type (TREE_VALUE (base));
13034
13035   SET_CLASSTYPE_MARKED (ref);
13036   BINFO_BASETYPES (TYPE_BINFO (ref)) = binfos = make_tree_vec (len);
13037
13038   for (i = 0; binfo; binfo = TREE_CHAIN (binfo))
13039     {
13040       /* The base of a derived struct is public by default.  */
13041       int via_public
13042         = (TREE_PURPOSE (binfo) == access_public_node
13043            || TREE_PURPOSE (binfo) == access_public_virtual_node
13044            || (tag_code != class_type
13045                && (TREE_PURPOSE (binfo) == access_default_node
13046                    || TREE_PURPOSE (binfo) == access_default_virtual_node)));
13047       int via_protected
13048         = (TREE_PURPOSE (binfo) == access_protected_node
13049            || TREE_PURPOSE (binfo) == access_protected_virtual_node);
13050       int via_virtual
13051         = (TREE_PURPOSE (binfo) == access_private_virtual_node
13052            || TREE_PURPOSE (binfo) == access_protected_virtual_node
13053            || TREE_PURPOSE (binfo) == access_public_virtual_node
13054            || TREE_PURPOSE (binfo) == access_default_virtual_node);
13055       tree basetype = TREE_VALUE (binfo);
13056       tree base_binfo;
13057
13058       if (basetype && TREE_CODE (basetype) == TYPE_DECL)
13059         basetype = TREE_TYPE (basetype);
13060       if (!basetype
13061           || (TREE_CODE (basetype) != RECORD_TYPE
13062               && TREE_CODE (basetype) != TYPENAME_TYPE
13063               && TREE_CODE (basetype) != TEMPLATE_TYPE_PARM
13064               && TREE_CODE (basetype) != BOUND_TEMPLATE_TEMPLATE_PARM))
13065         {
13066           cp_error ("base type `%T' fails to be a struct or class type",
13067                     TREE_VALUE (binfo));
13068           continue;
13069         }
13070
13071       GNU_xref_hier (name, basetype, via_public, via_virtual, 0);
13072
13073       /* This code replaces similar code in layout_basetypes.
13074          We put the complete_type first for implicit `typename'.  */
13075       if (!COMPLETE_TYPE_P (basetype)
13076           && ! (current_template_parms && uses_template_parms (basetype)))
13077         {
13078           cp_error ("base class `%T' has incomplete type", basetype);
13079           continue;
13080         }
13081       else
13082         {
13083           if (CLASSTYPE_MARKED (basetype))
13084             {
13085               if (basetype == ref)
13086                 cp_error ("recursive type `%T' undefined", basetype);
13087               else
13088                 cp_error ("duplicate base type `%T' invalid", basetype);
13089               continue;
13090             }
13091
13092           if (TYPE_FOR_JAVA (basetype)
13093               && (current_lang_stack
13094                   == &VARRAY_TREE (current_lang_base, 0)))
13095             TYPE_FOR_JAVA (ref) = 1;
13096
13097           /* Note that the BINFO records which describe individual
13098              inheritances are *not* shared in the lattice!  They
13099              cannot be shared because a given baseclass may be
13100              inherited with different `accessibility' by different
13101              derived classes.  (Each BINFO record describing an
13102              individual inheritance contains flags which say what
13103              the `accessibility' of that particular inheritance is.)  */
13104
13105           base_binfo
13106             = make_binfo (size_zero_node, basetype,
13107                           CLASS_TYPE_P (basetype)
13108                           ? TYPE_BINFO_VTABLE (basetype) : NULL_TREE,
13109                           CLASS_TYPE_P (basetype)
13110                           ? TYPE_BINFO_VIRTUALS (basetype) : NULL_TREE);
13111
13112           TREE_VEC_ELT (binfos, i) = base_binfo;
13113           TREE_VIA_PUBLIC (base_binfo) = via_public;
13114           TREE_VIA_PROTECTED (base_binfo) = via_protected;
13115           TREE_VIA_VIRTUAL (base_binfo) = via_virtual;
13116           BINFO_INHERITANCE_CHAIN (base_binfo) = TYPE_BINFO (ref);
13117
13118           /* We need to unshare the binfos now so that lookups during class
13119              definition work.  */
13120           unshare_base_binfos (base_binfo);
13121
13122           SET_CLASSTYPE_MARKED (basetype);
13123
13124           /* We are free to modify these bits because they are meaningless
13125              at top level, and BASETYPE is a top-level type.  */
13126           if (via_virtual || TYPE_USES_VIRTUAL_BASECLASSES (basetype))
13127             {
13128               TYPE_USES_VIRTUAL_BASECLASSES (ref) = 1;
13129               /* Converting to a virtual base class requires looking
13130                  up the offset of the virtual base.  */
13131               TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref) = 1;
13132             }
13133
13134           if (CLASS_TYPE_P (basetype))
13135             {
13136               TYPE_HAS_NEW_OPERATOR (ref)
13137                 |= TYPE_HAS_NEW_OPERATOR (basetype);
13138               TYPE_HAS_ARRAY_NEW_OPERATOR (ref)
13139                 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype);
13140               TYPE_GETS_DELETE (ref) |= TYPE_GETS_DELETE (basetype);
13141               /* If the base-class uses multiple inheritance, so do we.  */
13142               TYPE_USES_MULTIPLE_INHERITANCE (ref)
13143                 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype);
13144               /* Likewise, if converting to a base of the base may require
13145                  code, then we may need to generate code to convert to a
13146                  base as well.  */
13147               TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref)
13148                 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype);
13149             }
13150
13151           i += 1;
13152         }
13153     }
13154   if (i)
13155     TREE_VEC_LENGTH (binfos) = i;
13156   else
13157     BINFO_BASETYPES (TYPE_BINFO (ref)) = NULL_TREE;
13158
13159   if (i > 1)
13160     {
13161       TYPE_USES_MULTIPLE_INHERITANCE (ref) = 1;
13162       /* If there is more than one non-empty they cannot be at the same
13163          address.  */
13164       TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref) = 1;
13165     }
13166
13167   /* Unmark all the types.  */
13168   while (--i >= 0)
13169     CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos, i)));
13170   CLEAR_CLASSTYPE_MARKED (ref);
13171
13172   /* Now that we know all the base-classes, set up the list of virtual
13173      bases.  */
13174   get_vbase_types (ref);
13175 }
13176
13177 \f
13178 /* Begin compiling the definition of an enumeration type.
13179    NAME is its name (or null if anonymous).
13180    Returns the type object, as yet incomplete.
13181    Also records info about it so that build_enumerator
13182    may be used to declare the individual values as they are read.  */
13183
13184 tree
13185 start_enum (name)
13186      tree name;
13187 {
13188   register tree enumtype = NULL_TREE;
13189   struct binding_level *b = current_binding_level;
13190
13191   /* If this is the real definition for a previous forward reference,
13192      fill in the contents in the same object that used to be the
13193      forward reference.  */
13194
13195   if (name != NULL_TREE)
13196     enumtype = lookup_tag (ENUMERAL_TYPE, name, b, 1);
13197
13198   if (enumtype != NULL_TREE && TREE_CODE (enumtype) == ENUMERAL_TYPE)
13199     {
13200       cp_error ("multiple definition of `%#T'", enumtype);
13201       cp_error_at ("previous definition here", enumtype);
13202       /* Clear out TYPE_VALUES, and start again.  */
13203       TYPE_VALUES (enumtype) = NULL_TREE;
13204     }
13205   else
13206     {
13207       enumtype = make_node (ENUMERAL_TYPE);
13208       pushtag (name, enumtype, 0);
13209     }
13210
13211   if (current_class_type)
13212     TREE_ADDRESSABLE (b->tags) = 1;
13213
13214   GNU_xref_decl (current_function_decl, enumtype);
13215   return enumtype;
13216 }
13217
13218 /* After processing and defining all the values of an enumeration type,
13219    install their decls in the enumeration type and finish it off.
13220    ENUMTYPE is the type object and VALUES a list of name-value pairs.
13221    Returns ENUMTYPE.  */
13222
13223 tree
13224 finish_enum (enumtype)
13225      tree enumtype;
13226 {
13227   register tree minnode = NULL_TREE, maxnode = NULL_TREE;
13228   /* Calculate the maximum value of any enumerator in this type.  */
13229
13230   tree values = TYPE_VALUES (enumtype);
13231   if (values)
13232     {
13233       tree pair;
13234
13235       for (pair = values; pair; pair = TREE_CHAIN (pair))
13236         {
13237           tree decl;
13238           tree value;
13239
13240           /* The TREE_VALUE is a CONST_DECL for this enumeration
13241              constant.  */
13242           decl = TREE_VALUE (pair);
13243
13244           /* [dcl.enum]
13245
13246              Following the closing brace of an enum-specifier, each
13247              enumerator has the type of its enumeration.  Prior to the
13248              closing brace, the type of each enumerator is the type of
13249              its initializing value.  */
13250           TREE_TYPE (decl) = enumtype;
13251
13252           /* The DECL_INITIAL will be NULL if we are processing a
13253              template declaration and this enumeration constant had no
13254              explicit initializer.  */
13255           value = DECL_INITIAL (decl);
13256           if (value && !processing_template_decl)
13257             {
13258               /* Set the TREE_TYPE for the VALUE as well.  That's so
13259                  that when we call decl_constant_value we get an
13260                  entity of the right type (but with the constant
13261                  value).  Since we shouldn't ever call
13262                  decl_constant_value on a template type, there's no
13263                  reason to do that when processing_template_decl.
13264                  And, if the expression is something like a
13265                  TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
13266                  wreak havoc on the intended type of the expression.
13267
13268                  Of course, there's also no point in trying to compute
13269                  minimum or maximum values if we're in a template.  */
13270               TREE_TYPE (value) = enumtype;
13271
13272               if (!minnode)
13273                 minnode = maxnode = value;
13274               else if (tree_int_cst_lt (maxnode, value))
13275                 maxnode = value;
13276               else if (tree_int_cst_lt (value, minnode))
13277                 minnode = value;
13278             }
13279
13280           if (processing_template_decl)
13281             /* If this is just a template, leave the CONST_DECL
13282                alone.  That way tsubst_copy will find CONST_DECLs for
13283                CONST_DECLs, and not INTEGER_CSTs.  */
13284             ;
13285           else
13286             /* In the list we're building up, we want the enumeration
13287                values, not the CONST_DECLs.  */
13288             TREE_VALUE (pair) = value;
13289         }
13290     }
13291   else
13292     maxnode = minnode = integer_zero_node;
13293
13294   TYPE_VALUES (enumtype) = nreverse (values);
13295
13296   if (processing_template_decl)
13297     {
13298       tree scope = current_scope ();
13299       if (scope && TREE_CODE (scope) == FUNCTION_DECL)
13300         add_stmt (build_min (TAG_DEFN, enumtype));
13301     }
13302   else
13303     {
13304       int unsignedp = tree_int_cst_sgn (minnode) >= 0;
13305       int lowprec = min_precision (minnode, unsignedp);
13306       int highprec = min_precision (maxnode, unsignedp);
13307       int precision = MAX (lowprec, highprec);
13308       tree tem;
13309
13310       TYPE_SIZE (enumtype) = NULL_TREE;
13311
13312       /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'.  */
13313
13314       TYPE_PRECISION (enumtype) = precision;
13315       if (unsignedp)
13316         fixup_unsigned_type (enumtype);
13317       else
13318         fixup_signed_type (enumtype);
13319
13320       if (flag_short_enums || (precision > TYPE_PRECISION (integer_type_node)))
13321         /* Use the width of the narrowest normal C type which is wide
13322            enough.  */
13323         TYPE_PRECISION (enumtype) = TYPE_PRECISION (type_for_size
13324                                                     (precision, 1));
13325       else
13326         TYPE_PRECISION (enumtype) = TYPE_PRECISION (integer_type_node);
13327
13328       TYPE_SIZE (enumtype) = 0;
13329       layout_type (enumtype);
13330
13331       /* Fix up all variant types of this enum type.  */
13332       for (tem = TYPE_MAIN_VARIANT (enumtype); tem;
13333            tem = TYPE_NEXT_VARIANT (tem))
13334         {
13335           TYPE_VALUES (tem) = TYPE_VALUES (enumtype);
13336           TYPE_MIN_VALUE (tem) = TYPE_MIN_VALUE (enumtype);
13337           TYPE_MAX_VALUE (tem) = TYPE_MAX_VALUE (enumtype);
13338           TYPE_SIZE (tem) = TYPE_SIZE (enumtype);
13339           TYPE_SIZE_UNIT (tem) = TYPE_SIZE_UNIT (enumtype);
13340           TYPE_MODE (tem) = TYPE_MODE (enumtype);
13341           TYPE_PRECISION (tem) = TYPE_PRECISION (enumtype);
13342           TYPE_ALIGN (tem) = TYPE_ALIGN (enumtype);
13343           TYPE_USER_ALIGN (tem) = TYPE_USER_ALIGN (enumtype);
13344           TREE_UNSIGNED (tem) = TREE_UNSIGNED (enumtype);
13345         }
13346
13347       /* Finish debugging output for this type.  */
13348       rest_of_type_compilation (enumtype, namespace_bindings_p ());
13349     }
13350
13351   return enumtype;
13352 }
13353
13354 /* Build and install a CONST_DECL for an enumeration constant of the
13355    enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13356    Assignment of sequential values by default is handled here.  */
13357
13358 void
13359 build_enumerator (name, value, enumtype)
13360      tree name;
13361      tree value;
13362      tree enumtype;
13363 {
13364   tree decl;
13365   tree context;
13366   tree type;
13367   tree values;
13368
13369   /* Remove no-op casts from the value.  */
13370   if (value)
13371     STRIP_TYPE_NOPS (value);
13372
13373   if (! processing_template_decl)
13374     {
13375       /* Validate and default VALUE.  */
13376       if (value != NULL_TREE)
13377         {
13378           value = decl_constant_value (value);
13379
13380           if (TREE_CODE (value) == INTEGER_CST)
13381             {
13382               value = default_conversion (value);
13383               constant_expression_warning (value);
13384             }
13385           else
13386             {
13387               cp_error ("enumerator value for `%D' not integer constant", name);
13388               value = NULL_TREE;
13389             }
13390         }
13391
13392       /* Default based on previous value.  */
13393       if (value == NULL_TREE && ! processing_template_decl)
13394         {
13395           tree prev_value;
13396
13397           if (TYPE_VALUES (enumtype))
13398             {
13399               /* The next value is the previous value ... */
13400               prev_value = DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype)));
13401               /* ... plus one.  */
13402               value = cp_build_binary_op (PLUS_EXPR,
13403                                           prev_value,
13404                                           integer_one_node);
13405
13406               if (tree_int_cst_lt (value, prev_value))
13407                 cp_error ("overflow in enumeration values at `%D'", name);
13408             }
13409           else
13410             value = integer_zero_node;
13411         }
13412
13413       /* Remove no-op casts from the value.  */
13414       if (value)
13415         STRIP_TYPE_NOPS (value);
13416 #if 0
13417       /* To fix MAX_VAL enum consts. (bkoz)  */
13418       TREE_TYPE (value) = integer_type_node;
13419 #endif
13420     }
13421
13422   /* We always have to copy here; not all INTEGER_CSTs are unshared.
13423      Even in other cases, we will later (in finish_enum) be setting
13424      the type of VALUE.  But, we don't need to make a copy if this
13425      VALUE is one of the enumeration constants for this same
13426      enumeration type.  */
13427   for (values = TYPE_VALUES (enumtype); values; values = TREE_CHAIN (values))
13428     if (TREE_VALUE (values) == value)
13429       break;
13430   /* If we didn't break out of the loop, then we do need a copy.  */
13431   if (!values && value)
13432     value = copy_node (value);
13433
13434   /* C++ associates enums with global, function, or class declarations.  */
13435   context = current_scope ();
13436
13437   /* Build the actual enumeration constant.  Note that the enumeration
13438     constants have the type of their initializers until the
13439     enumeration is complete:
13440
13441       [ dcl.enum ]
13442
13443       Following the closing brace of an enum-specifier, each enumer-
13444       ator has the type of its enumeration.  Prior to the closing
13445       brace, the type of each enumerator is the type of its
13446       initializing value.
13447
13448     In finish_enum we will reset the type.  Of course, if we're
13449     processing a template, there may be no value.   */
13450   type = value ? TREE_TYPE (value) : NULL_TREE;
13451
13452   if (context && context == current_class_type)
13453     /* This enum declaration is local to the class.  We need the full
13454        lang_decl so that we can record DECL_CLASS_CONTEXT, for example.  */
13455     decl = build_lang_decl (CONST_DECL, name, type);
13456   else
13457     /* It's a global enum, or it's local to a function.  (Note local to
13458       a function could mean local to a class method.  */
13459     decl = build_decl (CONST_DECL, name, type);
13460
13461   DECL_CONTEXT (decl) = FROB_CONTEXT (context);
13462   DECL_INITIAL (decl) = value;
13463   TREE_READONLY (decl) = 1;
13464
13465   if (context && context == current_class_type)
13466     /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13467       on the TYPE_FIELDS list for `S'.  (That's so that you can say
13468       things like `S::i' later.)  */
13469     finish_member_declaration (decl);
13470   else
13471     {
13472       pushdecl (decl);
13473       GNU_xref_decl (current_function_decl, decl);
13474     }
13475
13476   /* Add this enumeration constant to the list for this type.  */
13477   TYPE_VALUES (enumtype) = tree_cons (name, decl, TYPE_VALUES (enumtype));
13478 }
13479
13480 \f
13481 /* We're defining DECL.  Make sure that it's type is OK.  */
13482
13483 static void
13484 check_function_type (decl, current_function_parms)
13485      tree decl;
13486      tree current_function_parms;
13487 {
13488   tree fntype = TREE_TYPE (decl);
13489   tree return_type = complete_type (TREE_TYPE (fntype));
13490
13491   /* In a function definition, arg types must be complete.  */
13492   require_complete_types_for_parms (current_function_parms);
13493
13494   if (!COMPLETE_OR_VOID_TYPE_P (return_type))
13495     {
13496       cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype));
13497
13498       /* Make it return void instead, but don't change the
13499          type of the DECL_RESULT, in case we have a named return value.  */
13500       if (TREE_CODE (fntype) == METHOD_TYPE)
13501         {
13502           tree ctype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype)));
13503           TREE_TYPE (decl)
13504             = build_cplus_method_type (ctype,
13505                                        void_type_node,
13506                                        FUNCTION_ARG_CHAIN (decl));
13507         }
13508       else
13509         TREE_TYPE (decl)
13510           = build_function_type (void_type_node,
13511                                  TYPE_ARG_TYPES (TREE_TYPE (decl)));
13512       TREE_TYPE (decl)
13513         = build_exception_variant (fntype,
13514                                    TYPE_RAISES_EXCEPTIONS (fntype));
13515     }
13516   else
13517     abstract_virtuals_error (decl, TREE_TYPE (fntype));
13518 }
13519
13520 /* Create the FUNCTION_DECL for a function definition.
13521    DECLSPECS and DECLARATOR are the parts of the declaration;
13522    they describe the function's name and the type it returns,
13523    but twisted together in a fashion that parallels the syntax of C.
13524
13525    FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13526    DECLARATOR is really the DECL for the function we are about to
13527    process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13528    indicating that the function is an inline defined in-class.
13529
13530    This function creates a binding context for the function body
13531    as well as setting up the FUNCTION_DECL in current_function_decl.
13532
13533    Returns 1 on success.  If the DECLARATOR is not suitable for a function
13534    (it defines a datum instead), we return 0, which tells
13535    yyparse to report a parse error.
13536
13537    For C++, we must first check whether that datum makes any sense.
13538    For example, "class A local_a(1,2);" means that variable local_a
13539    is an aggregate of type A, which should have a constructor
13540    applied to it with the argument list [1, 2].  */
13541
13542 int
13543 start_function (declspecs, declarator, attrs, flags)
13544      tree declspecs, declarator, attrs;
13545      int flags;
13546 {
13547   tree decl1;
13548   tree ctype = NULL_TREE;
13549   tree fntype;
13550   tree restype;
13551   extern int have_extern_spec;
13552   extern int used_extern_spec;
13553   int doing_friend = 0;
13554   struct binding_level *bl;
13555   tree current_function_parms;
13556
13557   /* Sanity check.  */
13558   my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node)) == VOID_TYPE, 160);
13559   my_friendly_assert (TREE_CHAIN (void_list_node) == NULL_TREE, 161);
13560
13561   /* This should only be done once on the top most decl.  */
13562   if (have_extern_spec && !used_extern_spec)
13563     {
13564       declspecs = tree_cons (NULL_TREE, get_identifier ("extern"), declspecs);
13565       used_extern_spec = 1;
13566     }
13567
13568   if (flags & SF_PRE_PARSED)
13569     {
13570       decl1 = declarator;
13571
13572       fntype = TREE_TYPE (decl1);
13573       if (TREE_CODE (fntype) == METHOD_TYPE)
13574         ctype = TYPE_METHOD_BASETYPE (fntype);
13575
13576       /* ISO C++ 11.4/5.  A friend function defined in a class is in
13577          the (lexical) scope of the class in which it is defined.  */
13578       if (!ctype && DECL_FRIEND_P (decl1))
13579         {
13580           ctype = DECL_FRIEND_CONTEXT (decl1);
13581
13582           /* CTYPE could be null here if we're dealing with a template;
13583              for example, `inline friend float foo()' inside a template
13584              will have no CTYPE set.  */
13585           if (ctype && TREE_CODE (ctype) != RECORD_TYPE)
13586             ctype = NULL_TREE;
13587           else
13588             doing_friend = 1;
13589         }
13590
13591       last_function_parms = DECL_ARGUMENTS (decl1);
13592       last_function_parm_tags = NULL_TREE;
13593     }
13594   else
13595     {
13596       decl1 = grokdeclarator (declarator, declspecs, FUNCDEF, 1, NULL_TREE);
13597       /* If the declarator is not suitable for a function definition,
13598          cause a syntax error.  */
13599       if (decl1 == NULL_TREE || TREE_CODE (decl1) != FUNCTION_DECL) return 0;
13600
13601       fntype = TREE_TYPE (decl1);
13602
13603       restype = TREE_TYPE (fntype);
13604       if (CLASS_TYPE_P (restype) && !CLASSTYPE_GOT_SEMICOLON (restype))
13605         {
13606           cp_error ("semicolon missing after declaration of `%#T'", restype);
13607           shadow_tag (build_tree_list (NULL_TREE, restype));
13608           CLASSTYPE_GOT_SEMICOLON (restype) = 1;
13609           if (TREE_CODE (fntype) == FUNCTION_TYPE)
13610             fntype = build_function_type (integer_type_node,
13611                                           TYPE_ARG_TYPES (fntype));
13612           else
13613             fntype = build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype), TREE_READONLY (decl1), TREE_SIDE_EFFECTS (decl1)),
13614                                               integer_type_node,
13615                                               TYPE_ARG_TYPES (fntype));
13616           TREE_TYPE (decl1) = fntype;
13617         }
13618
13619       if (TREE_CODE (fntype) == METHOD_TYPE)
13620         ctype = TYPE_METHOD_BASETYPE (fntype);
13621       else if (DECL_MAIN_P (decl1))
13622         {
13623           /* If this doesn't return integer_type, complain.  */
13624           if (TREE_TYPE (TREE_TYPE (decl1)) != integer_type_node)
13625             {
13626               if (pedantic || warn_return_type)
13627                 pedwarn ("return type for `main' changed to `int'");
13628               TREE_TYPE (decl1) = fntype = default_function_type;
13629             }
13630         }
13631     }
13632
13633   /* Sometimes we don't notice that a function is a static member, and
13634      build a METHOD_TYPE for it.  Fix that up now.  */
13635   if (ctype != NULL_TREE && DECL_STATIC_FUNCTION_P (decl1)
13636       && TREE_CODE (TREE_TYPE (decl1)) == METHOD_TYPE)
13637     {
13638       revert_static_member_fn (decl1);
13639       last_function_parms = TREE_CHAIN (last_function_parms);
13640       ctype = NULL_TREE;
13641     }
13642
13643   /* Warn if function was previously implicitly declared
13644      (but not if we warned then).  */
13645   if (! warn_implicit
13646       && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)) != NULL_TREE)
13647     cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1)));
13648
13649   /* Set up current_class_type, and enter the scope of the class, if
13650      appropriate.  */
13651   if (ctype)
13652     push_nested_class (ctype, 1);
13653   else if (DECL_STATIC_FUNCTION_P (decl1))
13654     push_nested_class (DECL_CONTEXT (decl1), 2);
13655
13656   /* Now that we have entered the scope of the class, we must restore
13657      the bindings for any template parameters surrounding DECL1, if it
13658      is an inline member template.  (Order is important; consider the
13659      case where a template parameter has the same name as a field of
13660      the class.)  It is not until after this point that
13661      PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly.  */
13662   if (flags & SF_INCLASS_INLINE)
13663     maybe_begin_member_template_processing (decl1);
13664
13665   /* Effective C++ rule 15.  */
13666   if (warn_ecpp
13667       && DECL_OVERLOADED_OPERATOR_P (decl1) == NOP_EXPR
13668       && TREE_CODE (TREE_TYPE (fntype)) == VOID_TYPE)
13669     cp_warning ("`operator=' should return a reference to `*this'");
13670
13671   /* Make the init_value nonzero so pushdecl knows this is not tentative.
13672      error_mark_node is replaced below (in poplevel) with the BLOCK.  */
13673   if (!DECL_INITIAL (decl1))
13674     DECL_INITIAL (decl1) = error_mark_node;
13675
13676 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13677   SET_DEFAULT_DECL_ATTRIBUTES (decl1, attrs);
13678 #endif
13679
13680   /* This function exists in static storage.
13681      (This does not mean `static' in the C sense!)  */
13682   TREE_STATIC (decl1) = 1;
13683
13684   /* We must call push_template_decl after current_class_type is set
13685      up.  (If we are processing inline definitions after exiting a
13686      class scope, current_class_type will be NULL_TREE until set above
13687      by push_nested_class.)  */
13688   if (processing_template_decl)
13689     decl1 = push_template_decl (decl1);
13690
13691   /* We are now in the scope of the function being defined.  */
13692   current_function_decl = decl1;
13693
13694   /* Save the parm names or decls from this function's declarator
13695      where store_parm_decls will find them.  */
13696   current_function_parms = last_function_parms;
13697   current_function_parm_tags = last_function_parm_tags;
13698
13699   /* Make sure the parameter and return types are reasonable.  When
13700      you declare a function, these types can be incomplete, but they
13701      must be complete when you define the function.  */
13702   if (! processing_template_decl)
13703     check_function_type (decl1, current_function_parms);
13704
13705   /* Build the return declaration for the function.  */
13706   restype = TREE_TYPE (fntype);
13707   if (!processing_template_decl)
13708     {
13709       if (!DECL_RESULT (decl1))
13710         {
13711           DECL_RESULT (decl1)
13712             = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype));
13713           c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype),
13714                                       DECL_RESULT (decl1));
13715         }
13716     }
13717   else
13718     /* Just use `void'.  Nobody will ever look at this anyhow.  */
13719     DECL_RESULT (decl1) = build_decl (RESULT_DECL, 0, void_type_node);
13720
13721   /* Initialize RTL machinery.  We cannot do this until
13722      CURRENT_FUNCTION_DECL and DECL_RESULT are set up.  We do this
13723      even when processing a template; this is how we get
13724      CFUN set up, and our per-function variables initialized.  */
13725   bl = current_binding_level;
13726   init_function_start (decl1, input_filename, lineno);
13727   current_binding_level = bl;
13728
13729   /* Even though we're inside a function body, we still don't want to
13730      call expand_expr to calculate the size of a variable-sized array.
13731      We haven't necessarily assigned RTL to all variables yet, so it's
13732      not safe to try to expand expressions involving them.  */
13733   immediate_size_expand = 0;
13734   cfun->x_dont_save_pending_sizes_p = 1;
13735
13736   /* Start the statement-tree, start the tree now.  */
13737   begin_stmt_tree (&DECL_SAVED_TREE (decl1));
13738
13739   /* Let the user know we're compiling this function.  */
13740   announce_function (decl1);
13741
13742   /* Record the decl so that the function name is defined.
13743      If we already have a decl for this name, and it is a FUNCTION_DECL,
13744      use the old decl.  */
13745   if (!processing_template_decl && !(flags & SF_PRE_PARSED))
13746     {
13747       /* A specialization is not used to guide overload resolution.  */
13748       if (!DECL_TEMPLATE_SPECIALIZATION (decl1)
13749           && ! DECL_FUNCTION_MEMBER_P (decl1))
13750         decl1 = pushdecl (decl1);
13751       else
13752         {
13753           /* We need to set the DECL_CONTEXT. */
13754           if (!DECL_CONTEXT (decl1) && DECL_TEMPLATE_INFO (decl1))
13755             DECL_CONTEXT (decl1) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1));
13756           /* And make sure we have enough default args.  */
13757           check_default_args (decl1);
13758         }
13759       fntype = TREE_TYPE (decl1);
13760     }
13761
13762   /* Reset these in case the call to pushdecl changed them.  */
13763   current_function_decl = decl1;
13764   cfun->decl = decl1;
13765
13766   /* If we are (erroneously) defining a function that we have already
13767      defined before, wipe out what we knew before.  */
13768   if (!DECL_PENDING_INLINE_P (decl1)
13769       && DECL_SAVED_FUNCTION_DATA (decl1))
13770     {
13771       free (DECL_SAVED_FUNCTION_DATA (decl1));
13772       DECL_SAVED_FUNCTION_DATA (decl1) = NULL;
13773     }
13774
13775   if (ctype && !doing_friend && !DECL_STATIC_FUNCTION_P (decl1))
13776     {
13777       /* We know that this was set up by `grokclassfn'.  We do not
13778          wait until `store_parm_decls', since evil parse errors may
13779          never get us to that point.  Here we keep the consistency
13780          between `current_class_type' and `current_class_ptr'.  */
13781       tree t = DECL_ARGUMENTS (decl1);
13782
13783       my_friendly_assert (t != NULL_TREE && TREE_CODE (t) == PARM_DECL,
13784                           162);
13785       my_friendly_assert (TREE_CODE (TREE_TYPE (t)) == POINTER_TYPE,
13786                           19990811);
13787
13788       cp_function_chain->x_current_class_ref
13789         = build_indirect_ref (t, NULL_PTR);
13790       cp_function_chain->x_current_class_ptr = t;
13791
13792       /* Constructors and destructors need to know whether they're "in
13793          charge" of initializing virtual base classes.  */
13794       if (DECL_HAS_IN_CHARGE_PARM_P (decl1))
13795         current_in_charge_parm = TREE_CHAIN (t);
13796     }
13797
13798   if (DECL_INTERFACE_KNOWN (decl1))
13799     {
13800       tree ctx = decl_function_context (decl1);
13801
13802       if (DECL_NOT_REALLY_EXTERN (decl1))
13803         DECL_EXTERNAL (decl1) = 0;
13804
13805       if (ctx != NULL_TREE && DECL_THIS_INLINE (ctx)
13806           && TREE_PUBLIC (ctx))
13807         /* This is a function in a local class in an extern inline
13808            function.  */
13809         comdat_linkage (decl1);
13810     }
13811   /* If this function belongs to an interface, it is public.
13812      If it belongs to someone else's interface, it is also external.
13813      This only affects inlines and template instantiations.  */
13814   else if (interface_unknown == 0
13815            && (! DECL_TEMPLATE_INSTANTIATION (decl1)
13816                || flag_alt_external_templates))
13817     {
13818       if (DECL_THIS_INLINE (decl1) || DECL_TEMPLATE_INSTANTIATION (decl1)
13819           || processing_template_decl)
13820         {
13821           DECL_EXTERNAL (decl1)
13822             = (interface_only
13823                || (DECL_THIS_INLINE (decl1) && ! flag_implement_inlines
13824                    && !DECL_VINDEX (decl1)));
13825
13826           /* For WIN32 we also want to put these in linkonce sections.  */
13827           maybe_make_one_only (decl1);
13828         }
13829       else
13830         DECL_EXTERNAL (decl1) = 0;
13831       DECL_NOT_REALLY_EXTERN (decl1) = 0;
13832       DECL_INTERFACE_KNOWN (decl1) = 1;
13833     }
13834   else if (interface_unknown && interface_only
13835            && (! DECL_TEMPLATE_INSTANTIATION (decl1)
13836                || flag_alt_external_templates))
13837     {
13838       /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13839          interface, we will have interface_only set but not
13840          interface_known.  In that case, we don't want to use the normal
13841          heuristics because someone will supply a #pragma implementation
13842          elsewhere, and deducing it here would produce a conflict.  */
13843       comdat_linkage (decl1);
13844       DECL_EXTERNAL (decl1) = 0;
13845       DECL_INTERFACE_KNOWN (decl1) = 1;
13846       DECL_DEFER_OUTPUT (decl1) = 1;
13847     }
13848   else
13849     {
13850       /* This is a definition, not a reference.
13851          So clear DECL_EXTERNAL.  */
13852       DECL_EXTERNAL (decl1) = 0;
13853
13854       if ((DECL_THIS_INLINE (decl1) || DECL_TEMPLATE_INSTANTIATION (decl1))
13855           && ! DECL_INTERFACE_KNOWN (decl1)
13856           /* Don't try to defer nested functions for now.  */
13857           && ! decl_function_context (decl1))
13858         DECL_DEFER_OUTPUT (decl1) = 1;
13859       else
13860         DECL_INTERFACE_KNOWN (decl1) = 1;
13861     }
13862
13863   pushlevel (0);
13864   current_binding_level->parm_flag = 1;
13865
13866   if (attrs)
13867     cplus_decl_attributes (decl1, NULL_TREE, attrs);
13868
13869   /* We need to do this even if we aren't expanding yet so that
13870      assemble_external works.  */
13871   make_function_rtl (decl1);
13872
13873   /* Promote the value to int before returning it.  */
13874   if (C_PROMOTING_INTEGER_TYPE_P (restype))
13875     restype = type_promotes_to (restype);
13876
13877   /* If this fcn was already referenced via a block-scope `extern' decl
13878      (or an implicit decl), propagate certain information about the usage.  */
13879   if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1)))
13880     TREE_ADDRESSABLE (decl1) = 1;
13881
13882   if (DECL_RESULT (decl1) == NULL_TREE)
13883     {
13884       DECL_RESULT (decl1)
13885         = build_decl (RESULT_DECL, 0, TYPE_MAIN_VARIANT (restype));
13886       TREE_READONLY (DECL_RESULT (decl1)) = CP_TYPE_CONST_P (restype);
13887       TREE_THIS_VOLATILE (DECL_RESULT (decl1)) = CP_TYPE_VOLATILE_P (restype);
13888     }
13889
13890   ++function_depth;
13891
13892   if (DECL_DESTRUCTOR_P (decl1))
13893     {
13894       dtor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13895       DECL_CONTEXT (dtor_label) = current_function_decl;
13896     }
13897   /* Under the old ABI we return `this' from constructors, so we make
13898      ordinary `return' statements in constructors jump to CTOR_LABEL;
13899      from there we return `this'.  Under the new ABI, we don't bother
13900      with any of this.  By not setting CTOR_LABEL the remainder of the
13901      machinery is automatically disabled.  */
13902   else if (!flag_new_abi && DECL_CONSTRUCTOR_P (decl1))
13903     {
13904       ctor_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
13905       DECL_CONTEXT (ctor_label) = current_function_decl;
13906     }
13907
13908   store_parm_decls (current_function_parms);
13909
13910   return 1;
13911 }
13912 \f
13913 /* Store the parameter declarations into the current function declaration.
13914    This is called after parsing the parameter declarations, before
13915    digesting the body of the function.
13916
13917    Also install to binding contour return value identifier, if any.  */
13918
13919 static void
13920 store_parm_decls (current_function_parms)
13921      tree current_function_parms;
13922 {
13923   register tree fndecl = current_function_decl;
13924   register tree parm;
13925   int parms_have_cleanups = 0;
13926   tree cleanups = NULL_TREE;
13927
13928   /* This is a list of types declared among parms in a prototype.  */
13929   tree parmtags = current_function_parm_tags;
13930
13931   /* This is a chain of any other decls that came in among the parm
13932      declarations.  If a parm is declared with  enum {foo, bar} x;
13933      then CONST_DECLs for foo and bar are put here.  */
13934   tree nonparms = NULL_TREE;
13935
13936   if (current_function_parms)
13937     {
13938       /* This case is when the function was defined with an ANSI prototype.
13939          The parms already have decls, so we need not do anything here
13940          except record them as in effect
13941          and complain if any redundant old-style parm decls were written.  */
13942
13943       tree specparms = current_function_parms;
13944       tree next;
13945
13946       /* Must clear this because it might contain TYPE_DECLs declared
13947              at class level.  */
13948       storedecls (NULL_TREE);
13949
13950       /* If we're doing semantic analysis, then we'll call pushdecl
13951              for each of these.  We must do them in reverse order so that
13952              they end in the correct forward order.  */
13953       specparms = nreverse (specparms);
13954
13955       for (parm = specparms; parm; parm = next)
13956         {
13957           next = TREE_CHAIN (parm);
13958           if (TREE_CODE (parm) == PARM_DECL)
13959             {
13960               tree cleanup;
13961
13962               if (DECL_NAME (parm) == NULL_TREE
13963                   || TREE_CODE (parm) != VOID_TYPE)
13964                 pushdecl (parm);
13965               else
13966                 cp_error ("parameter `%D' declared void", parm);
13967
13968               cleanup = (processing_template_decl
13969                          ? NULL_TREE
13970                          : maybe_build_cleanup (parm));
13971
13972               if (cleanup)
13973                 cleanups = tree_cons (parm, cleanup, cleanups);
13974             }
13975           else
13976             {
13977               /* If we find an enum constant or a type tag,
13978                  put it aside for the moment.  */
13979               TREE_CHAIN (parm) = NULL_TREE;
13980               nonparms = chainon (nonparms, parm);
13981             }
13982         }
13983
13984       /* Get the decls in their original chain order and record in the
13985          function.  This is all and only the PARM_DECLs that were
13986          pushed into scope by the loop above.  */
13987       DECL_ARGUMENTS (fndecl) = getdecls ();
13988       storetags (chainon (parmtags, gettags ()));
13989     }
13990   else
13991     DECL_ARGUMENTS (fndecl) = NULL_TREE;
13992
13993   /* Now store the final chain of decls for the arguments
13994      as the decl-chain of the current lexical scope.
13995      Put the enumerators in as well, at the front so that
13996      DECL_ARGUMENTS is not modified.  */
13997   storedecls (chainon (nonparms, DECL_ARGUMENTS (fndecl)));
13998
13999   /* Now that we have initialized the parms, we can start their
14000      cleanups.  We cannot do this before, since expand_decl_cleanup
14001      should not be called before the parm can be used.  */
14002   while (cleanups)
14003     {
14004       finish_decl_cleanup (TREE_PURPOSE (cleanups),
14005                            TREE_VALUE (cleanups));
14006       cleanups = TREE_CHAIN (cleanups);
14007     }
14008
14009   /* Create a binding contour which can be used to catch
14010      cleanup-generated temporaries.  */
14011   if (parms_have_cleanups)
14012     pushlevel (0);
14013
14014   /* Do the starting of the exception specifications, if we have any.  */
14015   if (flag_exceptions && !processing_template_decl
14016       && flag_enforce_eh_specs
14017       && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl)))
14018     current_eh_spec_try_block = expand_start_eh_spec ();
14019 }
14020
14021 \f
14022 /* We have finished doing semantic analysis on DECL, but have not yet
14023    generated RTL for its body.  Save away our current state, so that
14024    when we want to generate RTL later we know what to do.  */
14025
14026 static void
14027 save_function_data (decl)
14028      tree decl;
14029 {
14030   struct cp_language_function *f;
14031
14032   /* Save the language-specific per-function data so that we can
14033      get it back when we really expand this function.  */
14034   my_friendly_assert (!DECL_PENDING_INLINE_P (decl),
14035                       19990908);
14036
14037   /* Make a copy.  */
14038   f = ((struct cp_language_function *)
14039        xmalloc (sizeof (struct cp_language_function)));
14040   bcopy ((char *) cp_function_chain, (char *) f,
14041          sizeof (struct cp_language_function));
14042   DECL_SAVED_FUNCTION_DATA (decl) = f;
14043
14044   /* Clear out the bits we don't need.  */
14045   f->base.x_stmt_tree.x_last_stmt = NULL_TREE;
14046   f->base.x_stmt_tree.x_last_expr_type = NULL_TREE;
14047   f->x_named_label_uses = NULL;
14048   f->bindings = NULL;
14049
14050   /* When we get back here again, we will be expanding.  */
14051   f->x_expanding_p = 1;
14052
14053   /* If we've already decided that we cannot inline this function, we
14054      must remember that fact when we actually go to expand the
14055      function.  */
14056   f->cannot_inline = current_function_cannot_inline;
14057 }
14058
14059 /* At the end of every constructor we generate to code to return
14060    `this'.  Do that now.  */
14061
14062 static void
14063 finish_constructor_body ()
14064 {
14065   /* Any return from a constructor will end up here.  */
14066   if (ctor_label)
14067     add_stmt (build_stmt (LABEL_STMT, ctor_label));
14068
14069   /* Clear CTOR_LABEL so that finish_return_stmt knows to really
14070      generate the return, rather than a goto to CTOR_LABEL.  */
14071   ctor_label = NULL_TREE;
14072   /* In check_return_expr we translate an empty return from a
14073      constructor to a return of `this'.  */
14074   finish_return_stmt (NULL_TREE);
14075   /* Mark the end of the constructor.  */
14076   add_stmt (build_stmt (CTOR_STMT));
14077 }
14078
14079 /* At the end of every destructor we generate code to restore virtual
14080    function tables to the values desired by base classes and to call
14081    to base class destructors.  Do that now.  */
14082
14083 static void
14084 finish_destructor_body ()
14085 {
14086   tree compound_stmt;
14087   tree virtual_size;
14088   tree exprstmt;
14089   tree if_stmt;
14090
14091   /* Create a block to contain all the extra code.  */
14092   compound_stmt = begin_compound_stmt (/*has_no_scope=*/0);
14093
14094   /* Any return from a destructor will end up here.  */
14095   add_stmt (build_stmt (LABEL_STMT, dtor_label));
14096
14097   /* Generate the code to call destructor on base class.  If this
14098      destructor belongs to a class with virtual functions, then set
14099      the virtual function table pointer to represent the type of our
14100      base class.  */
14101
14102   /* This side-effect makes call to `build_delete' generate the code
14103      we have to have at the end of this destructor.  `build_delete'
14104      will set the flag again.  */
14105   TYPE_HAS_DESTRUCTOR (current_class_type) = 0;
14106
14107   exprstmt = build_delete (current_class_type,
14108                            current_class_ref,
14109                            sfk_base_destructor,
14110                            LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
14111                            0);
14112
14113   if (exprstmt != error_mark_node
14114       && (TREE_CODE (exprstmt) != NOP_EXPR
14115           || TREE_OPERAND (exprstmt, 0) != integer_zero_node
14116           || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type)))
14117     {
14118       if (exprstmt != void_zero_node)
14119         /* Don't call `expand_expr_stmt' if we're not going to do
14120            anything, since -Wall will give a diagnostic.  */
14121         finish_expr_stmt (exprstmt);
14122
14123       /* Run destructors for all virtual baseclasses.  */
14124       if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
14125         {
14126           tree vbases;
14127           tree if_stmt;
14128
14129           if_stmt = begin_if_stmt ();
14130           finish_if_stmt_cond (build (BIT_AND_EXPR, integer_type_node,
14131                                       current_in_charge_parm,
14132                                       integer_two_node),
14133                                if_stmt);
14134
14135           vbases = CLASSTYPE_VBASECLASSES (current_class_type);
14136           /* The CLASSTYPE_VBASECLASSES list is in initialization
14137              order, so we have to march through it in reverse order.  */
14138           for (vbases = nreverse (copy_list (vbases));
14139                vbases;
14140                vbases = TREE_CHAIN (vbases))
14141             {
14142               tree vbase = TREE_VALUE (vbases);
14143
14144               if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (vbase)))
14145                 {
14146                   tree vb = get_vbase
14147                     (BINFO_TYPE (vbase),
14148                      TYPE_BINFO (current_class_type));
14149                   finish_expr_stmt
14150                     (build_scoped_method_call
14151                      (current_class_ref, vb, base_dtor_identifier,
14152                       NULL_TREE));
14153                 }
14154             }
14155
14156           finish_then_clause (if_stmt);
14157           finish_if_stmt ();
14158         }
14159     }
14160
14161   virtual_size = c_sizeof (current_class_type);
14162
14163   /* At the end, call delete if that's what's requested.  */
14164
14165   /* FDIS sez: At the point of definition of a virtual destructor
14166      (including an implicit definition), non-placement operator delete
14167      shall be looked up in the scope of the destructor's class and if
14168      found shall be accessible and unambiguous.
14169
14170      This is somewhat unclear, but I take it to mean that if the class
14171      only defines placement deletes we don't do anything here.  So we
14172      pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
14173      they ever try to delete one of these.  */
14174   exprstmt = build_op_delete_call
14175     (DELETE_EXPR, current_class_ptr, virtual_size,
14176      LOOKUP_NORMAL | LOOKUP_SPECULATIVELY, NULL_TREE);
14177
14178   if_stmt = begin_if_stmt ();
14179   finish_if_stmt_cond (build (BIT_AND_EXPR, integer_type_node,
14180                               current_in_charge_parm,
14181                               integer_one_node),
14182                        if_stmt);
14183   finish_expr_stmt (exprstmt);
14184   finish_then_clause (if_stmt);
14185   finish_if_stmt ();
14186
14187   /* Close the block we started above.  */
14188   finish_compound_stmt (/*has_no_scope=*/0, compound_stmt);
14189 }
14190
14191 /* Finish up a function declaration and compile that function
14192    all the way to assembler language output.  The free the storage
14193    for the function definition.
14194
14195    FLAGS is a bitwise or of the following values:
14196      1 - CALL_POPLEVEL
14197        An extra call to poplevel (and expand_end_bindings) must be
14198        made to take care of the binding contour for the base
14199        initializers.  This is only relevant for constructors.
14200      2 - INCLASS_INLINE
14201        We just finished processing the body of an in-class inline
14202        function definition.  (This processing will have taken place
14203        after the class definition is complete.)  */
14204
14205 tree
14206 finish_function (flags)
14207      int flags;
14208 {
14209   register tree fndecl = current_function_decl;
14210   tree fntype, ctype = NULL_TREE;
14211   int call_poplevel = (flags & 1) != 0;
14212   int inclass_inline = (flags & 2) != 0;
14213   int nested;
14214
14215   /* When we get some parse errors, we can end up without a
14216      current_function_decl, so cope.  */
14217   if (fndecl == NULL_TREE)
14218     return error_mark_node;
14219
14220   nested = function_depth > 1;
14221   fntype = TREE_TYPE (fndecl);
14222
14223   /*  TREE_READONLY (fndecl) = 1;
14224       This caused &foo to be of type ptr-to-const-function
14225       which then got a warning when stored in a ptr-to-function variable.  */
14226
14227   my_friendly_assert (building_stmt_tree (), 20000911);
14228
14229   /* For a cloned function, we've already got all the code we need;
14230      there's no need to add any extra bits.  */
14231   if (!DECL_CLONED_FUNCTION_P (fndecl))
14232     {
14233       if (DECL_CONSTRUCTOR_P (fndecl))
14234         {
14235           finish_constructor_body ();
14236           if (call_poplevel)
14237             do_poplevel ();
14238         }
14239       else if (DECL_DESTRUCTOR_P (fndecl) && !processing_template_decl)
14240         finish_destructor_body ();
14241       else if (DECL_MAIN_P (fndecl))
14242         {
14243           /* Make it so that `main' always returns 0 by default.  */
14244 #ifdef VMS
14245           finish_return_stmt (integer_one_node);
14246 #else
14247           finish_return_stmt (integer_zero_node);
14248 #endif
14249         }
14250
14251       /* Finish dealing with exception specifiers.  */
14252       if (flag_exceptions && !processing_template_decl
14253           && flag_enforce_eh_specs
14254           && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl)))
14255         expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
14256                             (TREE_TYPE (current_function_decl)),
14257                             current_eh_spec_try_block);
14258     }
14259
14260   /* If we're saving up tree structure, tie off the function now.  */
14261   finish_stmt_tree (&DECL_SAVED_TREE (fndecl));
14262
14263   /* This must come after expand_function_end because cleanups might
14264      have declarations (from inline functions) that need to go into
14265      this function's blocks.  */
14266   if (current_binding_level->parm_flag != 1)
14267     my_friendly_abort (122);
14268   poplevel (1, 0, 1);
14269
14270   /* Remember that we were in class scope.  */
14271   if (current_class_name)
14272     ctype = current_class_type;
14273
14274   /* Must mark the RESULT_DECL as being in this function.  */
14275   DECL_CONTEXT (DECL_RESULT (fndecl)) = fndecl;
14276
14277   /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14278      to the FUNCTION_DECL node itself.  */
14279   BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl;
14280
14281   /* Save away current state, if appropriate.  */
14282   if (!processing_template_decl)
14283     save_function_data (fndecl);
14284
14285   /* If this function calls `setjmp' it cannot be inlined.  When
14286      `longjmp' is called it is not guaranteed to restore the value of
14287      local variables that have been modified since the call to
14288      `setjmp'.  So, if were to inline this function into some caller
14289      `c', then when we `longjmp', we might not restore all variables
14290      in `c'.  (It might seem, at first blush, that there's no way for
14291      this function to modify local variables in `c', but their
14292      addresses may have been stored somewhere accessible to this
14293      function.)  */
14294   if (!processing_template_decl && calls_setjmp_p (fndecl))
14295     DECL_UNINLINABLE (fndecl) = 1;
14296
14297   /* Clear out memory we no longer need.  */
14298   free_after_parsing (cfun);
14299   /* Since we never call rest_of_compilation, we never clear
14300      CFUN.  Do so explicitly.  */
14301   free_after_compilation (cfun);
14302   cfun = NULL;
14303
14304   /* If this is a in-class inline definition, we may have to pop the
14305      bindings for the template parameters that we added in
14306      maybe_begin_member_template_processing when start_function was
14307      called.  */
14308   if (inclass_inline)
14309     maybe_end_member_template_processing ();
14310
14311   /* Leave the scope of the class.  */
14312   if (ctype)
14313     pop_nested_class ();
14314
14315   --function_depth;
14316
14317   /* Clean up.  */
14318   if (! nested)
14319     /* Let the error reporting routines know that we're outside a
14320        function.  For a nested function, this value is used in
14321        pop_cp_function_context and then reset via pop_function_context.  */
14322     current_function_decl = NULL_TREE;
14323
14324   return fndecl;
14325 }
14326 \f
14327 /* Create the FUNCTION_DECL for a function definition.
14328    DECLSPECS and DECLARATOR are the parts of the declaration;
14329    they describe the return type and the name of the function,
14330    but twisted together in a fashion that parallels the syntax of C.
14331
14332    This function creates a binding context for the function body
14333    as well as setting up the FUNCTION_DECL in current_function_decl.
14334
14335    Returns a FUNCTION_DECL on success.
14336
14337    If the DECLARATOR is not suitable for a function (it defines a datum
14338    instead), we return 0, which tells yyparse to report a parse error.
14339
14340    May return void_type_node indicating that this method is actually
14341    a friend.  See grokfield for more details.
14342
14343    Came here with a `.pushlevel' .
14344
14345    DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14346    CHANGES TO CODE IN `grokfield'.  */
14347
14348 tree
14349 start_method (declspecs, declarator, attrlist)
14350      tree declarator, declspecs, attrlist;
14351 {
14352   tree fndecl = grokdeclarator (declarator, declspecs, MEMFUNCDEF, 0,
14353                                 attrlist);
14354
14355   /* Something too ugly to handle.  */
14356   if (fndecl == NULL_TREE)
14357     return NULL_TREE;
14358
14359   /* Pass friends other than inline friend functions back.  */
14360   if (fndecl == void_type_node)
14361     return fndecl;
14362
14363   if (TREE_CODE (fndecl) != FUNCTION_DECL)
14364     /* Not a function, tell parser to report parse error.  */
14365     return NULL_TREE;
14366
14367   if (DECL_IN_AGGR_P (fndecl))
14368     {
14369       if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl)) != current_class_type)
14370         {
14371           if (DECL_CONTEXT (fndecl)
14372               && TREE_CODE( DECL_CONTEXT (fndecl)) != NAMESPACE_DECL)
14373             cp_error ("`%D' is already defined in class `%T'", fndecl,
14374                       DECL_CONTEXT (fndecl));
14375         }
14376       return void_type_node;
14377     }
14378
14379   check_template_shadow (fndecl);
14380
14381   DECL_THIS_INLINE (fndecl) = 1;
14382
14383   if (flag_default_inline)
14384     DECL_INLINE (fndecl) = 1;
14385
14386   /* We process method specializations in finish_struct_1.  */
14387   if (processing_template_decl && !DECL_TEMPLATE_SPECIALIZATION (fndecl))
14388     fndecl = push_template_decl (fndecl);
14389
14390   if (! DECL_FRIEND_P (fndecl))
14391     {
14392       if (TREE_CHAIN (fndecl))
14393         {
14394           fndecl = copy_node (fndecl);
14395           TREE_CHAIN (fndecl) = NULL_TREE;
14396         }
14397
14398       if (DECL_CONSTRUCTOR_P (fndecl))
14399         {
14400           if (! grok_ctor_properties (current_class_type, fndecl))
14401             return void_type_node;
14402         }
14403       else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl)))
14404         grok_op_properties (fndecl, DECL_VIRTUAL_P (fndecl), 0);
14405     }
14406
14407   cp_finish_decl (fndecl, NULL_TREE, NULL_TREE, 0);
14408
14409   /* Make a place for the parms */
14410   pushlevel (0);
14411   current_binding_level->parm_flag = 1;
14412
14413   DECL_IN_AGGR_P (fndecl) = 1;
14414   return fndecl;
14415 }
14416
14417 /* Go through the motions of finishing a function definition.
14418    We don't compile this method until after the whole class has
14419    been processed.
14420
14421    FINISH_METHOD must return something that looks as though it
14422    came from GROKFIELD (since we are defining a method, after all).
14423
14424    This is called after parsing the body of the function definition.
14425    STMTS is the chain of statements that makes up the function body.
14426
14427    DECL is the ..._DECL that `start_method' provided.  */
14428
14429 tree
14430 finish_method (decl)
14431      tree decl;
14432 {
14433   register tree fndecl = decl;
14434   tree old_initial;
14435
14436   register tree link;
14437
14438   if (decl == void_type_node)
14439     return decl;
14440
14441   old_initial = DECL_INITIAL (fndecl);
14442
14443   /* Undo the level for the parms (from start_method).
14444      This is like poplevel, but it causes nothing to be
14445      saved.  Saving information here confuses symbol-table
14446      output routines.  Besides, this information will
14447      be correctly output when this method is actually
14448      compiled.  */
14449
14450   /* Clear out the meanings of the local variables of this level;
14451      also record in each decl which block it belongs to.  */
14452
14453   for (link = current_binding_level->names; link; link = TREE_CHAIN (link))
14454     {
14455       if (DECL_NAME (link) != NULL_TREE)
14456         pop_binding (DECL_NAME (link), link);
14457       my_friendly_assert (TREE_CODE (link) != FUNCTION_DECL, 163);
14458       DECL_CONTEXT (link) = NULL_TREE;
14459     }
14460
14461   GNU_xref_end_scope ((HOST_WIDE_INT) current_binding_level,
14462                       (HOST_WIDE_INT) current_binding_level->level_chain,
14463                       current_binding_level->parm_flag,
14464                       current_binding_level->keep);
14465
14466   poplevel (0, 0, 0);
14467
14468   DECL_INITIAL (fndecl) = old_initial;
14469
14470   /* We used to check if the context of FNDECL was different from
14471      current_class_type as another way to get inside here.  This didn't work
14472      for String.cc in libg++.  */
14473   if (DECL_FRIEND_P (fndecl))
14474     {
14475       CLASSTYPE_INLINE_FRIENDS (current_class_type)
14476         = tree_cons (NULL_TREE, fndecl, CLASSTYPE_INLINE_FRIENDS (current_class_type));
14477       decl = void_type_node;
14478     }
14479
14480   return decl;
14481 }
14482 \f
14483 /* Called when a new struct TYPE is defined.
14484    If this structure or union completes the type of any previous
14485    variable declaration, lay it out and output its rtl.  */
14486
14487 void
14488 hack_incomplete_structures (type)
14489      tree type;
14490 {
14491   tree *list;
14492   struct binding_level *level;
14493
14494   if (!type) /* Don't do this for class templates.  */
14495     return;
14496
14497   if (namespace_bindings_p ())
14498     {
14499       level = 0;
14500       list = &namespace_scope_incomplete;
14501     }
14502   else
14503     {
14504       level = innermost_nonclass_level ();
14505       list = &level->incomplete;
14506     }
14507
14508   while (1)
14509     {
14510       while (*list)
14511         {
14512           tree decl = TREE_VALUE (*list);
14513           if ((decl && TREE_TYPE (decl) == type)
14514               || (TREE_TYPE (decl)
14515                   && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
14516                   && TREE_TYPE (TREE_TYPE (decl)) == type))
14517             {
14518               int toplevel = toplevel_bindings_p ();
14519               if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
14520                   && TREE_TYPE (TREE_TYPE (decl)) == type)
14521                 layout_type (TREE_TYPE (decl));
14522               layout_decl (decl, 0);
14523               rest_of_decl_compilation (decl, NULL_PTR, toplevel, 0);
14524               if (! toplevel)
14525                 {
14526                   tree cleanup;
14527                   expand_decl (decl);
14528                   cleanup = maybe_build_cleanup (decl);
14529                   expand_decl_init (decl);
14530                   if (! expand_decl_cleanup (decl, cleanup))
14531                     cp_error ("parser lost in parsing declaration of `%D'",
14532                               decl);
14533                 }
14534               *list = TREE_CHAIN (*list);
14535             }
14536           else
14537             list = &TREE_CHAIN (*list);
14538         }
14539
14540       /* Keep looking through artificial binding levels generated
14541          for local variables.  */
14542       if (level && level->keep == 2)
14543         {
14544           level = level->level_chain;
14545           list = &level->incomplete;
14546         }
14547       else
14548         break;
14549     }
14550 }
14551
14552 /* If DECL is of a type which needs a cleanup, build that cleanup
14553    here.  */
14554
14555 tree
14556 maybe_build_cleanup (decl)
14557      tree decl;
14558 {
14559   tree type = TREE_TYPE (decl);
14560
14561   if (type != error_mark_node && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
14562     {
14563       int flags = LOOKUP_NORMAL|LOOKUP_DESTRUCTOR;
14564       tree rval;
14565
14566       if (TREE_CODE (type) == ARRAY_TYPE)
14567         rval = decl;
14568       else
14569         {
14570           mark_addressable (decl);
14571           rval = build_unary_op (ADDR_EXPR, decl, 0);
14572         }
14573
14574       /* Optimize for space over speed here.  */
14575       if (! TYPE_USES_VIRTUAL_BASECLASSES (type)
14576           || flag_expensive_optimizations)
14577         flags |= LOOKUP_NONVIRTUAL;
14578
14579       rval = build_delete (TREE_TYPE (rval), rval,
14580                            sfk_complete_destructor, flags, 0);
14581
14582       if (TYPE_USES_VIRTUAL_BASECLASSES (type)
14583           && ! TYPE_HAS_DESTRUCTOR (type))
14584         rval = build_compound_expr (tree_cons (NULL_TREE, rval,
14585                                                build_tree_list (NULL_TREE, build_vbase_delete (type, decl))));
14586
14587       return rval;
14588     }
14589   return 0;
14590 }
14591 \f
14592 /* When a stmt has been parsed, this function is called.  */
14593
14594 void
14595 finish_stmt ()
14596 {
14597   /* Always assume this statement was not an expression statement.  If
14598      it actually was an expression statement, its our callers
14599      responsibility to fix this up.  */
14600   last_expr_type = NULL_TREE;
14601 }
14602
14603 /* DECL was originally constructed as a non-static member function,
14604    but turned out to be static.  Update it accordingly.  */
14605
14606 void
14607 revert_static_member_fn (decl)
14608      tree decl;
14609 {
14610   tree tmp;
14611   tree function = TREE_TYPE (decl);
14612   tree args = TYPE_ARG_TYPES (function);
14613
14614   if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args)))
14615       != TYPE_UNQUALIFIED)
14616     cp_error ("static member function `%#D' declared with type qualifiers",
14617               decl);
14618
14619   args = TREE_CHAIN (args);
14620   tmp = build_function_type (TREE_TYPE (function), args);
14621   tmp = build_qualified_type (tmp, CP_TYPE_QUALS (function));
14622   tmp = build_exception_variant (tmp,
14623                                  TYPE_RAISES_EXCEPTIONS (function));
14624   TREE_TYPE (decl) = tmp;
14625   if (DECL_ARGUMENTS (decl))
14626     DECL_ARGUMENTS (decl) = TREE_CHAIN (DECL_ARGUMENTS (decl));
14627   DECL_STATIC_FUNCTION_P (decl) = 1;
14628 }
14629
14630 /* Initialize the variables used during compilation of a C++
14631    function.  */
14632
14633 static void
14634 push_cp_function_context (f)
14635      struct function *f;
14636 {
14637   struct cp_language_function *p
14638     = ((struct cp_language_function *)
14639        xcalloc (1, sizeof (struct cp_language_function)));
14640   f->language = (struct language_function *) p;
14641
14642   /* It takes an explicit call to expand_body to generate RTL for a
14643      function.  */
14644   expanding_p = 0;
14645
14646   /* Whenever we start a new function, we destroy temporaries in the
14647      usual way.  */
14648   current_stmt_tree ()->stmts_are_full_exprs_p = 1;
14649 }
14650
14651 /* Free the language-specific parts of F, now that we've finished
14652    compiling the function.  */
14653
14654 static void
14655 pop_cp_function_context (f)
14656      struct function *f;
14657 {
14658   if (f->language)
14659     free (f->language);
14660   f->language = 0;
14661 }
14662
14663 /* Mark P for GC.  */
14664
14665 static void
14666 mark_lang_function (p)
14667      struct cp_language_function *p;
14668 {
14669   if (!p)
14670     return;
14671
14672   mark_c_language_function (&p->base);
14673
14674   ggc_mark_tree (p->x_ctor_label);
14675   ggc_mark_tree (p->x_dtor_label);
14676   ggc_mark_tree (p->x_current_class_ptr);
14677   ggc_mark_tree (p->x_current_class_ref);
14678   ggc_mark_tree (p->x_eh_spec_try_block);
14679
14680   mark_named_label_lists (&p->x_named_labels, &p->x_named_label_uses);
14681   mark_binding_level (&p->bindings);
14682 }
14683
14684 /* Mark the language-specific data in F for GC.  */
14685
14686 static void
14687 mark_cp_function_context (f)
14688      struct function *f;
14689 {
14690   mark_lang_function ((struct cp_language_function *) f->language);
14691 }
14692
14693 void
14694 lang_mark_tree (t)
14695      tree t;
14696 {
14697   enum tree_code code = TREE_CODE (t);
14698   if (code == IDENTIFIER_NODE)
14699     {
14700       struct lang_identifier *li = (struct lang_identifier *) t;
14701       struct lang_id2 *li2 = li->x;
14702       ggc_mark_tree (li->namespace_bindings);
14703       ggc_mark_tree (li->bindings);
14704       ggc_mark_tree (li->class_value);
14705       ggc_mark_tree (li->class_template_info);
14706
14707       if (li2)
14708         {
14709           ggc_mark_tree (li2->label_value);
14710           ggc_mark_tree (li2->implicit_decl);
14711           ggc_mark_tree (li2->error_locus);
14712         }
14713     }
14714   else if (code == CPLUS_BINDING)
14715     {
14716       if (BINDING_HAS_LEVEL_P (t))
14717         mark_binding_level (&BINDING_LEVEL (t));
14718       else
14719         ggc_mark_tree (BINDING_SCOPE (t));
14720       ggc_mark_tree (BINDING_VALUE (t));
14721     }
14722   else if (code == OVERLOAD)
14723     ggc_mark_tree (OVL_FUNCTION (t));
14724   else if (code == TEMPLATE_PARM_INDEX)
14725     ggc_mark_tree (TEMPLATE_PARM_DECL (t));
14726   else if (TREE_CODE_CLASS (code) == 'd')
14727     {
14728       struct lang_decl *ld = DECL_LANG_SPECIFIC (t);
14729
14730       if (ld)
14731         {
14732           ggc_mark (ld);
14733           c_mark_lang_decl (&ld->decl_flags.base);
14734           if (!DECL_GLOBAL_CTOR_P (t)
14735               && !DECL_GLOBAL_DTOR_P (t)
14736               && !DECL_THUNK_P (t))
14737             ggc_mark_tree (ld->decl_flags.u2.access);
14738           else if (DECL_THUNK_P (t))
14739             ggc_mark_tree (ld->decl_flags.u2.vcall_offset);
14740           if (TREE_CODE (t) != NAMESPACE_DECL)
14741             ggc_mark_tree (ld->decl_flags.u.template_info);
14742           else
14743             mark_binding_level (&NAMESPACE_LEVEL (t));
14744           if (CAN_HAVE_FULL_LANG_DECL_P (t))
14745             {
14746               ggc_mark_tree (ld->befriending_classes);
14747               ggc_mark_tree (ld->context);
14748               ggc_mark_tree (ld->cloned_function);
14749               if (!DECL_OVERLOADED_OPERATOR_P (t))
14750                 ggc_mark_tree (ld->u2.vtt_parm);
14751               if (TREE_CODE (t) == TYPE_DECL)
14752                 ggc_mark_tree (ld->u.sorted_fields);
14753               else if (TREE_CODE (t) == FUNCTION_DECL
14754                        && !DECL_PENDING_INLINE_P (t))
14755                 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t));
14756             }
14757         }
14758     }
14759   else if (TREE_CODE_CLASS (code) == 't')
14760     {
14761       struct lang_type *lt = TYPE_LANG_SPECIFIC (t);
14762
14763       if (lt && !(TREE_CODE (t) == POINTER_TYPE
14764                   && TREE_CODE (TREE_TYPE (t)) == METHOD_TYPE))
14765         {
14766           ggc_mark (lt);
14767           ggc_mark_tree (lt->primary_base);
14768           ggc_mark_tree (lt->vfields);
14769           ggc_mark_tree (lt->vbases);
14770           ggc_mark_tree (lt->tags);
14771           ggc_mark_tree (lt->size);
14772           ggc_mark_tree (lt->pure_virtuals);
14773           ggc_mark_tree (lt->friend_classes);
14774           ggc_mark_tree (lt->rtti);
14775           ggc_mark_tree (lt->methods);
14776           ggc_mark_tree (lt->template_info);
14777           ggc_mark_tree (lt->befriending_classes);
14778         }
14779       else if (lt)
14780         /* In the case of pointer-to-member function types, the
14781            TYPE_LANG_SPECIFIC is really just a tree.  */
14782         ggc_mark_tree ((tree) lt);
14783     }
14784 }