osprey-gcc/gcc/cp/decl.c

Go to the documentation of this file.

/*
 * Copyright (C) 2006. QLogic Corporation. All Rights Reserved.
 */

/* Process declarations and variables for C++ compiler.
   Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
   2001, 2002, 2003, 2004, 2005  Free Software Foundation, Inc.
   Contributed by Michael Tiemann (tiemann@cygnus.com)

This file is part of GCC.

GCC is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.

GCC is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING.  If not, write to
the Free Software Foundation, 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA.  */


/* Process declarations and symbol lookup for C++ front end.
   Also constructs types; the standard scalar types at initialization,
   and structure, union, array and enum types when they are declared.  */

/* ??? not all decl nodes are given the most useful possible
   line numbers.  For example, the CONST_DECLs for enum values.  */

#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "tm.h"
#include "tree.h"
#include "rtl.h"
#include "expr.h"
#include "flags.h"
#include "cp-tree.h"
#include "tree-inline.h"
#include "decl.h"
#include "output.h"
#include "except.h"
#include "toplev.h"
#include "hashtab.h"
#include "tm_p.h"
#include "target.h"
#include "c-common.h"
#include "c-pragma.h"
#include "diagnostic.h"
#include "debug.h"
#include "timevar.h"
#include "tree-flow.h"

static tree grokparms (cp_parameter_declarator *, tree *);
static const char *redeclaration_error_message (tree, tree);

static int decl_jump_unsafe (tree);
static void require_complete_types_for_parms (tree);
static int ambi_op_p (enum tree_code);
static int unary_op_p (enum tree_code);
static void push_local_name (tree);
static tree grok_reference_init (tree, tree, tree, tree *);
static tree grokvardecl (tree, tree, const cp_decl_specifier_seq *,
       int, int, tree);
static void record_unknown_type (tree, const char *);
static tree builtin_function_1 (const char *, tree, tree,
        enum built_in_function code,
                                enum built_in_class cl, const char *,
        tree);
static tree build_library_fn_1 (tree, enum tree_code, tree);
static int member_function_or_else (tree, tree, enum overload_flags);
static void bad_specifiers (tree, const char *, int, int, int, int,
          int);
static void check_for_uninitialized_const_var (tree);
static hashval_t typename_hash (const void *);
static int typename_compare (const void *, const void *);
static tree local_variable_p_walkfn (tree *, int *, void *);
static tree record_builtin_java_type (const char *, int);
static const char *tag_name (enum tag_types);
static tree lookup_and_check_tag (enum tag_types, tree, tag_scope, bool);
static int walk_namespaces_r (tree, walk_namespaces_fn, void *);
static tree make_label_decl (tree, int);
static void use_label (tree);
static void check_previous_goto_1 (tree, struct cp_binding_level *, tree,
           const location_t *);
static void check_previous_goto (struct named_label_use_list *);
static void check_switch_goto (struct cp_binding_level *);
static void check_previous_gotos (tree);
static void pop_label (tree, tree);
static void pop_labels (tree);
static void maybe_deduce_size_from_array_init (tree, tree);
static void layout_var_decl (tree);
static void maybe_commonize_var (tree);
static tree check_initializer (tree, tree, int, tree *);
static void make_rtl_for_nonlocal_decl (tree, tree, const char *);
static void save_function_data (tree);
static void check_function_type (tree, tree);
static void finish_constructor_body (void);
static void begin_destructor_body (void);
static void finish_destructor_body (void);
static tree create_array_type_for_decl (tree, tree, tree);
static tree get_atexit_node (void);
static tree get_dso_handle_node (void);
static tree start_cleanup_fn (void);
static void end_cleanup_fn (void);
static tree cp_make_fname_decl (tree, int);
static void initialize_predefined_identifiers (void);
static tree check_special_function_return_type
  (special_function_kind, tree, tree);
static tree push_cp_library_fn (enum tree_code, tree);
static tree build_cp_library_fn (tree, enum tree_code, tree);
static void store_parm_decls (tree);
static void initialize_local_var (tree, tree);
static void expand_static_init (tree, tree);
static tree next_initializable_field (tree);
static tree reshape_init (tree, tree *);

/* Erroneous argument lists can use this *IFF* they do not modify it.  */
tree error_mark_list;

/* The following symbols are subsumed in the cp_global_trees array, and
   listed here individually for documentation purposes.

   C++ extensions
  tree wchar_decl_node;

  tree vtable_entry_type;
  tree delta_type_node;
  tree __t_desc_type_node;
        tree ti_desc_type_node;
  tree bltn_desc_type_node, ptr_desc_type_node;
  tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
  tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
  tree ptm_desc_type_node;
  tree base_desc_type_node;

  tree class_type_node;
  tree unknown_type_node;

   Array type `vtable_entry_type[]'

  tree vtbl_type_node;
  tree vtbl_ptr_type_node;

   Namespaces,

  tree std_node;
  tree abi_node;

   A FUNCTION_DECL which can call `abort'.  Not necessarily the
   one that the user will declare, but sufficient to be called
   by routines that want to abort the program.

  tree abort_fndecl;

   The FUNCTION_DECL for the default `::operator delete'.

  tree global_delete_fndecl;

   Used by RTTI
  tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
  tree tinfo_var_id;

*/

tree cp_global_trees[CPTI_MAX];

/* Indicates that there is a type value in some namespace, although
   that is not necessarily in scope at the moment.  */

tree global_type_node;

/* The node that holds the "name" of the global scope.  */
tree global_scope_name;

/* Used only for jumps to as-yet undefined labels, since jumps to
   defined labels can have their validity checked immediately.  */

struct named_label_use_list GTY(())
{
  struct cp_binding_level *binding_level;
  tree names_in_scope;
  tree label_decl;
  location_t o_goto_locus;
  struct named_label_use_list *next;
};

#define named_label_uses cp_function_chain->x_named_label_uses

#define local_names cp_function_chain->x_local_names

/* A list of objects which have constructors or destructors
   which reside in the global scope.  The decl is stored in
   the TREE_VALUE slot and the initializer is stored
   in the TREE_PURPOSE slot.  */
tree static_aggregates;

/* -- end of C++ */

/* A node for the integer constants 2, and 3.  */

tree integer_two_node, integer_three_node;

/* A list of all LABEL_DECLs in the function that have names.  Here so
   we can clear out their names' definitions at the end of the
   function, and so we can check the validity of jumps to these labels.  */

struct named_label_list GTY(())
{
  struct cp_binding_level *binding_level;
  tree names_in_scope;
  tree old_value;
  tree label_decl;
  tree bad_decls;
  struct named_label_list *next;
  unsigned int in_try_scope : 1;
  unsigned int in_catch_scope : 1;
};

#define named_labels cp_function_chain->x_named_labels

/* The number of function bodies which we are currently processing.
   (Zero if we are at namespace scope, one inside the body of a
   function, two inside the body of a function in a local class, etc.)  */
int function_depth;

/* States indicating how grokdeclarator() should handle declspecs marked
   with __attribute__((deprecated)).  An object declared as
   __attribute__((deprecated)) suppresses warnings of uses of other
   deprecated items.  */

enum deprecated_states {
  DEPRECATED_NORMAL,
  DEPRECATED_SUPPRESS
};

static enum deprecated_states deprecated_state = DEPRECATED_NORMAL;

/* True if a declaration with an `extern' linkage specifier is being
   processed.  */
bool have_extern_spec;


/* A TREE_LIST of VAR_DECLs.  The TREE_PURPOSE is a RECORD_TYPE or
   UNION_TYPE; the TREE_VALUE is a VAR_DECL with that type.  At the
   time the VAR_DECL was declared, the type was incomplete.  */

static GTY(()) tree incomplete_vars;

/* Returns the kind of template specialization we are currently
   processing, given that it's declaration contained N_CLASS_SCOPES
   explicit scope qualifications.  */

tmpl_spec_kind
current_tmpl_spec_kind (int n_class_scopes)
{
  int n_template_parm_scopes = 0;
  int seen_specialization_p = 0;
  int innermost_specialization_p = 0;
  struct cp_binding_level *b;

  /* Scan through the template parameter scopes.  */
  for (b = current_binding_level;
       b->kind == sk_template_parms;
       b = b->level_chain)
    {
      /* If we see a specialization scope inside a parameter scope,
   then something is wrong.  That corresponds to a declaration
   like:

      template <class T> template <> ...

   which is always invalid since [temp.expl.spec] forbids the
   specialization of a class member template if the enclosing
   class templates are not explicitly specialized as well.  */
      if (b->explicit_spec_p)
  {
    if (n_template_parm_scopes == 0)
      innermost_specialization_p = 1;
    else
      seen_specialization_p = 1;
  }
      else if (seen_specialization_p == 1)
  return tsk_invalid_member_spec;

      ++n_template_parm_scopes;
    }

  /* Handle explicit instantiations.  */
  if (processing_explicit_instantiation)
    {
      if (n_template_parm_scopes != 0)
  /* We've seen a template parameter list during an explicit
     instantiation.  For example:

       template <class T> template void f(int);

     This is erroneous.  */
  return tsk_invalid_expl_inst;
      else
  return tsk_expl_inst;
    }

  if (n_template_parm_scopes < n_class_scopes)
    /* We've not seen enough template headers to match all the
       specialized classes present.  For example:

         template <class T> void R<T>::S<T>::f(int);

       This is invalid; there needs to be one set of template
       parameters for each class.  */
    return tsk_insufficient_parms;
  else if (n_template_parm_scopes == n_class_scopes)
    /* We're processing a non-template declaration (even though it may
       be a member of a template class.)  For example:

         template <class T> void S<T>::f(int);

       The `class T' maches the `S<T>', leaving no template headers
       corresponding to the `f'.  */
    return tsk_none;
  else if (n_template_parm_scopes > n_class_scopes + 1)
    /* We've got too many template headers.  For example:

         template <> template <class T> void f (T);

       There need to be more enclosing classes.  */
    return tsk_excessive_parms;
  else
    /* This must be a template.  It's of the form:

         template <class T> template <class U> void S<T>::f(U);

       This is a specialization if the innermost level was a
       specialization; otherwise it's just a definition of the
       template.  */
    return innermost_specialization_p ? tsk_expl_spec : tsk_template;
}

/* Exit the current scope.  */

void
finish_scope (void)
{
  poplevel (0, 0, 0);
}

/* When a label goes out of scope, check to see if that label was used
   in a valid manner, and issue any appropriate warnings or errors.  */

static void
pop_label (tree label, tree old_value)
{
  if (!processing_template_decl)
    {
      if (DECL_INITIAL (label) == NULL_TREE)
  {
    location_t location;

    cp_error_at ("label %qD used but not defined", label);
#ifdef USE_MAPPED_LOCATION
    location = input_location; /* FIXME want (input_filename, (line)0) */
#else
    location.file = input_filename;
    location.line = 0;
#endif
    /* Avoid crashing later.  */
    define_label (location, DECL_NAME (label));
  }
      else if (warn_unused_label && !TREE_USED (label))
  cp_warning_at ("label %qD defined but not used", label);
    }

  SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label), old_value);
}

/* At the end of a function, all labels declared within the function
   go out of scope.  BLOCK is the top-level block for the
   function.  */

static void
pop_labels (tree block)
{
  struct named_label_list *link;

  /* Clear out the definitions of all label names, since their scopes
     end here.  */
  for (link = named_labels; link; link = link->next)
    {
      pop_label (link->label_decl, link->old_value);
      /* Put the labels into the "variables" of the top-level block,
   so debugger can see them.  */
      TREE_CHAIN (link->label_decl) = BLOCK_VARS (block);
      BLOCK_VARS (block) = link->label_decl;
    }

  named_labels = NULL;
}

/* The following two routines are used to interface to Objective-C++.
   The binding level is purposely treated as an opaque type.  */

void *
objc_get_current_scope (void)
{
  return current_binding_level;
}

/* The following routine is used by the NeXT-style SJLJ exceptions;
   variables get marked 'volatile' so as to not be clobbered by
   _setjmp()/_longjmp() calls.  All variables in the current scope,
   as well as parent scopes up to (but not including) ENCLOSING_BLK
   shall be thusly marked.  */

void
objc_mark_locals_volatile (void *enclosing_blk)
{
  struct cp_binding_level *scope;

  for (scope = current_binding_level;
       scope && scope != enclosing_blk && scope->kind == sk_block;
       scope = scope->level_chain)
    {
      tree decl;

      for (decl = scope->names; decl; decl = TREE_CHAIN (decl))
        {
    if (TREE_CODE (decl) == VAR_DECL)
      {
              DECL_REGISTER (decl) = 0;
              TREE_THIS_VOLATILE (decl) = 1;
      }
        }
    }
}

/* Exit a binding level.
   Pop the level off, and restore the state of the identifier-decl mappings
   that were in effect when this level was entered.

   If KEEP == 1, this level had explicit declarations, so
   and create a "block" (a BLOCK node) for the level
   to record its declarations and subblocks for symbol table output.

   If FUNCTIONBODY is nonzero, this level is the body of a function,
   so create a block as if KEEP were set and also clear out all
   label names.

   If REVERSE is nonzero, reverse the order of decls before putting
   them into the BLOCK.  */

tree
poplevel (int keep, int reverse, int functionbody)
{
  tree link;
  /* The chain of decls was accumulated in reverse order.
     Put it into forward order, just for cleanliness.  */
  tree decls;
  int tmp = functionbody;
  int real_functionbody;
  tree subblocks;
  tree block;
  tree decl;
  int leaving_for_scope;
  scope_kind kind;

  timevar_push (TV_NAME_LOOKUP);
 restart:

  block = NULL_TREE;

  gcc_assert (current_binding_level->kind != sk_class);

  real_functionbody = (current_binding_level->kind == sk_cleanup
           ? ((functionbody = 0), tmp) : functionbody);
  subblocks = functionbody >= 0 ? current_binding_level->blocks : 0;

  gcc_assert (!VEC_length(cp_class_binding,
        current_binding_level->class_shadowed));

  /* We used to use KEEP == 2 to indicate that the new block should go
     at the beginning of the list of blocks at this binding level,
     rather than the end.  This hack is no longer used.  */
  gcc_assert (keep == 0 || keep == 1);

  if (current_binding_level->keep)
    keep = 1;

  /* Any uses of undefined labels, and any defined labels, now operate
     under constraints of next binding contour.  */
  if (cfun && !functionbody)
    {
      struct cp_binding_level *level_chain;
      level_chain = current_binding_level->level_chain;
      if (level_chain)
  {
    struct named_label_use_list *uses;
    struct named_label_list *labels;
    for (labels = named_labels; labels; labels = labels->next)
      if (labels->binding_level == current_binding_level)
        {
    tree decl;
    if (current_binding_level->kind == sk_try)
      labels->in_try_scope = 1;
    if (current_binding_level->kind == sk_catch)
      labels->in_catch_scope = 1;
    for (decl = labels->names_in_scope; decl;
         decl = TREE_CHAIN (decl))
      if (decl_jump_unsafe (decl))
        labels->bad_decls = tree_cons (NULL_TREE, decl,
               labels->bad_decls);
    labels->binding_level = level_chain;
    labels->names_in_scope = level_chain->names;
        }

    for (uses = named_label_uses; uses; uses = uses->next)
      if (uses->binding_level == current_binding_level)
        {
    uses->binding_level = level_chain;
    uses->names_in_scope = level_chain->names;
        }
  }
    }

  /* Get the decls in the order they were written.
     Usually current_binding_level->names is in reverse order.
     But parameter decls were previously put in forward order.  */

  if (reverse)
    current_binding_level->names
      = decls = nreverse (current_binding_level->names);
  else
    decls = current_binding_level->names;

  /* If there were any declarations or structure tags in that level,
     or if this level is a function body,
     create a BLOCK to record them for the life of this function.  */
  block = NULL_TREE;
  if (keep == 1 || functionbody)
    block = make_node (BLOCK);
  if (block != NULL_TREE)
    {
      BLOCK_VARS (block) = decls;
      BLOCK_SUBBLOCKS (block) = subblocks;
    }

  /* In each subblock, record that this is its superior.  */
  if (keep >= 0)
    for (link = subblocks; link; link = TREE_CHAIN (link))
      BLOCK_SUPERCONTEXT (link) = block;

  /* We still support the old for-scope rules, whereby the variables
     in a for-init statement were in scope after the for-statement
     ended.  We only use the new rules if flag_new_for_scope is
     nonzero.  */
  leaving_for_scope
    = current_binding_level->kind == sk_for && flag_new_for_scope == 1;

  /* Before we remove the declarations first check for unused variables.  */
  if (warn_unused_variable
      && !processing_template_decl)
    for (decl = getdecls (); decl; decl = TREE_CHAIN (decl))
      if (TREE_CODE (decl) == VAR_DECL
    && ! TREE_USED (decl)
    && ! DECL_IN_SYSTEM_HEADER (decl)
    && DECL_NAME (decl) && ! DECL_ARTIFICIAL (decl))
  warning ("%Junused variable %qD", decl, decl);

  /* Remove declarations for all the DECLs in this level.  */
  for (link = decls; link; link = TREE_CHAIN (link))
    {
      if (leaving_for_scope && TREE_CODE (link) == VAR_DECL
          && DECL_NAME (link))
  {
    tree name = DECL_NAME (link);
    cxx_binding *ob;
    tree ns_binding;

    ob = outer_binding (name,
            IDENTIFIER_BINDING (name),
            /*class_p=*/true);
    if (!ob)
      ns_binding = IDENTIFIER_NAMESPACE_VALUE (name);
    else
      ns_binding = NULL_TREE;

    if (ob && ob->scope == current_binding_level->level_chain)
      /* We have something like:

           int i;
           for (int i; ;);

         and we are leaving the `for' scope.  There's no reason to
         keep the binding of the inner `i' in this case.  */
      pop_binding (name, link);
    else if ((ob && (TREE_CODE (ob->value) == TYPE_DECL))
       || (ns_binding && TREE_CODE (ns_binding) == TYPE_DECL))
      /* Here, we have something like:

     typedef int I;

     void f () {
       for (int I; ;);
     }

         We must pop the for-scope binding so we know what's a
         type and what isn't.  */
      pop_binding (name, link);
    else
      {
        /* Mark this VAR_DECL as dead so that we can tell we left it
     there only for backward compatibility.  */
        DECL_DEAD_FOR_LOCAL (link) = 1;

        /* Keep track of what should have happened when we
     popped the binding.  */
        if (ob && ob->value)
    DECL_SHADOWED_FOR_VAR (link) = ob->value;

        /* Add it to the list of dead variables in the next
     outermost binding to that we can remove these when we
     leave that binding.  */
        current_binding_level->level_chain->dead_vars_from_for
    = tree_cons (NULL_TREE, link,
           current_binding_level->level_chain->
           dead_vars_from_for);

        /* Although we don't pop the cxx_binding, we do clear
     its SCOPE since the scope is going away now.  */
        IDENTIFIER_BINDING (name)->scope
    = current_binding_level->level_chain;
      }
  }
      else
  {
    tree name;
    
    /* Remove the binding.  */
    decl = link;

    if (TREE_CODE (decl) == TREE_LIST)
      decl = TREE_VALUE (decl);
    name = decl;
    
    if (TREE_CODE (name) == OVERLOAD)
      name = OVL_FUNCTION (name);

    gcc_assert (DECL_P (name));
    pop_binding (DECL_NAME (name), decl);
  }
    }

  /* Remove declarations for any `for' variables from inner scopes
     that we kept around.  */
  for (link = current_binding_level->dead_vars_from_for;
       link; link = TREE_CHAIN (link))
    pop_binding (DECL_NAME (TREE_VALUE (link)), TREE_VALUE (link));

  /* Restore the IDENTIFIER_TYPE_VALUEs.  */
  for (link = current_binding_level->type_shadowed;
       link; link = TREE_CHAIN (link))
    SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link), TREE_VALUE (link));

  /* Restore the IDENTIFIER_LABEL_VALUEs for local labels.  */
  for (link = current_binding_level->shadowed_labels;
       link;
       link = TREE_CHAIN (link))
    pop_label (TREE_VALUE (link), TREE_PURPOSE (link));

  /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
     list if a `using' declaration put them there.  The debugging
     back-ends won't understand OVERLOAD, so we remove them here.
     Because the BLOCK_VARS are (temporarily) shared with
     CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
     popped all the bindings.  */
  if (block)
    {
      tree* d;

      for (d = &BLOCK_VARS (block); *d; )
  {
    if (TREE_CODE (*d) == TREE_LIST)
      *d = TREE_CHAIN (*d);
    else
      d = &TREE_CHAIN (*d);
  }
    }

  /* If the level being exited is the top level of a function,
     check over all the labels.  */
  if (functionbody)
    {
      /* Since this is the top level block of a function, the vars are
   the function's parameters.  Don't leave them in the BLOCK
   because they are found in the FUNCTION_DECL instead.  */
      BLOCK_VARS (block) = 0;
      pop_labels (block);
    }

  kind = current_binding_level->kind;
  if (kind == sk_cleanup)
    {
      tree stmt;

      /* If this is a temporary binding created for a cleanup, then we'll
   have pushed a statement list level.  Pop that, create a new
   BIND_EXPR for the block, and insert it into the stream.  */
      stmt = pop_stmt_list (current_binding_level->statement_list);
      stmt = c_build_bind_expr (block, stmt);
      add_stmt (stmt);
    }

  leave_scope ();
  if (functionbody)
    DECL_INITIAL (current_function_decl) = block;
  else if (block)
    current_binding_level->blocks
      = chainon (current_binding_level->blocks, block);

  /* If we did not make a block for the level just exited,
     any blocks made for inner levels
     (since they cannot be recorded as subblocks in that level)
     must be carried forward so they will later become subblocks
     of something else.  */
  else if (subblocks)
    current_binding_level->blocks
      = chainon (current_binding_level->blocks, subblocks);

  /* Each and every BLOCK node created here in `poplevel' is important
     (e.g. for proper debugging information) so if we created one
     earlier, mark it as "used".  */
  if (block)
    TREE_USED (block) = 1;

  /* All temporary bindings created for cleanups are popped silently.  */
  if (kind == sk_cleanup)
    goto restart;

  POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, block);
}

/* Insert BLOCK at the end of the list of subblocks of the
   current binding level.  This is used when a BIND_EXPR is expanded,
   to handle the BLOCK node inside the BIND_EXPR.  */

void
insert_block (tree block)
{
  TREE_USED (block) = 1;
  current_binding_level->blocks
    = chainon (current_binding_level->blocks, block);
}

/* Walk all the namespaces contained NAMESPACE, including NAMESPACE
   itself, calling F for each.  The DATA is passed to F as well.  */

static int
walk_namespaces_r (tree namespace, walk_namespaces_fn f, void* data)
{
  int result = 0;
  tree current = NAMESPACE_LEVEL (namespace)->namespaces;

  result |= (*f) (namespace, data);

  for (; current; current = TREE_CHAIN (current))
    result |= walk_namespaces_r (current, f, data);

  return result;
}

/* Walk all the namespaces, calling F for each.  The DATA is passed to
   F as well.  */

int
walk_namespaces (walk_namespaces_fn f, void* data)
{
  return walk_namespaces_r (global_namespace, f, data);
}

/* Call wrapup_globals_declarations for the globals in NAMESPACE.  If
   DATA is non-NULL, this is the last time we will call
   wrapup_global_declarations for this NAMESPACE.  */

int
wrapup_globals_for_namespace (tree namespace, void* data)
{
  struct cp_binding_level *level = NAMESPACE_LEVEL (namespace);
  varray_type statics = level->static_decls;
  tree *vec = &VARRAY_TREE (statics, 0);
  int len = VARRAY_ACTIVE_SIZE (statics);
  int last_time = (data != 0);

  if (last_time)
    {
      check_global_declarations (vec, len);
      emit_debug_global_declarations (vec, len);
      return 0;
    }

  /* Write out any globals that need to be output.  */
  return wrapup_global_declarations (vec, len);
}


/* In C++, you don't have to write `struct S' to refer to `S'; you
   can just use `S'.  We accomplish this by creating a TYPE_DECL as
   if the user had written `typedef struct S S'.  Create and return
   the TYPE_DECL for TYPE.  */

tree
create_implicit_typedef (tree name, tree type)
{
  tree decl;

  decl = build_decl (TYPE_DECL, name, type);
  DECL_ARTIFICIAL (decl) = 1;
  /* There are other implicit type declarations, like the one *within*
     a class that allows you to write `S::S'.  We must distinguish
     amongst these.  */
  SET_DECL_IMPLICIT_TYPEDEF_P (decl);
  TYPE_NAME (type) = decl;

  return decl;
}

/* Remember a local name for name-mangling purposes.  */

static void
push_local_name (tree decl)
{
  size_t i, nelts;
  tree t, name;

  timevar_push (TV_NAME_LOOKUP);
  if (!local_names)
    VARRAY_TREE_INIT (local_names, 8, "local_names");

  name = DECL_NAME (decl);

  nelts = VARRAY_ACTIVE_SIZE (local_names);
  for (i = 0; i < nelts; i++)
    {
      t = VARRAY_TREE (local_names, i);
      if (DECL_NAME (t) == name)
  {
    if (!DECL_LANG_SPECIFIC (decl))
      retrofit_lang_decl (decl);
    DECL_LANG_SPECIFIC (decl)->decl_flags.u2sel = 1;
    if (DECL_LANG_SPECIFIC (t))
      DECL_DISCRIMINATOR (decl) = DECL_DISCRIMINATOR (t) + 1;
    else
      DECL_DISCRIMINATOR (decl) = 1;

    VARRAY_TREE (local_names, i) = decl;
    timevar_pop (TV_NAME_LOOKUP);
    return;
  }
    }

  VARRAY_PUSH_TREE (local_names, decl);
  timevar_pop (TV_NAME_LOOKUP);
}

/* Subroutine of duplicate_decls: return truthvalue of whether
   or not types of these decls match.

   For C++, we must compare the parameter list so that `int' can match
   `int&' in a parameter position, but `int&' is not confused with
   `const int&'.  */

int
decls_match (tree newdecl, tree olddecl)
{
  int types_match;

  if (newdecl == olddecl)
    return 1;

  if (TREE_CODE (newdecl) != TREE_CODE (olddecl))
    /* If the two DECLs are not even the same kind of thing, we're not
       interested in their types.  */
    return 0;

  if (TREE_CODE (newdecl) == FUNCTION_DECL)
    {
      tree f1 = TREE_TYPE (newdecl);
      tree f2 = TREE_TYPE (olddecl);
      tree p1 = TYPE_ARG_TYPES (f1);
      tree p2 = TYPE_ARG_TYPES (f2);

      if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl)
    && ! (DECL_EXTERN_C_P (newdecl)
    && DECL_EXTERN_C_P (olddecl)))
  return 0;

      if (TREE_CODE (f1) != TREE_CODE (f2))
        return 0;

      if (same_type_p (TREE_TYPE (f1), TREE_TYPE (f2)))
  {
    if (p2 == NULL_TREE && DECL_EXTERN_C_P (olddecl)
        && (DECL_BUILT_IN (olddecl)
#ifndef NO_IMPLICIT_EXTERN_C
            || (DECL_IN_SYSTEM_HEADER (newdecl) && !DECL_CLASS_SCOPE_P (newdecl))
            || (DECL_IN_SYSTEM_HEADER (olddecl) && !DECL_CLASS_SCOPE_P (olddecl))
#endif
        ))
      {
        types_match = self_promoting_args_p (p1);
        if (p1 == void_list_node)
    TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
      }
#ifndef NO_IMPLICIT_EXTERN_C
    else if (p1 == NULL_TREE
       && (DECL_EXTERN_C_P (olddecl)
                 && DECL_IN_SYSTEM_HEADER (olddecl)
                 && !DECL_CLASS_SCOPE_P (olddecl))
       && (DECL_EXTERN_C_P (newdecl)
                 && DECL_IN_SYSTEM_HEADER (newdecl)
                 && !DECL_CLASS_SCOPE_P (newdecl)))
      {
        types_match = self_promoting_args_p (p2);
        TREE_TYPE (newdecl) = TREE_TYPE (olddecl);
      }
#endif
    else
      types_match = compparms (p1, p2);
  }
      else
  types_match = 0;
    }
  else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
    {
      if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl))
    != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)))
  return 0;

      if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
        DECL_TEMPLATE_PARMS (olddecl)))
  return 0;

      if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
  types_match = same_type_p (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl)),
           TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl)));
      else
  types_match = decls_match (DECL_TEMPLATE_RESULT (olddecl),
           DECL_TEMPLATE_RESULT (newdecl));
    }
  else
    {
      /* Need to check scope for variable declaration (VAR_DECL).
   For typedef (TYPE_DECL), scope is ignored.  */
      if (TREE_CODE (newdecl) == VAR_DECL
    && CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl))
  return 0;

      if (TREE_TYPE (newdecl) == error_mark_node)
  types_match = TREE_TYPE (olddecl) == error_mark_node;
      else if (TREE_TYPE (olddecl) == NULL_TREE)
  types_match = TREE_TYPE (newdecl) == NULL_TREE;
      else if (TREE_TYPE (newdecl) == NULL_TREE)
  types_match = 0;
      else
  types_match = comptypes (TREE_TYPE (newdecl),
         TREE_TYPE (olddecl),
         COMPARE_REDECLARATION);
    }

  return types_match;
}

/* If NEWDECL is `static' and an `extern' was seen previously,
   warn about it.  OLDDECL is the previous declaration.

   Note that this does not apply to the C++ case of declaring
   a variable `extern const' and then later `const'.

   Don't complain about built-in functions, since they are beyond
   the user's control.  */

void
warn_extern_redeclared_static (tree newdecl, tree olddecl)
{
  tree name;

  if (TREE_CODE (newdecl) == TYPE_DECL
      || TREE_CODE (newdecl) == TEMPLATE_DECL
      || TREE_CODE (newdecl) == CONST_DECL
      || TREE_CODE (newdecl) == NAMESPACE_DECL)
    return;

  /* Don't get confused by static member functions; that's a different
     use of `static'.  */
  if (TREE_CODE (newdecl) == FUNCTION_DECL
      && DECL_STATIC_FUNCTION_P (newdecl))
    return;

  /* If the old declaration was `static', or the new one isn't, then
     then everything is OK.  */
  if (DECL_THIS_STATIC (olddecl) || !DECL_THIS_STATIC (newdecl))
    return;

  /* It's OK to declare a builtin function as `static'.  */
  if (TREE_CODE (olddecl) == FUNCTION_DECL
      && DECL_ARTIFICIAL (olddecl))
    return;

  name = DECL_ASSEMBLER_NAME (newdecl);
  pedwarn ("%qD was declared %<extern%> and later %<static%>", newdecl);
  cp_pedwarn_at ("previous declaration of %qD", olddecl);
}

/* If NEWDECL is a redeclaration of OLDDECL, merge the declarations.
   If the redeclaration is invalid, a diagnostic is issued, and the
   error_mark_node is returned.  Otherwise, OLDDECL is returned.

   If NEWDECL is not a redeclaration of OLDDECL, NULL_TREE is
   returned.  */

tree
duplicate_decls (tree newdecl, tree olddecl)
{
  unsigned olddecl_uid = DECL_UID (olddecl);
  int olddecl_friend = 0, types_match = 0;
  int new_defines_function = 0;

  if (newdecl == olddecl)
    return olddecl;

  types_match = decls_match (newdecl, olddecl);

  /* If either the type of the new decl or the type of the old decl is an
     error_mark_node, then that implies that we have already issued an
     error (earlier) for some bogus type specification, and in that case,
     it is rather pointless to harass the user with yet more error message
     about the same declaration, so just pretend the types match here.  */
  if (TREE_TYPE (newdecl) == error_mark_node
      || TREE_TYPE (olddecl) == error_mark_node)
    types_match = 1;

  if (DECL_P (olddecl)
      && TREE_CODE (newdecl) == FUNCTION_DECL
      && TREE_CODE (olddecl) == FUNCTION_DECL
      && (DECL_UNINLINABLE (newdecl) || DECL_UNINLINABLE (olddecl)))
    {
      if (DECL_DECLARED_INLINE_P (newdecl)
    && DECL_UNINLINABLE (newdecl)
    && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl)))
  /* Already warned elsewhere.  */;
      else if (DECL_DECLARED_INLINE_P (olddecl)
         && DECL_UNINLINABLE (olddecl)
         && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl)))
  /* Already warned.  */;
      else if (DECL_DECLARED_INLINE_P (newdecl)
         && DECL_UNINLINABLE (olddecl)
         && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl)))
  {
    warning ("%Jfunction %qD redeclared as inline", newdecl, newdecl);
    warning ("%Jprevious declaration of %qD with attribute noinline",
                   olddecl, olddecl);
  }
      else if (DECL_DECLARED_INLINE_P (olddecl)
         && DECL_UNINLINABLE (newdecl)
         && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl)))
  {
    warning ("%Jfunction %qD redeclared with attribute noinline",
       newdecl, newdecl);
    warning ("%Jprevious declaration of %qD was inline",
       olddecl, olddecl);
  }
    }

  /* Check for redeclaration and other discrepancies.  */
  if (TREE_CODE (olddecl) == FUNCTION_DECL
      && DECL_ARTIFICIAL (olddecl))
    {
      if (TREE_CODE (newdecl) != FUNCTION_DECL)
  {
          /* Avoid warnings redeclaring anticipated built-ins.  */
          if (DECL_ANTICIPATED (olddecl))
            return NULL_TREE;

    /* If you declare a built-in or predefined function name as static,
       the old definition is overridden, but optionally warn this was a
       bad choice of name.  */
    if (! TREE_PUBLIC (newdecl))
      {
        if (warn_shadow)
                warning ("shadowing %s function %q#D",
                         DECL_BUILT_IN (olddecl) ? "built-in" : "library",
                         olddecl);
        /* Discard the old built-in function.  */
        return NULL_TREE;
      }
    /* If the built-in is not ansi, then programs can override
       it even globally without an error.  */
    else if (! DECL_BUILT_IN (olddecl))
      warning ("library function %q#D redeclared as non-function %q#D",
                     olddecl, newdecl);
    else
      {
        error ("declaration of %q#D", newdecl);
        error ("conflicts with built-in declaration %q#D",
                     olddecl);
      }
    return NULL_TREE;
  }
      else if (!types_match)
  {
          /* Avoid warnings redeclaring anticipated built-ins.  */
          if (DECL_ANTICIPATED (olddecl))
      {
        /* Deal with fileptr_type_node.  FILE type is not known
     at the time we create the builtins.  */
        tree t1, t2;

        for (t1 = TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
       t2 = TYPE_ARG_TYPES (TREE_TYPE (olddecl));
       t1 || t2;
       t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
    if (!t1 || !t2)
      break;
    else if (TREE_VALUE (t2) == fileptr_type_node)
      {
        tree t = TREE_VALUE (t1);

        if (TREE_CODE (t) == POINTER_TYPE
      && TYPE_NAME (TREE_TYPE (t))
      && DECL_NAME (TYPE_NAME (TREE_TYPE (t)))
         == get_identifier ("FILE")
      && compparms (TREE_CHAIN (t1), TREE_CHAIN (t2)))
          {
      tree oldargs = TYPE_ARG_TYPES (TREE_TYPE (olddecl));

      TYPE_ARG_TYPES (TREE_TYPE (olddecl))
        = TYPE_ARG_TYPES (TREE_TYPE (newdecl));
      types_match = decls_match (newdecl, olddecl);
      if (types_match)
        return duplicate_decls (newdecl, olddecl);
      TYPE_ARG_TYPES (TREE_TYPE (olddecl)) = oldargs;
          }
      }
    else if (! same_type_p (TREE_VALUE (t1), TREE_VALUE (t2)))
      break;
      }
    else if ((DECL_EXTERN_C_P (newdecl)
        && DECL_EXTERN_C_P (olddecl))
       || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
         TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
      {
        /* A near match; override the builtin.  */

        if (TREE_PUBLIC (newdecl))
    {
      warning ("new declaration %q#D", newdecl);
      warning ("ambiguates built-in declaration %q#D",
                           olddecl);
    }
        else if (warn_shadow)
    warning ("shadowing %s function %q#D",
                         DECL_BUILT_IN (olddecl) ? "built-in" : "library",
                         olddecl);
      }
    else
      /* Discard the old built-in function.  */
      return NULL_TREE;

    /* Replace the old RTL to avoid problems with inlining.  */
    COPY_DECL_RTL (newdecl, olddecl);
  }
      /* Even if the types match, prefer the new declarations type
   for anticipated built-ins, for exception lists, etc...  */
      else if (DECL_ANTICIPATED (olddecl))
  {
    tree type = TREE_TYPE (newdecl);
    tree attribs = (*targetm.merge_type_attributes)
      (TREE_TYPE (olddecl), type);

    type = cp_build_type_attribute_variant (type, attribs);
    TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = type;
  }

      /* Whether or not the builtin can throw exceptions has no
   bearing on this declarator.  */
      TREE_NOTHROW (olddecl) = 0;

      if (DECL_THIS_STATIC (newdecl) && !DECL_THIS_STATIC (olddecl))
  {
    /* If a builtin function is redeclared as `static', merge
       the declarations, but make the original one static.  */
    DECL_THIS_STATIC (olddecl) = 1;
    TREE_PUBLIC (olddecl) = 0;

    /* Make the old declaration consistent with the new one so
       that all remnants of the builtin-ness of this function
       will be banished.  */
    SET_DECL_LANGUAGE (olddecl, DECL_LANGUAGE (newdecl));
    COPY_DECL_RTL (newdecl, olddecl);
  }
    }
  else if (TREE_CODE (olddecl) != TREE_CODE (newdecl))
    {
      if ((TREE_CODE (olddecl) == TYPE_DECL && DECL_ARTIFICIAL (olddecl)
     && TREE_CODE (newdecl) != TYPE_DECL
     && ! (TREE_CODE (newdecl) == TEMPLATE_DECL
     && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL))
    || (TREE_CODE (newdecl) == TYPE_DECL && DECL_ARTIFICIAL (newdecl)
        && TREE_CODE (olddecl) != TYPE_DECL
        && ! (TREE_CODE (olddecl) == TEMPLATE_DECL
        && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl))
      == TYPE_DECL))))
  {
    /* We do nothing special here, because C++ does such nasty
       things with TYPE_DECLs.  Instead, just let the TYPE_DECL
       get shadowed, and know that if we need to find a TYPE_DECL
       for a given name, we can look in the IDENTIFIER_TYPE_VALUE
       slot of the identifier.  */
    return NULL_TREE;
  }

      if ((TREE_CODE (newdecl) == FUNCTION_DECL
     && DECL_FUNCTION_TEMPLATE_P (olddecl))
    || (TREE_CODE (olddecl) == FUNCTION_DECL
        && DECL_FUNCTION_TEMPLATE_P (newdecl)))
  return NULL_TREE;

      error ("%q#D redeclared as different kind of symbol", newdecl);
      if (TREE_CODE (olddecl) == TREE_LIST)
  olddecl = TREE_VALUE (olddecl);
      cp_error_at ("previous declaration of %q#D", olddecl);

      return error_mark_node;
    }
  else if (!types_match)
    {
      if (CP_DECL_CONTEXT (newdecl) != CP_DECL_CONTEXT (olddecl))
  /* These are certainly not duplicate declarations; they're
     from different scopes.  */
  return NULL_TREE;

      if (TREE_CODE (newdecl) == TEMPLATE_DECL)
  {
    /* The name of a class template may not be declared to refer to
       any other template, class, function, object, namespace, value,
       or type in the same scope.  */
    if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == TYPE_DECL
        || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
      {
        error ("declaration of template %q#D", newdecl);
        cp_error_at ("conflicts with previous declaration %q#D",
         olddecl);
      }
    else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl)) == FUNCTION_DECL
       && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == FUNCTION_DECL
       && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl))),
         TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl))))
       && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl),
             DECL_TEMPLATE_PARMS (olddecl))
       /* Template functions can be disambiguated by
          return type.  */
       && same_type_p (TREE_TYPE (TREE_TYPE (newdecl)),
           TREE_TYPE (TREE_TYPE (olddecl))))
      {
        error ("new declaration %q#D", newdecl);
        cp_error_at ("ambiguates old declaration %q#D", olddecl);
      }
    return NULL_TREE;
  }
      if (TREE_CODE (newdecl) == FUNCTION_DECL)
  {
    if (DECL_EXTERN_C_P (newdecl) && DECL_EXTERN_C_P (olddecl))
      {
        error ("declaration of C function %q#D conflicts with",
                     newdecl);
        cp_error_at ("previous declaration %q#D here", olddecl);
      }
    else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl)),
            TYPE_ARG_TYPES (TREE_TYPE (olddecl))))
      {
        error ("new declaration %q#D", newdecl);
        cp_error_at ("ambiguates old declaration %q#D", olddecl);
      }
    else
      return NULL_TREE;
  }
      else
  {
    error ("conflicting declaration %q#D", newdecl);
    cp_error_at ("%qD has a previous declaration as %q#D",
                       olddecl, olddecl);
          return error_mark_node;
  }
    }
  else if (TREE_CODE (newdecl) == FUNCTION_DECL
      && ((DECL_TEMPLATE_SPECIALIZATION (olddecl)
     && (!DECL_TEMPLATE_INFO (newdecl)
         || (DECL_TI_TEMPLATE (newdecl)
       != DECL_TI_TEMPLATE (olddecl))))
    || (DECL_TEMPLATE_SPECIALIZATION (newdecl)
        && (!DECL_TEMPLATE_INFO (olddecl)
      || (DECL_TI_TEMPLATE (olddecl)
          != DECL_TI_TEMPLATE (newdecl))))))
    /* It's OK to have a template specialization and a non-template
       with the same type, or to have specializations of two
       different templates with the same type.  Note that if one is a
       specialization, and the other is an instantiation of the same
       template, that we do not exit at this point.  That situation
       can occur if we instantiate a template class, and then
       specialize one of its methods.  This situation is valid, but
       the declarations must be merged in the usual way.  */
    return NULL_TREE;
  else if (TREE_CODE (newdecl) == FUNCTION_DECL
     && ((DECL_TEMPLATE_INSTANTIATION (olddecl)
    && !DECL_USE_TEMPLATE (newdecl))
         || (DECL_TEMPLATE_INSTANTIATION (newdecl)
       && !DECL_USE_TEMPLATE (olddecl))))
    /* One of the declarations is a template instantiation, and the
       other is not a template at all.  That's OK.  */
    return NULL_TREE;
  else if (TREE_CODE (newdecl) == NAMESPACE_DECL)
    {
      /* In [namespace.alias] we have:
   
           In a declarative region, a namespace-alias-definition can be
     used to redefine a namespace-alias declared in that declarative
     region to refer only to the namespace to which it already
     refers.
     
   Therefore, if we encounter a second alias directive for the same
   alias, we can just ignore the second directive.  */
      if (DECL_NAMESPACE_ALIAS (newdecl)
    && (DECL_NAMESPACE_ALIAS (newdecl) 
        == DECL_NAMESPACE_ALIAS (olddecl)))
  return olddecl;
      /* [namespace.alias]

         A namespace-name or namespace-alias shall not be declared as
   the name of any other entity in the same declarative region.
   A namespace-name defined at global scope shall not be
   declared as the name of any other entity in any global scope
   of the program.  */
      error ("declaration of namespace %qD conflicts with", newdecl);
      cp_error_at ("previous declaration of namespace %qD here", olddecl);
      return error_mark_node;
    }
  else
    {
      const char *errmsg = redeclaration_error_message (newdecl, olddecl);
      if (errmsg)
  {
    error (errmsg, newdecl);
    if (DECL_NAME (olddecl) != NULL_TREE)
      cp_error_at ((DECL_INITIAL (olddecl)
        && namespace_bindings_p ())
       ? "%q#D previously defined here"
       : "%q#D previously declared here", olddecl);
    return error_mark_node;
  }
      else if (TREE_CODE (olddecl) == FUNCTION_DECL
         && DECL_INITIAL (olddecl) != NULL_TREE
         && TYPE_ARG_TYPES (TREE_TYPE (olddecl)) == NULL_TREE
         && TYPE_ARG_TYPES (TREE_TYPE (newdecl)) != NULL_TREE)
  {
    /* Prototype decl follows defn w/o prototype.  */
    cp_warning_at ("prototype for %q#D", newdecl);
    warning ("%Jfollows non-prototype definition here", olddecl);
  }
      else if (TREE_CODE (olddecl) == FUNCTION_DECL
         && DECL_LANGUAGE (newdecl) != DECL_LANGUAGE (olddecl))
  {
    /* extern "C" int foo ();
       int foo () { bar (); }
       is OK.  */
    if (current_lang_depth () == 0)
      SET_DECL_LANGUAGE (newdecl, DECL_LANGUAGE (olddecl));
    else
      {
        cp_error_at ("previous declaration of %q#D with %qL linkage",
         olddecl, DECL_LANGUAGE (olddecl));
        error ("conflicts with new declaration with %qL linkage",
                     DECL_LANGUAGE (newdecl));
      }
  }

      if (DECL_LANG_SPECIFIC (olddecl) && DECL_USE_TEMPLATE (olddecl))
  ;
      else if (TREE_CODE (olddecl) == FUNCTION_DECL)
  {
    tree t1 = TYPE_ARG_TYPES (TREE_TYPE (olddecl));
    tree t2 = TYPE_ARG_TYPES (TREE_TYPE (newdecl));
    int i = 1;

    if (TREE_CODE (TREE_TYPE (newdecl)) == METHOD_TYPE)
      t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2);

    for (; t1 && t1 != void_list_node;
         t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2), i++)
      if (TREE_PURPOSE (t1) && TREE_PURPOSE (t2))
        {
    if (1 == simple_cst_equal (TREE_PURPOSE (t1),
             TREE_PURPOSE (t2)))
      {
        pedwarn ("default argument given for parameter %d of %q#D",
           i, newdecl);
        cp_pedwarn_at ("after previous specification in %q#D",
                 olddecl);
      }
    else
      {
        error ("default argument given for parameter %d of %q#D",
                           i, newdecl);
        cp_error_at ("after previous specification in %q#D",
         olddecl);
      }
        }

    if (DECL_DECLARED_INLINE_P (newdecl)
        && ! DECL_DECLARED_INLINE_P (olddecl)
        && TREE_ADDRESSABLE (olddecl) && warn_inline)
      {
        warning ("%q#D was used before it was declared inline", newdecl);
        warning ("%Jprevious non-inline declaration here", olddecl);
      }
  }
    }

  /* Do not merge an implicit typedef with an explicit one.  In:

       class A;
       ...
       typedef class A A __attribute__ ((foo));

     the attribute should apply only to the typedef.  */
  if (TREE_CODE (olddecl) == TYPE_DECL
      && (DECL_IMPLICIT_TYPEDEF_P (olddecl)
    || DECL_IMPLICIT_TYPEDEF_P (newdecl)))
    return NULL_TREE;

  /* If new decl is `static' and an `extern' was seen previously,
     warn about it.  */
  warn_extern_redeclared_static (newdecl, olddecl);

  /* We have committed to returning 1 at this point.  */
  if (TREE_CODE (newdecl) == FUNCTION_DECL)
    {
      /* Now that functions must hold information normally held
   by field decls, there is extra work to do so that
   declaration information does not get destroyed during
   definition.  */
      if (DECL_VINDEX (olddecl))
  DECL_VINDEX (newdecl) = DECL_VINDEX (olddecl);
      if (DECL_CONTEXT (olddecl))
  DECL_CONTEXT (newdecl) = DECL_CONTEXT (olddecl);
      DECL_STATIC_CONSTRUCTOR (newdecl) |= DECL_STATIC_CONSTRUCTOR (olddecl);
      DECL_STATIC_DESTRUCTOR (newdecl) |= DECL_STATIC_DESTRUCTOR (olddecl);
      DECL_PURE_VIRTUAL_P (newdecl) |= DECL_PURE_VIRTUAL_P (olddecl);
      DECL_VIRTUAL_P (newdecl) |= DECL_VIRTUAL_P (olddecl);
      DECL_THIS_STATIC (newdecl) |= DECL_THIS_STATIC (olddecl);
      if (DECL_OVERLOADED_OPERATOR_P (olddecl) != ERROR_MARK)
  SET_OVERLOADED_OPERATOR_CODE
    (newdecl, DECL_OVERLOADED_OPERATOR_P (olddecl));
      new_defines_function = DECL_INITIAL (newdecl) != NULL_TREE;

      /* Optionally warn about more than one declaration for the same
         name, but don't warn about a function declaration followed by a
         definition.  */
      if (warn_redundant_decls && ! DECL_ARTIFICIAL (olddecl)
    && !(new_defines_function && DECL_INITIAL (olddecl) == NULL_TREE)
    /* Don't warn about extern decl followed by definition.  */
    && !(DECL_EXTERNAL (olddecl) && ! DECL_EXTERNAL (newdecl))
    /* Don't warn about friends, let add_friend take care of it.  */
    && ! (DECL_FRIEND_P (newdecl) || DECL_FRIEND_P (olddecl)))
  {
    warning ("redundant redeclaration of %qD in same scope", newdecl);
    cp_warning_at ("previous declaration of %qD", olddecl);
  }
    }

  /* Deal with C++: must preserve virtual function table size.  */
  if (TREE_CODE (olddecl) == TYPE_DECL)
    {
      tree newtype = TREE_TYPE (newdecl);
      tree oldtype = TREE_TYPE (olddecl);

      if (newtype != error_mark_node && oldtype != error_mark_node
    && TYPE_LANG_SPECIFIC (newtype) && TYPE_LANG_SPECIFIC (oldtype))
  CLASSTYPE_FRIEND_CLASSES (newtype)
    = CLASSTYPE_FRIEND_CLASSES (oldtype);

      DECL_ORIGINAL_TYPE (newdecl) = DECL_ORIGINAL_TYPE (olddecl);
    }

  /* Copy all the DECL_... slots specified in the new decl
     except for any that we copy here from the old type.  */
  DECL_ATTRIBUTES (newdecl)
    = (*targetm.merge_decl_attributes) (olddecl, newdecl);

  if (TREE_CODE (newdecl) == TEMPLATE_DECL)
    {
      TREE_TYPE (olddecl) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl));
      DECL_TEMPLATE_SPECIALIZATIONS (olddecl)
  = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl),
       DECL_TEMPLATE_SPECIALIZATIONS (newdecl));

      /* If the new declaration is a definition, update the file and
   line information on the declaration.  */
      if (DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl)) == NULL_TREE
    && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl)) != NULL_TREE)
  {
    DECL_SOURCE_LOCATION (olddecl)
      = DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (olddecl))
      = DECL_SOURCE_LOCATION (newdecl);
    if (DECL_FUNCTION_TEMPLATE_P (newdecl))
      DECL_ARGUMENTS (DECL_TEMPLATE_RESULT (olddecl))
        = DECL_ARGUMENTS (DECL_TEMPLATE_RESULT (newdecl));
  }

      if (DECL_FUNCTION_TEMPLATE_P (newdecl))
  {
    DECL_INLINE (DECL_TEMPLATE_RESULT (olddecl))
      |= DECL_INLINE (DECL_TEMPLATE_RESULT (newdecl));
    DECL_DECLARED_INLINE_P (DECL_TEMPLATE_RESULT (olddecl))
      |= DECL_DECLARED_INLINE_P (DECL_TEMPLATE_RESULT (newdecl));
  }

      return olddecl;
    }

  if (types_match)
    {
      /* Automatically handles default parameters.  */
      tree oldtype = TREE_TYPE (olddecl);
      tree newtype;

      /* Merge the data types specified in the two decls.  */
      newtype = merge_types (TREE_TYPE (newdecl), TREE_TYPE (olddecl));

      /* If merge_types produces a non-typedef type, just use the old type.  */
      if (TREE_CODE (newdecl) == TYPE_DECL
    && newtype == DECL_ORIGINAL_TYPE (newdecl))
  newtype = oldtype;

      if (TREE_CODE (newdecl) == VAR_DECL)
  {
    DECL_THIS_EXTERN (newdecl) |= DECL_THIS_EXTERN (olddecl);
    DECL_INITIALIZED_P (newdecl) |= DECL_INITIALIZED_P (olddecl);
    DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (newdecl)
      |= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (olddecl);
  }

      /* Do this after calling `merge_types' so that default
   parameters don't confuse us.  */
      else if (TREE_CODE (newdecl) == FUNCTION_DECL
    && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl))
        != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl))))
  {
    TREE_TYPE (newdecl) = build_exception_variant (newtype,
               TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)));
    TREE_TYPE (olddecl) = build_exception_variant (newtype,
               TYPE_RAISES_EXCEPTIONS (oldtype));

    if ((pedantic || ! DECL_IN_SYSTEM_HEADER (olddecl))
        && ! DECL_IS_BUILTIN (olddecl)
        && flag_exceptions
        && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl)),
                               TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl)), 1))
      {
        error ("declaration of %qF throws different exceptions",
                     newdecl);
        cp_error_at ("than previous declaration %qF", olddecl);
      }
  }
      TREE_TYPE (newdecl) = TREE_TYPE (olddecl) = newtype;

      /* Lay the type out, unless already done.  */
      if (! same_type_p (newtype, oldtype)
    && TREE_TYPE (newdecl) != error_mark_node
    && !(processing_template_decl && uses_template_parms (newdecl)))
  layout_type (TREE_TYPE (newdecl));

      if ((TREE_CODE (newdecl) == VAR_DECL
     || TREE_CODE (newdecl) == PARM_DECL
     || TREE_CODE (newdecl) == RESULT_DECL
     || TREE_CODE (newdecl) == FIELD_DECL
     || TREE_CODE (newdecl) == TYPE_DECL)
    && !(processing_template_decl && uses_template_parms (newdecl)))
  layout_decl (newdecl, 0);

      /* Merge the type qualifiers.  */
      if (TREE_READONLY (newdecl))
  TREE_READONLY (olddecl) = 1;
      if (TREE_THIS_VOLATILE (newdecl))
  TREE_THIS_VOLATILE (olddecl) = 1;
      if (TREE_NOTHROW (newdecl))
  TREE_NOTHROW (olddecl) = 1;

      /* Merge deprecatedness.  */
      if (TREE_DEPRECATED (newdecl))
  TREE_DEPRECATED (olddecl) = 1;

      /* Merge the initialization information.  */
      if (DECL_INITIAL (newdecl) == NULL_TREE
    && DECL_INITIAL (olddecl) != NULL_TREE)
  {
    DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
    DECL_SOURCE_LOCATION (newdecl) = DECL_SOURCE_LOCATION (olddecl);
    if (CAN_HAVE_FULL_LANG_DECL_P (newdecl)
        && DECL_LANG_SPECIFIC (newdecl)
        && DECL_LANG_SPECIFIC (olddecl))
      {
        DECL_SAVED_TREE (newdecl) = DECL_SAVED_TREE (olddecl);
        DECL_STRUCT_FUNCTION (newdecl) = DECL_STRUCT_FUNCTION (olddecl);
      }
  }

      /* Merge the section attribute.
         We want to issue an error if the sections conflict but that must be
   done later in decl_attributes since we are called before attributes
   are assigned.  */
      if (DECL_SECTION_NAME (newdecl) == NULL_TREE)
  DECL_SECTION_NAME (newdecl) = DECL_SECTION_NAME (olddecl);

      if (TREE_CODE (newdecl) == FUNCTION_DECL)
  {
    DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl)
      |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl);
    DECL_NO_LIMIT_STACK (newdecl) |= DECL_NO_LIMIT_STACK (olddecl);
    TREE_THIS_VOLATILE (newdecl) |= TREE_THIS_VOLATILE (olddecl);
    TREE_READONLY (newdecl) |= TREE_READONLY (olddecl);
    TREE_NOTHROW (newdecl) |= TREE_NOTHROW (olddecl);
    DECL_IS_MALLOC (newdecl) |= DECL_IS_MALLOC (olddecl);
    DECL_IS_PURE (newdecl) |= DECL_IS_PURE (olddecl);
    /* Keep the old RTL.  */
    COPY_DECL_RTL (olddecl, newdecl);
  }
      else if (TREE_CODE (newdecl) == VAR_DECL
         && (DECL_SIZE (olddecl) || !DECL_SIZE (newdecl)))
  {
    /* Keep the old RTL.  We cannot keep the old RTL if the old
       declaration was for an incomplete object and the new
       declaration is not since many attributes of the RTL will
       change.  */
    COPY_DECL_RTL (olddecl, newdecl);
  }
    }
  /* If cannot merge, then use the new type and qualifiers,
     and don't preserve the old rtl.  */
  else
    {
      /* Clean out any memory we had of the old declaration.  */
      tree oldstatic = value_member (olddecl, static_aggregates);
      if (oldstatic)
  TREE_VALUE (oldstatic) = error_mark_node;

      TREE_TYPE (olddecl) = TREE_TYPE (newdecl);
      TREE_READONLY (olddecl) = TREE_READONLY (newdecl);
      TREE_THIS_VOLATILE (olddecl) = TREE_THIS_VOLATILE (newdecl);
      TREE_SIDE_EFFECTS (olddecl) = TREE_SIDE_EFFECTS (newdecl);
    }

  /* Merge the storage class information.  */
  merge_weak (newdecl, olddecl);

  DECL_ONE_ONLY (newdecl) |= DECL_ONE_ONLY (olddecl);
  DECL_DEFER_OUTPUT (newdecl) |= DECL_DEFER_OUTPUT (olddecl);
  TREE_PUBLIC (newdecl) = TREE_PUBLIC (olddecl);
  TREE_STATIC (olddecl) = TREE_STATIC (newdecl) |= TREE_STATIC (olddecl);
  if (! DECL_EXTERNAL (olddecl))
    DECL_EXTERNAL (newdecl) = 0;

  if (DECL_LANG_SPECIFIC (newdecl) && DECL_LANG_SPECIFIC (olddecl))
    {
      DECL_INTERFACE_KNOWN (newdecl) |= DECL_INTERFACE_KNOWN (olddecl);
      DECL_NOT_REALLY_EXTERN (newdecl) |= DECL_NOT_REALLY_EXTERN (olddecl);
      DECL_COMDAT (newdecl) |= DECL_COMDAT (olddecl);
      DECL_TEMPLATE_INSTANTIATED (newdecl)
  |= DECL_TEMPLATE_INSTANTIATED (olddecl);
      
      /* If the OLDDECL is an instantiation and/or specialization,
   then the NEWDECL must be too.  But, it may not yet be marked
   as such if the caller has created NEWDECL, but has not yet
   figured out that it is a redeclaration.  */
      if (!DECL_USE_TEMPLATE (newdecl))
  DECL_USE_TEMPLATE (newdecl) = DECL_USE_TEMPLATE (olddecl);
      
      /* Don't really know how much of the language-specific
   values we should copy from old to new.  */
      DECL_IN_AGGR_P (newdecl) = DECL_IN_AGGR_P (olddecl);
      DECL_LANG_SPECIFIC (newdecl)->decl_flags.u2 =
  DECL_LANG_SPECIFIC (olddecl)->decl_flags.u2;
      DECL_NONCONVERTING_P (newdecl) = DECL_NONCONVERTING_P (olddecl);
      DECL_REPO_AVAILABLE_P (newdecl) = DECL_REPO_AVAILABLE_P (olddecl);
      DECL_TEMPLATE_INFO (newdecl) = DECL_TEMPLATE_INFO (olddecl);
      DECL_INITIALIZED_IN_CLASS_P (newdecl)
        |= DECL_INITIALIZED_IN_CLASS_P (olddecl);
      olddecl_friend = DECL_FRIEND_P (olddecl);

      /* Only functions have DECL_BEFRIENDING_CLASSES.  */
      if (TREE_CODE (newdecl) == FUNCTION_DECL
    || DECL_FUNCTION_TEMPLATE_P (newdecl))
  {
    DECL_BEFRIENDING_CLASSES (newdecl)
      = chainon (DECL_BEFRIENDING_CLASSES (newdecl),
           DECL_BEFRIENDING_CLASSES (olddecl));
    /* DECL_THUNKS is only valid for virtual functions,
       otherwise it is a DECL_FRIEND_CONTEXT.  */
    if (DECL_VIRTUAL_P (newdecl))
      DECL_THUNKS (newdecl) = DECL_THUNKS (olddecl);
  }
    }

  if (TREE_CODE (newdecl) == FUNCTION_DECL)
    {
      if (DECL_TEMPLATE_INSTANTIATION (olddecl)
    && !DECL_TEMPLATE_INSTANTIATION (newdecl))
  {
    /* If newdecl is not a specialization, then it is not a
       template-related function at all.  And that means that we
       should have exited above, returning 0.  */
    gcc_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl));

    if (TREE_USED (olddecl))
      /* From [temp.expl.spec]:

         If a template, a member template or the member of a class
         template is explicitly specialized then that
         specialization shall be declared before the first use of
         that specialization that would cause an implicit
         instantiation to take place, in every translation unit in
         which such a use occurs.  */
      error ("explicit specialization of %qD after first use",
          olddecl);

    SET_DECL_TEMPLATE_SPECIALIZATION (olddecl);

    /* [temp.expl.spec/14] We don't inline explicit specialization
       just because the primary template says so.  */
  }
      else
  {
    if (DECL_PENDING_INLINE_INFO (newdecl) == 0)
      DECL_PENDING_INLINE_INFO (newdecl) = DECL_PENDING_INLINE_INFO (olddecl);

    DECL_DECLARED_INLINE_P (newdecl) |= DECL_DECLARED_INLINE_P (olddecl);

    /* If either decl says `inline', this fn is inline, unless
       its definition was passed already.  */
    if (DECL_INLINE (newdecl) && DECL_INITIAL (olddecl) == NULL_TREE)
      DECL_INLINE (olddecl) = 1;
    DECL_INLINE (newdecl) = DECL_INLINE (olddecl);

    DECL_UNINLINABLE (newdecl) = DECL_UNINLINABLE (olddecl)
      = (DECL_UNINLINABLE (newdecl) || DECL_UNINLINABLE (olddecl));
  }

      /* Preserve abstractness on cloned [cd]tors.  */
      DECL_ABSTRACT (newdecl) = DECL_ABSTRACT (olddecl);

      if (! types_match)
  {
    SET_DECL_LANGUAGE (olddecl, DECL_LANGUAGE (newdecl));
    COPY_DECL_ASSEMBLER_NAME (newdecl, olddecl);
    COPY_DECL_RTL (newdecl, olddecl);
  }
      if (! types_match || new_defines_function)
  {
    /* These need to be copied so that the names are available.
       Note that if the types do match, we'll preserve inline
       info and other bits, but if not, we won't.  */
    DECL_ARGUMENTS (olddecl) = DECL_ARGUMENTS (newdecl);
    DECL_RESULT (olddecl) = DECL_RESULT (newdecl);
  }
      if (new_defines_function)
  /* If defining a function declared with other language
     linkage, use the previously declared language linkage.  */
  SET_DECL_LANGUAGE (newdecl, DECL_LANGUAGE (olddecl));
      else if (types_match)
  {
    /* If redeclaring a builtin function, and not a definition,
       it stays built in.  */
    if (DECL_BUILT_IN (olddecl))
      {
        DECL_BUILT_IN_CLASS (newdecl) = DECL_BUILT_IN_CLASS (olddecl);
        DECL_FUNCTION_CODE (newdecl) = DECL_FUNCTION_CODE (olddecl);
        /* If we're keeping the built-in definition, keep the rtl,
     regardless of declaration matches.  */
        COPY_DECL_RTL (olddecl, newdecl);
      }

    DECL_RESULT (newdecl) = DECL_RESULT (olddecl);
    /* Don't clear out the arguments if we're redefining a function.  */
    if (DECL_ARGUMENTS (olddecl))
      DECL_ARGUMENTS (newdecl) = DECL_ARGUMENTS (olddecl);
  }
    }
  else if (TREE_CODE (newdecl) == NAMESPACE_DECL)
    NAMESPACE_LEVEL (newdecl) = NAMESPACE_LEVEL (olddecl);

  /* Now preserve various other info from the definition.  */
  TREE_ADDRESSABLE (newdecl) = TREE_ADDRESSABLE (olddecl);
  TREE_ASM_WRITTEN (newdecl) = TREE_ASM_WRITTEN (olddecl);
  DECL_COMMON (newdecl) = DECL_COMMON (olddecl);
  COPY_DECL_ASSEMBLER_NAME (olddecl, newdecl);

  /* Warn about conflicting visibility specifications.  */
  if (DECL_VISIBILITY_SPECIFIED (olddecl) 
      && DECL_VISIBILITY_SPECIFIED (newdecl)
      && DECL_VISIBILITY (newdecl) != DECL_VISIBILITY (olddecl))
    {
      warning ("%J%qD: visibility attribute ignored because it",
         newdecl, newdecl);
      warning ("%Jconflicts with previous declaration here", olddecl);
    }
  /* Choose the declaration which specified visibility.  */
  if (DECL_VISIBILITY_SPECIFIED (olddecl))
    {
      DECL_VISIBILITY (newdecl) = DECL_VISIBILITY (olddecl);
      DECL_VISIBILITY_SPECIFIED (newdecl) = 1;
    }

  /* The DECL_LANG_SPECIFIC information in OLDDECL will be replaced
     with that from NEWDECL below.  */
  if (DECL_LANG_SPECIFIC (olddecl))
    {
      gcc_assert (DECL_LANG_SPECIFIC (olddecl) 
      != DECL_LANG_SPECIFIC (newdecl));
      ggc_free (DECL_LANG_SPECIFIC (olddecl));
    }

  if (TREE_CODE (newdecl) == FUNCTION_DECL)
    {
      int function_size;

      function_size = sizeof (struct tree_decl);

      memcpy ((char *) olddecl + sizeof (struct tree_common),
        (char *) newdecl + sizeof (struct tree_common),
        function_size - sizeof (struct tree_common));

      if (DECL_TEMPLATE_INFO (newdecl))
  /* If newdecl is a template instantiation, it is possible that
     the following sequence of events has occurred:

     o A friend function was declared in a class template.  The
     class template was instantiated.

     o The instantiation of the friend declaration was
     recorded on the instantiation list, and is newdecl.

     o Later, however, instantiate_class_template called pushdecl
     on the newdecl to perform name injection.  But, pushdecl in
     turn called duplicate_decls when it discovered that another
     declaration of a global function with the same name already
     existed.

     o Here, in duplicate_decls, we decided to clobber newdecl.

     If we're going to do that, we'd better make sure that
     olddecl, and not newdecl, is on the list of
     instantiations so that if we try to do the instantiation
     again we won't get the clobbered declaration.  */
  reregister_specialization (newdecl,
           DECL_TI_TEMPLATE (newdecl),
           olddecl);
    }
  else
    {
      memcpy ((char *) olddecl + sizeof (struct tree_common),
        (char *) newdecl + sizeof (struct tree_common),
        sizeof (struct tree_decl) - sizeof (struct tree_common)
        + TREE_CODE_LENGTH (TREE_CODE (newdecl)) * sizeof (char *));
    }

  DECL_UID (olddecl) = olddecl_uid;
  if (olddecl_friend)
    DECL_FRIEND_P (olddecl) = 1;

  /* NEWDECL contains the merged attribute lists.
     Update OLDDECL to be the same.  */
  DECL_ATTRIBUTES (olddecl) = DECL_ATTRIBUTES (newdecl);

  /* If OLDDECL had its DECL_RTL instantiated, re-invoke make_decl_rtl
    so that encode_section_info has a chance to look at the new decl
    flags and attributes.  */
  if (DECL_RTL_SET_P (olddecl)
      && (TREE_CODE (olddecl) == FUNCTION_DECL
    || (TREE_CODE (olddecl) == VAR_DECL
        && TREE_STATIC (olddecl))))
    make_decl_rtl (olddecl);

  /* The NEWDECL will no longer be needed.  Because every out-of-class
     declaration of a member results in a call to duplicate_decls,
     freeing these nodes represents in a significant savings.  */
  ggc_free (newdecl);

  return olddecl;
}

/* Return zero if the declaration NEWDECL is valid
   when the declaration OLDDECL (assumed to be for the same name)
   has already been seen.
   Otherwise return an error message format string with a %s
   where the identifier should go.  */

static const char *
redeclaration_error_message (tree newdecl, tree olddecl)
{
  if (TREE_CODE (newdecl) == TYPE_DECL)
    {
      /* Because C++ can put things into name space for free,
   constructs like "typedef struct foo { ... } foo"
   would look like an erroneous redeclaration.  */
      if (same_type_p (TREE_TYPE (newdecl), TREE_TYPE (olddecl)))
  return 0;
      else
  return "redefinition of %q#D";
    }
  else if (TREE_CODE (newdecl) == FUNCTION_DECL)
    {
      /* If this is a pure function, its olddecl will actually be
   the original initialization to `0' (which we force to call
   abort()).  Don't complain about redefinition in this case.  */
      if (DECL_LANG_SPECIFIC (olddecl) && DECL_PURE_VIRTUAL_P (olddecl)
    && DECL_INITIAL (olddecl) == NULL_TREE)
  return 0;

      /* If both functions come from different namespaces, this is not
   a redeclaration - this is a conflict with a used function.  */
      if (DECL_NAMESPACE_SCOPE_P (olddecl)
    && DECL_CONTEXT (olddecl) != DECL_CONTEXT (newdecl)
    && ! decls_match (olddecl, newdecl))
  return "%qD conflicts with used function";

      /* We'll complain about linkage mismatches in
         warn_extern_redeclared_static.  */

      /* Defining the same name twice is no good.  */
      if (DECL_INITIAL (olddecl) != NULL_TREE
    && DECL_INITIAL (newdecl) != NULL_TREE)
  {
    if (DECL_NAME (olddecl) == NULL_TREE)
      return "%q#D not declared in class";
    else
      return "redefinition of %q#D";
  }
      return 0;
    }
  else if (TREE_CODE (newdecl) == TEMPLATE_DECL)
    {
      tree nt, ot;

      if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) == TYPE_DECL)
  {
    if (COMPLETE_TYPE_P (TREE_TYPE (newdecl))
        && COMPLETE_TYPE_P (TREE_TYPE (olddecl)))
      return "redefinition of %q#D";
    return NULL;
  }

      if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl)) != FUNCTION_DECL
    || (DECL_TEMPLATE_RESULT (newdecl)
        == DECL_TEMPLATE_RESULT (olddecl)))
  return NULL;

      nt = DECL_TEMPLATE_RESULT (newdecl);
      if (DECL_TEMPLATE_INFO (nt))
  nt = DECL_TEMPLATE_RESULT (template_for_substitution (nt));
      ot = DECL_TEMPLATE_RESULT (olddecl);
      if (DECL_TEMPLATE_INFO (ot))
  ot = DECL_TEMPLATE_RESULT (template_for_substitution (ot));
      if (DECL_INITIAL (nt) && DECL_INITIAL (ot))
  return "redefinition of %q#D";

      return NULL;
    }
  else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl))
    {
      /* Objects declared at top level:  */
      /* If at least one is a reference, it's ok.  */
      if (DECL_EXTERNAL (newdecl) || DECL_EXTERNAL (olddecl))
  return 0;
      /* Reject two definitions.  */
      return "redefinition of %q#D";
    }
  else
    {
      /* Objects declared with block scope:  */
      /* Reject two definitions, and reject a definition
   together with an external reference.  */
      if (!(DECL_EXTERNAL (newdecl) && DECL_EXTERNAL (olddecl)))
  return "redeclaration of %q#D";
      return 0;
    }
}

/* Create a new label, named ID.  */

static tree
make_label_decl (tree id, int local_p)
{
  tree decl;

  decl = build_decl (LABEL_DECL, id, void_type_node);

  DECL_CONTEXT (decl) = current_function_decl;
  DECL_MODE (decl) = VOIDmode;
  C_DECLARED_LABEL_FLAG (decl) = local_p;

  /* Say where one reference is to the label, for the sake of the
     error if it is not defined.  */
  DECL_SOURCE_LOCATION (decl) = input_location;

  /* Record the fact that this identifier is bound to this label.  */
  SET_IDENTIFIER_LABEL_VALUE (id, decl);

  return decl;
}

/* Record this label on the list of used labels so that we can check
   at the end of the function to see whether or not the label was
   actually defined, and so we can check when the label is defined whether
   this use is valid.  */

static void
use_label (tree decl)
{
  if (named_label_uses == NULL
      || named_label_uses->names_in_scope != current_binding_level->names
      || named_label_uses->label_decl != decl)
    {
      struct named_label_use_list *new_ent;
      new_ent = GGC_NEW (struct named_label_use_list);
      new_ent->label_decl = decl;
      new_ent->names_in_scope = current_binding_level->names;
      new_ent->binding_level = current_binding_level;
      new_ent->o_goto_locus = input_location;
      new_ent->next = named_label_uses;
      named_label_uses = new_ent;
    }
}

/* Look for a label named ID in the current function.  If one cannot
   be found, create one.  (We keep track of used, but undefined,
   labels, and complain about them at the end of a function.)  */

tree
lookup_label (tree id)
{
  tree decl;
  struct named_label_list *ent;

  timevar_push (TV_NAME_LOOKUP);
  /* You can't use labels at global scope.  */
  if (current_function_decl == NULL_TREE)
    {
      error ("label %qE referenced outside of any function", id);
      POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, NULL_TREE);
    }

  /* See if we've already got this label.  */
  decl = IDENTIFIER_LABEL_VALUE (id);
  if (decl != NULL_TREE && DECL_CONTEXT (decl) == current_function_decl)
    POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);

  /* Record this label on the list of labels used in this function.
     We do this before calling make_label_decl so that we get the
     IDENTIFIER_LABEL_VALUE before the new label is declared.  */
  ent = GGC_CNEW (struct named_label_list);
  ent->old_value = IDENTIFIER_LABEL_VALUE (id);
  ent->next = named_labels;
  named_labels = ent;

  /* We need a new label.  */
  decl = make_label_decl (id, /*local_p=*/0);

  /* Now fill in the information we didn't have before.  */
  ent->label_decl = decl;

  POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
}

/* Declare a local label named ID.  */

tree
declare_local_label (tree id)
{
  tree decl;

  /* Add a new entry to the SHADOWED_LABELS list so that when we leave
     this scope we can restore the old value of
     IDENTIFIER_TYPE_VALUE.  */
  current_binding_level->shadowed_labels
    = tree_cons (IDENTIFIER_LABEL_VALUE (id), NULL_TREE,
     current_binding_level->shadowed_labels);
  /* Look for the label.  */
  decl = make_label_decl (id, /*local_p=*/1);
  /* Now fill in the information we didn't have before.  */
  TREE_VALUE (current_binding_level->shadowed_labels) = decl;

  return decl;
}

/* Returns nonzero if it is ill-formed to jump past the declaration of
   DECL.  Returns 2 if it's also a real problem.  */

static int
decl_jump_unsafe (tree decl)
{
  if (TREE_CODE (decl) != VAR_DECL || TREE_STATIC (decl))
    return 0;

  if (DECL_INITIAL (decl) == NULL_TREE
      && pod_type_p (TREE_TYPE (decl)))
    return 0;

  /* This is really only important if we're crossing an initialization.
     The POD stuff is just pedantry; why should it matter if the class
     contains a field of pointer to member type?  */
  if (DECL_INITIAL (decl)
      || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl))))
    return 2;
  return 1;
}

/* Check that a single previously seen jump to a newly defined label
   is OK.  DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
   the jump context; NAMES are the names in scope in LEVEL at the jump
   context; FILE and LINE are the source position of the jump or 0.  */

static void
check_previous_goto_1 (tree decl,
                       struct cp_binding_level* level,
                       tree names, const location_t *locus)
{
  int identified = 0;
  int saw_eh = 0;
  struct cp_binding_level *b = current_binding_level;
  for (; b; b = b->level_chain)
    {
      tree new_decls = b->names;
      tree old_decls = (b == level ? names : NULL_TREE);
      for (; new_decls != old_decls;
     new_decls = TREE_CHAIN (new_decls))
  {
    int problem = decl_jump_unsafe (new_decls);
    if (! problem)
      continue;

    if (! identified)
      {
        if (decl)
    pedwarn ("jump to label %qD", decl);
        else
    pedwarn ("jump to case label");

        if (locus)
    pedwarn ("%H  from here", locus);
        identified = 1;
      }

    if (problem > 1)
      cp_error_at ("  crosses initialization of %q#D",
       new_decls);
    else
      cp_pedwarn_at ("  enters scope of non-POD %q#D",
         new_decls);
  }

      if (b == level)
  break;
      if ((b->kind == sk_try || b->kind == sk_catch) && ! saw_eh)
  {
    if (! identified)
      {
        if (decl)
    pedwarn ("jump to label %qD", decl);
        else
    pedwarn ("jump to case label");

        if (locus)
    pedwarn ("%H  from here", locus);
        identified = 1;
      }
    if (b->kind == sk_try)
      error ("  enters try block");
    else
      error ("  enters catch block");
    saw_eh = 1;
  }
    }
}

static void
check_previous_goto (struct named_label_use_list* use)
{
  check_previous_goto_1 (use->label_decl, use->binding_level,
       use->names_in_scope, &use->o_goto_locus);
}

static void
check_switch_goto (struct cp_binding_level* level)
{
  check_previous_goto_1 (NULL_TREE, level, level->names, NULL);
}

/* Check that any previously seen jumps to a newly defined label DECL
   are OK.  Called by define_label.  */

static void
check_previous_gotos (tree decl)
{
  struct named_label_use_list **usep;

  if (! TREE_USED (decl))
    return;

  for (usep = &named_label_uses; *usep; )
    {
      struct named_label_use_list *use = *usep;
      if (use->label_decl == decl)
  {
    check_previous_goto (use);
    *usep = use->next;
  }
      else
  usep = &(use->next);
    }
}

/* Check that a new jump to a label DECL is OK.  Called by
   finish_goto_stmt.  */

void
check_goto (tree decl)
{
  int identified = 0;
  tree bad;
  struct named_label_list *lab;

  /* We can't know where a computed goto is jumping.  So we assume
     that it's OK.  */
  if (! DECL_P (decl))
    return;

  /* If the label hasn't been defined yet, defer checking.  */
  if (! DECL_INITIAL (decl))
    {
      use_label (decl);
      return;
    }

  for (lab = named_labels; lab; lab = lab->next)
    if (decl == lab->label_decl)
      break;

  /* If the label is not on named_labels it's a gcc local label, so
     it must be in an outer scope, so jumping to it is always OK.  */
  if (lab == 0)
    return;

  if ((lab->in_try_scope || lab->in_catch_scope || lab->bad_decls)
      && !identified)
    {
      cp_pedwarn_at ("jump to label %qD", decl);
      pedwarn ("  from here");
      identified = 1;
    }

  for (bad = lab->bad_decls; bad; bad = TREE_CHAIN (bad))
    {
      tree b = TREE_VALUE (bad);
      int u = decl_jump_unsafe (b);

      if (u > 1 && DECL_ARTIFICIAL (b))
  /* Can't skip init of __exception_info.  */
  error ("%J  enters catch block", b);
      else if (u > 1)
  cp_error_at ("  skips initialization of %q#D", b);
      else
  cp_pedwarn_at ("  enters scope of non-POD %q#D", b);
    }

  if (lab->in_try_scope)
    error ("  enters try block");
  else if (lab->in_catch_scope)
    error ("  enters catch block");
}

/* Define a label, specifying the location in the source file.
   Return the LABEL_DECL node for the label.  */

tree
define_label (location_t location, tree name)
{
  tree decl = lookup_label (name);
  struct named_label_list *ent;
  struct cp_binding_level *p;

  timevar_push (TV_NAME_LOOKUP);
  for (ent = named_labels; ent; ent = ent->next)
    if (ent->label_decl == decl)
      break;

  /* After labels, make any new cleanups in the function go into their
     own new (temporary) binding contour.  */
  for (p = current_binding_level;
       p->kind != sk_function_parms;
       p = p->level_chain)
    p->more_cleanups_ok = 0;

  if (name == get_identifier ("wchar_t"))
    pedwarn ("label named wchar_t");

  if (DECL_INITIAL (decl) != NULL_TREE)
    error ("duplicate label %qD", decl);
  else
    {
      /* Mark label as having been defined.  */
      DECL_INITIAL (decl) = error_mark_node;
      /* Say where in the source.  */
      DECL_SOURCE_LOCATION (decl) = location;
      if (ent)
  {
    ent->names_in_scope = current_binding_level->names;
    ent->binding_level = current_binding_level;
  }
      check_previous_gotos (decl);
    }

  POP_TIMEVAR_AND_RETURN (TV_NAME_LOOKUP, decl);
}

struct cp_switch
{
  struct cp_binding_level *level;
  struct cp_switch *next;
  /* The SWITCH_STMT being built.  */
  tree switch_stmt;
  /* A splay-tree mapping the low element of a case range to the high
     element, or NULL_TREE if there is no high element.  Used to
     determine whether or not a new case label duplicates an old case
     label.  We need a tree, rather than simply a hash table, because
     of the GNU case range extension.  */
  splay_tree cases;
};

/* A stack of the currently active switch statements.  The innermost
   switch statement is on the top of the stack.  There is no need to
   mark the stack for garbage collection because it is only active
   during the processing of the body of a function, and we never
   collect at that point.  */

static struct cp_switch *switch_stack;

/* Called right after a switch-statement condition is parsed.
   SWITCH_STMT is the switch statement being parsed.  */

void
push_switch (tree switch_stmt)
{
  struct cp_switch *p = xmalloc (sizeof (struct cp_switch));
  p->level = current_binding_level;
  p->next = switch_stack;
  p->switch_stmt = switch_stmt;
  p->cases = splay_tree_new (case_compare, NULL, NULL);
  switch_stack = p;
}

void
pop_switch (void)
{
  struct cp_switch *cs = switch_stack;

  /* Emit warnings as needed.  */
  c_do_switch_warnings (cs->cases, cs->switch_stmt);

  splay_tree_delete (cs->cases);
  switch_stack = switch_stack->next;
  free (cs);
}

/* Note that we've seen a definition of a case label, and complain if this
   is a bad place for one.  */

tree
finish_case_label (tree low_value, tree high_value)
{
  tree cond, r;
  struct cp_binding_level *p;

  if (processing_template_decl)
    {
      tree label;

      /* For templates, just add the case label; we'll do semantic
   analysis at instantiation-time.  */
      label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
      return add_stmt (build_case_label (low_value, high_value, label));
    }

  /* Find the condition on which this switch statement depends.  */
  cond = SWITCH_STMT_COND (switch_stack->switch_stmt);
  if (cond && TREE_CODE (cond) == TREE_LIST)
    cond = TREE_VALUE (cond);

  r = c_add_case_label (switch_stack->cases, cond, TREE_TYPE (cond),
      low_value, high_value);

  check_switch_goto (switch_stack->level);

  /* After labels, make any new cleanups in the function go into their
     own new (temporary) binding contour.  */
  for (p = current_binding_level;
       p->kind != sk_function_parms;
       p = p->level_chain)
    p->more_cleanups_ok = 0;

  return r;
}

/* Hash a TYPENAME_TYPE.  K is really of type `tree'.  */

static hashval_t
typename_hash (const void* k)
{
  hashval_t hash;
  tree t = (tree) k;

  hash = (htab_hash_pointer (TYPE_CONTEXT (t))
    ^ htab_hash_pointer (DECL_NAME (TYPE_NAME (t))));

  return hash;
}

typedef struct typename_info {
  tree scope;
  tree name;
  tree template_id;
  bool enum_p;
  bool class_p;
} typename_info;

/* Compare two TYPENAME_TYPEs.  K1 and K2 are really of type `tree'.  */

static int
typename_compare (const void * k1, const void * k2)
{
  tree t1;
  const typename_info *t2;

  t1 = (tree) k1;
  t2 = (const typename_info *) k2;

  return (DECL_NAME (TYPE_NAME (t1)) == t2->name
    && TYPE_CONTEXT (t1) == t2->scope
    && TYPENAME_TYPE_FULLNAME (t1) == t2->template_id
    && TYPENAME_IS_ENUM_P (t1) == t2->enum_p
    && TYPENAME_IS_CLASS_P (t1) == t2->class_p);
}

/* Build a TYPENAME_TYPE.  If the type is `typename T::t', CONTEXT is
   the type of `T', NAME is the IDENTIFIER_NODE for `t'.
 
   Returns the new TYPENAME_TYPE.  */

static GTY ((param_is (union tree_node))) htab_t typename_htab;

static tree
build_typename_type (tree context, tree name, tree fullname,
         enum tag_types tag_type)
{
  tree t;
  tree d;
  typename_info ti;
  void **e;
  hashval_t hash;

  if (typename_htab == NULL)
    typename_htab = htab_create_ggc (61, &typename_hash,
             &typename_compare, NULL);

  ti.scope = FROB_CONTEXT (context); 
  ti.name = name;
  ti.template_id = fullname;
  ti.enum_p = tag_type == enum_type;
  ti.class_p = (tag_type == class_type
    || tag_type == record_type
    || tag_type == union_type);
  hash =  (htab_hash_pointer (ti.scope)
     ^ htab_hash_pointer (ti.name));

  /* See if we already have this type.  */
  e = htab_find_slot_with_hash (typename_htab, &ti, hash, INSERT);
  if (*e)
    t = (tree) *e;
  else
    {
      /* Build the TYPENAME_TYPE.  */
      t = make_aggr_type (TYPENAME_TYPE);
      TYPE_CONTEXT (t) = ti.scope;
      TYPENAME_TYPE_FULLNAME (t) = ti.template_id;
      TYPENAME_IS_ENUM_P (t) = ti.enum_p;
      TYPENAME_IS_CLASS_P (t) = ti.class_p;
      
      /* Build the corresponding TYPE_DECL.  */
      d = build_decl (TYPE_DECL, name, t);
      TYPE_NAME (TREE_TYPE (d)) = d;
      TYPE_STUB_DECL (TREE_TYPE (d)) = d;
      DECL_CONTEXT (d) = FROB_CONTEXT (context);
      DECL_ARTIFICIAL (d) = 1;

      /* Store it in the hash table.  */
      *e = t;
    }
      
  return t;
}

/* Resolve `typename CONTEXT::NAME'.  TAG_TYPE indicates the tag
   provided to name the type.  Returns an appropriate type, unless an
   error occurs, in which case error_mark_node is returned.  If we
   locate a non-artificial TYPE_DECL and TF_KEEP_TYPE_DECL is set, we
   return that, rather than the _TYPE it corresponds to, in other
   cases we look through the type decl.  If TF_ERROR is set, complain
   about errors, otherwise be quiet.  */

tree
make_typename_type (tree context, tree name, enum tag_types tag_type,
        tsubst_flags_t complain)
{
  tree fullname;

  if (name == error_mark_node
      || context == NULL_TREE
      || context == error_mark_node)
    return error_mark_node;

  if (TYPE_P (name))
    {
      if (!(TYPE_LANG_SPECIFIC (name)
      && (CLASSTYPE_IS_TEMPLATE (name)
    || CLASSTYPE_USE_TEMPLATE (name))))
  name = TYPE_IDENTIFIER (name);
      else
  /* Create a TEMPLATE_ID_EXPR for the type.  */
  name = build_nt (TEMPLATE_ID_EXPR,
       CLASSTYPE_TI_TEMPLATE (name),
       CLASSTYPE_TI_ARGS (name));
    }
  else if (TREE_CODE (name) == TYPE_DECL)
    name = DECL_NAME (name);

  fullname = name;

  if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
    {
      name = TREE_OPERAND (name, 0);
      if (TREE_CODE (name) == TEMPLATE_DECL)
  name = TREE_OPERAND (fullname, 0) = DECL_NAME (name);
    }
  if (TREE_CODE (name) == TEMPLATE_DECL)
    {
      error ("%qD used without template parameters", name);
      return error_mark_node;
    }
  gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
  gcc_assert (TYPE_P (context));

  if (!dependent_type_p (context)
      || currently_open_class (context))
    {
      if (TREE_CODE (fullname) == TEMPLATE_ID_EXPR)
  {
    tree tmpl = NULL_TREE;
    if (IS_AGGR_TYPE (context))
      tmpl = lookup_field (context, name, 0, false);
    if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
      {
        if (complain & tf_error)
    error ("no class template named %q#T in %q#T",
                       name, context);
        return error_mark_node;
      }

    if (complain & tf_error)
      perform_or_defer_access_check (TYPE_BINFO (context), tmpl);

    return lookup_template_class (tmpl,
          TREE_OPERAND (fullname, 1),
          NULL_TREE, context,
          /*entering_scope=*/0,
                                  tf_error | tf_warning | tf_user);
  }
      else
  {
          tree t;

    if (!IS_AGGR_TYPE (context))
      {
        if (complain & tf_error)
    error ("no type named %q#T in %q#T", name, context);
        return error_mark_node;
      }

    t = lookup_field (context, name, 0, true);
    if (t)
      {
        if (TREE_CODE (t) != TYPE_DECL)
    {
      if (complain & tf_error)
        error ("no type named %q#T in %q#T", name, context);
      return error_mark_node;
    }

        if (complain & tf_error)
    perform_or_defer_access_check (TYPE_BINFO (context), t);

        if (DECL_ARTIFICIAL (t) || !(complain & tf_keep_type_decl))
    t = TREE_TYPE (t);

        return t;
      }
  }
    }

  /* If the CONTEXT is not a template type, then either the field is
     there now or its never going to be.  */
  if (!dependent_type_p (context))
    {
      if (complain & tf_error)
  error ("no type named %q#T in %q#T", name, context);
      return error_mark_node;
    }

  return build_typename_type (context, name, fullname, tag_type);
}

/* Resolve `CONTEXT::template NAME'.  Returns a TEMPLATE_DECL if the name
   can be resolved or an UNBOUND_CLASS_TEMPLATE, unless an error occurs, 
   in which case error_mark_node is returned.

   If PARM_LIST is non-NULL, also make sure that the template parameter
   list of TEMPLATE_DECL matches.

   If COMPLAIN zero, don't complain about any errors that occur.  */

tree
make_unbound_class_template (tree context, tree name, tree parm_list,
           tsubst_flags_t complain)
{
  tree t;
  tree d;

  if (TYPE_P (name))
    name = TYPE_IDENTIFIER (name);
  else if (DECL_P (name))
    name = DECL_NAME (name);
  gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);

  if (!dependent_type_p (context)
      || currently_open_class (context))
    {
      tree tmpl = NULL_TREE;

      if (IS_AGGR_TYPE (context))
  tmpl = lookup_field (context, name, 0, false);

      if (!tmpl || !DECL_CLASS_TEMPLATE_P (tmpl))
  {
    if (complain & tf_error)
      error ("no class template named %q#T in %q#T", name, context);
    return error_mark_node;
  }

      if (parm_list
    && !comp_template_parms (DECL_TEMPLATE_PARMS (tmpl), parm_list))
  {
    if (complain & tf_error)
      {
        error ("template parameters do not match template");
        cp_error_at ("%qD declared here", tmpl);
      }
    return error_mark_node;
  }

      if (complain & tf_error)
  perform_or_defer_access_check (TYPE_BINFO (context), tmpl);

      return tmpl;
    }

  /* Build the UNBOUND_CLASS_TEMPLATE.  */
  t = make_aggr_type (UNBOUND_CLASS_TEMPLATE);
  TYPE_CONTEXT (t) = FROB_CONTEXT (context);
  TREE_TYPE (t) = NULL_TREE;

  /* Build the corresponding TEMPLATE_DECL.  */
  d = build_decl (TEMPLATE_DECL, name, t);
  TYPE_NAME (TREE_TYPE (d)) = d;
  TYPE_STUB_DECL (TREE_TYPE (d)) = d;
  DECL_CONTEXT (d) = FROB_CONTEXT (context);
  DECL_ARTIFICIAL (d) = 1;
  DECL_TEMPLATE_PARMS (d) = parm_list;

  return t;
}



/* Push the declarations of builtin types into the namespace.
   RID_INDEX is the index of the builtin type in the array
   RID_POINTERS.  NAME is the name used when looking up the builtin
   type.  TYPE is the _TYPE node for the builtin type.  */

void
record_builtin_type (enum rid rid_index,
                     const char* name,
                     tree type)
{
  tree rname = NULL_TREE, tname = NULL_TREE;
  tree tdecl = NULL_TREE;

  if ((int) rid_index < (int) RID_MAX)
    rname = ridpointers[(int) rid_index];
  if (name)
    tname = get_identifier (name);

  /* The calls to SET_IDENTIFIER_GLOBAL_VALUE below should be
     eliminated.  Built-in types should not be looked up name; their
     names are keywords that the parser can recognize.  However, there
     is code in c-common.c that uses identifier_global_value to look
     up built-in types by name.  */
  if (tname)
    {
      tdecl = build_decl (TYPE_DECL, tname, type);
      DECL_ARTIFICIAL (tdecl) = 1;
      SET_IDENTIFIER_GLOBAL_VALUE (tname, tdecl);
    }
  if (rname)
    {
      if (!tdecl)
  {
    tdecl = build_decl (TYPE_DECL, rname, type);
    DECL_ARTIFICIAL (tdecl) = 1;
  }
      SET_IDENTIFIER_GLOBAL_VALUE (rname, tdecl);
    }

  if (!TYPE_NAME (type))
    TYPE_NAME (type) = tdecl;

  if (tdecl)
    debug_hooks->type_decl (tdecl, 0);
}

/* Record one of the standard Java types.
 * Declare it as having the given NAME.
 * If SIZE > 0, it is the size of one of the integral types;
 * otherwise it is the negative of the size of one of the other types.  */

static tree
record_builtin_java_type (const char* name, int size)
{
  tree type, decl;
  if (size > 0)
    type = make_signed_type (size);
  else if (size > -32)
    { /* "__java_char" or ""__java_boolean".  */
      type = make_unsigned_type (-size);
      /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
    }
  else
    { /* "__java_float" or ""__java_double".  */
      type = make_node (REAL_TYPE);
      TYPE_PRECISION (type) = - size;
      layout_type (type);
    }
  record_builtin_type (RID_MAX, name, type);
  decl = TYPE_NAME (type);

  /* Suppress generate debug symbol entries for these types,
     since for normal C++ they are just clutter.
     However, push_lang_context undoes this if extern "Java" is seen.  */
  DECL_IGNORED_P (decl) = 1;

  TYPE_FOR_JAVA (type) = 1;
  return type;
}

/* Push a type into the namespace so that the back-ends ignore it.  */

static void
record_unknown_type (tree type, const char* name)
{
  tree decl = pushdecl (build_decl (TYPE_DECL, get_identifier (name), type));
  /* Make sure the "unknown type" typedecl gets ignored for debug info.  */
  DECL_IGNORED_P (decl) = 1;
  TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;
  TYPE_SIZE (type) = TYPE_SIZE (void_type_node);
  TYPE_ALIGN (type) = 1;
  TYPE_USER_ALIGN (type) = 0;
  TYPE_MODE (type) = TYPE_MODE (void_type_node);
}

/* An string for which we should create an IDENTIFIER_NODE at
   startup.  */

typedef struct predefined_identifier
{
  /* The name of the identifier.  */
  const char *const name;
  /* The place where the IDENTIFIER_NODE should be stored.  */
  tree *const node;
  /* Nonzero if this is the name of a constructor or destructor.  */
  const int ctor_or_dtor_p;
} predefined_identifier;

/* Create all the predefined identifiers.  */

static void
initialize_predefined_identifiers (void)
{
  const predefined_identifier *pid;

  /* A table of identifiers to create at startup.  */
  static const predefined_identifier predefined_identifiers[] = {
    { "C++", &lang_name_cplusplus, 0 },
    { "C", &lang_name_c, 0 },
    { "Java", &lang_name_java, 0 },
    /* Some of these names have a trailing space so that it is
       impossible for them to conflict with names written by users.  */
    { "__ct ", &ctor_identifier, 1 },
    { "__base_ctor ", &base_ctor_identifier, 1 },
    { "__comp_ctor ", &complete_ctor_identifier, 1 },
    { "__dt ", &dtor_identifier, 1 },
    { "__comp_dtor ", &complete_dtor_identifier, 1 },
    { "__base_dtor ", &base_dtor_identifier, 1 },
    { "__deleting_dtor ", &deleting_dtor_identifier, 1 },
    { IN_CHARGE_NAME, &in_charge_identifier, 0 },
    { "nelts", &nelts_identifier, 0 },
    { THIS_NAME, &this_identifier, 0 },
    { VTABLE_DELTA_NAME, &delta_identifier, 0 },
    { VTABLE_PFN_NAME, &pfn_identifier, 0 },
    { "_vptr", &vptr_identifier, 0 },
    { "__vtt_parm", &vtt_parm_identifier, 0 },
    { "::", &global_scope_name, 0 },
    { "std", &std_identifier, 0 },
    { NULL, NULL, 0 }
  };

  for (pid = predefined_identifiers; pid->name; ++pid)
    {
      *pid->node = get_identifier (pid->name);
      if (pid->ctor_or_dtor_p)
  IDENTIFIER_CTOR_OR_DTOR_P (*pid->node) = 1;
    }
}

/* Create the predefined scalar types of C,
   and some nodes representing standard constants (0, 1, (void *)0).
   Initialize the global binding level.
   Make definitions for built-in primitive functions.  */

void
cxx_init_decl_processing (void)
{
  tree void_ftype;
  tree void_ftype_ptr;

  build_common_tree_nodes (flag_signed_char, false);

  /* Create all the identifiers we need.  */
  initialize_predefined_identifiers ();

  /* Create the global variables.  */
  push_to_top_level ();

  current_function_decl = NULL_TREE;
  current_binding_level = NULL;
  /* Enter the global namespace.  */
  gcc_assert (global_namespace == NULL_TREE);
  global_namespace = build_lang_decl (NAMESPACE_DECL, global_scope_name,
                                      void_type_node);
  begin_scope (sk_namespace, global_namespace);

  current_lang_name = NULL_TREE;

  /* Adjust various flags based on command-line settings.  */
  if (!flag_permissive)
    flag_pedantic_errors = 1;
  if (!flag_no_inline)
    {
      flag_inline_trees = 1;
      flag_no_inline = 1;
    }
  if (flag_inline_functions)
    flag_inline_trees = 2;

  /* Force minimum function alignment if using the least significant
     bit of function pointers to store the virtual bit.  */
  if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
      && force_align_functions_log < 1)
    force_align_functions_log = 1;

  /* Initially, C.  */
  current_lang_name = lang_name_c;

  error_mark_list = build_tree_list (error_mark_node, error_mark_node);
  TREE_TYPE (error_mark_list) = error_mark_node;

  /* Create the `std' namespace.  */
  push_namespace (std_identifier);
  std_node = current_namespace;
  pop_namespace ();

  c_common_nodes_and_builtins ();

  java_byte_type_node = record_builtin_java_type ("__java_byte", 8);
  java_short_type_node = record_builtin_java_type ("__java_short", 16);
  java_int_type_node = record_builtin_java_type ("__java_int", 32);
  java_long_type_node = record_builtin_java_type ("__java_long", 64);
  java_float_type_node = record_builtin_java_type ("__java_float", -32);
  java_double_type_node = record_builtin_java_type ("__java_double", -64);
  java_char_type_node = record_builtin_java_type ("__java_char", -16);
  java_boolean_type_node = record_builtin_java_type ("__java_boolean", -1);

  integer_two_node = build_int_cst (NULL_TREE, 2);
  integer_three_node = build_int_cst (NULL_TREE, 3);

  record_builtin_type (RID_BOOL, "bool", boolean_type_node);
  truthvalue_type_node = boolean_type_node;
  truthvalue_false_node = boolean_false_node;
  truthvalue_true_node = boolean_true_node;

  empty_except_spec = build_tree_list (NULL_TREE, NULL_TREE);

#if 0
  record_builtin_type (RID_MAX, NULL, string_type_node);
#endif

  delta_type_node = ptrdiff_type_node;
  vtable_index_type = ptrdiff_type_node;

  vtt_parm_type = build_pointer_type (const_ptr_type_node);
  void_ftype = build_function_type (void_type_node, void_list_node);
  void_ftype_ptr = build_function_type (void_type_node,
          tree_cons (NULL_TREE,
               ptr_type_node,
               void_list_node));
  void_ftype_ptr
    = build_exception_variant (void_ftype_ptr, empty_except_spec);

  /* C++ extensions */

  unknown_type_node = make_node (UNKNOWN_TYPE);
  record_unknown_type (unknown_type_node, "unknown type");

  /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node.  */
  TREE_TYPE (unknown_type_node) = unknown_type_node;

  /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
     result.  */
  TYPE_POINTER_TO (unknown_type_node) = unknown_type_node;
  TYPE_REFERENCE_TO (unknown_type_node) = unknown_type_node;

  {
    /* Make sure we get a unique function type, so we can give
       its pointer type a name.  (This wins for gdb.) */
    tree vfunc_type = make_node (FUNCTION_TYPE);
    TREE_TYPE (vfunc_type) = integer_type_node;
    TYPE_ARG_TYPES (vfunc_type) = NULL_TREE;
    layout_type (vfunc_type);

    vtable_entry_type = build_pointer_type (vfunc_type);
  }
  record_builtin_type (RID_MAX, VTBL_PTR_TYPE, vtable_entry_type);

  vtbl_type_node
    = build_cplus_array_type (vtable_entry_type, NULL_TREE);
  layout_type (vtbl_type_node);
  vtbl_type_node = build_qualified_type (vtbl_type_node, TYPE_QUAL_CONST);
  record_builtin_type (RID_MAX, NULL, vtbl_type_node);
  vtbl_ptr_type_node = build_pointer_type (vtable_entry_type);
  layout_type (vtbl_ptr_type_node);
  record_builtin_type (RID_MAX, NULL, vtbl_ptr_type_node);

  push_namespace (get_identifier ("__cxxabiv1"));
  abi_node = current_namespace;
  pop_namespace ();

  global_type_node = make_node (LANG_TYPE);
  record_unknown_type (global_type_node, "global type");

  /* Now, C++.  */
  current_lang_name = lang_name_cplusplus;

  {
    tree bad_alloc_id;
    tree bad_alloc_type_node;
    tree bad_alloc_decl;
    tree newtype, deltype;
    tree ptr_ftype_sizetype;

    push_namespace (std_identifier);
    bad_alloc_id = get_identifier ("bad_alloc");
    bad_alloc_type_node = make_aggr_type (RECORD_TYPE);
    TYPE_CONTEXT (bad_alloc_type_node) = current_namespace;
    bad_alloc_decl
      = create_implicit_typedef (bad_alloc_id, bad_alloc_type_node);
    DECL_CONTEXT (bad_alloc_decl) = current_namespace;
    TYPE_STUB_DECL (bad_alloc_type_node) = bad_alloc_decl;
    pop_namespace ();

    ptr_ftype_sizetype
      = build_function_type (ptr_type_node,
           tree_cons (NULL_TREE,
          size_type_node,
          void_list_node));
    newtype = build_exception_variant
      (ptr_ftype_sizetype, add_exception_specifier
       (NULL_TREE, bad_alloc_type_node, -1));
    deltype = build_exception_variant (void_ftype_ptr, empty_except_spec);
    push_cp_library_fn (NEW_EXPR, newtype);
    push_cp_library_fn (VEC_NEW_EXPR, newtype);
    global_delete_fndecl = push_cp_library_fn (DELETE_EXPR, deltype);
    push_cp_library_fn (VEC_DELETE_EXPR, deltype);
  }

  abort_fndecl
    = build_library_fn_ptr ("__cxa_pure_virtual", void_ftype);

  /* Perform other language dependent initializations.  */
  init_class_processing ();
  init_rtti_processing ();

  if (flag_exceptions)
    init_exception_processing ();

  if (! supports_one_only ())
    flag_weak = 0;

  make_fname_decl = cp_make_fname_decl;
  start_fname_decls ();

  /* Show we use EH for cleanups.  */
  if (flag_exceptions)
    using_eh_for_cleanups ();
}

/* Generate an initializer for a function naming variable from
   NAME. NAME may be NULL, to indicate a dependent name.  TYPE_P is
   filled in with the type of the init.  */

tree
cp_fname_init (const char* name, tree *type_p)
{
  tree domain = NULL_TREE;
  tree type;
  tree init = NULL_TREE;
  size_t length = 0;

  if (name)
    {
      length = strlen (name);
      domain = build_index_type (size_int (length));
      init = build_string (length + 1, name);
    }

  type = build_qualified_type (char_type_node, TYPE_QUAL_CONST);
  type = build_cplus_array_type (type, domain);

  *type_p = type;

  if (init)
    TREE_TYPE (init) = type;
  else
    init = error_mark_node;

  return init;
}

/* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
   decl, NAME is the initialization string and TYPE_DEP indicates whether
   NAME depended on the type of the function. We make use of that to detect
   __PRETTY_FUNCTION__ inside a template fn. This is being done
   lazily at the point of first use, so we mustn't push the decl now.  */

static tree
cp_make_fname_decl (tree id, int type_dep)
{
  const char *const name = (type_dep && processing_template_decl
          ? NULL : fname_as_string (type_dep));
  tree type;
  tree init = cp_fname_init (name, &type);
  tree decl = build_decl (VAR_DECL, id, type);

  if (name)
    free ((char *) name);

  /* As we're using pushdecl_with_scope, we must set the context.  */
  DECL_CONTEXT (decl) = current_function_decl;
  DECL_PRETTY_FUNCTION_P (decl) = type_dep;

  TREE_STATIC (decl) = 1;
  TREE_READONLY (decl) = 1;
  DECL_ARTIFICIAL (decl) = 1;
  DECL_INITIAL (decl) = init;

  TREE_USED (decl) = 1;

  if (current_function_decl)
    {
      struct cp_binding_level *b = current_binding_level;
      while (b->level_chain->kind != sk_function_parms)
  b = b->level_chain;
      pushdecl_with_scope (decl, b);
      cp_finish_decl (decl, init, NULL_TREE, LOOKUP_ONLYCONVERTING);
    }
  else
    pushdecl_top_level_and_finish (decl, init);

  return decl;
}

/* Make a definition for a builtin function named NAME in the current
   namespace, whose data type is TYPE and whose context is CONTEXT.
   TYPE should be a function type with argument types.

   CLASS and CODE tell later passes how to compile calls to this function.
   See tree.h for possible values.

   If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
   the name to be called if we can't opencode the function.
   If ATTRS is nonzero, use that for the function's attribute
   list.  */

static tree
builtin_function_1 (const char* name,
                    tree type,
                    tree context,
        enum built_in_function code,
                    enum built_in_class class,
                    const char* libname,
                    tree attrs)
{
  tree decl = build_library_fn_1 (get_identifier (name), ERROR_MARK, type);
  DECL_BUILT_IN_CLASS (decl) = class;
  DECL_FUNCTION_CODE (decl) = code;
  DECL_CONTEXT (decl) = context;

  pushdecl (decl);

  /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
     we cannot change DECL_ASSEMBLER_NAME until we have installed this
     function in the namespace.  */
  if (libname)
    SET_DECL_ASSEMBLER_NAME (decl, get_identifier (libname));

  /* Warn if a function in the namespace for users
     is used without an occasion to consider it declared.  */
  if (name[0] != '_' || name[1] != '_')
    DECL_ANTICIPATED (decl) = 1;

  /* Possibly apply some default attributes to this built-in function.  */
  if (attrs)
    decl_attributes (&decl, attrs, ATTR_FLAG_BUILT_IN);
  else
    decl_attributes (&decl, NULL_TREE, 0);

  return decl;
}

/* Entry point for the benefit of c_common_nodes_and_builtins.

   Make a definition for a builtin function named NAME and whose data type
   is TYPE.  TYPE should be a function type with argument types.  This
   function places the anticipated declaration in the global namespace
   and additionally in the std namespace if appropriate.

   CLASS and CODE tell later passes how to compile calls to this function.
   See tree.h for possible values.

   If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
   the name to be called if we can't opencode the function.

   If ATTRS is nonzero, use that for the function's attribute
   list.  */

tree
builtin_function (const char* name,
                  tree type,
                  int code,
                  enum built_in_class cl,
                  const char* libname,
                  tree attrs)
{
  /* All builtins that don't begin with an '_' should additionally
     go in the 'std' namespace.  */
  if (name[0] != '_')
    {
      push_namespace (std_identifier);
      builtin_function_1 (name, type, std_node, code, cl, libname, attrs);
      pop_namespace ();
    }

  return builtin_function_1 (name, type, NULL_TREE, code,
           cl, libname, attrs);
}

/* Generate a FUNCTION_DECL with the typical flags for a runtime library
   function.  Not called directly.  */

static tree
build_library_fn_1 (tree name, enum tree_code operator_code, tree type)
{
  tree fn = build_lang_decl (FUNCTION_DECL, name, type);
  DECL_EXTERNAL (fn) = 1;
  TREE_PUBLIC (fn) = 1;
  DECL_ARTIFICIAL (fn) = 1;
  TREE_NOTHROW (fn) = 1;
  SET_OVERLOADED_OPERATOR_CODE (fn, operator_code);
  SET_DECL_LANGUAGE (fn, lang_c);
  /* Runtime library routines are, by definition, available in an
     external shared object.  */
  DECL_VISIBILITY (fn) = VISIBILITY_DEFAULT;
  DECL_VISIBILITY_SPECIFIED (fn) = 1;
  return fn;
}

/* Returns the _DECL for a library function with C linkage.
   We assume that such functions never throw; if this is incorrect,
   callers should unset TREE_NOTHROW.  */

tree
build_library_fn (tree name, tree type)
{
  return build_library_fn_1 (name, ERROR_MARK, type);
}

/* Returns the _DECL for a library function with C++ linkage.  */

static tree
build_cp_library_fn (tree name, enum tree_code operator_code, tree type)
{
  tree fn = build_library_fn_1 (name, operator_code, type);
  TREE_NOTHROW (fn) = TYPE_NOTHROW_P (type);
  DECL_CONTEXT (fn) = FROB_CONTEXT (current_namespace);
  SET_DECL_LANGUAGE (fn, lang_cplusplus);
  return fn;
}

/* Like build_library_fn, but takes a C string instead of an
   IDENTIFIER_NODE.  */

tree
build_library_fn_ptr (const char* name, tree type)
{
  return build_library_fn (get_identifier (name), type);
}

/* Like build_cp_library_fn, but takes a C string instead of an
   IDENTIFIER_NODE.  */

tree
build_cp_library_fn_ptr (const char* name, tree type)
{
  return build_cp_library_fn (get_identifier (name), ERROR_MARK, type);
}

/* Like build_library_fn, but also pushes the function so that we will
   be able to find it via IDENTIFIER_GLOBAL_VALUE.  */

tree
push_library_fn (tree name, tree type)
{
  tree fn = build_library_fn (name, type);
  pushdecl_top_level (fn);
  return fn;
}

/* Like build_cp_library_fn, but also pushes the function so that it
   will be found by normal lookup.  */

static tree
push_cp_library_fn (enum tree_code operator_code, tree type)
{
  tree fn = build_cp_library_fn (ansi_opname (operator_code),
         operator_code,
         type);
  pushdecl (fn);
  return fn;
}

/* Like push_library_fn, but takes a TREE_LIST of parm types rather than
   a FUNCTION_TYPE.  */

tree
push_void_library_fn (tree name, tree parmtypes)
{
  tree type = build_function_type (void_type_node, parmtypes);
  return push_library_fn (name, type);
}

/* Like push_library_fn, but also note that this function throws
   and does not return.  Used for __throw_foo and the like.  */

tree
push_throw_library_fn (tree name, tree type)
{
  tree fn = push_library_fn (name, type);
  TREE_THIS_VOLATILE (fn) = 1;
  TREE_NOTHROW (fn) = 0;
  return fn;
}

/* When we call finish_struct for an anonymous union, we create
   default copy constructors and such.  But, an anonymous union
   shouldn't have such things; this function undoes the damage to the
   anonymous union type T.

   (The reason that we create the synthesized methods is that we don't
   distinguish `union { int i; }' from `typedef union { int i; } U'.
   The first is an anonymous union; the second is just an ordinary
   union type.)  */

void
fixup_anonymous_aggr (tree t)
{
  tree *q;

  /* Wipe out memory of synthesized methods.  */
  TYPE_HAS_CONSTRUCTOR (t) = 0;
  TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 0;
  TYPE_HAS_INIT_REF (t) = 0;
  TYPE_HAS_CONST_INIT_REF (t) = 0;
  TYPE_HAS_ASSIGN_REF (t) = 0;
  TYPE_HAS_CONST_ASSIGN_REF (t) = 0;

  /* Splice the implicitly generated functions out of the TYPE_METHODS
     list.  */
  q = &TYPE_METHODS (t);
  while (*q)
    {
      if (DECL_ARTIFICIAL (*q))
  *q = TREE_CHAIN (*q);
      else
  q = &TREE_CHAIN (*q);
    }

  /* ISO C++ 9.5.3.  Anonymous unions may not have function members.  */
  if (TYPE_METHODS (t))
    error ("%Jan anonymous union cannot have function members",
     TYPE_MAIN_DECL (t));

  /* Anonymous aggregates cannot have fields with ctors, dtors or complex
     assignment operators (because they cannot have these methods themselves).
     For anonymous unions this is already checked because they are not allowed
     in any union, otherwise we have to check it.  */
  if (TREE_CODE (t) != UNION_TYPE)
    {
      tree field, type;

      for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
  if (TREE_CODE (field) == FIELD_DECL)
    {
      type = TREE_TYPE (field);
      if (CLASS_TYPE_P (type))
        {
          if (TYPE_NEEDS_CONSTRUCTING (type))
      cp_error_at ("member %q#D with constructor not allowed "
                               "in anonymous aggregate",
             field);
    if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
      cp_error_at ("member %q#D with destructor not allowed "
                               "in anonymous aggregate",
             field);
    if (TYPE_HAS_COMPLEX_ASSIGN_REF (type))
      cp_error_at ("member %q#D with copy assignment operator "
                               "not allowed in anonymous aggregate",
             field);
        }
    }
    }
}

/* Make sure that a declaration with no declarator is well-formed, i.e.
   just declares a tagged type or anonymous union.

   Returns the type declared; or NULL_TREE if none.  */

tree
check_tag_decl (cp_decl_specifier_seq *declspecs)
{
  int saw_friend = declspecs->specs[(int)ds_friend] != 0;
  int saw_typedef = declspecs->specs[(int)ds_typedef] != 0;
  /* If a class, struct, or enum type is declared by the DECLSPECS
     (i.e, if a class-specifier, enum-specifier, or non-typename
     elaborated-type-specifier appears in the DECLSPECS),
     DECLARED_TYPE is set to the corresponding type.  */
  tree declared_type = NULL_TREE;
  bool error_p = false;

  if (declspecs->multiple_types_p)
    error ("multiple types in one declaration");
  else if (declspecs->redefined_builtin_type)
    {
      if (!in_system_header)
  pedwarn ("redeclaration of C++ built-in type %qT",
     declspecs->redefined_builtin_type);
      return NULL_TREE;
    }

  if (declspecs->type
      && TYPE_P (declspecs->type)
      && ((TREE_CODE (declspecs->type) != TYPENAME_TYPE
     && IS_AGGR_TYPE (declspecs->type))
    || TREE_CODE (declspecs->type) == ENUMERAL_TYPE))
    declared_type = declspecs->type;
  else if (declspecs->type == error_mark_node)
    error_p = true;
  if (declared_type == NULL_TREE && ! saw_friend && !error_p)
    pedwarn ("declaration does not declare anything");
  /* Check for an anonymous union.  */
  else if (declared_type && IS_AGGR_TYPE_CODE (TREE_CODE (declared_type))
     && TYPE_ANONYMOUS_P (declared_type))
    {
      /* 7/3 In a simple-declaration, the optional init-declarator-list
         can be omitted only when declaring a class (clause 9) or
         enumeration (7.2), that is, when the decl-specifier-seq contains
         either a class-specifier, an elaborated-type-specifier with
         a class-key (9.1), or an enum-specifier.  In these cases and
         whenever a class-specifier or enum-specifier is present in the
         decl-specifier-seq, the identifiers in these specifiers are among
         the names being declared by the declaration (as class-name,
         enum-names, or enumerators, depending on the syntax).  In such
         cases, and except for the declaration of an unnamed bit-field (9.6),
         the decl-specifier-seq shall introduce one or more names into the
         program, or shall redeclare a name introduced by a previous
         declaration.  [Example:
             enum { };            // ill-formed
             typedef class { };   // ill-formed
         --end example]  */
      if (saw_typedef)
        {
          error ("missing type-name in typedef-declaration");
          return NULL_TREE;
        }
      /* Anonymous unions are objects, so they can have specifiers.  */;
      SET_ANON_AGGR_TYPE_P (declared_type);

      if (TREE_CODE (declared_type) != UNION_TYPE && pedantic
    && !in_system_header)
  pedwarn ("ISO C++ prohibits anonymous structs");
    }

  else
    {
      if (declspecs->specs[(int)ds_inline]
    || declspecs->specs[(int)ds_virtual])
  error ("%qs can only be specified for functions",
         declspecs->specs[(int)ds_inline]
         ? "inline" : "virtual");
      else if (saw_friend
         && (!current_class_type
       || current_scope () != current_class_type))
  error ("%<friend%> can only be specified inside a class");
      else if (declspecs->specs[(int)ds_explicit])
  error ("%<explicit%> can only be specified for constructors");
      else if (declspecs->storage_class)
  error ("a storage class can only be specified for objects "
         "and functions");
      else if (declspecs->specs[(int)ds_const]
         || declspecs->specs[(int)ds_volatile]
         || declspecs->specs[(int)ds_restrict]
         || declspecs->specs[(int)ds_thread])
  error ("qualifiers can only be specified for objects "
         "and functions");
    }

  return declared_type;
}

/* Called when a declaration is seen that contains no names to declare.
   If its type is a reference to a structure, union or enum inherited
   from a containing scope, shadow that tag name for the current scope
   with a forward reference.
   If its type defines a new named structure or union
   or defines an enum, it is valid but we need not do anything here.
   Otherwise, it is an error.

   C++: may have to grok the declspecs to learn about static,
   complain for anonymous unions.

   Returns the TYPE declared -- or NULL_TREE if none.  */

tree
shadow_tag (cp_decl_specifier_seq *declspecs)
{
  tree t = check_tag_decl (declspecs);

  if (!t)
    return NULL_TREE;

  if (declspecs->attributes)
    {
      cp_warning_at ("attribute ignored in declaration of %q#T", t);
      cp_warning_at ("attribute for %q#T must follow the %qs keyword",
         t,
         class_key_or_enum_as_string (t));

    }

  maybe_process_partial_specialization (t);

  /* This is where the variables in an anonymous union are
     declared.  An anonymous union declaration looks like:
     union { ... } ;
     because there is no declarator after the union, the parser
     sends that declaration here.  */
  if (ANON_AGGR_TYPE_P (t))
    {
      fixup_anonymous_aggr (t);

      if (TYPE_FIELDS (t))
  {
    tree decl = grokdeclarator (/*declarator=*/NULL,
              declspecs, NORMAL, 0, NULL);
    finish_anon_union (decl);
  }
    }

  return t;
}

/* Decode a "typename", such as "int **", returning a ..._TYPE node.  */

tree
groktypename (cp_decl_specifier_seq *type_specifiers,
        const cp_declarator *declarator)
{
  tree attrs;
  tree type;
  attrs = type_specifiers->attributes;
  type_specifiers->attributes = NULL_TREE;
  type = grokdeclarator (declarator, type_specifiers, TYPENAME, 0, &attrs);
  if (attrs)
    cplus_decl_attributes (&type, attrs, 0);
  return type;
}

/* Decode a declarator in an ordinary declaration or data definition.
   This is called as soon as the type information and variable name
   have been parsed, before parsing the initializer if any.
   Here we create the ..._DECL node, fill in its type,
   and put it on the list of decls for the current context.
   The ..._DECL node is returned as the value.

   Exception: for arrays where the length is not specified,
   the type is left null, to be filled in by `cp_finish_decl'.

   Function definitions do not come here; they go to start_function
   instead.  However, external and forward declarations of functions
   do go through here.  Structure field declarations are done by
   grokfield and not through here.  */

tree
start_decl (const cp_declarator *declarator,
      cp_decl_specifier_seq *declspecs,
            int initialized,
            tree attributes,
            tree prefix_attributes, 
      tree *pushed_scope_p)
{
  tree decl;
  tree type, tem;
  tree context;

  *pushed_scope_p = NULL_TREE;
 
  /* This should only be done once on the top most decl.  */
  if (have_extern_spec)
    {
      declspecs->storage_class = sc_extern;
      have_extern_spec = false;
    }

  /* An object declared as __attribute__((deprecated)) suppresses
     warnings of uses of other deprecated items.  */
  if (lookup_attribute ("deprecated", attributes))
    deprecated_state = DEPRECATED_SUPPRESS;

  attributes = chainon (attributes, prefix_attributes);

  decl = grokdeclarator (declarator, declspecs, NORMAL, initialized,
       &attributes);

  deprecated_state = DEPRECATED_NORMAL;

  if (decl == NULL_TREE || TREE_CODE (decl) == VOID_TYPE)
    return error_mark_node;

  type = TREE_TYPE (decl);

  if (type == error_mark_node)
    return error_mark_node;

  context = DECL_CONTEXT (decl);

  if (context)
    {
      *pushed_scope_p = push_scope (context);
  
      /* We are only interested in class contexts, later.  */
      if (TREE_CODE (context) == NAMESPACE_DECL)
  context = NULL_TREE;
    }

  if (initialized)
    /* Is it valid for this decl to have an initializer at all?
       If not, set INITIALIZED to zero, which will indirectly
       tell `cp_finish_decl' to ignore the initializer once it is parsed.  */
    switch (TREE_CODE (decl))
      {
      case TYPE_DECL:
  error ("typedef %qD is initialized (use __typeof__ instead)", decl);
  initialized = 0;
  break;

      case FUNCTION_DECL:
  error ("function %q#D is initialized like a variable", decl);
  initialized = 0;
  break;

      default:
  break;
      }

  if (initialized)
    {
      if (! toplevel_bindings_p ()
    && DECL_EXTERNAL (decl))
  warning ("declaration of %q#D has %<extern%> and is initialized",
                 decl);
      DECL_EXTERNAL (decl) = 0;
      if (toplevel_bindings_p ())
  TREE_STATIC (decl) = 1;

      /* Tell `pushdecl' this is an initialized decl
   even though we don't yet have the initializer expression.
   Also tell `cp_finish_decl' it may store the real initializer.  */
      DECL_INITIAL (decl) = error_mark_node;
    }

  /* Set attributes here so if duplicate decl, will have proper attributes.  */
  cplus_decl_attributes (&decl, attributes, 0);

  /* If #pragma weak was used, mark the decl weak now.  */
  maybe_apply_pragma_weak (decl);

  if (TREE_CODE (decl) == FUNCTION_DECL
      && DECL_DECLARED_INLINE_P (decl)
      && DECL_UNINLINABLE (decl)
      && lookup_attribute ("noinline", DECL_ATTRIBUTES (decl)))
    warning ("%Jinline function %qD given attribute noinline", decl, decl);

  if (context && COMPLETE_TYPE_P (complete_type (context)))
    {
      if (TREE_CODE (decl) == VAR_DECL)
  {
    tree field = lookup_field (context, DECL_NAME (decl), 0, false);
    if (field == NULL_TREE || TREE_CODE (field) != VAR_DECL)
      error ("%q#D is not a static member of %q#T", decl, context);
    else
      {
        if (DECL_CONTEXT (field) != context)
    {
      if (!same_type_p (DECL_CONTEXT (field), context))
        pedwarn ("ISO C++ does not permit %<%T::%D%> "
                             "to be defined as %<%T::%D%>",
           DECL_CONTEXT (field), DECL_NAME (decl),
           context, DECL_NAME (decl));
      DECL_CONTEXT (decl) = DECL_CONTEXT (field);
    }
        if (processing_specialization
      && template_class_depth (context) == 0
      && CLASSTYPE_TEMPLATE_SPECIALIZATION (context))
    error ("template header not allowed in member definition "
           "of explicitly specialized class");
        /* Static data member are tricky; an in-class initialization
     still doesn't provide a definition, so the in-class
     declaration will have DECL_EXTERNAL set, but will have an
     initialization.  Thus, duplicate_decls won't warn
     about this situation, and so we check here.  */
        if (DECL_INITIAL (decl) 
      && DECL_INITIALIZED_IN_CLASS_P (field))
    error ("duplicate initialization of %qD", decl);
        if (duplicate_decls (decl, field))
    decl = field;
      }
  }
      else
  {
    tree field = check_classfn (context, decl,
              (processing_template_decl
               > template_class_depth (context))
              ? current_template_parms
              : NULL_TREE);
    if (field && duplicate_decls (decl, field))
      decl = field;
  }

      /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set.  */
      DECL_IN_AGGR_P (decl) = 0;
      if ((DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl))
    || CLASSTYPE_TEMPLATE_INSTANTIATION (context))
  {
    /* Do not mark DECL as an explicit specialization if it was
       not already marked as an instantiation; a declaration
       should never be marked as a specialization unless we know
       what template is being specialized.  */ 
    if (DECL_LANG_SPECIFIC (decl) && DECL_USE_TEMPLATE (decl))
      SET_DECL_TEMPLATE_SPECIALIZATION (decl);
    /* [temp.expl.spec] An explicit specialization of a static data
       member of a template is a definition if the declaration
       includes an initializer; otherwise, it is a declaration.

       We check for processing_specialization so this only applies
       to the new specialization syntax.  */
    if (DECL_INITIAL (decl) == NULL_TREE && processing_specialization)
      DECL_EXTERNAL (decl) = 1;
  }

      if (DECL_EXTERNAL (decl) && ! DECL_TEMPLATE_SPECIALIZATION (decl))
  pedwarn ("declaration of %q#D outside of class is not definition",
                 decl);
    }

  /* Enter this declaration into the symbol table.  */
  tem = maybe_push_decl (decl);

  if (processing_template_decl)
    tem = push_template_decl (tem);
  if (tem == error_mark_node)
    return error_mark_node;

#if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
  /* Tell the back-end to use or not use .common as appropriate.  If we say
     -fconserve-space, we want this to save .data space, at the expense of
     wrong semantics.  If we say -fno-conserve-space, we want this to
     produce errors about redefs; to do this we force variables into the
     data segment.  */
  DECL_COMMON (tem) = ((TREE_CODE (tem) != VAR_DECL
      || !DECL_THREAD_LOCAL (tem))
           && (flag_conserve_space || ! TREE_PUBLIC (tem)));
#endif

  if (! processing_template_decl)
    start_decl_1 (tem);

  return tem;
}

void
start_decl_1 (tree decl)
{
  tree type = TREE_TYPE (decl);
  int initialized = (DECL_INITIAL (decl) != NULL_TREE);

  if (type == error_mark_node)
    return;

  if (initialized)
    /* Is it valid for this decl to have an initializer at all?
       If not, set INITIALIZED to zero, which will indirectly
       tell `cp_finish_decl' to ignore the initializer once it is parsed.  */
    {
      /* Don't allow initializations for incomplete types except for
   arrays which might be completed by the initialization.  */
      if (COMPLETE_TYPE_P (complete_type (type)))
  ;     /* A complete type is ok.  */
      else if (TREE_CODE (type) != ARRAY_TYPE)
  {
    error ("variable %q#D has initializer but incomplete type", decl);
    initialized = 0;
    type = TREE_TYPE (decl) = error_mark_node;
  }
      else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type))))
  {
    if (DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl))
      error ("elements of array %q#D have incomplete type", decl);
    /* else we already gave an error in start_decl.  */
    initialized = 0;
  }
    }

  if (!initialized
      && TREE_CODE (decl) != TYPE_DECL
      && TREE_CODE (decl) != TEMPLATE_DECL
      && type != error_mark_node
      && IS_AGGR_TYPE (type)
      && ! DECL_EXTERNAL (decl))
    {
      if ((! processing_template_decl || ! uses_template_parms (type))
    && !COMPLETE_TYPE_P (complete_type (type)))
  {
    error ("aggregate %q#D has incomplete type and cannot be defined",
     decl);
    /* Change the type so that assemble_variable will give
       DECL an rtl we can live with: (mem (const_int 0)).  */
    type = TREE_TYPE (decl) = error_mark_node;
  }
      else
  {
    /* If any base type in the hierarchy of TYPE needs a constructor,
       then we set initialized to 1.  This way any nodes which are
       created for the purposes of initializing this aggregate
       will live as long as it does.  This is necessary for global
       aggregates which do not have their initializers processed until
       the end of the file.  */
    initialized = TYPE_NEEDS_CONSTRUCTING (type);
  }
    }

  if (! initialized)
    DECL_INITIAL (decl) = NULL_TREE;

  /* Create a new scope to hold this declaration if necessary.
     Whether or not a new scope is necessary cannot be determined
     until after the type has been completed; if the type is a
     specialization of a class template it is not until after
     instantiation has occurred that TYPE_HAS_NONTRIVIAL_DESTRUCTOR
     will be set correctly.  */
  maybe_push_cleanup_level (type);
}

/* Handle initialization of references.  DECL, TYPE, and INIT have the
   same meaning as in cp_finish_decl.  *CLEANUP must be NULL on entry,
   but will be set to a new CLEANUP_STMT if a temporary is created
   that must be destroyed subsequently.

   Returns an initializer expression to use to initialize DECL, or
   NULL if the initialization can be performed statically.

   Quotes on semantics can be found in ARM 8.4.3.  */

static tree
grok_reference_init (tree decl, tree type, tree init, tree *cleanup)
{
  tree tmp;

  if (init == NULL_TREE)
    {
      if ((DECL_LANG_SPECIFIC (decl) == 0
     || DECL_IN_AGGR_P (decl) == 0)
    && ! DECL_THIS_EXTERN (decl))
  error ("%qD declared as reference but not initialized", decl);
      return NULL_TREE;
    }

  if (TREE_CODE (init) == CONSTRUCTOR)
    {
      error ("ISO C++ forbids use of initializer list to "
             "initialize reference %qD", decl);
      return NULL_TREE;
    }

  if (TREE_CODE (init) == TREE_LIST)
    init = build_x_compound_expr_from_list (init, "initializer");

  if (TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE
      && TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE)
    /* Note: default conversion is only called in very special cases.  */
    init = decay_conversion (init);

  /* Convert INIT to the reference type TYPE.  This may involve the
     creation of a temporary, whose lifetime must be the same as that
     of the reference.  If so, a DECL_EXPR for the temporary will be
     added just after the DECL_EXPR for DECL.  That's why we don't set
     DECL_INITIAL for local references (instead assigning to them
     explicitly); we need to allow the temporary to be initialized
     first.  */
  tmp = initialize_reference (type, init, decl, cleanup);

  if (tmp == error_mark_node)
    return NULL_TREE;
  else if (tmp == NULL_TREE)
    {
      error ("cannot initialize %qT from %qT", type, TREE_TYPE (init));
      return NULL_TREE;
    }

  if (TREE_STATIC (decl) && !TREE_CONSTANT (tmp))
    return tmp;

  DECL_INITIAL (decl) = tmp;

  return NULL_TREE;
}

/* When parsing `int a[] = {1, 2};' we don't know the size of the
   array until we finish parsing the initializer.  If that's the
   situation we're in, update DECL accordingly.  */

static void
maybe_deduce_size_from_array_init (tree decl, tree init)
{
  tree type = TREE_TYPE (decl);

  if (TREE_CODE (type) == ARRAY_TYPE
      && TYPE_DOMAIN (type) == NULL_TREE
      && TREE_CODE (decl) != TYPE_DECL)
    {
      /* do_default is really a C-ism to deal with tentative definitions.
   But let's leave it here to ease the eventual merge.  */
      int do_default = !DECL_EXTERNAL (decl);
      tree initializer = init ? init : DECL_INITIAL (decl);
      int failure = cp_complete_array_type (&TREE_TYPE (decl), initializer,
              do_default);

      if (failure == 1)
  error ("initializer fails to determine size of %qD", decl);

      if (failure == 2)
  {
    if (do_default)
      error ("array size missing in %qD", decl);
    /* If a `static' var's size isn't known, make it extern as
       well as static, so it does not get allocated.  If it's not
       `static', then don't mark it extern; finish_incomplete_decl
       will give it a default size and it will get allocated.  */
    else if (!pedantic && TREE_STATIC (decl) && !TREE_PUBLIC (decl))
      DECL_EXTERNAL (decl) = 1;
  }

      if (failure == 3)
  error ("zero-size array %qD", decl);

      cp_apply_type_quals_to_decl (cp_type_quals (TREE_TYPE (decl)), decl);

      layout_decl (decl, 0);
    }
}

/* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
   any appropriate error messages regarding the layout.  */

static void
layout_var_decl (tree decl)
{
  tree type = TREE_TYPE (decl);
#if 0
  tree ttype = target_type (type);
#endif

  /* If we haven't already layed out this declaration, do so now.
     Note that we must not call complete type for an external object
     because it's type might involve templates that we are not
     supposed to instantiate yet.  (And it's perfectly valid to say
     `extern X x' for some incomplete type `X'.)  */
  if (!DECL_EXTERNAL (decl))
    complete_type (type);
  if (!DECL_SIZE (decl)
      && TREE_TYPE (decl) != error_mark_node
      && (COMPLETE_TYPE_P (type)
    || (TREE_CODE (type) == ARRAY_TYPE
        && !TYPE_DOMAIN (type)
        && COMPLETE_TYPE_P (TREE_TYPE (type)))))
    layout_decl (decl, 0);

  if (!DECL_EXTERNAL (decl) && DECL_SIZE (decl) == NULL_TREE)
    {
      /* An automatic variable with an incomplete type: that is an error.
   Don't talk about array types here, since we took care of that
   message in grokdeclarator.  */
      error ("storage size of %qD isn't known", decl);
      TREE_TYPE (decl) = error_mark_node;
    }
#if 0
  /* Keep this code around in case we later want to control debug info
     based on whether a type is "used".  (jason 1999-11-11) */

  else if (!DECL_EXTERNAL (decl) && IS_AGGR_TYPE (ttype))
    /* Let debugger know it should output info for this type.  */
    note_debug_info_needed (ttype);

  if (TREE_STATIC (decl) && DECL_CLASS_SCOPE_P (decl))
    note_debug_info_needed (DECL_CONTEXT (decl));
#endif

  if ((DECL_EXTERNAL (decl) || TREE_STATIC (decl))
      && DECL_SIZE (decl) != NULL_TREE
      && ! TREE_CONSTANT (DECL_SIZE (decl)))
    {
      if (TREE_CODE (DECL_SIZE (decl)) == INTEGER_CST)
  constant_expression_warning (DECL_SIZE (decl));
      else
  error ("storage size of %qD isn't constant", decl);
    }

  if (TREE_STATIC (decl)
      && !DECL_ARTIFICIAL (decl)
      && current_function_decl
      && DECL_CONTEXT (decl) == current_function_decl)
    push_local_name (decl);
}

/* If a local static variable is declared in an inline function, or if
   we have a weak definition, we must endeavor to create only one
   instance of the variable at link-time.  */

static void
maybe_commonize_var (tree decl)
{
  /* Static data in a function with comdat linkage also has comdat
     linkage.  */
  if (TREE_STATIC (decl)
      /* Don't mess with __FUNCTION__.  */
      && ! DECL_ARTIFICIAL (decl)
      && DECL_FUNCTION_SCOPE_P (decl)
      /* Unfortunately, import_export_decl has not always been called
   before the function is processed, so we cannot simply check
   DECL_COMDAT.  */
      && (DECL_COMDAT (DECL_CONTEXT (decl))
    || ((DECL_DECLARED_INLINE_P (DECL_CONTEXT (decl))
         || DECL_TEMPLATE_INSTANTIATION (DECL_CONTEXT (decl)))
        && TREE_PUBLIC (DECL_CONTEXT (decl)))))
    {
      if (flag_weak)
  {
    /* With weak symbols, we simply make the variable COMDAT;
       that will cause copies in multiple translations units to
       be merged.  */
    comdat_linkage (decl);
  }
      else
  {
    if (DECL_INITIAL (decl) == NULL_TREE
        || DECL_INITIAL (decl) == error_mark_node)
      {
        /* Without weak symbols, we can use COMMON to merge
     uninitialized variables.  */
        TREE_PUBLIC (decl) = 1;
        DECL_COMMON (decl) = 1;
      }
    else
      {
        /* While for initialized variables, we must use internal
     linkage -- which means that multiple copies will not
     be merged.  */
        TREE_PUBLIC (decl) = 0;
        DECL_COMMON (decl) = 0;
        cp_warning_at ("sorry: semantics of inline function static "
                             "data %q#D are wrong (you'll wind up "
                             "with multiple copies)", decl);
        warning ("%J  you can work around this by removing "
                       "the initializer",
           decl);
      }
  }
    }
  else if (DECL_LANG_SPECIFIC (decl) && DECL_COMDAT (decl))
    /* Set it up again; we might have set DECL_INITIAL since the last
       time.  */
    comdat_linkage (decl);
}

/* Issue an error message if DECL is an uninitialized const variable.  */

static void
check_for_uninitialized_const_var (tree decl)
{
  tree type = TREE_TYPE (decl);

  /* ``Unless explicitly declared extern, a const object does not have
     external linkage and must be initialized. ($8.4; $12.1)'' ARM
     7.1.6 */
  if (TREE_CODE (decl) == VAR_DECL
      && TREE_CODE (type) != REFERENCE_TYPE
      && CP_TYPE_CONST_P (type)
      && !TYPE_NEEDS_CONSTRUCTING (type)
      && !DECL_INITIAL (decl))
    error ("uninitialized const %qD", decl);
}

/* FIELD is a FIELD_DECL or NULL.  In the former case, the value
   returned is the next FIELD_DECL (possibly FIELD itself) that can be
   initialized.  If there are no more such fields, the return value
   will be NULL.  */

static tree
next_initializable_field (tree field)
{
  while (field
   && (TREE_CODE (field) != FIELD_DECL
       || (DECL_C_BIT_FIELD (field) && !DECL_NAME (field))
       || DECL_ARTIFICIAL (field)))
    field = TREE_CHAIN (field);

  return field;
}

/* Subroutine of reshape_init. Reshape the constructor for an array. INITP
   is the pointer to the old constructor list (to the CONSTRUCTOR_ELTS of
   the CONSTRUCTOR we are processing), while NEW_INIT is the CONSTRUCTOR we
   are building.
   ELT_TYPE is the element type of the array. MAX_INDEX is an INTEGER_CST
   representing the size of the array minus one (the maximum index), or
   NULL_TREE if the array was declared without specifying the size.  */

static bool
reshape_init_array (tree elt_type, tree max_index,
        tree *initp, tree new_init)
{
  bool sized_array_p = (max_index != NULL_TREE);
  unsigned HOST_WIDE_INT max_index_cst = 0;
  unsigned HOST_WIDE_INT index;

  if (sized_array_p)
    {
      if (host_integerp (max_index, 1))
  max_index_cst = tree_low_cst (max_index, 1);
      /* sizetype is sign extended, not zero extended.  */
      else
  max_index_cst = tree_low_cst (fold_convert (size_type_node, max_index),
              1);
    }

  /* Loop until there are no more initializers.  */
  for (index = 0;
       *initp && (!sized_array_p || index <= max_index_cst);
       ++index)
    {
      tree element_init;
      tree designated_index;

      element_init = reshape_init (elt_type, initp);
      if (element_init == error_mark_node)
  return false;
      TREE_CHAIN (element_init) = CONSTRUCTOR_ELTS (new_init);
      CONSTRUCTOR_ELTS (new_init) = element_init;
      designated_index = TREE_PURPOSE (element_init);
      if (designated_index)
  {
    /* Handle array designated initializers (GNU extension).  */
    if (TREE_CODE (designated_index) == IDENTIFIER_NODE)
      {
        error ("name %qD used in a GNU-style designated "
         "initializer for an array", designated_index);
        TREE_PURPOSE (element_init) = NULL_TREE;
      }
    else
      gcc_unreachable ();
  }
    }

  return true;
}

/* Undo the brace-elision allowed by [dcl.init.aggr] in a
   brace-enclosed aggregate initializer.

   *INITP is one of a list of initializers describing a brace-enclosed
   initializer for an entity of the indicated aggregate TYPE.  It may
   not presently match the shape of the TYPE; for example:

     struct S { int a; int b; };
     struct S a[] = { 1, 2, 3, 4 };

   Here *INITP will point to TREE_LIST of four elements, rather than a
   list of two elements, each itself a list of two elements.  This
   routine transforms INIT from the former form into the latter.  The
   revised initializer is returned.  */

static tree
reshape_init (tree type, tree *initp)
{
  tree inits;
  tree old_init;
  tree old_init_value;
  tree new_init;
  bool brace_enclosed_p;
  bool string_init_p;

  old_init = *initp;
  old_init_value = (TREE_CODE (*initp) == TREE_LIST
        ? TREE_VALUE (*initp) : old_init);

  gcc_assert (old_init_value);

  /* If the initializer is brace-enclosed, pull initializers from the
     enclosed elements.  Advance past the brace-enclosed initializer
     now.  */
  if (TREE_CODE (old_init_value) == CONSTRUCTOR
      && BRACE_ENCLOSED_INITIALIZER_P (old_init_value))
    {
      *initp = TREE_CHAIN (old_init);
      TREE_CHAIN (old_init) = NULL_TREE;
      inits = CONSTRUCTOR_ELTS (old_init_value);
      initp = &inits;
      brace_enclosed_p = true;
    }
  else
    {
      inits = NULL_TREE;
      brace_enclosed_p = false;
    }

  /* A non-aggregate type is always initialized with a single
     initializer.  */
  if (!CP_AGGREGATE_TYPE_P (type))
      {
  *initp = TREE_CHAIN (old_init);
  TREE_CHAIN (old_init) = NULL_TREE;
  /* It is invalid to initialize a non-aggregate type with a
     brace-enclosed initializer.  */
  if (brace_enclosed_p)
    {
      error ("brace-enclosed initializer used to initialize %qT",
       type);
      if (TREE_CODE (old_init) == TREE_LIST)
        TREE_VALUE (old_init) = error_mark_node;
      else
        old_init = error_mark_node;
    }

  return old_init;
      }

  /* [dcl.init.aggr]

     All implicit type conversions (clause _conv_) are considered when
     initializing the aggregate member with an initializer from an
     initializer-list.  If the initializer can initialize a member,
     the member is initialized.  Otherwise, if the member is itself a
     non-empty subaggregate, brace elision is assumed and the
     initializer is considered for the initialization of the first
     member of the subaggregate.  */
  if (!brace_enclosed_p
      && can_convert_arg (type, TREE_TYPE (old_init_value), old_init_value))
    {
      *initp = TREE_CHAIN (old_init);
      TREE_CHAIN (old_init) = NULL_TREE;
      return old_init;
    }

  string_init_p = false;
  if (TREE_CODE (old_init_value) == STRING_CST
      && TREE_CODE (type) == ARRAY_TYPE
      && char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type))))
    {
      /* [dcl.init.string]

   A char array (whether plain char, signed char, or unsigned char)
   can be initialized by a string-literal (optionally enclosed in
   braces); a wchar_t array can be initialized by a wide
   string-literal (optionally enclosed in braces).  */
      new_init = old_init;
      /* Move past the initializer.  */
      *initp = TREE_CHAIN (old_init);
      TREE_CHAIN (old_init) = NULL_TREE;
      string_init_p = true;
    }
  else
    {
      /* Build a CONSTRUCTOR to hold the contents of the aggregate.  */
      new_init = build_constructor (NULL_TREE, NULL_TREE);

      if (CLASS_TYPE_P (type))
  {
    tree field;

    field = next_initializable_field (TYPE_FIELDS (type));

    if (!field)
      {
        /* [dcl.init.aggr]

     An initializer for an aggregate member that is an
     empty class shall have the form of an empty
     initializer-list {}.  */
        if (!brace_enclosed_p)
    {
      error ("initializer for %qT must be brace-enclosed", type);
      return error_mark_node;
    }
      }
    else
      {
        /* Loop through the initializable fields, gathering
     initializers.  */
        while (*initp)
    {
      tree field_init;

      /* Handle designated initializers, as an extension.  */
      if (TREE_PURPOSE (*initp))
        {
          if (pedantic)
      pedwarn ("ISO C++ does not allow designated initializers");
          field = lookup_field_1 (type, TREE_PURPOSE (*initp),
                /*want_type=*/false);
          if (!field || TREE_CODE (field) != FIELD_DECL)
      error ("%qT has no non-static data member named %qD",
             type, TREE_PURPOSE (*initp));
        }
      if (!field)
        break;

      field_init = reshape_init (TREE_TYPE (field), initp);
      if (field_init == error_mark_node)
        return error_mark_node;
      TREE_CHAIN (field_init) = CONSTRUCTOR_ELTS (new_init);
      CONSTRUCTOR_ELTS (new_init) = field_init;
      /* [dcl.init.aggr]

         When a union  is  initialized with a brace-enclosed
         initializer, the braces shall only contain an
         initializer for the first member of the union.  */
      if (TREE_CODE (type) == UNION_TYPE)
        break;
      field = next_initializable_field (TREE_CHAIN (field));
    }
      }
  }
      else if (TREE_CODE (type) == ARRAY_TYPE
         || TREE_CODE (type) == VECTOR_TYPE)
  {
      /* If the bound of the array is known, take no more initializers
        than are allowed.  */
      tree max_index = NULL_TREE;
      if (TREE_CODE (type) == ARRAY_TYPE)
        {
    if (TYPE_DOMAIN (type))
      max_index = array_type_nelts (type);
        }
      else
        {
    /* For a vector, the representation type is a struct
      containing a single member which is an array of the
      appropriate size.  */
    tree rtype = TYPE_DEBUG_REPRESENTATION_TYPE (type);
    if (rtype && TYPE_DOMAIN (TREE_TYPE (TYPE_FIELDS (rtype))))
      max_index = array_type_nelts (TREE_TYPE (TYPE_FIELDS
                 (rtype)));
        }

    if (!reshape_init_array (TREE_TYPE (type), max_index,
           initp, new_init))
      return error_mark_node;
  }
      else
  gcc_unreachable ();

      /* The initializers were placed in reverse order in the
   CONSTRUCTOR.  */
      CONSTRUCTOR_ELTS (new_init) = nreverse (CONSTRUCTOR_ELTS (new_init));

      if (TREE_CODE (old_init) == TREE_LIST)
  new_init = build_tree_list (TREE_PURPOSE (old_init), new_init);
    }

  /* If there are more initializers than necessary, issue a
     diagnostic.  */  
  if (*initp)
    {
      if (brace_enclosed_p)
  error ("too many initializers for %qT", type);
      else if (warn_missing_braces && !string_init_p)
  warning ("missing braces around initializer");
    }

  return new_init;
}

/* Verify INIT (the initializer for DECL), and record the
   initialization in DECL_INITIAL, if appropriate.  CLEANUP is as for
   grok_reference_init.

   If the return value is non-NULL, it is an expression that must be
   evaluated dynamically to initialize DECL.  */

static tree
check_initializer (tree decl, tree init, int flags, tree *cleanup)
{
  tree type = TREE_TYPE (decl);
  tree init_code = NULL;

  /* If `start_decl' didn't like having an initialization, ignore it now.  */
  if (init != NULL_TREE && DECL_INITIAL (decl) == NULL_TREE)
    init = NULL_TREE;

  /* If an initializer is present, DECL_INITIAL has been
     error_mark_node, to indicate that an as-of-yet unevaluated
     initialization will occur.  From now on, DECL_INITIAL reflects
     the static initialization -- if any -- of DECL.  */
  DECL_INITIAL (decl) = NULL_TREE;

  /* Things that are going to be initialized need to have complete
     type.  */
  TREE_TYPE (decl) = type = complete_type (TREE_TYPE (decl));

  if (type == error_mark_node)
    /* We will have already complained.  */
    init = NULL_TREE;
  else if (init && COMPLETE_TYPE_P (type)
     && !TREE_CONSTANT (TYPE_SIZE (type)))
    {
      error ("variable-sized object %qD may not be initialized", decl);
      init = NULL_TREE;
    }
  else if (TREE_CODE (type) == ARRAY_TYPE
     && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (type))))
    {
      error ("elements of array %q#D have incomplete type", decl);
      init = NULL_TREE;
    }
  else if (TREE_CODE (type) != ARRAY_TYPE && !COMPLETE_TYPE_P (type))
    {
      error ("%qD has incomplete type", decl);
      TREE_TYPE (decl) = error_mark_node;
      init = NULL_TREE;
    }

  if (TREE_CODE (decl) == CONST_DECL)
    {
      gcc_assert (TREE_CODE (decl) != REFERENCE_TYPE);

      DECL_INITIAL (decl) = init;

      gcc_assert (init != NULL_TREE);
      init = NULL_TREE;
    }
  else if (!DECL_EXTERNAL (decl) && TREE_CODE (type) == REFERENCE_TYPE)
    init = grok_reference_init (decl, type, init, cleanup);
  else if (init)
    {
      if (TREE_CODE (init) == CONSTRUCTOR
    && BRACE_ENCLOSED_INITIALIZER_P (init))
  {
    /* [dcl.init] paragraph 13,
       If T is a scalar type, then a declaration of the form
       T x = { a };
       is equivalent to
       T x = a;

       reshape_init will complain about the extra braces,
       and doesn't do anything useful in the case where TYPE is
       scalar, so just don't call it.  */
    if (CP_AGGREGATE_TYPE_P (type))
      init = reshape_init (type, &init);

    if ((*targetm.vector_opaque_p) (type))
      {
        error ("opaque vector types cannot be initialized");
        init = error_mark_node;
      }
  }

      /* If DECL has an array type without a specific bound, deduce the
   array size from the initializer.  */
      maybe_deduce_size_from_array_init (decl, init);
      type = TREE_TYPE (decl);

      if (TYPE_HAS_CONSTRUCTOR (type) || TYPE_NEEDS_CONSTRUCTING (type))
  {
    if (TREE_CODE (type) == ARRAY_TYPE)
      goto initialize_aggr;
    else if (TREE_CODE (init) == CONSTRUCTOR
       && BRACE_ENCLOSED_INITIALIZER_P (init))
      {
        if (TYPE_NON_AGGREGATE_CLASS (type))
    {
      error ("%qD must be initialized by constructor, "
                         "not by %<{...}%>",
       decl);
      init = error_mark_node;
    }
        else
    goto dont_use_constructor;
      }
    else
      {
        int saved_stmts_are_full_exprs_p;

      initialize_aggr:
        saved_stmts_are_full_exprs_p = 0;
        if (building_stmt_tree ())
    {
      saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p ();
      current_stmt_tree ()->stmts_are_full_exprs_p = 1;
    }
        init = build_aggr_init (decl, init, flags);
        if (building_stmt_tree ())
    current_stmt_tree ()->stmts_are_full_exprs_p =
      saved_stmts_are_full_exprs_p;
        return init;
      }
  }
      else
  {
  dont_use_constructor:
    if (TREE_CODE (init) != TREE_VEC)
      {
        init_code = store_init_value (decl, init);
        if (pedantic && TREE_CODE (type) == ARRAY_TYPE
      && DECL_INITIAL (decl)
      && TREE_CODE (DECL_INITIAL (decl)) == STRING_CST
      && PAREN_STRING_LITERAL_P (DECL_INITIAL (decl)))
    warning ("array %qD initialized by parenthesized string literal %qE",
       decl, DECL_INITIAL (decl));
        init = NULL;
      }
  }
    }
  else if (DECL_EXTERNAL (decl))
    ;
  else if (TYPE_P (type) && TYPE_NEEDS_CONSTRUCTING (type))
    goto initialize_aggr;
  else if (IS_AGGR_TYPE (type))
    {
      tree core_type = strip_array_types (type);

      if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type))
  error ("structure %qD with uninitialized const members", decl);
      if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type))
  error ("structure %qD with uninitialized reference members", decl);

      check_for_uninitialized_const_var (decl);
    }
  else
    check_for_uninitialized_const_var (decl);

  if (init && init != error_mark_node)
    init_code = build2 (INIT_EXPR, type, decl, init);

  return init_code;
}

/* If DECL is not a local variable, give it RTL.  */

static void
make_rtl_for_nonlocal_decl (tree decl, tree init, const char* asmspec)
{
  int toplev = toplevel_bindings_p ();
  int defer_p;

  /* Set the DECL_ASSEMBLER_NAME for the object.  */
  if (asmspec)
    {
      /* The `register' keyword, when used together with an
   asm-specification, indicates that the variable should be
   placed in a particular register.  */
      if (TREE_CODE (decl) == VAR_DECL && DECL_REGISTER (decl))
  {
    change_decl_assembler_name (decl, get_identifier (asmspec));
    DECL_HARD_REGISTER (decl) = 1;
  }
      else
  {
    if (TREE_CODE (decl) == FUNCTION_DECL
        && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
      set_builtin_user_assembler_name (decl, asmspec);
    set_user_assembler_name (decl, asmspec);
  }
    }

  /* Handle non-variables up front.  */
  if (TREE_CODE (decl) != VAR_DECL)
    {
      rest_of_decl_compilation (decl, toplev, at_eof);
      return;
    }

  /* If we see a class member here, it should be a static data
     member.  */
  if (DECL_LANG_SPECIFIC (decl) && DECL_IN_AGGR_P (decl))
    {
      gcc_assert (TREE_STATIC (decl));
      /* An in-class declaration of a static data member should be
   external; it is only a declaration, and not a definition.  */
      if (init == NULL_TREE)
  gcc_assert (DECL_EXTERNAL (decl));
    }

  /* We don't create any RTL for local variables.  */
  if (DECL_FUNCTION_SCOPE_P (decl) && !TREE_STATIC (decl))
    return;

  /* We defer emission of local statics until the corresponding
     DECL_EXPR is expanded.  */
  defer_p = DECL_FUNCTION_SCOPE_P (decl) || DECL_VIRTUAL_P (decl);

  /* We try to defer namespace-scope static constants so that they are
     not emitted into the object file unnecessarily.  */
  if (!DECL_VIRTUAL_P (decl)
      && TREE_READONLY (decl)
      && DECL_INITIAL (decl) != NULL_TREE
      && DECL_INITIAL (decl) != error_mark_node
      && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl))
      && toplev
      && !TREE_PUBLIC (decl))
    {
      /* Fool with the linkage of static consts according to #pragma
   interface.  */
      struct c_fileinfo *finfo = get_fileinfo (lbasename (input_filename));
      if (!finfo->interface_unknown && !TREE_PUBLIC (decl))
  {
    TREE_PUBLIC (decl) = 1;
    DECL_EXTERNAL (decl) = finfo->interface_only;
  }

      defer_p = 1;
    }
  /* Likewise for template instantiations.  */
  else if (DECL_LANG_SPECIFIC (decl)
     && DECL_IMPLICIT_INSTANTIATION (decl))
    defer_p = 1;

  /* If we're not deferring, go ahead and assemble the variable.  */
  if (!defer_p)
    rest_of_decl_compilation (decl, toplev, at_eof);
}

/* Generate code to initialize DECL (a local variable).  */

static void
initialize_local_var (tree decl, tree init)
{
  tree type = TREE_TYPE (decl);
  tree cleanup;

  gcc_assert (TREE_CODE (decl) == VAR_DECL
        || TREE_CODE (decl) == RESULT_DECL);
  gcc_assert (!TREE_STATIC (decl));

  if (DECL_SIZE (decl) == NULL_TREE)
    {
      /* If we used it already as memory, it must stay in memory.  */
      DECL_INITIAL (decl) = NULL_TREE;
      TREE_ADDRESSABLE (decl) = TREE_USED (decl);
    }

  if (DECL_SIZE (decl) && type != error_mark_node)
    {
      int already_used;

      /* Compute and store the initial value.  */
      already_used = TREE_USED (decl) || TREE_USED (type);

      /* Perform the initialization.  */
      if (init)
  {
    int saved_stmts_are_full_exprs_p;

    gcc_assert (building_stmt_tree ());
    saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p ();
    current_stmt_tree ()->stmts_are_full_exprs_p = 1;
    finish_expr_stmt (init);
    current_stmt_tree ()->stmts_are_full_exprs_p =
      saved_stmts_are_full_exprs_p;
  }

      /* Set this to 0 so we can tell whether an aggregate which was
   initialized was ever used.  Don't do this if it has a
   destructor, so we don't complain about the 'resource
   allocation is initialization' idiom.  Now set
   attribute((unused)) on types so decls of that type will be
   marked used. (see TREE_USED, above.)  */
      if (TYPE_NEEDS_CONSTRUCTING (type)
    && ! already_used
    && TYPE_HAS_TRIVIAL_DESTRUCTOR (type)
    && DECL_NAME (decl))
  TREE_USED (decl) = 0;
      else if (already_used)
  TREE_USED (decl) = 1;
    }

  /* Generate a cleanup, if necessary.  */
  cleanup = cxx_maybe_build_cleanup (decl);
  if (DECL_SIZE (decl) && cleanup)
    finish_decl_cleanup (decl, cleanup);
}

/* DECL is a VAR_DECL for a compiler-generated variable with static
   storage duration (like a virtual table) whose initializer is a
   compile-time constant.  Initialize the variable and provide it to
   the back end.  */

void
initialize_artificial_var (tree decl, tree init)
{
  DECL_INITIAL (decl) = build_constructor (NULL_TREE, init);
  DECL_INITIALIZED_P (decl) = 1;
  determine_visibility (decl);
  layout_var_decl (decl);
  maybe_commonize_var (decl);
  make_rtl_for_nonlocal_decl (decl, init, /*asmspec=*/NULL);
}

/* Finish processing of a declaration;
   install its line number and initial value.
   If the length of an array type is not known before,
   it must be determined now, from the initial value, or it is an error.

   INIT holds the value of an initializer that should be allowed to escape
   the normal rules.

   FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
   if the (init) syntax was used.  */

void
cp_finish_decl (tree decl, tree init, tree asmspec_tree, int flags)
{
  tree type;
  tree ttype = NULL_TREE;
  tree cleanup;
  const char *asmspec = NULL;
  int was_readonly = 0;
  bool var_definition_p = false;

  if (decl == error_mark_node)
    return;
  else if (! decl)
    {
      if (init)
  error ("assignment (not initialization) in declaration");
      return;
    }

  gcc_assert (TREE_CODE (decl) != RESULT_DECL);

  /* Assume no cleanup is required.  */
  cleanup = NULL_TREE;

  /* If a name was specified, get the string.  */
  if (global_scope_p (current_binding_level))
    asmspec_tree = maybe_apply_renaming_pragma (decl, asmspec_tree);
  if (asmspec_tree)
    asmspec = TREE_STRING_POINTER (asmspec_tree);

  if (init && TREE_CODE (init) == NAMESPACE_DECL)
    {
      error ("cannot initialize %qD to namespace %qD", decl, init);
      init = NULL_TREE;
    }

  if (current_class_type
      && CP_DECL_CONTEXT (decl) == current_class_type
      && TYPE_BEING_DEFINED (current_class_type)
      && (DECL_INITIAL (decl) || init))
    DECL_INITIALIZED_IN_CLASS_P (decl) = 1;

  type = TREE_TYPE (decl);

  if (type == error_mark_node)
    goto finish_end;

  if (processing_template_decl)
    {
      /* Add this declaration to the statement-tree.  */
      if (at_function_scope_p ())
  add_decl_expr (decl);

      if (init && DECL_INITIAL (decl))
  DECL_INITIAL (decl) = init;
      if (TREE_CODE (decl) == VAR_DECL
    && !DECL_PRETTY_FUNCTION_P (decl)
    && !dependent_type_p (TREE_TYPE (decl)))
  maybe_deduce_size_from_array_init (decl, init);
      
      goto finish_end;
    }

  /* Parameters are handled by store_parm_decls, not cp_finish_decl.  */
  gcc_assert (TREE_CODE (decl) != PARM_DECL);

  /* Take care of TYPE_DECLs up front.  */
  if (TREE_CODE (decl) == TYPE_DECL)
    {
      if (type != error_mark_node
    && IS_AGGR_TYPE (type) && DECL_NAME (decl))
  {
    if (TREE_TYPE (DECL_NAME (decl)) && TREE_TYPE (decl) != type)
      warning ("shadowing previous type declaration of %q#D", decl);
    set_identifier_type_value (DECL_NAME (decl), decl);
  }

      /* If we have installed this as the canonical typedef for this
   type, and that type has not been defined yet, delay emitting
   the debug information for it, as we will emit it later.  */
      if (TYPE_MAIN_DECL (TREE_TYPE (decl)) == decl
    && !COMPLETE_TYPE_P (TREE_TYPE (decl)))
  TYPE_DECL_SUPPRESS_DEBUG (decl) = 1;

      rest_of_decl_compilation (decl, DECL_CONTEXT (decl) == NULL_TREE,
        at_eof);
      goto finish_end;
    }

  if (TREE_CODE (decl) != FUNCTION_DECL)
    ttype = target_type (type);


  /* A reference will be modified here, as it is initialized.  */
  if (! DECL_EXTERNAL (decl) 
      && TREE_READONLY (decl)
      && TREE_CODE (type) == REFERENCE_TYPE)
    {
      was_readonly = 1;
      TREE_READONLY (decl) = 0;
    }

  if (TREE_CODE (decl) == VAR_DECL)
    {
      /* Only PODs can have thread-local storage.  Other types may require
   various kinds of non-trivial initialization.  */
      if (DECL_THREAD_LOCAL (decl) && !pod_type_p (TREE_TYPE (decl)))
  error ("%qD cannot be thread-local because it has non-POD type %qT",
         decl, TREE_TYPE (decl));
      /* Convert the initializer to the type of DECL, if we have not
   already initialized DECL.  */
      if (!DECL_INITIALIZED_P (decl)
    /* If !DECL_EXTERNAL then DECL is being defined.  In the
       case of a static data member initialized inside the
       class-specifier, there can be an initializer even if DECL
       is *not* defined.  */
    && (!DECL_EXTERNAL (decl) || init))
  {
    init = check_initializer (decl, init, flags, &cleanup);
    /* Thread-local storage cannot be dynamically initialized.  */
    if (DECL_THREAD_LOCAL (decl) && init)
      {
        error ("%qD is thread-local and so cannot be dynamically "
         "initialized", decl);
        init = NULL_TREE;
      }

    /* Check that the initializer for a static data member was a
       constant.  Althouh we check in the parser that the
       initializer is an integral constant expression, we do not
       simplify division-by-zero at the point at which it
       occurs.  Therefore, in:

         struct S { static const int i = 7 / 0; };
         
       we issue an error at this point.  It would
       probably be better to forbid division by zero in
       integral constant expressions.  */
    if (DECL_EXTERNAL (decl) && init)
      {
        error ("%qD cannot be initialized by a non-constant expression"
         " when being declared", decl);
        DECL_INITIALIZED_IN_CLASS_P (decl) = 0;
        init = NULL_TREE;
      }
    
    /* Handle:

       [dcl.init]

       The memory occupied by any object of static storage
       duration is zero-initialized at program startup before
       any other initialization takes place.

       We cannot create an appropriate initializer until after
       the type of DECL is finalized.  If DECL_INITIAL is set,
       then the DECL is statically initialized, and any
       necessary zero-initialization has already been performed.  */
    if (TREE_STATIC (decl) && !DECL_INITIAL (decl))
      DECL_INITIAL (decl) = build_zero_init (TREE_TYPE (decl),
               /*nelts=*/NULL_TREE,
               /*static_storage_p=*/true);
    /* Remember that the initialization for this variable has
       taken place.  */
    DECL_INITIALIZED_P (decl) = 1;
    /* This declaration is the definition of this variable,
       unless we are initializing a static data member within
       the class specifier.  */
    if (!DECL_EXTERNAL (decl))
      var_definition_p = true;
    /* The variable is being defined, so determine its
       visibility.  */
    determine_visibility (decl);
  }
      /* If the variable has an array type, lay out the type, even if
   there is no initializer.  It is valid to index through the
   array, and we must get TYPE_ALIGN set correctly on the array
   type.  */
      else if (TREE_CODE (type) == ARRAY_TYPE)
  layout_type (type);
    }

  /* Add this declaration to the statement-tree.  This needs to happen
     after the call to check_initializer so that the DECL_EXPR for a
     reference temp is added before the DECL_EXPR for the reference itself.  */
  if (at_function_scope_p ())
    add_decl_expr (decl);

  if (TREE_CODE (decl) == VAR_DECL)
    layout_var_decl (decl);

  /* Output the assembler code and/or RTL code for variables and functions,
     unless the type is an undefined structure or union.
     If not, it will get done when the type is completed.  */
  if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL)
    {
      if (TREE_CODE (decl) == VAR_DECL)
  maybe_commonize_var (decl);

      make_rtl_for_nonlocal_decl (decl, init, asmspec);

      /* Check for abstractness of the type. Notice that there is no
   need to strip array types here since the check for those types
   is already done within create_array_type_for_decl.  */
      if (TREE_CODE (type) == FUNCTION_TYPE
    || TREE_CODE (type) == METHOD_TYPE)
  abstract_virtuals_error (decl, TREE_TYPE (type));
      else
  abstract_virtuals_error (decl, type);

      if (TREE_CODE (decl) == FUNCTION_DECL
    || TREE_TYPE (decl) == error_mark_node)
  /* No initialization required.  */
  ;
      else if (DECL_EXTERNAL (decl)
         && ! (DECL_LANG_SPECIFIC (decl)
         && DECL_NOT_REALLY_EXTERN (decl)))
  {
    if (init)
      DECL_INITIAL (decl) = init;
  }
      else
  {
    /* A variable definition.  */
    if (DECL_FUNCTION_SCOPE_P (decl))
      {
        /* Initialize the local variable.  */
        if (processing_template_decl)
    {
      if (init || DECL_INITIAL (decl) == error_mark_node)
        DECL_INITIAL (decl) = init;
    }
        else if (!TREE_STATIC (decl))
    initialize_local_var (decl, init);
      }
    
    /* If a variable is defined, and then a subsequent
       definition with external linkage is encountered, we will
       get here twice for the same variable.  We want to avoid
       calling expand_static_init more than once.  For variables
       that are not static data members, we can call
       expand_static_init only when we actually process the
       initializer.  It is not legal to redeclare a static data
       member, so this issue does not arise in that case.  */
    if (var_definition_p && TREE_STATIC (decl))
      expand_static_init (decl, init); 
  } 
    }

  /* If a CLEANUP_STMT was created to destroy a temporary bound to a
     reference, insert it in the statement-tree now.  */
  if (cleanup)
    push_cleanup (decl, cleanup, false);

 finish_end:

  if (was_readonly)
    TREE_READONLY (decl) = 1;

  /* If this was marked 'used', be sure it will be output.  */
  if (lookup_attribute ("used", DECL_ATTRIBUTES (decl)))
    mark_decl_referenced (decl);
}

/* This is here for a midend callback from c-common.c.  */

void
finish_decl (tree decl, tree init, tree asmspec_tree)
{
  cp_finish_decl (decl, init, asmspec_tree, 0);
}

/* Returns a declaration for a VAR_DECL as if:

     extern "C" TYPE NAME;

   had been seen.  Used to create compiler-generated global
   variables.  */

tree
declare_global_var (tree name, tree type)
{
  tree decl;

  push_to_top_level ();
  decl = build_decl (VAR_DECL, name, type);
  TREE_PUBLIC (decl) = 1;
  DECL_EXTERNAL (decl) = 1;
  DECL_ARTIFICIAL (decl) = 1;
  /* If the user has explicitly declared this variable (perhaps
     because the code we are compiling is part of a low-level runtime
     library), then it is possible that our declaration will be merged
     with theirs by pushdecl.  */
  decl = pushdecl (decl);
  cp_finish_decl (decl, NULL_TREE, NULL_TREE, 0);
  pop_from_top_level ();

  return decl;
}

/* Returns a pointer to the `atexit' function.  Note that if
   FLAG_USE_CXA_ATEXIT is nonzero, then this will actually be the new
   `__cxa_atexit' function specified in the IA64 C++ ABI.  */

static tree
get_atexit_node (void)
{
  tree atexit_fndecl;
  tree arg_types;
  tree fn_type;
  tree fn_ptr_type;
  const char *name;

  if (atexit_node)
    return atexit_node;

  if (flag_use_cxa_atexit)
    {
      /* The declaration for `__cxa_atexit' is:

     int __cxa_atexit (void (*)(void *), void *, void *)

   We build up the argument types and then then function type
   itself.  */

      /* First, build the pointer-to-function type for the first
   argument.  */
      arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
      fn_type = build_function_type (void_type_node, arg_types);
      fn_ptr_type = build_pointer_type (fn_type);
      /* Then, build the rest of the argument types.  */
      arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
      arg_types = tree_cons (NULL_TREE, ptr_type_node, arg_types);
      arg_types = tree_cons (NULL_TREE, fn_ptr_type, arg_types);
      /* And the final __cxa_atexit type.  */
      fn_type = build_function_type (integer_type_node, arg_types);
      fn_ptr_type = build_pointer_type (fn_type);
      name = "__cxa_atexit";
    }
  else
    {
      /* The declaration for `atexit' is:

           int atexit (void (*)());

   We build up the argument types and then then function type
   itself.  */
      fn_type = build_function_type (void_type_node, void_list_node);
      fn_ptr_type = build_pointer_type (fn_type);
      arg_types = tree_cons (NULL_TREE, fn_ptr_type, void_list_node);
      /* Build the final atexit type.  */
      fn_type = build_function_type (integer_type_node, arg_types);
      name = "atexit";
    }

  /* Now, build the function declaration.  */
  push_lang_context (lang_name_c);
  atexit_fndecl = build_library_fn_ptr (name, fn_type);
  mark_used (atexit_fndecl);
  pop_lang_context ();
  atexit_node = decay_conversion (atexit_fndecl);

  return atexit_node;
}

/* Returns the __dso_handle VAR_DECL.  */

static tree
get_dso_handle_node (void)
{
  if (dso_handle_node)
    return dso_handle_node;

  /* Declare the variable.  */
  dso_handle_node = declare_global_var (get_identifier ("__dso_handle"),
          ptr_type_node);

  return dso_handle_node;
}

/* Begin a new function with internal linkage whose job will be simply
   to destroy some particular variable.  */

static GTY(()) int start_cleanup_cnt;

static tree
start_cleanup_fn (void)
{
  char name[32];
  tree parmtypes;
  tree fntype;
  tree fndecl;

  push_to_top_level ();

  /* No need to mangle this.  */
  push_lang_context (lang_name_c);

  /* Build the parameter-types.  */
  parmtypes = void_list_node;
  /* Functions passed to __cxa_atexit take an additional parameter.
     We'll just ignore it.  After we implement the new calling
     convention for destructors, we can eliminate the use of
     additional cleanup functions entirely in the -fnew-abi case.  */
  if (flag_use_cxa_atexit)
    parmtypes = tree_cons (NULL_TREE, ptr_type_node, parmtypes);
  /* Build the function type itself.  */
  fntype = build_function_type (void_type_node, parmtypes);
  /* Build the name of the function.  */
  sprintf (name, "__tcf_%d", start_cleanup_cnt++);
  /* Build the function declaration.  */
  fndecl = build_lang_decl (FUNCTION_DECL, get_identifier (name), fntype);
  /* It's a function with internal linkage, generated by the
     compiler.  */
  TREE_PUBLIC (fndecl) = 0;
  DECL_ARTIFICIAL (fndecl) = 1;
  /* Make the function `inline' so that it is only emitted if it is
     actually needed.  It is unlikely that it will be inlined, since
     it is only called via a function pointer, but we avoid unnecessary
     emissions this way.  */
  DECL_INLINE (fndecl) = 1;
  DECL_DECLARED_INLINE_P (fndecl) = 1;
  DECL_INTERFACE_KNOWN (fndecl) = 1;
  /* Build the parameter.  */
  if (flag_use_cxa_atexit)
    {
      tree parmdecl;

      parmdecl = cp_build_parm_decl (NULL_TREE, ptr_type_node);
      DECL_CONTEXT (parmdecl) = fndecl;
      TREE_USED (parmdecl) = 1;
      DECL_ARGUMENTS (fndecl) = parmdecl;
    }

  pushdecl (fndecl);
  start_preparsed_function (fndecl, NULL_TREE, SF_PRE_PARSED);

  pop_lang_context ();

  return current_function_decl;
}

/* Finish the cleanup function begun by start_cleanup_fn.  */

static void
end_cleanup_fn (void)
{
  expand_or_defer_fn (finish_function (0));

  pop_from_top_level ();
}

/* Generate code to handle the destruction of DECL, an object with
   static storage duration.  */

tree
register_dtor_fn (tree decl)
{
  tree cleanup;
  tree compound_stmt;
  tree args;
  tree fcall;

  if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
    return void_zero_node;

  /* Call build_cleanup before we enter the anonymous function so that
     any access checks will be done relative to the current scope,
     rather than the scope of the anonymous function.  */
  build_cleanup (decl);

  /* Now start the function.  */
  cleanup = start_cleanup_fn ();

  /* Now, recompute the cleanup.  It may contain SAVE_EXPRs that refer
     to the original function, rather than the anonymous one.  That
     will make the back-end think that nested functions are in use,
     which causes confusion.  */

  push_deferring_access_checks (dk_no_check);
  fcall = build_cleanup (decl);
  pop_deferring_access_checks ();

  /* Create the body of the anonymous function.  */
  compound_stmt = begin_compound_stmt (BCS_FN_BODY);
  finish_expr_stmt (fcall);
  finish_compound_stmt (compound_stmt);
  end_cleanup_fn ();

  /* Call atexit with the cleanup function.  */
  cxx_mark_addressable (cleanup);
  mark_used (cleanup);
  cleanup = build_unary_op (ADDR_EXPR, cleanup, 0);
  if (flag_use_cxa_atexit)
    {
      args = tree_cons (NULL_TREE,
      build_unary_op (ADDR_EXPR, get_dso_handle_node (), 0),
      NULL_TREE);
      args = tree_cons (NULL_TREE, null_pointer_node, args);
      args = tree_cons (NULL_TREE, cleanup, args);
    }
  else
    args = tree_cons (NULL_TREE, cleanup, NULL_TREE);
  return build_function_call (get_atexit_node (), args);
}

/* DECL is a VAR_DECL with static storage duration.  INIT, if present,
   is its initializer.  Generate code to handle the construction
   and destruction of DECL.  */

static void
expand_static_init (tree decl, tree init)
{
  gcc_assert (TREE_CODE (decl) == VAR_DECL);
  gcc_assert (TREE_STATIC (decl));

  /* Some variables require no initialization.  */
  if (!init
      && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl))
      && TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
    return;

  if (DECL_FUNCTION_SCOPE_P (decl))
    {
      /* Emit code to perform this initialization but once.  */
      tree if_stmt = NULL_TREE, inner_if_stmt = NULL_TREE;
      tree then_clause = NULL_TREE, inner_then_clause = NULL_TREE;
      tree guard, guard_addr, guard_addr_list;
      tree acquire_fn, release_fn, abort_fn;
      tree flag, begin;

      /* Emit code to perform this initialization but once.  This code
   looks like:

           static <type> guard;
           if (!guard.first_byte) {
       if (__cxa_guard_acquire (&guard)) {
         bool flag = false;
         try {
           // Do initialization.
           flag = true; __cxa_guard_release (&guard);
           // Register variable for destruction at end of program.
         } catch {
           if (!flag) __cxa_guard_abort (&guard);
         }
     }

   Note that the `flag' variable is only set to 1 *after* the
   initialization is complete.  This ensures that an exception,
   thrown during the construction, will cause the variable to
   reinitialized when we pass through this code again, as per:

     [stmt.dcl]

     If the initialization exits by throwing an exception, the  
     initialization is not complete, so it will be tried again
     the next time control enters the declaration.

         This process should be thread-safe, too; multiple threads
   should not be able to initialize the variable more than
   once.  */

      /* Create the guard variable.  */
      guard = get_guard (decl);

      /* This optimization isn't safe on targets with relaxed memory
   consistency.  On such targets we force synchronization in
   __cxa_guard_acquire.  */
      if (!targetm.relaxed_ordering || !flag_threadsafe_statics)
  {
    /* Begin the conditional initialization.  */
    if_stmt = begin_if_stmt ();
    finish_if_stmt_cond (get_guard_cond (guard), if_stmt);
    then_clause = begin_compound_stmt (BCS_NO_SCOPE);
  }

      if (flag_threadsafe_statics)
  {
    guard_addr = build_address (guard);
    guard_addr_list = build_tree_list (NULL_TREE, guard_addr);

    acquire_fn = get_identifier ("__cxa_guard_acquire");
    release_fn = get_identifier ("__cxa_guard_release");
    abort_fn = get_identifier ("__cxa_guard_abort");
    if (!get_global_value_if_present (acquire_fn, &acquire_fn))
      {
        tree argtypes = tree_cons (NULL_TREE, TREE_TYPE (guard_addr),
           void_list_node);
        tree vfntype = build_function_type (void_type_node, argtypes);
        acquire_fn = push_library_fn
    (acquire_fn, build_function_type (integer_type_node, argtypes));
        release_fn = push_library_fn (release_fn, vfntype);
        abort_fn = push_library_fn (abort_fn, vfntype);
      }
    else
      {
        release_fn = identifier_global_value (release_fn);
        abort_fn = identifier_global_value (abort_fn);
      }

    inner_if_stmt = begin_if_stmt ();
    finish_if_stmt_cond (build_call (acquire_fn, guard_addr_list),
             inner_if_stmt);

    inner_then_clause = begin_compound_stmt (BCS_NO_SCOPE);
    begin = get_target_expr (boolean_false_node);
    flag = TARGET_EXPR_SLOT (begin);

    TARGET_EXPR_CLEANUP (begin)
      = build (COND_EXPR, void_type_node, flag,
         void_zero_node,
         build_call (abort_fn, guard_addr_list));
    CLEANUP_EH_ONLY (begin) = 1;

    /* Do the initialization itself.  */
    init = add_stmt_to_compound (begin, init);
    init = add_stmt_to_compound
      (init, build (MODIFY_EXPR, void_type_node, flag, boolean_true_node));
    init = add_stmt_to_compound
      (init, build_call (release_fn, guard_addr_list));
  }
      else
  init = add_stmt_to_compound (init, set_guard (guard));

      /* Use atexit to register a function for destroying this static
   variable.  */
      init = add_stmt_to_compound (init, register_dtor_fn (decl));

      finish_expr_stmt (init);

      if (flag_threadsafe_statics)
  {
    finish_compound_stmt (inner_then_clause);
    finish_then_clause (inner_if_stmt);
    finish_if_stmt (inner_if_stmt);
  }

      if (!targetm.relaxed_ordering || !flag_threadsafe_statics)
  {
    finish_compound_stmt (then_clause);
    finish_then_clause (if_stmt);
    finish_if_stmt (if_stmt);
  }
    }
  else
    static_aggregates = tree_cons (init, decl, static_aggregates);
}


/* Make TYPE a complete type based on INITIAL_VALUE.
   Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
   2 if there was no information (in which case assume 0 if DO_DEFAULT).  */

int
cp_complete_array_type (tree *ptype, tree initial_value, bool do_default)
{
  int failure;
  tree type, elt_type;

  if (initial_value)
    {
      /* An array of character type can be initialized from a
   brace-enclosed string constant.  */
      if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (*ptype)))
    && TREE_CODE (initial_value) == CONSTRUCTOR
    && CONSTRUCTOR_ELTS (initial_value)
    && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value)))
        == STRING_CST)
    && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value)) == NULL_TREE)
  initial_value = TREE_VALUE (CONSTRUCTOR_ELTS (initial_value));
    }
  
  failure = complete_array_type (ptype, initial_value, do_default);
  
  /* We can create the array before the element type is complete, which
     means that we didn't have these two bits set in the original type
     either.  In completing the type, we are expected to propagate these
     bits.  See also complete_type which does the same thing for arrays
     of fixed size.  */
  type = *ptype;
  if (TYPE_DOMAIN (type))
    {
      elt_type = TREE_TYPE (type);
      TYPE_NEEDS_CONSTRUCTING (type) = TYPE_NEEDS_CONSTRUCTING (elt_type);
      TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
  = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (elt_type);
    }

  return failure;
}

/* Return zero if something is declared to be a member of type
   CTYPE when in the context of CUR_TYPE.  STRING is the error
   message to print in that case.  Otherwise, quietly return 1.  */

static int
member_function_or_else (tree ctype, tree cur_type, enum overload_flags flags)
{
  if (ctype && ctype != cur_type)
    {
      if (flags == DTOR_FLAG)
  error ("destructor for alien class %qT cannot be a member", ctype);
      else
  error ("constructor for alien class %qT cannot be a member", ctype);
      return 0;
    }
  return 1;
}

/* Subroutine of `grokdeclarator'.  */

/* Generate errors possibly applicable for a given set of specifiers.
   This is for ARM $7.1.2.  */

static void
bad_specifiers (tree object,
                const char* type,
                int virtualp,
                int quals,
                int inlinep,
                int friendp,
                int raises)
{
  if (virtualp)
    error ("%qD declared as a %<virtual%> %s", object, type);
  if (inlinep)
    error ("%qD declared as an %<inline%> %s", object, type);
  if (quals)
    error ("%<const%> and %<volatile%> function specifiers on "
           "%qD invalid in %s declaration",
           object, type);
  if (friendp)
    cp_error_at ("%qD declared as a friend", object);
  if (raises
      && (TREE_CODE (object) == TYPE_DECL
    || (!TYPE_PTRFN_P (TREE_TYPE (object))
        && !TYPE_REFFN_P (TREE_TYPE (object))
        && !TYPE_PTRMEMFUNC_P (TREE_TYPE (object)))))
    cp_error_at ("%qD declared with an exception specification", object);
}

/* CTYPE is class type, or null if non-class.
   TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
   or METHOD_TYPE.
   DECLARATOR is the function's name.
   PARMS is a chain of PARM_DECLs for the function.
   VIRTUALP is truthvalue of whether the function is virtual or not.
   FLAGS are to be passed through to `grokclassfn'.
   QUALS are qualifiers indicating whether the function is `const'
   or `volatile'.
   RAISES is a list of exceptions that this function can raise.
   CHECK is 1 if we must find this method in CTYPE, 0 if we should
   not look, and -1 if we should not call `grokclassfn' at all.

   SFK is the kind of special function (if any) for the new function.

   Returns `NULL_TREE' if something goes wrong, after issuing
   applicable error messages.  */

static tree
grokfndecl (tree ctype,
            tree type,
            tree declarator,
      tree parms,
            tree orig_declarator,
            int virtualp,
            enum overload_flags flags,
      cp_cv_quals quals,
            tree raises,
            int check,
            int friendp,
            int publicp,
            int inlinep,
      special_function_kind sfk,
            int funcdef_flag,
            int template_count,
            tree in_namespace,
      tree* attrlist)
{
  tree decl;
  int staticp = ctype && TREE_CODE (type) == FUNCTION_TYPE;
  int has_default_arg = 0;
  tree t;

  if (raises)
    type = build_exception_variant (type, raises);

  decl = build_lang_decl (FUNCTION_DECL, declarator, type);
  DECL_ARGUMENTS (decl) = parms;
  /* Propagate volatile out from type to decl.  */
  if (TYPE_VOLATILE (type))
    TREE_THIS_VOLATILE (decl) = 1;

  /* If this decl has namespace scope, set that up.  */
  if (in_namespace)
    set_decl_namespace (decl, in_namespace, friendp);
  else if (!ctype)
    DECL_CONTEXT (decl) = FROB_CONTEXT (current_namespace);

  /* `main' and builtins have implicit 'C' linkage.  */
  if ((MAIN_NAME_P (declarator)
       || (IDENTIFIER_LENGTH (declarator) > 10
     && IDENTIFIER_POINTER (declarator)[0] == '_'
     && IDENTIFIER_POINTER (declarator)[1] == '_'
     && strncmp (IDENTIFIER_POINTER (declarator)+2, "builtin_", 8) == 0))
      && current_lang_name == lang_name_cplusplus
      && ctype == NULL_TREE
      /* NULL_TREE means global namespace.  */
      && DECL_CONTEXT (decl) == NULL_TREE)
    SET_DECL_LANGUAGE (decl, lang_c);

  /* Should probably propagate const out from type to decl I bet (mrs).  */
  if (staticp)
    {
      DECL_STATIC_FUNCTION_P (decl) = 1;
      DECL_CONTEXT (decl) = ctype;
    }

  if (ctype)
    DECL_CONTEXT (decl) = ctype;

  if (ctype == NULL_TREE && DECL_MAIN_P (decl))
    {
      if (processing_template_decl)
  error ("cannot declare %<::main%> to be a template");
      if (inlinep)
  error ("cannot declare %<::main%> to be inline");
      if (!publicp)
  error ("cannot declare %<::main%> to be static");
      if (!same_type_p (TREE_TYPE (TREE_TYPE (decl)),
      integer_type_node))
  {
    error ("%<::main%> must return %<int%>");
    TREE_TYPE (TREE_TYPE (decl)) = integer_type_node;
  }
      inlinep = 0;
      publicp = 1;
    }

  /* Members of anonymous types and local classes have no linkage; make
     them internal.  If a typedef is made later, this will be changed.  */
  if (ctype && (TYPE_ANONYMOUS_P (ctype)
    || decl_function_context (TYPE_MAIN_DECL (ctype))))
    publicp = 0;

  if (publicp)
    {
      /* [basic.link]: A name with no linkage (notably, the name of a class
   or enumeration declared in a local scope) shall not be used to
   declare an entity with linkage.

   Only check this for public decls for now.  See core 319, 389.  */
      t = no_linkage_check (TREE_TYPE (decl),
          /*relaxed_p=*/false);
      if (t)
  {
    if (TYPE_ANONYMOUS_P (t))
      {
        if (DECL_EXTERN_C_P (decl))
    /* Allow this; it's pretty common in C.  */;
        else
    {
      pedwarn ("non-local function %q#D uses anonymous type",
            decl);
      if (DECL_ORIGINAL_TYPE (TYPE_NAME (t)))
        cp_pedwarn_at ("%q#D does not refer to the unqualified "
                                   "type, so it is not used for linkage",
                                   TYPE_NAME (t));
    }
      }
    else
      pedwarn ("non-local function %q#D uses local type %qT", decl, t);
  }
    }

  TREE_PUBLIC (decl) = publicp;
  if (! publicp)
    {
      DECL_INTERFACE_KNOWN (decl) = 1;
      DECL_NOT_REALLY_EXTERN (decl) = 1;
    }

  /* If the declaration was declared inline, mark it as such.  */
  if (inlinep)
    DECL_DECLARED_INLINE_P (decl) = 1;
  /* We inline functions that are explicitly declared inline, or, when
     the user explicitly asks us to, all functions.  */
  if (DECL_DECLARED_INLINE_P (decl)
      || (flag_inline_trees == 2 && !DECL_INLINE (decl) && funcdef_flag))
    DECL_INLINE (decl) = 1;

  DECL_EXTERNAL (decl) = 1;
  if (quals && TREE_CODE (type) == FUNCTION_TYPE)
    {
      error ("%smember function %qD cannot have cv-qualifier",
       (ctype ? "static " : "non-"), decl);
      quals = TYPE_UNQUALIFIED;
    }

  if (IDENTIFIER_OPNAME_P (DECL_NAME (decl)))
    grok_op_properties (decl, /*complain=*/true);

  if (ctype && decl_function_context (decl))
    DECL_NO_STATIC_CHAIN (decl) = 1;

  for (t = TYPE_ARG_TYPES (TREE_TYPE (decl)); t; t = TREE_CHAIN (t))
    if (TREE_PURPOSE (t)
  && TREE_CODE (TREE_PURPOSE (t)) == DEFAULT_ARG)
      {
  has_default_arg = 1;
  break;
      }

  if (friendp
      && TREE_CODE (orig_declarator) == TEMPLATE_ID_EXPR)
    {
      if (funcdef_flag)
  error
    ("defining explicit specialization %qD in friend declaration",
     orig_declarator);
      else
  {
    tree fns = TREE_OPERAND (orig_declarator, 0);
    tree args = TREE_OPERAND (orig_declarator, 1);

    if (PROCESSING_REAL_TEMPLATE_DECL_P ())
      {
        /* Something like `template <class T> friend void f<T>()'.  */
        error ("invalid use of template-id %qD in declaration "
                     "of primary template",
                     orig_declarator);
        return NULL_TREE;
      }


    /* A friend declaration of the form friend void f<>().  Record
       the information in the TEMPLATE_ID_EXPR.  */
    SET_DECL_IMPLICIT_INSTANTIATION (decl);

          if (TREE_CODE (fns) == COMPONENT_REF)
            {
              /* Due to bison parser ickiness, we will have already looked
                 up an operator_name or PFUNCNAME within the current class
                 (see template_id in parse.y). If the current class contains
                 such a name, we'll get a COMPONENT_REF here. Undo that.  */

              gcc_assert (TREE_TYPE (TREE_OPERAND (fns, 0))
        == current_class_type);
              fns = TREE_OPERAND (fns, 1);
            }
    gcc_assert (TREE_CODE (fns) == IDENTIFIER_NODE
          || TREE_CODE (fns) == OVERLOAD);
    DECL_TEMPLATE_INFO (decl) = tree_cons (fns, args, NULL_TREE);

    if (has_default_arg)
      {
        error ("default arguments are not allowed in declaration "
                     "of friend template specialization %qD",
                     decl);
        return NULL_TREE;
      }

    if (inlinep)
      {
        error ("%<inline%> is not allowed in declaration of friend "
                     "template specialization %qD",
                     decl);
        return NULL_TREE;
      }
  }
    }

  if (funcdef_flag)
    /* Make the init_value nonzero so pushdecl knows this is not
       tentative.  error_mark_node is replaced later with the BLOCK.  */
    DECL_INITIAL (decl) = error_mark_node;

  if (TYPE_NOTHROW_P (type) || nothrow_libfn_p (decl))
    TREE_NOTHROW (decl) = 1;

  /* Caller will do the rest of this.  */
  if (check < 0)
    return decl;

  if (ctype != NULL_TREE)
    {
      if (sfk == sfk_constructor)
  DECL_CONSTRUCTOR_P (decl) = 1;

      grokclassfn (ctype, decl, flags, quals);
    }

  decl = check_explicit_specialization (orig_declarator, decl,
          template_count,
          2 * (funcdef_flag != 0) +
          4 * (friendp != 0));
  if (decl == error_mark_node)
    return NULL_TREE;

  if (attrlist)
    {
      cplus_decl_attributes (&decl, *attrlist, 0);
      *attrlist = NULL_TREE;
    }

  if (ctype != NULL_TREE
      && (! TYPE_FOR_JAVA (ctype) || check_java_method (decl))
      && check)
    {
      tree old_decl;

      old_decl = check_classfn (ctype, decl,
        (processing_template_decl
         > template_class_depth (ctype))
        ? current_template_parms
        : NULL_TREE); 

      if (old_decl && TREE_CODE (old_decl) == TEMPLATE_DECL)
  /* Because grokfndecl is always supposed to return a
     FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
     here.  We depend on our callers to figure out that its
     really a template that's being returned.  */
  old_decl = DECL_TEMPLATE_RESULT (old_decl);

      if (old_decl && DECL_STATIC_FUNCTION_P (old_decl)
    && TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE)
  /* Remove the `this' parm added by grokclassfn.
     XXX Isn't this done in start_function, too?  */
  revert_static_member_fn (decl);
      if (old_decl && DECL_ARTIFICIAL (old_decl))
  error ("definition of implicitly-declared %qD", old_decl);

      if (old_decl)
  {
    tree ok;
    tree pushed_scope;

    /* Since we've smashed OLD_DECL to its
       DECL_TEMPLATE_RESULT, we must do the same to DECL.  */
    if (TREE_CODE (decl) == TEMPLATE_DECL)
      decl = DECL_TEMPLATE_RESULT (decl);

    /* Attempt to merge the declarations.  This can fail, in
       the case of some invalid specialization declarations.  */
    pushed_scope = push_scope (ctype);
    ok = duplicate_decls (decl, old_decl);
    if (pushed_scope)
      pop_scope (pushed_scope);
    if (!ok)
      {
        error ("no %q#D member function declared in class %qT",
         decl, ctype);
        return NULL_TREE;
      }
    return old_decl;
  }
    }

  if (DECL_CONSTRUCTOR_P (decl) && !grok_ctor_properties (ctype, decl))
    return NULL_TREE;

  if (ctype == NULL_TREE || check)
    return decl;

  if (virtualp)
    DECL_VIRTUAL_P (decl) = 1;

  return decl;
}

/* DECL is a VAR_DECL for a static data member.  Set flags to reflect
   the linkage that DECL will receive in the object file.  */

static void
set_linkage_for_static_data_member (tree decl)
{
  /* A static data member always has static storage duration and
     external linkage.  Note that static data members are forbidden in
     local classes -- the only situation in which a class has
     non-external linkage.  */
  TREE_PUBLIC (decl) = 1;
  TREE_STATIC (decl) = 1;
  /* For non-template classes, static data members are always put
     out in exactly those files where they are defined, just as
     with ordinary namespace-scope variables.  */
  if (!processing_template_decl)
    DECL_INTERFACE_KNOWN (decl) = 1;
}

/* Create a VAR_DECL named NAME with the indicated TYPE.

   If SCOPE is non-NULL, it is the class type or namespace containing
   the variable.  If SCOPE is NULL, the variable should is created in
   the innermost enclosings scope.  */

static tree
grokvardecl (tree type,
             tree name,
       const cp_decl_specifier_seq *declspecs,
             int initialized,
             int constp,
             tree scope)
{
  tree decl;
  tree explicit_scope;

  gcc_assert (!name || TREE_CODE (name) == IDENTIFIER_NODE);

  /* Compute the scope in which to place the variable, but remember
     whether or not that scope was explicitly specified by the user.   */
  explicit_scope = scope;
  if (!scope)
    {
      /* An explicit "extern" specifier indicates a namespace-scope
   variable.  */
      if (declspecs->storage_class == sc_extern)
  scope = current_namespace;
      else if (!at_function_scope_p ())
  scope = current_scope ();
    }

  if (scope
      && (/* If the variable is a namespace-scope variable declared in a
       template, we need DECL_LANG_SPECIFIC.  */
    (TREE_CODE (scope) == NAMESPACE_DECL && processing_template_decl)
    /* Similarly for namespace-scope variables with language linkage
       other than C++.  */
    || (TREE_CODE (scope) == NAMESPACE_DECL
        && current_lang_name != lang_name_cplusplus)
    /* Similarly for static data members.  */
    || TYPE_P (scope)))
    decl = build_lang_decl (VAR_DECL, name, type);
  else
    decl = build_decl (VAR_DECL, name, type);

  if (explicit_scope && TREE_CODE (explicit_scope) == NAMESPACE_DECL)
    set_decl_namespace (decl, explicit_scope, 0);
  else
    DECL_CONTEXT (decl) = scope;

  if (declspecs->storage_class == sc_extern)
    {
      DECL_THIS_EXTERN (decl) = 1;
      DECL_EXTERNAL (decl) = !initialized;
    }

  if (DECL_CLASS_SCOPE_P (decl))
    {
      set_linkage_for_static_data_member (decl);
      /* This function is only called with out-of-class definitions.  */
      DECL_EXTERNAL (decl) = 0;
    }
  /* At top level, either `static' or no s.c. makes a definition
     (perhaps tentative), and absence of `static' makes it public.  */
  else if (toplevel_bindings_p ())
    {
      TREE_PUBLIC (decl) = (declspecs->storage_class != sc_static
          && (DECL_THIS_EXTERN (decl) || ! constp));
      TREE_STATIC (decl) = ! DECL_EXTERNAL (decl);
    }
  /* Not at top level, only `static' makes a static definition.  */
  else
    {
      TREE_STATIC (decl) = declspecs->storage_class == sc_static;
      TREE_PUBLIC (decl) = DECL_EXTERNAL (decl);
    }

  if (declspecs->specs[(int)ds_thread])
    {
      if (targetm.have_tls)
  DECL_THREAD_LOCAL (decl) = 1;
      else
  /* A mere warning is sure to result in improper semantics
     at runtime.  Don't bother to allow this to compile.  */
  error ("thread-local storage not supported for this target");
    }

  if (TREE_PUBLIC (decl))
    {
      /* [basic.link]: A name with no linkage (notably, the name of a class
   or enumeration declared in a local scope) shall not be used to
   declare an entity with linkage.

   Only check this for public decls for now.  */
      tree t = no_linkage_check (TREE_TYPE (decl), /*relaxed_p=*/false);
      if (t)
  {
    if (TYPE_ANONYMOUS_P (t))
      {
        if (DECL_EXTERN_C_P (decl))
    /* Allow this; it's pretty common in C.  */
      ;
        else
    {
      /* DRs 132, 319 and 389 seem to indicate types with
         no linkage can only be used to declare extern "C"
         entities.  Since it's not always an error in the
         ISO C++ 90 Standard, we only issue a warning.  */
      warning ("non-local variable %q#D uses anonymous type",
         decl);
      if (DECL_ORIGINAL_TYPE (TYPE_NAME (t)))
        cp_warning_at ("%q#D does not refer to the unqualified "
           "type, so it is not used for linkage",
           TYPE_NAME (t));
    }
      }
    else
      warning ("non-local variable %q#D uses local type %qT", decl, t);
  }
    }
  else
    DECL_INTERFACE_KNOWN (decl) = 1;

  return decl;
}

/* Create and return a canonical pointer to member function type, for
   TYPE, which is a POINTER_TYPE to a METHOD_TYPE.  */

tree
build_ptrmemfunc_type (tree type)
{
  tree field, fields;
  tree t;
  tree unqualified_variant = NULL_TREE;

  if (type == error_mark_node)
    return type;

  /* If a canonical type already exists for this type, use it.  We use
     this method instead of type_hash_canon, because it only does a
     simple equality check on the list of field members.  */

  if ((t = TYPE_GET_PTRMEMFUNC_TYPE (type)))
    return t;

  /* Make sure that we always have the unqualified pointer-to-member
     type first.  */
  if (cp_type_quals (type) != TYPE_UNQUALIFIED)
    unqualified_variant
      = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type));

  t = make_aggr_type (RECORD_TYPE);
  xref_basetypes (t, NULL_TREE);

  /* Let the front-end know this is a pointer to member function...  */
  TYPE_PTRMEMFUNC_FLAG (t) = 1;
  /* ... and not really an aggregate.  */
  SET_IS_AGGR_TYPE (t, 0);

  field = build_decl (FIELD_DECL, pfn_identifier, type);
  fields = field;

  field = build_decl (FIELD_DECL, delta_identifier, delta_type_node);
  TREE_CHAIN (field) = fields;
  fields = field;

  finish_builtin_struct (t, "__ptrmemfunc_type", fields, ptr_type_node);

  /* Zap out the name so that the back-end will give us the debugging
     information for this anonymous RECORD_TYPE.  */
  TYPE_NAME (t) = NULL_TREE;

  /* If this is not the unqualified form of this pointer-to-member
     type, set the TYPE_MAIN_VARIANT for this type to be the
     unqualified type.  Since they are actually RECORD_TYPEs that are
     not variants of each other, we must do this manually.  */
  if (cp_type_quals (type) != TYPE_UNQUALIFIED)
    {
      t = build_qualified_type (t, cp_type_quals (type));
      TYPE_MAIN_VARIANT (t) = unqualified_variant;
      TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (unqualified_variant);
      TYPE_NEXT_VARIANT (unqualified_variant) = t;
    }

  /* Cache this pointer-to-member type so that we can find it again
     later.  */
  TYPE_SET_PTRMEMFUNC_TYPE (type, t);

  return t;
}

/* Create and return a pointer to data member type.  */

tree
build_ptrmem_type (tree class_type, tree member_type)
{
  if (TREE_CODE (member_type) == METHOD_TYPE)
    {
      tree arg_types;

      arg_types = TYPE_ARG_TYPES (member_type);
      class_type = (cp_build_qualified_type
        (class_type,
         cp_type_quals (TREE_TYPE (TREE_VALUE (arg_types)))));
      member_type
  = build_method_type_directly (class_type,
              TREE_TYPE (member_type),
              TREE_CHAIN (arg_types));
      return build_ptrmemfunc_type (build_pointer_type (member_type));
    }
  else
    {
      gcc_assert (TREE_CODE (member_type) != FUNCTION_TYPE);
      return build_offset_type (class_type, member_type);
    }
}

/* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
   Check to see that the definition is valid.  Issue appropriate error
   messages.  Return 1 if the definition is particularly bad, or 0
   otherwise.  */

int
check_static_variable_definition (tree decl, tree type)
{
  /* Motion 10 at San Diego: If a static const integral data member is
     initialized with an integral constant expression, the initializer
     may appear either in the declaration (within the class), or in
     the definition, but not both.  If it appears in the class, the
     member is a member constant.  The file-scope definition is always
     required.  */
  if (!ARITHMETIC_TYPE_P (type) && TREE_CODE (type) != ENUMERAL_TYPE)
    {
      error ("invalid in-class initialization of static data member "
             "of non-integral type %qT",
       type);
      /* If we just return the declaration, crashes will sometimes
   occur.  We therefore return void_type_node, as if this were a
   friend declaration, to cause callers to completely ignore
   this declaration.  */
      return 1;
    }
  else if (!CP_TYPE_CONST_P (type))
    error ("ISO C++ forbids in-class initialization of non-const "
           "static member %qD",
           decl);
  else if (pedantic && !INTEGRAL_TYPE_P (type))
    pedwarn ("ISO C++ forbids initialization of member constant "
             "%qD of non-integral type %qT", decl, type);

  return 0;
}

/* Given the SIZE (i.e., number of elements) in an array, compute an
   appropriate index type for the array.  If non-NULL, NAME is the
   name of the thing being declared.  */

tree
compute_array_index_type (tree name, tree size)
{
  tree type = TREE_TYPE (size);
  tree itype;

  /* The array bound must be an integer type.  */
  if (!dependent_type_p (type) && !INTEGRAL_TYPE_P (type))
    {
      if (name)
  error ("size of array %qD has non-integral type %qT", name, type);
      else
  error ("size of array has non-integral type %qT", type);
      size = integer_one_node;
      type = TREE_TYPE (size);
    }

  if (abi_version_at_least (2)
      /* We should only handle value dependent expressions specially.  */
      ? value_dependent_expression_p (size)
      /* But for abi-1, we handled all instances in templates. This
   effects the manglings produced.  */
      : processing_template_decl)
    return build_index_type (build_min (MINUS_EXPR, sizetype,
          size, integer_one_node));

  /* The size might be the result of a cast.  */
  STRIP_TYPE_NOPS (size);

  /* It might be a const variable or enumeration constant.  */
  size = integral_constant_value (size);

  /* Normally, the array-bound will be a constant.  */
  if (TREE_CODE (size) == INTEGER_CST)
    {
      /* Check to see if the array bound overflowed.  Make that an
   error, no matter how generous we're being.  */
      int old_flag_pedantic_errors = flag_pedantic_errors;
      int old_pedantic = pedantic;
      pedantic = flag_pedantic_errors = 1;
      constant_expression_warning (size);
      pedantic = old_pedantic;
      flag_pedantic_errors = old_flag_pedantic_errors;

      /* An array must have a positive number of elements.  */
      if (INT_CST_LT (size, integer_zero_node))
  {
    if (name)
      error ("size of array %qD is negative", name);
    else
      error ("size of array is negative");
    size = integer_one_node;
  }
      /* As an extension we allow zero-sized arrays.  We always allow
   them in system headers because glibc uses them.  */
      else if (integer_zerop (size) && pedantic && !in_system_header)
  {
    if (name)
      pedwarn ("ISO C++ forbids zero-size array %qD", name);
    else
      pedwarn ("ISO C++ forbids zero-size array");
  }
    }
  else if (TREE_CONSTANT (size))
    {
      /* `(int) &fn' is not a valid array bound.  */
      if (name)
  error ("size of array %qD is not an integral constant-expression",
               name);
      else
  error ("size of array is not an integral constant-expression");
    }
  else if (pedantic)
    {
      if (name)
  pedwarn ("ISO C++ forbids variable-size array %qD", name);
      else
  pedwarn ("ISO C++ forbids variable-size array");
    }

  if (processing_template_decl && !TREE_CONSTANT (size))
    /* A variable sized array.  */
    itype = build_min (MINUS_EXPR, sizetype, size, integer_one_node);
  else
    {
      HOST_WIDE_INT saved_processing_template_decl;

      /* Compute the index of the largest element in the array.  It is
       one less than the number of elements in the array.  We save
       and restore PROCESSING_TEMPLATE_DECL so that computations in
       cp_build_binary_op will be appropriately folded.  */
      saved_processing_template_decl = processing_template_decl;
      processing_template_decl = 0;
      itype = cp_build_binary_op (MINUS_EXPR,
          cp_convert (ssizetype, size),
          cp_convert (ssizetype, integer_one_node));
      itype = fold (itype);
      processing_template_decl = saved_processing_template_decl;

      if (!TREE_CONSTANT (itype))
  /* A variable sized array.  */
  itype = variable_size (itype);
      /* Make sure that there was no overflow when creating to a signed
       index type.  (For example, on a 32-bit machine, an array with
       size 2^32 - 1 is too big.)  */
      else if (TREE_OVERFLOW (itype))
  {
    error ("overflow in array dimension");
    TREE_OVERFLOW (itype) = 0;
  }
    }

  /* Create and return the appropriate index type.  */
  return build_index_type (itype);
}

/* Returns the scope (if any) in which the entity declared by
   DECLARATOR will be located.  If the entity was declared with an
   unqualified name, NULL_TREE is returned.  */

tree
get_scope_of_declarator (const cp_declarator *declarator)
{
  while (declarator && declarator->kind != cdk_id)
    declarator = declarator->declarator;

  /* If the declarator-id is a SCOPE_REF, the scope in which the
     declaration occurs is the first operand.  */
  if (declarator
      && declarator->u.id.qualifying_scope)
    return declarator->u.id.qualifying_scope;

  /* Otherwise, the declarator is not a qualified name; the entity will
     be declared in the current scope.  */
  return NULL_TREE;
}

/* Returns an ARRAY_TYPE for an array with SIZE elements of the
   indicated TYPE.  If non-NULL, NAME is the NAME of the declaration
   with this type.  */

static tree
create_array_type_for_decl (tree name, tree type, tree size)
{
  tree itype = NULL_TREE;
  const char* error_msg;

  /* If things have already gone awry, bail now.  */
  if (type == error_mark_node || size == error_mark_node)
    return error_mark_node;

  /* Assume that everything will go OK.  */
  error_msg = NULL;

  /* There are some types which cannot be array elements.  */
  switch (TREE_CODE (type))
    {
    case VOID_TYPE:
      error_msg = "array of void";
      break;

    case FUNCTION_TYPE:
      error_msg = "array of functions";
      break;

    case REFERENCE_TYPE:
      error_msg = "array of references";
      break;

    case METHOD_TYPE:
      error_msg = "array of function members";
      break;

    default:
      break;
    }

  /* If something went wrong, issue an error-message and return.  */
  if (error_msg)
    {
      if (name)
  error ("declaration of %qD as %s", name, error_msg);
      else
  error ("creating %s", error_msg);

      return error_mark_node;
    }

  /* [dcl.array]

     The constant expressions that specify the bounds of the arrays
     can be omitted only for the first member of the sequence.  */
  if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type))
    {
      if (name)
  error ("declaration of %qD as multidimensional array must "
               "have bounds for all dimensions except the first",
               name);
      else
  error ("multidimensional array must have bounds for all "
               "dimensions except the first");

      return error_mark_node;
    }

  /* Figure out the index type for the array.  */
  if (size)
    itype = compute_array_index_type (name, size);

  /* [dcl.array]
     T is called the array element type; this type shall not be [...] an
     abstract class type.  */
  abstract_virtuals_error (name, type);

  return build_cplus_array_type (type, itype);
}

/* Check that it's OK to declare a function with the indicated TYPE.
   SFK indicates the kind of special function (if any) that this
   function is.  OPTYPE is the type given in a conversion operator
   declaration, or the class type for a constructor/destructor.
   Returns the actual return type of the function; that
   may be different than TYPE if an error occurs, or for certain
   special functions.  */

static tree
check_special_function_return_type (special_function_kind sfk,
                                    tree type,
                                    tree optype)
{
  switch (sfk)
    {
    case sfk_constructor:
      if (type)
  error ("return type specification for constructor invalid");

      if (targetm.cxx.cdtor_returns_this () && !TYPE_FOR_JAVA (optype))
  type = build_pointer_type (optype);
      else
  type = void_type_node;
      break;

    case sfk_destructor:
      if (type)
  error ("return type specification for destructor invalid");
      /* We can't use the proper return type here because we run into
   problems with ambiguous bases and covariant returns.
   Java classes are left unchanged because (void *) isn't a valid
   Java type, and we don't want to change the Java ABI.  */
      if (targetm.cxx.cdtor_returns_this () && !TYPE_FOR_JAVA (optype))
  type = build_pointer_type (void_type_node);
      else
  type = void_type_node;
      break;

    case sfk_conversion:
      if (type && !same_type_p (type, optype))
  error ("operator %qT declared to return %qT", optype, type);
      else if (type)
  pedwarn ("return type specified for %<operator %T%>",  optype);
      type = optype;
      break;

    default:
      gcc_unreachable ();
    }

  return type;
}

/* A variable or data member (whose unqualified name is IDENTIFIER)
   has been declared with the indicated TYPE.  If the TYPE is not
   acceptable, issue an error message and return a type to use for
   error-recovery purposes.  */

tree
check_var_type (tree identifier, tree type)
{
  if (VOID_TYPE_P (type))
    {
      if (!identifier)
  error ("unnamed variable or field declared void");
      else if (TREE_CODE (identifier) == IDENTIFIER_NODE)
  {
    gcc_assert (!IDENTIFIER_OPNAME_P (identifier));
    error ("variable or field %qE declared void", identifier);
  }
      else
  error ("variable or field declared void");
      type = integer_type_node;
    }
  
  return type;
}

/* Given declspecs and a declarator (abstract or otherwise), determine
   the name and type of the object declared and construct a DECL node
   for it.

   DECLSPECS is a chain of tree_list nodes whose value fields
    are the storage classes and type specifiers.

   DECL_CONTEXT says which syntactic context this declaration is in:
     NORMAL for most contexts.  Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
     FUNCDEF for a function definition.  Like NORMAL but a few different
      error messages in each case.  Return value may be zero meaning
      this definition is too screwy to try to parse.
     MEMFUNCDEF for a function definition.  Like FUNCDEF but prepares to
      handle member functions (which have FIELD context).
      Return value may be zero meaning this definition is too screwy to
      try to parse.
     PARM for a parameter declaration (either within a function prototype
      or before a function body).  Make a PARM_DECL, or return void_type_node.
     CATCHPARM for a parameter declaration before a catch clause.
     TYPENAME if for a typename (in a cast or sizeof).
      Don't make a DECL node; just return the ..._TYPE node.
     FIELD for a struct or union field; make a FIELD_DECL.
     BITFIELD for a field with specified width.
   INITIALIZED is 1 if the decl has an initializer.

   ATTRLIST is a pointer to the list of attributes, which may be NULL
   if there are none; *ATTRLIST may be modified if attributes from inside
   the declarator should be applied to the declaration.

   When this function is called, scoping variables (such as
   CURRENT_CLASS_TYPE) should reflect the scope in which the
   declaration occurs, not the scope in which the new declaration will
   be placed.  For example, on:

     void S::f() { ... }

   when grokdeclarator is called for `S::f', the CURRENT_CLASS_TYPE
   should not be `S'.  */

tree
grokdeclarator (const cp_declarator *declarator,
    const cp_decl_specifier_seq *declspecs,
                enum decl_context decl_context,
                int initialized,
                tree* attrlist)
{
  tree type = NULL_TREE;
  int longlong = 0;
  int type_quals;
  int virtualp, explicitp, friendp, inlinep, staticp;
  int explicit_int = 0;
  int explicit_char = 0;
  int defaulted_int = 0;
  tree dependant_name = NULL_TREE;

  tree typedef_decl = NULL_TREE;
  const char *name = NULL;
  tree typedef_type = NULL_TREE;
  int funcdef_flag = 0;
  cp_declarator_kind innermost_code = cdk_error;
  int bitfield = 0;
#if 0
  /* See the code below that used this.  */
  tree decl_attr = NULL_TREE;
#endif

  /* Keep track of what sort of function is being processed
     so that we can warn about default return values, or explicit
     return values which do not match prescribed defaults.  */
  special_function_kind sfk = sfk_none;

  tree dname = NULL_TREE;
  tree ctor_return_type = NULL_TREE;
  enum overload_flags flags = NO_SPECIAL;
  cp_cv_quals quals = TYPE_UNQUALIFIED;
  tree raises = NULL_TREE;
  int template_count = 0;
  tree returned_attrs = NULL_TREE;
  tree parms = NULL_TREE;
  const cp_declarator *id_declarator;
  /* The unqualified name of the declarator; either an
     IDENTIFIER_NODE, BIT_NOT_EXPR, or TEMPLATE_ID_EXPR.  */
  tree unqualified_id;
  /* The class type, if any, in which this entity is located,
     or NULL_TREE if none.  Note that this value may be different from
     the current class type; for example if an attempt is made to declare
     "A::f" inside "B", this value will be "A".  */
  tree ctype = current_class_type;
  /* The NAMESPACE_DECL for the namespace in which this entity is
     located.  If an unqualified name is used to declare the entity,
     this value will be NULL_TREE, even if the entity is located at
     namespace scope.  */
  tree in_namespace = NULL_TREE;
  cp_decl_spec ds;
  cp_storage_class storage_class;
  bool unsigned_p, signed_p, short_p, long_p, thread_p;
  bool type_was_error_mark_node = false;

  signed_p = declspecs->specs[(int)ds_signed];
  unsigned_p = declspecs->specs[(int)ds_unsigned];
  short_p = declspecs->specs[(int)ds_short];
  long_p = declspecs->specs[(int)ds_long];
  thread_p = declspecs->specs[(int)ds_thread];

  if (decl_context == FUNCDEF)
    funcdef_flag = 1, decl_context = NORMAL;
  else if (decl_context == MEMFUNCDEF)
    funcdef_flag = -1, decl_context = FIELD;
  else if (decl_context == BITFIELD)
    bitfield = 1, decl_context = FIELD;

  /* Look inside a declarator for the name being declared
     and get it as a string, for an error message.  */
  for (id_declarator = declarator;
       id_declarator;
       id_declarator = id_declarator->declarator)
    {
      if (id_declarator->kind != cdk_id)
  innermost_code = id_declarator->kind;

      switch (id_declarator->kind)
  {
  case cdk_function:
    if (id_declarator->declarator
        && id_declarator->declarator->kind == cdk_id)
      {
        sfk = id_declarator->declarator->u.id.sfk;
        if (sfk == sfk_destructor)
    flags = DTOR_FLAG;
      }
    break;

  case cdk_id:
    {
      tree qualifying_scope = id_declarator->u.id.qualifying_scope;
      tree decl = id_declarator->u.id.unqualified_name;
      if (!decl)
        break;
      if (qualifying_scope)
        {
    if (TYPE_P (qualifying_scope))
      {
        ctype = qualifying_scope;
        if (innermost_code != cdk_function
      && current_class_type
      && !UNIQUELY_DERIVED_FROM_P (ctype,
                 current_class_type))
          {
      error ("type %qT is not derived from type %qT",
             ctype, current_class_type);
      return error_mark_node;
          }
      }
    else if (TREE_CODE (qualifying_scope) == NAMESPACE_DECL)
      in_namespace = qualifying_scope;
        }
      if (TREE_CODE (decl) == BASELINK)
        decl = BASELINK_FUNCTIONS (decl);
      if (decl == error_mark_node)
        return error_mark_node;
      switch (TREE_CODE (decl))
        {
        case BIT_NOT_EXPR:
    {
      tree type;

      if (innermost_code != cdk_function)
        {
          error ("declaration of %qD as non-function", decl);
          return error_mark_node;
        }
      else if (!qualifying_scope 
         && !(current_class_type && at_class_scope_p ()))
        {
          error ("declaration of %qD as non-member", decl);
          return error_mark_node;
        }
      
      type = TREE_OPERAND (decl, 0);
      name = IDENTIFIER_POINTER (constructor_name (type));
    }
    break;

        case TEMPLATE_ID_EXPR:
    {
      tree fns = TREE_OPERAND (decl, 0);

      dname = fns;
      if (TREE_CODE (dname) == COMPONENT_REF)
        dname = TREE_OPERAND (dname, 1);
      if (TREE_CODE (dname) != IDENTIFIER_NODE)
        {
          gcc_assert (is_overloaded_fn (dname));
          dname = DECL_NAME (get_first_fn (dname));
        }
    }
    /* Fall through.  */

        case IDENTIFIER_NODE:
    if (TREE_CODE (decl) == IDENTIFIER_NODE)
      dname = decl;

    if (C_IS_RESERVED_WORD (dname))
      {
        error ("declarator-id missing; using reserved word %qD",
         dname);
        name = IDENTIFIER_POINTER (dname);
      }
    else if (!IDENTIFIER_TYPENAME_P (dname))
      name = IDENTIFIER_POINTER (dname);
    else
      {
        gcc_assert (flags == NO_SPECIAL);
        flags = TYPENAME_FLAG;
        ctor_return_type = TREE_TYPE (dname);
        sfk = sfk_conversion;
        if (is_typename_at_global_scope (dname))
          name = IDENTIFIER_POINTER (dname);
        else
          name = "<invalid operator>";
      }
    break;

        case TYPE_DECL:
    dname = constructor_name (TREE_TYPE (decl));
    name = IDENTIFIER_POINTER (dname);
    break;

        default:
    gcc_unreachable ();
        }
      break;

    case cdk_array:
    case cdk_pointer:
    case cdk_reference:
    case cdk_ptrmem:
      break;

    case cdk_error:
      break;

    default:
      gcc_unreachable ();
    }
  }
      if (id_declarator->kind == cdk_id)
  break;
    }

  /* A function definition's declarator must have the form of
     a function declarator.  */

  if (funcdef_flag && innermost_code != cdk_function)
    return 0;

  if (((dname && IDENTIFIER_OPNAME_P (dname)) || flags == TYPENAME_FLAG)
      && innermost_code != cdk_function
      && ! (ctype && !declspecs->any_specifiers_p))
    {
      error ("declaration of %qD as non-function", dname);
      return error_mark_node;
    }

  /* Anything declared one level down from the top level
     must be one of the parameters of a function
     (because the body is at least two levels down).  */

  /* This heuristic cannot be applied to C++ nodes! Fixed, however,
     by not allowing C++ class definitions to specify their parameters
     with xdecls (must be spec.d in the parmlist).

     Since we now wait to push a class scope until we are sure that
     we are in a legitimate method context, we must set oldcname
     explicitly (since current_class_name is not yet alive).

     We also want to avoid calling this a PARM if it is in a namespace.  */

  if (decl_context == NORMAL && !toplevel_bindings_p ())
    {
      struct cp_binding_level *b = current_binding_level;
      current_binding_level = b->level_chain;
      if (current_binding_level != 0 && toplevel_bindings_p ())
  decl_context = PARM;
      current_binding_level = b;
    }

  if (name == NULL)
    name = decl_context == PARM ? "parameter" : "type name";

  /* If there were multiple types specified in the decl-specifier-seq,
     issue an error message.  */
  if (declspecs->multiple_types_p)
    error ("two or more data types in declaration of %qs", name);
  /* Extract the basic type from the decl-specifier-seq.  */
  type = declspecs->type;
  if (type == error_mark_node)
    {
      type = NULL_TREE;
      type_was_error_mark_node = true;
    }
  /* If the entire declaration is itself tagged as deprecated then
     suppress reports of deprecated items.  */
  if (type && TREE_DEPRECATED (type)
      && deprecated_state != DEPRECATED_SUPPRESS)
    warn_deprecated_use (type);
  if (type && TREE_CODE (type) == TYPE_DECL)
    {
      typedef_decl = type;
      type = TREE_TYPE (typedef_decl);
    }
  /* No type at all: default to `int', and set DEFAULTED_INT
     because it was not a user-defined typedef.  */
  if (type == NULL_TREE && (signed_p || unsigned_p || long_p || short_p))
    {
      /* These imply 'int'.  */
      type = integer_type_node;
      defaulted_int = 1;
    }
  /* Gather flags.  */
  explicit_int = declspecs->explicit_int_p;
  explicit_char = declspecs->explicit_char_p;

  /* Check for repeated decl-specifiers.  */
  for (ds = ds_first; ds != ds_last; ++ds)
    {
      unsigned count = declspecs->specs[(int)ds];
      if (count < 2)
  continue;
      /* The "long" specifier is a special case because of
   "long long".  */
      if (ds == ds_long)
  {
    if (count > 2)
      error ("%<long long long%> is too long for GCC");
    else if (pedantic && !in_system_header && warn_long_long)
      pedwarn ("ISO C++ does not support %<long long%>");
    else
      longlong = 1;
  }
      else if (declspecs->specs[(int)ds] > 1)
  {
    static const char *const decl_spec_names[] = {
      "signed",
      "unsigned",
      "short",
      "long",
      "const",
      "volatile",
      "restrict",
      "inline",
      "virtual",
      "explicit",
      "friend",
      "typedef",
      "__complex",
      "__thread"
    };
    error ("duplicate %qs", decl_spec_names[(int)ds]);
  }
    }

#if 0
  /* See the code below that used this.  */
  if (typedef_decl)
    decl_attr = DECL_ATTRIBUTES (typedef_decl);
#endif
  typedef_type = type;


  if (sfk != sfk_conversion)
    ctor_return_type = ctype;

  if (sfk != sfk_none)
    type = check_special_function_return_type (sfk, type,
                 ctor_return_type);
  else if (type == NULL_TREE)
    {
      int is_main;

      explicit_int = -1;

      /* We handle `main' specially here, because 'main () { }' is so
   common.  With no options, it is allowed.  With -Wreturn-type,
   it is a warning.  It is only an error with -pedantic-errors.  */
      is_main = (funcdef_flag
     && dname && MAIN_NAME_P (dname)
     && ctype == NULL_TREE
     && in_namespace == NULL_TREE
     && current_namespace == global_namespace);

      if (type_was_error_mark_node)
  /* We've already issued an error, don't complain more.  */;
      else if (in_system_header || flag_ms_extensions)
  /* Allow it, sigh.  */;
      else if (pedantic || ! is_main)
  pedwarn ("ISO C++ forbids declaration of %qs with no type", name);
      else if (warn_return_type)
  warning ("ISO C++ forbids declaration of %qs with no type", name);

      type = integer_type_node;
    }

  ctype = NULL_TREE;

  /* Now process the modifiers that were specified
     and check for invalid combinations.  */

  /* Long double is a special combination.  */
  if (long_p && TYPE_MAIN_VARIANT (type) == double_type_node)
    {
      long_p = false;
      type = build_qualified_type (long_double_type_node,
           cp_type_quals (type));
    }

  /* Check all other uses of type modifiers.  */

  if (unsigned_p || signed_p || long_p || short_p)
    {
      int ok = 0;

      if (TREE_CODE (type) == REAL_TYPE)
  error ("short, signed or unsigned invalid for %qs", name);
      else if (TREE_CODE (type) != INTEGER_TYPE)
  error ("long, short, signed or unsigned invalid for %qs", name);
      else if (long_p && short_p)
  error ("long and short specified together for %qs", name);
      else if ((long_p || short_p) && explicit_char)
  error ("long or short specified with char for %qs", name);
      else if ((long_p|| short_p) && TREE_CODE (type) == REAL_TYPE)
  error ("long or short specified with floating type for %qs", name);
      else if (signed_p && unsigned_p)
  error ("signed and unsigned given together for %qs", name);
      else
  {
    ok = 1;
    if (!explicit_int && !defaulted_int && !explicit_char && pedantic)
      {
        pedwarn ("long, short, signed or unsigned used invalidly for %qs",
           name);
        if (flag_pedantic_errors)
    ok = 0;
      }
  }

      /* Discard the type modifiers if they are invalid.  */
      if (! ok)
  {
    unsigned_p = false;
    signed_p = false;
    long_p = false;
    short_p = false;
    longlong = 0;
  }
    }

  /* Decide whether an integer type is signed or not.
     Optionally treat bitfields as signed by default.  */
  if (unsigned_p
      /* [class.bit]

   It is implementation-defined whether a plain (neither
   explicitly signed or unsigned) char, short, int, or long
   bit-field is signed or unsigned.

   Naturally, we extend this to long long as well.  Note that
   this does not include wchar_t.  */
      || (bitfield && !flag_signed_bitfields
    && !signed_p
    /* A typedef for plain `int' without `signed' can be
       controlled just like plain `int', but a typedef for
       `signed int' cannot be so controlled.  */
    && !(typedef_decl
         && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl))
    && (TREE_CODE (type) == INTEGER_TYPE
        || TREE_CODE (type) == CHAR_TYPE)
    && !same_type_p (TYPE_MAIN_VARIANT (type), wchar_type_node)))
    {
      if (longlong)
    {
#ifdef TARG_SL
      if (Long_Long_Support == TRUE)
      {
        type = long_long_unsigned_type_node;
      }
      else
      {
        warning("\"unsigned long long\" is mapped to \"unsinged long\" in declaration %s, "
                "Please use \"-mlong-long\" option to enbale long long type supporting", name);
        type = long_unsigned_type_node;
      }
#else
      type = long_long_unsigned_type_node;
#endif
    }
      else if (long_p)
  type = long_unsigned_type_node;
      else if (short_p)
  type = short_unsigned_type_node;
      else if (type == char_type_node)
  type = unsigned_char_type_node;
      else if (typedef_decl)
  type = c_common_unsigned_type (type);
      else
  type = unsigned_type_node;
    }
  else if (signed_p && type == char_type_node)
    type = signed_char_type_node;
  else if (longlong)
  {
#ifdef TARG_SL
      if (Long_Long_Support == TRUE)
      {
        type = long_long_integer_type_node;
      }
      else
      {
        warning("\"long long\" is mapped to \"long\" in declaration %s, "
                "Please use \"-mlong-long\" option to enbale long long type supporting", name);
        type = long_integer_type_node;
      }
#else
    type = long_long_integer_type_node;
#endif
  }
  else if (long_p)
    type = long_integer_type_node;
  else if (short_p)
    type = short_integer_type_node;

  if (declspecs->specs[(int)ds_complex])
    {
#ifdef TARG_SL
      error("Unsupported type: \"complex\"");
#endif
      if (TREE_CODE (type) != INTEGER_TYPE && TREE_CODE (type) != REAL_TYPE)
  error ("complex invalid for %qs", name);
      /* If we just have "complex", it is equivalent to
   "complex double", but if any modifiers at all are specified it is
   the complex form of TYPE.  E.g, "complex short" is
   "complex short int".  */

      else if (defaulted_int && ! longlong
         && ! (long_p || short_p || signed_p || unsigned_p))
  type = complex_double_type_node;
      else if (type == integer_type_node)
  type = complex_integer_type_node;
      else if (type == float_type_node)
  type = complex_float_type_node;
      else if (type == double_type_node)
  type = complex_double_type_node;
      else if (type == long_double_type_node)
  type = complex_long_double_type_node;
      else
  type = build_complex_type (type);
    }

#ifdef TARG_SL
      if (TREE_CODE(type) == REAL_TYPE)
      {
        if (TYPE_MAIN_VARIANT(type) == double_type_node || TYPE_MAIN_VARIANT(type) == float_type_node)
        {
          if (Float_Point_Support == FALSE)
          {
            error("\"float/double\" type is not supported in default mode, "
                  "Please use \"-msoft-float\" option to enable float point emulation");
          }
        }
        else
        {
          warning("Unsupported real type");
        }
      }
#endif


  type_quals = TYPE_UNQUALIFIED;
  if (declspecs->specs[(int)ds_const])
    type_quals |= TYPE_QUAL_CONST;
  if (declspecs->specs[(int)ds_volatile])
    type_quals |= TYPE_QUAL_VOLATILE;
  if (declspecs->specs[(int)ds_restrict])
    type_quals |= TYPE_QUAL_RESTRICT;
  if (sfk == sfk_conversion && type_quals != TYPE_UNQUALIFIED)
    error ("qualifiers are not allowed on declaration of %<operator %T%>",
           ctor_return_type);

  if (TREE_CODE (type) == FUNCTION_TYPE 
      && type_quals != TYPE_UNQUALIFIED)
    {
      /* This was an error in C++98 (cv-qualifiers cannot be added to
         a function type), but DR 295 makes the code well-formed by
         dropping the extra qualifiers. */
      if (pedantic)
        {
          tree bad_type = build_qualified_type (type, type_quals);
          pedwarn ("ignoring %qV qualifiers added to function type %qT",
                   bad_type, type);
        }
      type_quals = TYPE_UNQUALIFIED;
    }
  type_quals |= cp_type_quals (type);
  type = cp_build_qualified_type_real
    (type, type_quals, ((typedef_decl && !DECL_ARTIFICIAL (typedef_decl)
       ? tf_ignore_bad_quals : 0) | tf_error | tf_warning));
  /* We might have ignored or rejected some of the qualifiers.  */
  type_quals = cp_type_quals (type);

  staticp = 0;
  inlinep = !! declspecs->specs[(int)ds_inline];
  virtualp = !! declspecs->specs[(int)ds_virtual];
  explicitp = !! declspecs->specs[(int)ds_explicit];

  storage_class = declspecs->storage_class;
  if (storage_class == sc_static)
    staticp = 1 + (decl_context == FIELD);

  if (virtualp && staticp == 2)
    {
      error ("member %qD cannot be declared both virtual and static", dname);
      staticp = 0;
    }
  friendp = !! declspecs->specs[(int)ds_friend];

  if (dependant_name && !friendp)
    {
      error ("%<%T::%D%> is not a valid declarator", ctype, dependant_name);
      return void_type_node;
    }

  /* Issue errors about use of storage classes for parameters.  */
  if (decl_context == PARM)
    {
      if (declspecs->specs[(int)ds_typedef])
  error ("typedef declaration invalid in parameter declaration");
      else if (storage_class == sc_static
         || storage_class == sc_extern
         || thread_p)
  error ("storage class specifiers invalid in parameter declarations");
    }

  /* Give error if `virtual' is used outside of class declaration.  */
  if (virtualp
      && (current_class_name == NULL_TREE || decl_context != FIELD))
    {
      error ("virtual outside class declaration");
      virtualp = 0;
    }

  /* Static anonymous unions are dealt with here.  */
  if (staticp && decl_context == TYPENAME
      && declspecs->type
      && ANON_AGGR_TYPE_P (declspecs->type))
    decl_context = FIELD;

  /* Warn about storage classes that are invalid for certain
     kinds of declarations (parameters, typenames, etc.).  */
  if (declspecs->multiple_storage_classes_p)
    {
      error ("multiple storage classes in declaration of %qs", name);
      storage_class = sc_none;
    }
  else if (thread_p
     && ((storage_class
    && storage_class != sc_extern
    && storage_class != sc_static)
         || declspecs->specs[(int)ds_typedef]))
    {
      error ("multiple storage classes in declaration of %qs", name);
      thread_p = false;
    }
  else if (decl_context != NORMAL
     && ((storage_class != sc_none
    && storage_class != sc_mutable)
         || thread_p))
    {
      if ((decl_context == PARM || decl_context == CATCHPARM)
    && (storage_class == sc_register
        || storage_class == sc_auto))
  ;
      else if (declspecs->specs[(int)ds_typedef])
  ;
      else if (decl_context == FIELD
         /* C++ allows static class elements.  */
         && storage_class == sc_static)
  /* C++ also allows inlines and signed and unsigned elements,
     but in those cases we don't come in here.  */
  ;
      else
  {
    if (decl_context == FIELD)
      error ("storage class specified for %qs", name);
    else
      {
        if (decl_context == PARM || decl_context == CATCHPARM)
    error ("storage class specified for parameter %qs", name);
        else
    error ("storage class specified for typename");
      }
    if (storage_class == sc_register
        || storage_class == sc_auto
        || storage_class == sc_extern
        || thread_p)
      storage_class = sc_none;
  }
    }
  else if (storage_class == sc_extern && initialized
     && !funcdef_flag)
    {
      if (toplevel_bindings_p ())
  {
    /* It's common practice (and completely valid) to have a const
       be initialized and declared extern.  */
    if (!(type_quals & TYPE_QUAL_CONST))
      warning ("%qs initialized and declared %<extern%>", name);
  }
      else
  error ("%qs has both %<extern%> and initializer", name);
    }
  else if (storage_class == sc_extern && funcdef_flag
     && ! toplevel_bindings_p ())
    error ("nested function %qs declared %<extern%>", name);
  else if (toplevel_bindings_p ())
    {
      if (storage_class == sc_auto)
  error ("top-level declaration of %qs specifies %<auto%>", name);
    }
  else if (thread_p
     && storage_class != sc_extern
     && storage_class != sc_static)
    {
      error ("function-scope %qs implicitly auto and declared %<__thread%>",
       name);
      thread_p = false;
    }

  if (storage_class && friendp)
    error ("storage class specifiers invalid in friend function declarations");

  if (!id_declarator)
    unqualified_id = NULL_TREE;
  else
    {
      unqualified_id = id_declarator->u.id.unqualified_name;
      if (TREE_CODE (unqualified_id) == BASELINK)
  unqualified_id = BASELINK_FUNCTIONS (unqualified_id);
      switch (TREE_CODE (unqualified_id))
  {
  case BIT_NOT_EXPR:
    unqualified_id
      = constructor_name (TREE_OPERAND (unqualified_id, 0));
    break;

  case TYPE_DECL:
    unqualified_id
      = constructor_name (TREE_TYPE (unqualified_id));
    break;

  case IDENTIFIER_NODE:
  case TEMPLATE_ID_EXPR:
    break;

  default:
    gcc_unreachable ();
  }
    }

  /* Determine the type of the entity declared by recurring on the
     declarator.  */
  for (; declarator; declarator = declarator->declarator)
    {
      const cp_declarator *inner_declarator;
      tree attrs;

      if (type == error_mark_node)
  return error_mark_node;

      attrs = declarator->attributes;
      if (attrs)
  {
    int attr_flags;

    attr_flags = 0;
    if (declarator == NULL || declarator->kind == cdk_id)
      attr_flags |= (int) ATTR_FLAG_DECL_NEXT;
    if (declarator->kind == cdk_function)
      attr_flags |= (int) ATTR_FLAG_FUNCTION_NEXT;
    if (declarator->kind == cdk_array)
      attr_flags |= (int) ATTR_FLAG_ARRAY_NEXT;
    returned_attrs = decl_attributes (&type,
              chainon (returned_attrs, attrs),
              attr_flags);
  }

      if (declarator->kind == cdk_id)
  break;

      inner_declarator = declarator->declarator;

      switch (declarator->kind)
  {
  case cdk_array:
    type = create_array_type_for_decl (dname, type,
               declarator->u.array.bounds);
    break;

  case cdk_function:
    {
      tree arg_types;
      int funcdecl_p;

      /* Declaring a function type.
         Make sure we have a valid type for the function to return.  */

      /* We now know that the TYPE_QUALS don't apply to the
               decl, but to its return type.  */
      type_quals = TYPE_UNQUALIFIED;

      /* Warn about some types functions can't return.  */

      if (TREE_CODE (type) == FUNCTION_TYPE)
        {
    error ("%qs declared as function returning a function", name);
    type = integer_type_node;
        }
      if (TREE_CODE (type) == ARRAY_TYPE)
        {
    error ("%qs declared as function returning an array", name);
    type = integer_type_node;
        }

      /* Pick up type qualifiers which should be applied to `this'.  */
      quals = declarator->u.function.qualifiers;

      /* Pick up the exception specifications.  */
      raises = declarator->u.function.exception_specification;

      /* Say it's a definition only for the CALL_EXPR
         closest to the identifier.  */
      funcdecl_p = inner_declarator && inner_declarator->kind == cdk_id;

      if (ctype == NULL_TREE
    && decl_context == FIELD
    && funcdecl_p
    && (friendp == 0 || dname == current_class_name))
        ctype = current_class_type;

      if (ctype && sfk == sfk_conversion)
        TYPE_HAS_CONVERSION (ctype) = 1;
      if (ctype && (sfk == sfk_constructor
        || sfk == sfk_destructor))
        {
    /* We are within a class's scope. If our declarator name
       is the same as the class name, and we are defining
       a function, then it is a constructor/destructor, and
       therefore returns a void type.  */

    if (flags == DTOR_FLAG)
      {
        /* ISO C++ 12.4/2.  A destructor may not be
           declared const or volatile.  A destructor may
           not be static.  */
        if (staticp == 2)
          error ("destructor cannot be static member function");
        if (quals)
          {
      error ("destructors may not be cv-qualified");
      quals = TYPE_UNQUALIFIED;
          }
        if (decl_context == FIELD)
          {
      if (! member_function_or_else (ctype,
                   current_class_type,
                   flags))
        return void_type_node;
          }
      }
    else            /* It's a constructor.  */
      {
        if (explicitp == 1)
          explicitp = 2;
        /* ISO C++ 12.1.  A constructor may not be
           declared const or volatile.  A constructor may
           not be virtual.  A constructor may not be
           static.  */
        if (staticp == 2)
          error ("constructor cannot be static member function");
        if (virtualp)
          {
      pedwarn ("constructors cannot be declared virtual");
      virtualp = 0;
          }
        if (quals)
          {
      error ("constructors may not be cv-qualified");
      quals = TYPE_UNQUALIFIED;
          }
        if (decl_context == FIELD)
          {
      if (! member_function_or_else (ctype,
                   current_class_type,
                   flags))
        return void_type_node;
      TYPE_HAS_CONSTRUCTOR (ctype) = 1;
      if (sfk != sfk_constructor)
        return NULL_TREE;
          }
      }
    if (decl_context == FIELD)
      staticp = 0;
        }
      else if (friendp)
        {
    if (initialized)
      error ("can't initialize friend function %qs", name);
    if (virtualp)
      {
        /* Cannot be both friend and virtual.  */
        error ("virtual functions cannot be friends");
        friendp = 0;
      }
    if (decl_context == NORMAL)
      error ("friend declaration not in class definition");
    if (current_function_decl && funcdef_flag)
      error ("can't define friend function %qs in a local "
                         "class definition",
                         name);
        }

      arg_types = grokparms (declarator->u.function.parameters,
           &parms);

      if (inner_declarator
    && inner_declarator->kind == cdk_id
    && inner_declarator->u.id.sfk == sfk_destructor
    && arg_types != void_list_node)
        {
    error ("destructors may not have parameters");
    arg_types = void_list_node;
    parms = NULL_TREE;
        }

      type = build_function_type (type, arg_types);
            type = cp_build_qualified_type (type, quals);
    }
    break;

  case cdk_pointer:
  case cdk_reference:
  case cdk_ptrmem:
    /* Filter out pointers-to-references and references-to-references.
       We can get these if a TYPE_DECL is used.  */

    if (TREE_CODE (type) == REFERENCE_TYPE)
      {
        error (declarator->kind == cdk_reference
         ? "cannot declare reference to %q#T"
         : "cannot declare pointer to %q#T", type);
        type = TREE_TYPE (type);
      }
    else if (VOID_TYPE_P (type))
      {
        if (declarator->kind == cdk_reference)
    error ("cannot declare reference to %q#T", type);
        else if (declarator->kind == cdk_ptrmem)
    error ("cannot declare pointer to %q#T member", type);
      }

    /* We now know that the TYPE_QUALS don't apply to the decl,
       but to the target of the pointer.  */
    type_quals = TYPE_UNQUALIFIED;

    if (declarator->kind == cdk_ptrmem
        && (TREE_CODE (type) == FUNCTION_TYPE
      || (quals && TREE_CODE (type) == METHOD_TYPE)))
      {
        tree dummy;
        
              /* If the type is a FUNCTION_TYPE, pick up the
                 qualifiers from that function type. No other
                 qualifiers may be supplied. */
              if (TREE_CODE (type) == FUNCTION_TYPE)
                quals = cp_type_quals (type);

        dummy = build_decl (TYPE_DECL, NULL_TREE, type);
        grok_method_quals (declarator->u.pointer.class_type,
         dummy, quals);
        type = TREE_TYPE (dummy);
        quals = TYPE_UNQUALIFIED;
      }

    if (declarator->kind == cdk_reference)
      {
        if (!VOID_TYPE_P (type))
    type = build_reference_type (type);
      }
    else if (TREE_CODE (type) == METHOD_TYPE)
      type = build_ptrmemfunc_type (build_pointer_type (type));
    else if (declarator->kind == cdk_ptrmem)
      {
        /* We might have parsed a namespace as the class type.  */
        if (TREE_CODE (declarator->u.pointer.class_type)
      == NAMESPACE_DECL)
    {
      error ("%qD is a namespace",
       declarator->u.pointer.class_type);
      type = build_pointer_type (type);
    }
        else if (declarator->u.pointer.class_type == error_mark_node)
    /* We will already have complained.  */
    type = error_mark_node;
        else
    type = build_ptrmem_type (declarator->u.pointer.class_type,
            type);
      }
    else
      type = build_pointer_type (type);

    /* Process a list of type modifier keywords (such as
       const or volatile) that were given inside the `*' or `&'.  */

    if (declarator->u.pointer.qualifiers)
      {
        type
    = cp_build_qualified_type (type,
             declarator->u.pointer.qualifiers);
        type_quals = cp_type_quals (type);
      }
    ctype = NULL_TREE;
    break;

  case cdk_error:
    break;

  default:
    gcc_unreachable ();
  }
    }

  if (unqualified_id && TREE_CODE (unqualified_id) == TEMPLATE_ID_EXPR
      && TREE_CODE (type) != FUNCTION_TYPE
      && TREE_CODE (type) != METHOD_TYPE)
    {
      error ("template-id %qD used as a declarator",
       unqualified_id);
      unqualified_id = dname;
    }

  /* If DECLARATOR is non-NULL, we know it is a cdk_id declarator;
     otherwise, we would not have exited the loop above.  */
  if (declarator
      && declarator->u.id.qualifying_scope
      && TYPE_P (declarator->u.id.qualifying_scope))
    {
      tree t;

      ctype = declarator->u.id.qualifying_scope;
      ctype = TYPE_MAIN_VARIANT (ctype);
      t = ctype;
      while (t != NULL_TREE && CLASS_TYPE_P (t))
  {
    /* You're supposed to have one `template <...>' for every
       template class, but you don't need one for a full
       specialization.  For example:

         template <class T> struct S{};
         template <> struct S<int> { void f(); };
         void S<int>::f () {}

       is correct; there shouldn't be a `template <>' for the
       definition of `S<int>::f'.  */
    if (CLASSTYPE_TEMPLATE_INFO (t)
        && (CLASSTYPE_TEMPLATE_INSTANTIATION (t)
      || uses_template_parms (CLASSTYPE_TI_ARGS (t)))
        && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t)))
      template_count += 1;

    t = TYPE_MAIN_DECL (t);
    t = DECL_CONTEXT (t);
  }

      if (ctype == current_class_type)
  {
    /* class A {
         void A::f ();
       };

       Is this ill-formed?  */

    if (pedantic)
      pedwarn ("extra qualification %<%T::%> on member %qs ignored",
      ctype, name);
  }
      else if (TREE_CODE (type) == FUNCTION_TYPE)
  {
    tree sname = declarator->u.id.unqualified_name;

    if (TREE_CODE (sname) == IDENTIFIER_NODE
        && NEW_DELETE_OPNAME_P (sname))
      /* Overloaded operator new and operator delete
         are always static functions.  */
      ;
    else if (current_class_type == NULL_TREE || friendp)
      type
        = build_method_type_directly (ctype,
              TREE_TYPE (type),
              TYPE_ARG_TYPES (type));
    else
      {
        error ("cannot declare member function %<%T::%s%> within %<%T%>",
         ctype, name, current_class_type);
        return error_mark_node;
      }
  }
      else if (declspecs->specs[(int)ds_typedef]
         || COMPLETE_TYPE_P (complete_type (ctype)))
  {
    /* Have to move this code elsewhere in this function.
       this code is used for i.e., typedef int A::M; M *pm;

       It is?  How? jason 10/2/94 */

    if (current_class_type)
      {
        error ("cannot declare member %<%T::%s%> within %qT",
         ctype, name, current_class_type);
        return void_type_node;
      }
  }
      else
  {
    cxx_incomplete_type_error (NULL_TREE, ctype);
    return error_mark_node;
  }
    }

  if (returned_attrs)
    {
      if (attrlist)
  *attrlist = chainon (returned_attrs, *attrlist);
      else
  attrlist = &returned_attrs;
    }

  /* Now TYPE has the actual type.  */

  /* Did array size calculations overflow?  */

  if (TREE_CODE (type) == ARRAY_TYPE
      && COMPLETE_TYPE_P (type)