1996-09-18 05:35:50 +00:00
|
|
|
|
/* Report error messages, build initializers, and perform
|
|
|
|
|
some front-end optimizations for C++ compiler.
|
2002-02-01 18:16:02 +00:00
|
|
|
|
Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
|
2007-05-19 01:19:51 +00:00
|
|
|
|
1999, 2000, 2001, 2002, 2004, 2005, 2006
|
|
|
|
|
Free Software Foundation, Inc.
|
1996-09-18 05:35:50 +00:00
|
|
|
|
Hacked by Michael Tiemann (tiemann@cygnus.com)
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
This file is part of GCC.
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
GCC is free software; you can redistribute it and/or modify
|
1996-09-18 05:35:50 +00:00
|
|
|
|
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.
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
GCC is distributed in the hope that it will be useful,
|
1996-09-18 05:35:50 +00:00
|
|
|
|
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
|
2004-07-28 03:11:36 +00:00
|
|
|
|
along with GCC; see the file COPYING. If not, write to
|
2007-05-19 01:19:51 +00:00
|
|
|
|
the Free Software Foundation, 51 Franklin Street, Fifth Floor,
|
|
|
|
|
Boston, MA 02110-1301, USA. */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* This file is part of the C++ front end.
|
|
|
|
|
It contains routines to build C++ expressions given their operands,
|
|
|
|
|
including computing the types of the result, C and C++ specific error
|
2007-05-19 01:19:51 +00:00
|
|
|
|
checks, and some optimization. */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
#include "config.h"
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#include "system.h"
|
2004-07-28 03:11:36 +00:00
|
|
|
|
#include "coretypes.h"
|
|
|
|
|
#include "tm.h"
|
1996-09-18 05:35:50 +00:00
|
|
|
|
#include "tree.h"
|
|
|
|
|
#include "cp-tree.h"
|
|
|
|
|
#include "flags.h"
|
1999-08-26 09:30:50 +00:00
|
|
|
|
#include "toplev.h"
|
2002-02-01 18:16:02 +00:00
|
|
|
|
#include "output.h"
|
|
|
|
|
#include "diagnostic.h"
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
static tree
|
|
|
|
|
process_init_constructor (tree type, tree init);
|
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* Print an error message stemming from an attempt to use
|
|
|
|
|
BASETYPE as a base class for TYPE. */
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
tree
|
2004-07-28 03:11:36 +00:00
|
|
|
|
error_not_base_type (tree basetype, tree type)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
|
|
|
|
if (TREE_CODE (basetype) == FUNCTION_DECL)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
basetype = DECL_CONTEXT (basetype);
|
2007-05-19 01:19:51 +00:00
|
|
|
|
error ("type %qT is not a base type for type %qT", basetype, type);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
return error_mark_node;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
tree
|
2004-07-28 03:11:36 +00:00
|
|
|
|
binfo_or_else (tree base, tree type)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
tree binfo = lookup_base (type, base, ba_unique, NULL);
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
if (binfo == error_mark_node)
|
|
|
|
|
return NULL_TREE;
|
|
|
|
|
else if (!binfo)
|
|
|
|
|
error_not_base_type (base, type);
|
|
|
|
|
return binfo;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* According to ARM $7.1.6, "A `const' object may be initialized, but its
|
|
|
|
|
value may not be changed thereafter. Thus, we emit hard errors for these,
|
|
|
|
|
rather than just pedwarns. If `SOFT' is 1, then we just pedwarn. (For
|
|
|
|
|
example, conversions to references.) */
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
void
|
2004-07-28 03:11:36 +00:00
|
|
|
|
readonly_error (tree arg, const char* string, int soft)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
1999-10-16 06:09:09 +00:00
|
|
|
|
const char *fmt;
|
2007-05-19 01:19:51 +00:00
|
|
|
|
void (*fn) (const char *, ...) ATTRIBUTE_GCC_CXXDIAG(1,2);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
if (soft)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
fn = pedwarn;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
else
|
2002-02-01 18:16:02 +00:00
|
|
|
|
fn = error;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
if (TREE_CODE (arg) == COMPONENT_REF)
|
|
|
|
|
{
|
|
|
|
|
if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
|
2007-05-19 01:19:51 +00:00
|
|
|
|
fmt = "%s of data-member %qD in read-only structure";
|
1996-09-18 05:35:50 +00:00
|
|
|
|
else
|
2007-05-19 01:19:51 +00:00
|
|
|
|
fmt = "%s of read-only data-member %qD";
|
1999-08-26 09:30:50 +00:00
|
|
|
|
(*fn) (fmt, string, TREE_OPERAND (arg, 1));
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
|
|
|
|
else if (TREE_CODE (arg) == VAR_DECL)
|
|
|
|
|
{
|
|
|
|
|
if (DECL_LANG_SPECIFIC (arg)
|
|
|
|
|
&& DECL_IN_AGGR_P (arg)
|
|
|
|
|
&& !TREE_STATIC (arg))
|
2007-05-19 01:19:51 +00:00
|
|
|
|
fmt = "%s of constant field %qD";
|
1996-09-18 05:35:50 +00:00
|
|
|
|
else
|
2007-05-19 01:19:51 +00:00
|
|
|
|
fmt = "%s of read-only variable %qD";
|
1999-08-26 09:30:50 +00:00
|
|
|
|
(*fn) (fmt, string, arg);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
|
|
|
|
else if (TREE_CODE (arg) == PARM_DECL)
|
2007-05-19 01:19:51 +00:00
|
|
|
|
(*fn) ("%s of read-only parameter %qD", string, arg);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
else if (TREE_CODE (arg) == INDIRECT_REF
|
2007-05-19 01:19:51 +00:00
|
|
|
|
&& TREE_CODE (TREE_TYPE (TREE_OPERAND (arg, 0))) == REFERENCE_TYPE
|
|
|
|
|
&& (TREE_CODE (TREE_OPERAND (arg, 0)) == VAR_DECL
|
|
|
|
|
|| TREE_CODE (TREE_OPERAND (arg, 0)) == PARM_DECL))
|
|
|
|
|
(*fn) ("%s of read-only reference %qD", string, TREE_OPERAND (arg, 0));
|
1996-09-18 05:35:50 +00:00
|
|
|
|
else if (TREE_CODE (arg) == RESULT_DECL)
|
2007-05-19 01:19:51 +00:00
|
|
|
|
(*fn) ("%s of read-only named return value %qD", string, arg);
|
1999-10-16 06:09:09 +00:00
|
|
|
|
else if (TREE_CODE (arg) == FUNCTION_DECL)
|
2007-05-19 01:19:51 +00:00
|
|
|
|
(*fn) ("%s of function %qD", string, arg);
|
1999-10-16 06:09:09 +00:00
|
|
|
|
else
|
1996-09-18 05:35:50 +00:00
|
|
|
|
(*fn) ("%s of read-only location", string);
|
|
|
|
|
}
|
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
|
|
|
|
|
/* Structure that holds information about declarations whose type was
|
|
|
|
|
incomplete and we could not check whether it was abstract or not. */
|
|
|
|
|
|
|
|
|
|
struct pending_abstract_type GTY((chain_next ("%h.next")))
|
|
|
|
|
{
|
|
|
|
|
/* Declaration which we are checking for abstractness. It is either
|
|
|
|
|
a DECL node, or an IDENTIFIER_NODE if we do not have a full
|
|
|
|
|
declaration available. */
|
|
|
|
|
tree decl;
|
|
|
|
|
|
|
|
|
|
/* Type which will be checked for abstractness. */
|
|
|
|
|
tree type;
|
|
|
|
|
|
|
|
|
|
/* Position of the declaration. This is only needed for IDENTIFIER_NODEs,
|
|
|
|
|
because DECLs already carry locus information. */
|
|
|
|
|
location_t locus;
|
|
|
|
|
|
|
|
|
|
/* Link to the next element in list. */
|
|
|
|
|
struct pending_abstract_type* next;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Compute the hash value of the node VAL. This function is used by the
|
|
|
|
|
hash table abstract_pending_vars. */
|
|
|
|
|
|
|
|
|
|
static hashval_t
|
|
|
|
|
pat_calc_hash (const void* val)
|
|
|
|
|
{
|
|
|
|
|
const struct pending_abstract_type *pat =
|
|
|
|
|
(const struct pending_abstract_type *) val;
|
|
|
|
|
return (hashval_t) TYPE_UID (pat->type);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Compare node VAL1 with the type VAL2. This function is used by the
|
|
|
|
|
hash table abstract_pending_vars. */
|
|
|
|
|
|
|
|
|
|
static int
|
|
|
|
|
pat_compare (const void* val1, const void* val2)
|
|
|
|
|
{
|
|
|
|
|
const struct pending_abstract_type *pat1 =
|
|
|
|
|
(const struct pending_abstract_type *) val1;
|
|
|
|
|
tree type2 = (tree)val2;
|
|
|
|
|
|
|
|
|
|
return (pat1->type == type2);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Hash table that maintains pending_abstract_type nodes, for which we still
|
|
|
|
|
need to check for type abstractness. The key of the table is the type
|
|
|
|
|
of the declaration. */
|
|
|
|
|
static GTY ((param_is (struct pending_abstract_type)))
|
|
|
|
|
htab_t abstract_pending_vars = NULL;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* This function is called after TYPE is completed, and will check if there
|
|
|
|
|
are pending declarations for which we still need to verify the abstractness
|
|
|
|
|
of TYPE, and emit a diagnostic (through abstract_virtuals_error) if TYPE
|
|
|
|
|
turned out to be incomplete. */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
complete_type_check_abstract (tree type)
|
|
|
|
|
{
|
|
|
|
|
void **slot;
|
|
|
|
|
struct pending_abstract_type *pat;
|
|
|
|
|
location_t cur_loc = input_location;
|
|
|
|
|
|
|
|
|
|
gcc_assert (COMPLETE_TYPE_P (type));
|
|
|
|
|
|
|
|
|
|
if (!abstract_pending_vars)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
/* Retrieve the list of pending declarations for this type. */
|
|
|
|
|
slot = htab_find_slot_with_hash (abstract_pending_vars, type,
|
|
|
|
|
(hashval_t)TYPE_UID (type), NO_INSERT);
|
|
|
|
|
if (!slot)
|
|
|
|
|
return;
|
|
|
|
|
pat = (struct pending_abstract_type*)*slot;
|
|
|
|
|
gcc_assert (pat);
|
|
|
|
|
|
|
|
|
|
/* If the type is not abstract, do not do anything. */
|
|
|
|
|
if (CLASSTYPE_PURE_VIRTUALS (type))
|
|
|
|
|
{
|
|
|
|
|
struct pending_abstract_type *prev = 0, *next;
|
|
|
|
|
|
|
|
|
|
/* Reverse the list to emit the errors in top-down order. */
|
|
|
|
|
for (; pat; pat = next)
|
|
|
|
|
{
|
|
|
|
|
next = pat->next;
|
|
|
|
|
pat->next = prev;
|
|
|
|
|
prev = pat;
|
|
|
|
|
}
|
|
|
|
|
pat = prev;
|
|
|
|
|
|
|
|
|
|
/* Go through the list, and call abstract_virtuals_error for each
|
|
|
|
|
element: it will issue a diagnostic if the type is abstract. */
|
|
|
|
|
while (pat)
|
|
|
|
|
{
|
|
|
|
|
gcc_assert (type == pat->type);
|
|
|
|
|
|
|
|
|
|
/* Tweak input_location so that the diagnostic appears at the correct
|
|
|
|
|
location. Notice that this is only needed if the decl is an
|
|
|
|
|
IDENTIFIER_NODE. */
|
|
|
|
|
input_location = pat->locus;
|
|
|
|
|
abstract_virtuals_error (pat->decl, pat->type);
|
|
|
|
|
pat = pat->next;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
htab_clear_slot (abstract_pending_vars, slot);
|
|
|
|
|
|
|
|
|
|
input_location = cur_loc;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* If TYPE has abstract virtual functions, issue an error about trying
|
|
|
|
|
to create an object of that type. DECL is the object declared, or
|
|
|
|
|
NULL_TREE if the declaration is unavailable. Returns 1 if an error
|
|
|
|
|
occurred; zero if all was well. */
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
int
|
2004-07-28 03:11:36 +00:00
|
|
|
|
abstract_virtuals_error (tree decl, tree type)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
VEC(tree,gc) *pure;
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
/* This function applies only to classes. Any other entity can never
|
|
|
|
|
be abstract. */
|
|
|
|
|
if (!CLASS_TYPE_P (type))
|
2002-02-01 18:16:02 +00:00
|
|
|
|
return 0;
|
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
/* If the type is incomplete, we register it within a hash table,
|
|
|
|
|
so that we can check again once it is completed. This makes sense
|
|
|
|
|
only for objects for which we have a declaration or at least a
|
|
|
|
|
name. */
|
|
|
|
|
if (!COMPLETE_TYPE_P (type))
|
|
|
|
|
{
|
|
|
|
|
void **slot;
|
|
|
|
|
struct pending_abstract_type *pat;
|
|
|
|
|
|
|
|
|
|
gcc_assert (!decl || DECL_P (decl)
|
|
|
|
|
|| TREE_CODE (decl) == IDENTIFIER_NODE);
|
|
|
|
|
|
|
|
|
|
if (!abstract_pending_vars)
|
|
|
|
|
abstract_pending_vars = htab_create_ggc (31, &pat_calc_hash,
|
|
|
|
|
&pat_compare, NULL);
|
|
|
|
|
|
|
|
|
|
slot = htab_find_slot_with_hash (abstract_pending_vars, type,
|
|
|
|
|
(hashval_t)TYPE_UID (type), INSERT);
|
|
|
|
|
|
|
|
|
|
pat = GGC_NEW (struct pending_abstract_type);
|
|
|
|
|
pat->type = type;
|
|
|
|
|
pat->decl = decl;
|
|
|
|
|
pat->locus = ((decl && DECL_P (decl))
|
|
|
|
|
? DECL_SOURCE_LOCATION (decl)
|
|
|
|
|
: input_location);
|
|
|
|
|
|
|
|
|
|
pat->next = (struct pending_abstract_type *) *slot;
|
|
|
|
|
*slot = pat;
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
if (!TYPE_SIZE (type))
|
|
|
|
|
/* TYPE is being defined, and during that time
|
|
|
|
|
CLASSTYPE_PURE_VIRTUALS holds the inline friends. */
|
|
|
|
|
return 0;
|
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
pure = CLASSTYPE_PURE_VIRTUALS (type);
|
|
|
|
|
if (!pure)
|
2004-07-28 03:11:36 +00:00
|
|
|
|
return 0;
|
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
if (decl)
|
|
|
|
|
{
|
|
|
|
|
if (TREE_CODE (decl) == RESULT_DECL)
|
2002-02-01 18:16:02 +00:00
|
|
|
|
return 0;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
if (TREE_CODE (decl) == VAR_DECL)
|
2007-05-19 01:19:51 +00:00
|
|
|
|
error ("cannot declare variable %q+D to be of abstract "
|
|
|
|
|
"type %qT", decl, type);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
else if (TREE_CODE (decl) == PARM_DECL)
|
2007-05-19 01:19:51 +00:00
|
|
|
|
error ("cannot declare parameter %q+D to be of abstract type %qT",
|
|
|
|
|
decl, type);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
else if (TREE_CODE (decl) == FIELD_DECL)
|
2007-05-19 01:19:51 +00:00
|
|
|
|
error ("cannot declare field %q+D to be of abstract type %qT",
|
|
|
|
|
decl, type);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
else if (TREE_CODE (decl) == FUNCTION_DECL
|
|
|
|
|
&& TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE)
|
2007-05-19 01:19:51 +00:00
|
|
|
|
error ("invalid abstract return type for member function %q+#D", decl);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
else if (TREE_CODE (decl) == FUNCTION_DECL)
|
2007-05-19 01:19:51 +00:00
|
|
|
|
error ("invalid abstract return type for function %q+#D", decl);
|
|
|
|
|
else if (TREE_CODE (decl) == IDENTIFIER_NODE)
|
|
|
|
|
/* Here we do not have location information. */
|
|
|
|
|
error ("invalid abstract type %qT for %qE", type, decl);
|
|
|
|
|
else
|
|
|
|
|
error ("invalid abstract type for %q+D", decl);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
1999-08-26 09:30:50 +00:00
|
|
|
|
else
|
2007-05-19 01:19:51 +00:00
|
|
|
|
error ("cannot allocate an object of abstract type %qT", type);
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* Only go through this once. */
|
2007-05-19 01:19:51 +00:00
|
|
|
|
if (VEC_length (tree, pure))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
unsigned ix;
|
|
|
|
|
tree fn;
|
|
|
|
|
|
|
|
|
|
inform ("%J because the following virtual functions are pure "
|
|
|
|
|
"within %qT:", TYPE_MAIN_DECL (type), type);
|
|
|
|
|
|
|
|
|
|
for (ix = 0; VEC_iterate (tree, pure, ix, fn); ix++)
|
|
|
|
|
inform ("\t%+#D", fn);
|
|
|
|
|
/* Now truncate the vector. This leaves it non-null, so we know
|
|
|
|
|
there are pure virtuals, but empty so we don't list them out
|
|
|
|
|
again. */
|
|
|
|
|
VEC_truncate (tree, pure, 0);
|
1999-08-26 09:30:50 +00:00
|
|
|
|
}
|
|
|
|
|
else
|
2007-05-19 01:19:51 +00:00
|
|
|
|
inform ("%J since type %qT has pure virtual functions",
|
|
|
|
|
TYPE_MAIN_DECL (type), type);
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
return 1;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Print an error message for invalid use of an incomplete type.
|
|
|
|
|
VALUE is the expression that was used (or 0 if that isn't known)
|
2003-07-11 03:40:53 +00:00
|
|
|
|
and TYPE is the type that was invalid. DIAG_TYPE indicates the
|
|
|
|
|
type of diagnostic: 0 for an error, 1 for a warning, 2 for a
|
|
|
|
|
pedwarn. */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
void
|
2004-07-28 03:11:36 +00:00
|
|
|
|
cxx_incomplete_type_diagnostic (tree value, tree type, int diag_type)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2002-02-01 18:16:02 +00:00
|
|
|
|
int decl = 0;
|
2007-05-19 01:19:51 +00:00
|
|
|
|
void (*p_msg) (const char *, ...) ATTRIBUTE_GCC_CXXDIAG(1,2);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
|
|
|
|
|
if (diag_type == 1)
|
2007-05-19 01:19:51 +00:00
|
|
|
|
p_msg = warning0;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
else if (diag_type == 2)
|
2007-05-19 01:19:51 +00:00
|
|
|
|
p_msg = pedwarn;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
else
|
2007-05-19 01:19:51 +00:00
|
|
|
|
p_msg = error;
|
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* Avoid duplicate error message. */
|
|
|
|
|
if (TREE_CODE (type) == ERROR_MARK)
|
|
|
|
|
return;
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
if (value != 0 && (TREE_CODE (value) == VAR_DECL
|
2002-09-01 20:38:57 +00:00
|
|
|
|
|| TREE_CODE (value) == PARM_DECL
|
|
|
|
|
|| TREE_CODE (value) == FIELD_DECL))
|
2002-02-01 18:16:02 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
p_msg ("%q+D has incomplete type", value);
|
2002-02-01 18:16:02 +00:00
|
|
|
|
decl = 1;
|
|
|
|
|
}
|
2007-05-19 01:19:51 +00:00
|
|
|
|
retry:
|
1999-10-16 06:09:09 +00:00
|
|
|
|
/* We must print an error message. Be clever about what it says. */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
switch (TREE_CODE (type))
|
|
|
|
|
{
|
|
|
|
|
case RECORD_TYPE:
|
|
|
|
|
case UNION_TYPE:
|
|
|
|
|
case ENUMERAL_TYPE:
|
2002-02-01 18:16:02 +00:00
|
|
|
|
if (!decl)
|
2007-05-19 01:19:51 +00:00
|
|
|
|
p_msg ("invalid use of incomplete type %q#T", type);
|
2002-09-01 20:38:57 +00:00
|
|
|
|
if (!TYPE_TEMPLATE_INFO (type))
|
2007-05-19 01:19:51 +00:00
|
|
|
|
p_msg ("forward declaration of %q+#T", type);
|
2002-09-01 20:38:57 +00:00
|
|
|
|
else
|
2007-05-19 01:19:51 +00:00
|
|
|
|
p_msg ("declaration of %q+#T", type);
|
1999-10-16 06:09:09 +00:00
|
|
|
|
break;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
case VOID_TYPE:
|
2007-05-19 01:19:51 +00:00
|
|
|
|
p_msg ("invalid use of %qT", type);
|
1999-10-16 06:09:09 +00:00
|
|
|
|
break;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
case ARRAY_TYPE:
|
|
|
|
|
if (TYPE_DOMAIN (type))
|
2007-05-19 01:19:51 +00:00
|
|
|
|
{
|
|
|
|
|
type = TREE_TYPE (type);
|
|
|
|
|
goto retry;
|
|
|
|
|
}
|
|
|
|
|
p_msg ("invalid use of array with unspecified bounds");
|
1999-10-16 06:09:09 +00:00
|
|
|
|
break;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
case OFFSET_TYPE:
|
|
|
|
|
bad_member:
|
2007-05-19 01:19:51 +00:00
|
|
|
|
p_msg ("invalid use of member (did you forget the %<&%> ?)");
|
1999-10-16 06:09:09 +00:00
|
|
|
|
break;
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
case TEMPLATE_TYPE_PARM:
|
2007-05-19 01:19:51 +00:00
|
|
|
|
p_msg ("invalid use of template type parameter %qT", type);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case BOUND_TEMPLATE_TEMPLATE_PARM:
|
|
|
|
|
p_msg ("invalid use of template template parameter %qT",
|
|
|
|
|
TYPE_NAME (type));
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case TYPENAME_TYPE:
|
|
|
|
|
p_msg ("invalid use of dependent type %qT", type);
|
1999-10-16 06:09:09 +00:00
|
|
|
|
break;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
case UNKNOWN_TYPE:
|
|
|
|
|
if (value && TREE_CODE (value) == COMPONENT_REF)
|
2007-05-19 01:19:51 +00:00
|
|
|
|
goto bad_member;
|
1999-10-16 06:09:09 +00:00
|
|
|
|
else if (value && TREE_CODE (value) == ADDR_EXPR)
|
2007-05-19 01:19:51 +00:00
|
|
|
|
p_msg ("address of overloaded function with no contextual "
|
|
|
|
|
"type information");
|
1999-10-16 06:09:09 +00:00
|
|
|
|
else if (value && TREE_CODE (value) == OVERLOAD)
|
2007-05-19 01:19:51 +00:00
|
|
|
|
p_msg ("overloaded function with no contextual type information");
|
1999-10-16 06:09:09 +00:00
|
|
|
|
else
|
2007-05-19 01:19:51 +00:00
|
|
|
|
p_msg ("insufficient contextual information to determine type");
|
1999-10-16 06:09:09 +00:00
|
|
|
|
break;
|
2007-05-19 01:19:51 +00:00
|
|
|
|
|
1999-10-16 06:09:09 +00:00
|
|
|
|
default:
|
2007-05-19 01:19:51 +00:00
|
|
|
|
gcc_unreachable ();
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* Backward-compatibility interface to incomplete_type_diagnostic;
|
|
|
|
|
required by ../tree.c. */
|
|
|
|
|
#undef cxx_incomplete_type_error
|
|
|
|
|
void
|
2004-07-28 03:11:36 +00:00
|
|
|
|
cxx_incomplete_type_error (tree value, tree type)
|
2003-07-11 03:40:53 +00:00
|
|
|
|
{
|
|
|
|
|
cxx_incomplete_type_diagnostic (value, type, 0);
|
|
|
|
|
}
|
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* The recursive part of split_nonconstant_init. DEST is an lvalue
|
2007-05-19 01:19:51 +00:00
|
|
|
|
expression to which INIT should be assigned. INIT is a CONSTRUCTOR. */
|
2004-07-28 03:11:36 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
static void
|
|
|
|
|
split_nonconstant_init_1 (tree dest, tree init)
|
2004-07-28 03:11:36 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
unsigned HOST_WIDE_INT idx;
|
|
|
|
|
tree field_index, value;
|
|
|
|
|
tree type = TREE_TYPE (dest);
|
|
|
|
|
tree inner_type = NULL;
|
2004-07-28 03:11:36 +00:00
|
|
|
|
bool array_type_p = false;
|
|
|
|
|
|
|
|
|
|
switch (TREE_CODE (type))
|
|
|
|
|
{
|
|
|
|
|
case ARRAY_TYPE:
|
|
|
|
|
inner_type = TREE_TYPE (type);
|
|
|
|
|
array_type_p = true;
|
|
|
|
|
/* FALLTHRU */
|
|
|
|
|
|
|
|
|
|
case RECORD_TYPE:
|
|
|
|
|
case UNION_TYPE:
|
|
|
|
|
case QUAL_UNION_TYPE:
|
2007-05-19 01:19:51 +00:00
|
|
|
|
FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init), idx,
|
|
|
|
|
field_index, value)
|
2004-07-28 03:11:36 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
/* The current implementation of this algorithm assumes that
|
|
|
|
|
the field was set for all the elements. This is usually done
|
|
|
|
|
by process_init_constructor. */
|
|
|
|
|
gcc_assert (field_index);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
|
|
|
|
|
if (!array_type_p)
|
|
|
|
|
inner_type = TREE_TYPE (field_index);
|
|
|
|
|
|
|
|
|
|
if (TREE_CODE (value) == CONSTRUCTOR)
|
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
tree sub;
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
if (array_type_p)
|
2007-05-19 01:19:51 +00:00
|
|
|
|
sub = build4 (ARRAY_REF, inner_type, dest, field_index,
|
|
|
|
|
NULL_TREE, NULL_TREE);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
else
|
2007-05-19 01:19:51 +00:00
|
|
|
|
sub = build3 (COMPONENT_REF, inner_type, dest, field_index,
|
|
|
|
|
NULL_TREE);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
split_nonconstant_init_1 (sub, value);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
}
|
|
|
|
|
else if (!initializer_constant_valid_p (value, inner_type))
|
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
tree code;
|
|
|
|
|
tree sub;
|
|
|
|
|
|
|
|
|
|
/* FIXME: Ordered removal is O(1) so the whole function is
|
|
|
|
|
worst-case quadratic. This could be fixed using an aside
|
|
|
|
|
bitmap to record which elements must be removed and remove
|
|
|
|
|
them all at the same time. Or by merging
|
|
|
|
|
split_non_constant_init into process_init_constructor_array,
|
|
|
|
|
that is separating constants from non-constants while building
|
|
|
|
|
the vector. */
|
|
|
|
|
VEC_ordered_remove (constructor_elt, CONSTRUCTOR_ELTS (init),
|
|
|
|
|
idx);
|
|
|
|
|
--idx;
|
2004-07-28 03:11:36 +00:00
|
|
|
|
|
|
|
|
|
if (array_type_p)
|
2007-05-19 01:19:51 +00:00
|
|
|
|
sub = build4 (ARRAY_REF, inner_type, dest, field_index,
|
|
|
|
|
NULL_TREE, NULL_TREE);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
else
|
2007-05-19 01:19:51 +00:00
|
|
|
|
sub = build3 (COMPONENT_REF, inner_type, dest, field_index,
|
|
|
|
|
NULL_TREE);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
code = build2 (INIT_EXPR, inner_type, sub, value);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
code = build_stmt (EXPR_STMT, code);
|
2007-05-19 01:19:51 +00:00
|
|
|
|
add_stmt (code);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case VECTOR_TYPE:
|
|
|
|
|
if (!initializer_constant_valid_p (init, type))
|
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
tree code;
|
2005-06-03 03:28:44 +00:00
|
|
|
|
tree cons = copy_node (init);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
CONSTRUCTOR_ELTS (init) = NULL;
|
2007-05-19 01:19:51 +00:00
|
|
|
|
code = build2 (MODIFY_EXPR, type, dest, cons);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
code = build_stmt (EXPR_STMT, code);
|
2007-05-19 01:19:51 +00:00
|
|
|
|
add_stmt (code);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
default:
|
2007-05-19 01:19:51 +00:00
|
|
|
|
gcc_unreachable ();
|
2004-07-28 03:11:36 +00:00
|
|
|
|
}
|
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
/* The rest of the initializer is now a constant. */
|
|
|
|
|
TREE_CONSTANT (init) = 1;
|
2004-07-28 03:11:36 +00:00
|
|
|
|
}
|
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
/* A subroutine of store_init_value. Splits non-constant static
|
2004-07-28 03:11:36 +00:00
|
|
|
|
initializer INIT into a constant part and generates code to
|
|
|
|
|
perform the non-constant part of the initialization to DEST.
|
|
|
|
|
Returns the code for the runtime init. */
|
|
|
|
|
|
|
|
|
|
static tree
|
|
|
|
|
split_nonconstant_init (tree dest, tree init)
|
|
|
|
|
{
|
|
|
|
|
tree code;
|
|
|
|
|
|
|
|
|
|
if (TREE_CODE (init) == CONSTRUCTOR)
|
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
code = push_stmt_list ();
|
|
|
|
|
split_nonconstant_init_1 (dest, init);
|
|
|
|
|
code = pop_stmt_list (code);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
DECL_INITIAL (dest) = init;
|
|
|
|
|
TREE_READONLY (dest) = 0;
|
|
|
|
|
}
|
|
|
|
|
else
|
2007-05-19 01:19:51 +00:00
|
|
|
|
code = build2 (INIT_EXPR, TREE_TYPE (dest), dest, init);
|
2004-07-28 03:11:36 +00:00
|
|
|
|
|
|
|
|
|
return code;
|
|
|
|
|
}
|
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
/* Perform appropriate conversions on the initial value of a variable,
|
|
|
|
|
store it in the declaration DECL,
|
|
|
|
|
and print any error messages that are appropriate.
|
|
|
|
|
If the init is invalid, store an ERROR_MARK.
|
|
|
|
|
|
|
|
|
|
C++: Note that INIT might be a TREE_LIST, which would mean that it is
|
|
|
|
|
a base class initializer for some aggregate type, hopefully compatible
|
|
|
|
|
with DECL. If INIT is a single element, and DECL is an aggregate
|
|
|
|
|
type, we silently convert INIT into a TREE_LIST, allowing a constructor
|
|
|
|
|
to be called.
|
|
|
|
|
|
|
|
|
|
If INIT is a TREE_LIST and there is no constructor, turn INIT
|
|
|
|
|
into a CONSTRUCTOR and use standard initialization techniques.
|
|
|
|
|
Perhaps a warning should be generated?
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
Returns code to be executed if initialization could not be performed
|
|
|
|
|
for static variable. In that case, caller must emit the code. */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
tree
|
2004-07-28 03:11:36 +00:00
|
|
|
|
store_init_value (tree decl, tree init)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2004-07-28 03:11:36 +00:00
|
|
|
|
tree value, type;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
/* If variable's type was invalidly declared, just ignore it. */
|
|
|
|
|
|
|
|
|
|
type = TREE_TYPE (decl);
|
|
|
|
|
if (TREE_CODE (type) == ERROR_MARK)
|
|
|
|
|
return NULL_TREE;
|
|
|
|
|
|
|
|
|
|
if (IS_AGGR_TYPE (type))
|
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
gcc_assert (TYPE_HAS_TRIVIAL_INIT_REF (type)
|
|
|
|
|
|| TREE_CODE (init) == CONSTRUCTOR);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
if (TREE_CODE (init) == TREE_LIST)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
error ("constructor syntax used, but no constructor declared "
|
|
|
|
|
"for type %qT", type);
|
|
|
|
|
init = build_constructor_from_list (NULL_TREE, nreverse (init));
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else if (TREE_CODE (init) == TREE_LIST
|
|
|
|
|
&& TREE_TYPE (init) != unknown_type_node)
|
|
|
|
|
{
|
|
|
|
|
if (TREE_CODE (decl) == RESULT_DECL)
|
2004-07-28 03:11:36 +00:00
|
|
|
|
init = build_x_compound_expr_from_list (init,
|
|
|
|
|
"return value initializer");
|
1996-09-18 05:35:50 +00:00
|
|
|
|
else if (TREE_CODE (init) == TREE_LIST
|
|
|
|
|
&& TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
|
|
|
|
|
{
|
|
|
|
|
error ("cannot initialize arrays using this syntax");
|
|
|
|
|
return NULL_TREE;
|
|
|
|
|
}
|
|
|
|
|
else
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* We get here with code like `int a (2);' */
|
|
|
|
|
init = build_x_compound_expr_from_list (init, "initializer");
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
/* End of special C++ code. */
|
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* Digest the specified initializer into an expression. */
|
2007-05-19 01:19:51 +00:00
|
|
|
|
value = digest_init (type, init);
|
2005-06-03 03:28:44 +00:00
|
|
|
|
/* If the initializer is not a constant, fill in DECL_INITIAL with
|
|
|
|
|
the bits that are constant, and then return an expression that
|
|
|
|
|
will perform the dynamic initialization. */
|
|
|
|
|
if (value != error_mark_node
|
2007-05-19 01:19:51 +00:00
|
|
|
|
&& (TREE_SIDE_EFFECTS (value)
|
|
|
|
|
|| ! initializer_constant_valid_p (value, TREE_TYPE (value))))
|
2004-07-28 03:11:36 +00:00
|
|
|
|
return split_nonconstant_init (decl, value);
|
2005-06-03 03:28:44 +00:00
|
|
|
|
/* If the value is a constant, just put it in DECL_INITIAL. If DECL
|
|
|
|
|
is an automatic variable, the middle end will turn this into a
|
|
|
|
|
dynamic initialization later. */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
DECL_INITIAL (decl) = value;
|
|
|
|
|
return NULL_TREE;
|
|
|
|
|
}
|
2002-09-01 20:38:57 +00:00
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
/* Process the initializer INIT for a variable of type TYPE, emitting
|
|
|
|
|
diagnostics for invalid initializers and converting the initializer as
|
|
|
|
|
appropriate.
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
For aggregate types, it assumes that reshape_init has already run, thus the
|
|
|
|
|
initializer will have the right shape (brace elision has been undone). */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
tree
|
2007-05-19 01:19:51 +00:00
|
|
|
|
digest_init (tree type, tree init)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
|
|
|
|
enum tree_code code = TREE_CODE (type);
|
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
if (init == error_mark_node)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
return error_mark_node;
|
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
gcc_assert (init);
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
/* We must strip the outermost array type when completing the type,
|
|
|
|
|
because the its bounds might be incomplete at the moment. */
|
|
|
|
|
if (!complete_type_or_else (TREE_CODE (type) == ARRAY_TYPE
|
|
|
|
|
? TREE_TYPE (type) : type, NULL_TREE))
|
|
|
|
|
return error_mark_node;
|
2007-05-19 01:19:51 +00:00
|
|
|
|
|
|
|
|
|
/* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue
|
|
|
|
|
(g++.old-deja/g++.law/casts2.C). */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
if (TREE_CODE (init) == NON_LVALUE_EXPR)
|
|
|
|
|
init = TREE_OPERAND (init, 0);
|
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
/* Initialization of an array of chars from a string constant. The initializer
|
|
|
|
|
can be optionally enclosed in braces, but reshape_init has already removed
|
|
|
|
|
them if they were present. */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
if (code == ARRAY_TYPE)
|
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
|
2002-02-01 18:16:02 +00:00
|
|
|
|
if (char_type_p (typ1)
|
2007-05-19 01:19:51 +00:00
|
|
|
|
/*&& init */
|
|
|
|
|
&& TREE_CODE (init) == STRING_CST)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
tree char_type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (init)));
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
if (char_type != char_type_node
|
1996-09-18 05:35:50 +00:00
|
|
|
|
&& TYPE_PRECISION (typ1) == BITS_PER_UNIT)
|
|
|
|
|
{
|
|
|
|
|
error ("char-array initialized from wide string");
|
|
|
|
|
return error_mark_node;
|
|
|
|
|
}
|
2007-05-19 01:19:51 +00:00
|
|
|
|
if (char_type == char_type_node
|
1996-09-18 05:35:50 +00:00
|
|
|
|
&& TYPE_PRECISION (typ1) != BITS_PER_UNIT)
|
|
|
|
|
{
|
|
|
|
|
error ("int-array initialized from non-wide string");
|
|
|
|
|
return error_mark_node;
|
|
|
|
|
}
|
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
TREE_TYPE (init) = type;
|
|
|
|
|
if (TYPE_DOMAIN (type) != 0 && TREE_CONSTANT (TYPE_SIZE (type)))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2004-07-28 03:11:36 +00:00
|
|
|
|
int size = TREE_INT_CST_LOW (TYPE_SIZE (type));
|
1996-09-18 05:35:50 +00:00
|
|
|
|
size = (size + BITS_PER_UNIT - 1) / BITS_PER_UNIT;
|
|
|
|
|
/* In C it is ok to subtract 1 from the length of the string
|
|
|
|
|
because it's ok to ignore the terminating null char that is
|
|
|
|
|
counted in the length of the constant, but in C++ this would
|
|
|
|
|
be invalid. */
|
2007-05-19 01:19:51 +00:00
|
|
|
|
if (size < TREE_STRING_LENGTH (init))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
pedwarn ("initializer-string for array of chars is too long");
|
|
|
|
|
}
|
2007-05-19 01:19:51 +00:00
|
|
|
|
return init;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
/* Handle scalar types (including conversions) and references. */
|
2007-08-14 02:45:23 +00:00
|
|
|
|
if (TREE_CODE (type) != COMPLEX_TYPE
|
|
|
|
|
&& (SCALAR_TYPE_P (type) || code == REFERENCE_TYPE))
|
2007-05-19 01:19:51 +00:00
|
|
|
|
return convert_for_initialization (0, type, init, LOOKUP_NORMAL,
|
|
|
|
|
"initialization", NULL_TREE, 0);
|
|
|
|
|
|
|
|
|
|
/* Come here only for aggregates: records, arrays, unions, complex numbers
|
|
|
|
|
and vectors. */
|
|
|
|
|
gcc_assert (TREE_CODE (type) == ARRAY_TYPE
|
|
|
|
|
|| TREE_CODE (type) == VECTOR_TYPE
|
|
|
|
|
|| TREE_CODE (type) == RECORD_TYPE
|
|
|
|
|
|| TREE_CODE (type) == UNION_TYPE
|
|
|
|
|
|| TREE_CODE (type) == COMPLEX_TYPE);
|
|
|
|
|
|
|
|
|
|
if (BRACE_ENCLOSED_INITIALIZER_P (init))
|
|
|
|
|
return process_init_constructor (type, init);
|
|
|
|
|
else
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
if (COMPOUND_LITERAL_P (init) && TREE_CODE (type) == ARRAY_TYPE)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
error ("cannot initialize aggregate of type %qT with "
|
|
|
|
|
"a compound literal", type);
|
|
|
|
|
|
|
|
|
|
return error_mark_node;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
2007-05-19 01:19:51 +00:00
|
|
|
|
|
|
|
|
|
if (TREE_CODE (type) == ARRAY_TYPE
|
|
|
|
|
&& TREE_CODE (init) != CONSTRUCTOR)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
error ("array must be initialized with a brace-enclosed"
|
|
|
|
|
" initializer");
|
|
|
|
|
return error_mark_node;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
return convert_for_initialization (NULL_TREE, type, init,
|
|
|
|
|
LOOKUP_NORMAL | LOOKUP_ONLYCONVERTING,
|
1996-09-18 05:35:50 +00:00
|
|
|
|
"initialization", NULL_TREE, 0);
|
|
|
|
|
}
|
2007-05-19 01:19:51 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Set of flags used within process_init_constructor to describe the
|
|
|
|
|
initializers. */
|
|
|
|
|
#define PICFLAG_ERRONEOUS 1
|
|
|
|
|
#define PICFLAG_NOT_ALL_CONSTANT 2
|
|
|
|
|
#define PICFLAG_NOT_ALL_SIMPLE 4
|
|
|
|
|
|
|
|
|
|
/* Given an initializer INIT, return the flag (PICFLAG_*) which better
|
|
|
|
|
describe it. */
|
|
|
|
|
|
|
|
|
|
static int
|
|
|
|
|
picflag_from_initializer (tree init)
|
|
|
|
|
{
|
|
|
|
|
if (init == error_mark_node)
|
|
|
|
|
return PICFLAG_ERRONEOUS;
|
|
|
|
|
else if (!TREE_CONSTANT (init))
|
|
|
|
|
return PICFLAG_NOT_ALL_CONSTANT;
|
|
|
|
|
else if (!initializer_constant_valid_p (init, TREE_TYPE (init)))
|
|
|
|
|
return PICFLAG_NOT_ALL_SIMPLE;
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
/* Subroutine of process_init_constructor, which will process an initializer
|
|
|
|
|
INIT for a array or vector of type TYPE. Returns the flags (PICFLAG_*) which
|
|
|
|
|
describe the initializers. */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
static int
|
|
|
|
|
process_init_constructor_array (tree type, tree init)
|
|
|
|
|
{
|
|
|
|
|
unsigned HOST_WIDE_INT i, len = 0;
|
|
|
|
|
int flags = 0;
|
|
|
|
|
bool unbounded = false;
|
|
|
|
|
constructor_elt *ce;
|
|
|
|
|
VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (init);
|
|
|
|
|
|
|
|
|
|
gcc_assert (TREE_CODE (type) == ARRAY_TYPE
|
|
|
|
|
|| TREE_CODE (type) == VECTOR_TYPE);
|
|
|
|
|
|
|
|
|
|
if (TREE_CODE (type) == ARRAY_TYPE)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
tree domain = TYPE_DOMAIN (type);
|
|
|
|
|
if (domain)
|
|
|
|
|
len = (TREE_INT_CST_LOW (TYPE_MAX_VALUE (domain))
|
|
|
|
|
- TREE_INT_CST_LOW (TYPE_MIN_VALUE (domain))
|
|
|
|
|
+ 1);
|
|
|
|
|
else
|
|
|
|
|
unbounded = true; /* Take as many as there are. */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
2007-05-19 01:19:51 +00:00
|
|
|
|
else
|
|
|
|
|
/* Vectors are like simple fixed-size arrays. */
|
|
|
|
|
len = TYPE_VECTOR_SUBPARTS (type);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
/* There cannot be more initializers than needed as otherwise
|
|
|
|
|
reshape_init would have already rejected the initializer. */
|
|
|
|
|
if (!unbounded)
|
|
|
|
|
gcc_assert (VEC_length (constructor_elt, v) <= len);
|
|
|
|
|
|
|
|
|
|
for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
if (ce->index)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
gcc_assert (TREE_CODE (ce->index) == INTEGER_CST);
|
|
|
|
|
if (compare_tree_int (ce->index, i) != 0)
|
|
|
|
|
{
|
|
|
|
|
ce->value = error_mark_node;
|
|
|
|
|
sorry ("non-trivial designated initializers not supported");
|
|
|
|
|
}
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
2007-05-19 01:19:51 +00:00
|
|
|
|
else
|
|
|
|
|
ce->index = size_int (i);
|
|
|
|
|
gcc_assert (ce->value);
|
|
|
|
|
ce->value = digest_init (TREE_TYPE (type), ce->value);
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
if (ce->value != error_mark_node)
|
|
|
|
|
gcc_assert (same_type_ignoring_top_level_qualifiers_p
|
|
|
|
|
(TREE_TYPE (type), TREE_TYPE (ce->value)));
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
flags |= picflag_from_initializer (ce->value);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
/* No more initializers. If the array is unbounded, we are done. Otherwise,
|
|
|
|
|
we must add initializers ourselves. */
|
|
|
|
|
if (!unbounded)
|
|
|
|
|
for (; i < len; ++i)
|
|
|
|
|
{
|
|
|
|
|
tree next;
|
|
|
|
|
|
|
|
|
|
if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (type)))
|
|
|
|
|
{
|
|
|
|
|
/* If this type needs constructors run for default-initialization,
|
|
|
|
|
we can't rely on the backend to do it for us, so build up
|
|
|
|
|
TARGET_EXPRs. If the type in question is a class, just build
|
|
|
|
|
one up; if it's an array, recurse. */
|
|
|
|
|
if (IS_AGGR_TYPE (TREE_TYPE (type)))
|
|
|
|
|
next = build_functional_cast (TREE_TYPE (type), NULL_TREE);
|
|
|
|
|
else
|
|
|
|
|
next = build_constructor (NULL_TREE, NULL);
|
|
|
|
|
next = digest_init (TREE_TYPE (type), next);
|
|
|
|
|
}
|
|
|
|
|
else if (!zero_init_p (TREE_TYPE (type)))
|
|
|
|
|
next = build_zero_init (TREE_TYPE (type),
|
|
|
|
|
/*nelts=*/NULL_TREE,
|
|
|
|
|
/*static_storage_p=*/false);
|
|
|
|
|
else
|
|
|
|
|
/* The default zero-initialization is fine for us; don't
|
|
|
|
|
add anything to the CONSTRUCTOR. */
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
flags |= picflag_from_initializer (next);
|
|
|
|
|
CONSTRUCTOR_APPEND_ELT (v, size_int (i), next);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
CONSTRUCTOR_ELTS (init) = v;
|
|
|
|
|
return flags;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
/* Subroutine of process_init_constructor, which will process an initializer
|
|
|
|
|
INIT for a class of type TYPE. Returns the flags (PICFLAG_*) which describe
|
|
|
|
|
the initializers. */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
static int
|
|
|
|
|
process_init_constructor_record (tree type, tree init)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
VEC(constructor_elt,gc) *v = NULL;
|
|
|
|
|
int flags = 0;
|
|
|
|
|
tree field;
|
|
|
|
|
unsigned HOST_WIDE_INT idx = 0;
|
|
|
|
|
|
|
|
|
|
gcc_assert (TREE_CODE (type) == RECORD_TYPE);
|
|
|
|
|
gcc_assert (!CLASSTYPE_VBASECLASSES (type));
|
|
|
|
|
gcc_assert (!TYPE_BINFO (type)
|
|
|
|
|
|| !BINFO_N_BASE_BINFOS (TYPE_BINFO (type)));
|
|
|
|
|
gcc_assert (!TYPE_POLYMORPHIC_P (type));
|
|
|
|
|
|
|
|
|
|
/* Generally, we will always have an index for each initializer (which is
|
|
|
|
|
a FIELD_DECL, put by reshape_init), but compound literals don't go trough
|
|
|
|
|
reshape_init. So we need to handle both cases. */
|
|
|
|
|
for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
tree next;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
if (!DECL_NAME (field) && DECL_C_BIT_FIELD (field))
|
2002-05-09 20:02:13 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
flags |= picflag_from_initializer (integer_zero_node);
|
|
|
|
|
CONSTRUCTOR_APPEND_ELT (v, field, integer_zero_node);
|
|
|
|
|
continue;
|
2002-05-09 20:02:13 +00:00
|
|
|
|
}
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
if (TREE_CODE (field) != FIELD_DECL || DECL_ARTIFICIAL (field))
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (idx < VEC_length (constructor_elt, CONSTRUCTOR_ELTS (init)))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
constructor_elt *ce = VEC_index (constructor_elt,
|
|
|
|
|
CONSTRUCTOR_ELTS (init), idx);
|
|
|
|
|
if (ce->index)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
/* We can have either a FIELD_DECL or an IDENTIFIER_NODE. The
|
|
|
|
|
latter case can happen in templates where lookup has to be
|
|
|
|
|
deferred. */
|
|
|
|
|
gcc_assert (TREE_CODE (ce->index) == FIELD_DECL
|
|
|
|
|
|| TREE_CODE (ce->index) == IDENTIFIER_NODE);
|
|
|
|
|
if (ce->index != field
|
|
|
|
|
&& ce->index != DECL_NAME (field))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
ce->value = error_mark_node;
|
|
|
|
|
sorry ("non-trivial designated initializers not supported");
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
gcc_assert (ce->value);
|
|
|
|
|
next = digest_init (TREE_TYPE (field), ce->value);
|
|
|
|
|
++idx;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
2007-05-19 01:19:51 +00:00
|
|
|
|
else if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (field)))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
/* If this type needs constructors run for
|
|
|
|
|
default-initialization, we can't rely on the backend to do it
|
|
|
|
|
for us, so build up TARGET_EXPRs. If the type in question is
|
|
|
|
|
a class, just build one up; if it's an array, recurse. */
|
|
|
|
|
if (IS_AGGR_TYPE (TREE_TYPE (field)))
|
|
|
|
|
next = build_functional_cast (TREE_TYPE (field), NULL_TREE);
|
|
|
|
|
else
|
|
|
|
|
next = build_constructor (NULL_TREE, NULL);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
next = digest_init (TREE_TYPE (field), next);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
/* Warn when some struct elements are implicitly initialized. */
|
|
|
|
|
warning (OPT_Wmissing_field_initializers,
|
|
|
|
|
"missing initializer for member %qD", field);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
2007-05-19 01:19:51 +00:00
|
|
|
|
else
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
if (TREE_READONLY (field))
|
|
|
|
|
error ("uninitialized const member %qD", field);
|
|
|
|
|
else if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (TREE_TYPE (field)))
|
|
|
|
|
error ("member %qD with uninitialized const fields", field);
|
|
|
|
|
else if (TREE_CODE (TREE_TYPE (field)) == REFERENCE_TYPE)
|
|
|
|
|
error ("member %qD is uninitialized reference", field);
|
|
|
|
|
|
|
|
|
|
/* Warn when some struct elements are implicitly initialized
|
|
|
|
|
to zero. */
|
|
|
|
|
warning (OPT_Wmissing_field_initializers,
|
|
|
|
|
"missing initializer for member %qD", field);
|
|
|
|
|
|
|
|
|
|
if (!zero_init_p (TREE_TYPE (field)))
|
|
|
|
|
next = build_zero_init (TREE_TYPE (field), /*nelts=*/NULL_TREE,
|
|
|
|
|
/*static_storage_p=*/false);
|
|
|
|
|
else
|
|
|
|
|
/* The default zero-initialization is fine for us; don't
|
|
|
|
|
add anything to the CONSTRUCTOR. */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
continue;
|
2007-05-19 01:19:51 +00:00
|
|
|
|
}
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
flags |= picflag_from_initializer (next);
|
|
|
|
|
CONSTRUCTOR_APPEND_ELT (v, field, next);
|
|
|
|
|
}
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
CONSTRUCTOR_ELTS (init) = v;
|
|
|
|
|
return flags;
|
|
|
|
|
}
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
/* Subroutine of process_init_constructor, which will process a single
|
|
|
|
|
initializer INIT for a union of type TYPE. Returns the flags (PICFLAG_*)
|
|
|
|
|
which describe the initializer. */
|
|
|
|
|
|
|
|
|
|
static int
|
|
|
|
|
process_init_constructor_union (tree type, tree init)
|
|
|
|
|
{
|
|
|
|
|
constructor_elt *ce;
|
|
|
|
|
|
|
|
|
|
/* If the initializer was empty, use default zero initialization. */
|
|
|
|
|
if (VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (init)))
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
gcc_assert (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (init)) == 1);
|
|
|
|
|
ce = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (init), 0);
|
|
|
|
|
|
|
|
|
|
/* If this element specifies a field, initialize via that field. */
|
|
|
|
|
if (ce->index)
|
|
|
|
|
{
|
|
|
|
|
if (TREE_CODE (ce->index) == FIELD_DECL)
|
|
|
|
|
;
|
|
|
|
|
else if (TREE_CODE (ce->index) == IDENTIFIER_NODE)
|
|
|
|
|
{
|
|
|
|
|
/* This can happen within a cast, see g++.dg/opt/cse2.C. */
|
|
|
|
|
tree name = ce->index;
|
|
|
|
|
tree field;
|
|
|
|
|
for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
|
|
|
|
|
if (DECL_NAME (field) == name)
|
|
|
|
|
break;
|
|
|
|
|
if (!field)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
error ("no field %qD found in union being initialized", field);
|
|
|
|
|
ce->value = error_mark_node;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
2007-05-19 01:19:51 +00:00
|
|
|
|
ce->index = field;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
gcc_assert (TREE_CODE (ce->index) == INTEGER_CST
|
|
|
|
|
|| TREE_CODE (ce->index) == RANGE_EXPR);
|
|
|
|
|
error ("index value instead of field name in union initializer");
|
|
|
|
|
ce->value = error_mark_node;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
2007-05-19 01:19:51 +00:00
|
|
|
|
else
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
|
|
|
|
/* Find the first named field. ANSI decided in September 1990
|
|
|
|
|
that only named fields count here. */
|
2007-05-19 01:19:51 +00:00
|
|
|
|
tree field = TYPE_FIELDS (type);
|
2003-07-11 03:40:53 +00:00
|
|
|
|
while (field && (!DECL_NAME (field) || TREE_CODE (field) != FIELD_DECL))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
field = TREE_CHAIN (field);
|
2007-05-19 01:19:51 +00:00
|
|
|
|
gcc_assert (field);
|
|
|
|
|
ce->index = field;
|
|
|
|
|
}
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
if (ce->value && ce->value != error_mark_node)
|
|
|
|
|
ce->value = digest_init (TREE_TYPE (ce->index), ce->value);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
return picflag_from_initializer (ce->value);
|
|
|
|
|
}
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
/* Process INIT, a constructor for a variable of aggregate type TYPE. The
|
|
|
|
|
constructor is a brace-enclosed initializer, and will be modified in-place.
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
Each element is converted to the right type through digest_init, and
|
|
|
|
|
missing initializers are added following the language rules (zero-padding,
|
|
|
|
|
etc.).
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
After the execution, the initializer will have TREE_CONSTANT if all elts are
|
|
|
|
|
constant, and TREE_STATIC set if, in addition, all elts are simple enough
|
|
|
|
|
constants that the assembler and linker can compute them.
|
|
|
|
|
|
|
|
|
|
The function returns the initializer itself, or error_mark_node in case
|
|
|
|
|
of error. */
|
|
|
|
|
|
|
|
|
|
static tree
|
|
|
|
|
process_init_constructor (tree type, tree init)
|
|
|
|
|
{
|
|
|
|
|
int flags;
|
|
|
|
|
|
|
|
|
|
gcc_assert (BRACE_ENCLOSED_INITIALIZER_P (init));
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
if (TREE_CODE (type) == ARRAY_TYPE || TREE_CODE (type) == VECTOR_TYPE)
|
|
|
|
|
flags = process_init_constructor_array (type, init);
|
|
|
|
|
else if (TREE_CODE (type) == RECORD_TYPE)
|
|
|
|
|
flags = process_init_constructor_record (type, init);
|
|
|
|
|
else if (TREE_CODE (type) == UNION_TYPE)
|
|
|
|
|
flags = process_init_constructor_union (type, init);
|
|
|
|
|
else
|
|
|
|
|
gcc_unreachable ();
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
if (flags & PICFLAG_ERRONEOUS)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
return error_mark_node;
|
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
TREE_TYPE (init) = type;
|
2002-12-04 15:42:16 +00:00
|
|
|
|
if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type) == NULL_TREE)
|
2007-05-19 01:19:51 +00:00
|
|
|
|
cp_complete_array_type (&TREE_TYPE (init), init, /*do_default=*/0);
|
|
|
|
|
if (!(flags & PICFLAG_NOT_ALL_CONSTANT))
|
|
|
|
|
{
|
|
|
|
|
TREE_CONSTANT (init) = 1;
|
|
|
|
|
TREE_INVARIANT (init) = 1;
|
|
|
|
|
if (!(flags & PICFLAG_NOT_ALL_SIMPLE))
|
|
|
|
|
TREE_STATIC (init) = 1;
|
|
|
|
|
}
|
|
|
|
|
return init;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Given a structure or union value DATUM, construct and return
|
|
|
|
|
the structure or union component which results from narrowing
|
2003-07-11 03:40:53 +00:00
|
|
|
|
that value to the base specified in BASETYPE. For example, given the
|
1996-09-18 05:35:50 +00:00
|
|
|
|
hierarchy
|
|
|
|
|
|
|
|
|
|
class L { int ii; };
|
|
|
|
|
class A : L { ... };
|
|
|
|
|
class B : L { ... };
|
|
|
|
|
class C : A, B { ... };
|
|
|
|
|
|
|
|
|
|
and the declaration
|
|
|
|
|
|
|
|
|
|
C x;
|
|
|
|
|
|
|
|
|
|
then the expression
|
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
x.A::ii refers to the ii member of the L part of
|
|
|
|
|
the A part of the C object named by X. In this case,
|
2002-02-01 18:16:02 +00:00
|
|
|
|
DATUM would be x, and BASETYPE would be A.
|
|
|
|
|
|
|
|
|
|
I used to think that this was nonconformant, that the standard specified
|
|
|
|
|
that first we look up ii in A, then convert x to an L& and pull out the
|
|
|
|
|
ii part. But in fact, it does say that we convert x to an A&; A here
|
2003-07-11 03:40:53 +00:00
|
|
|
|
is known as the "naming class". (jason 2000-12-19)
|
|
|
|
|
|
|
|
|
|
BINFO_P points to a variable initialized either to NULL_TREE or to the
|
|
|
|
|
binfo for the specific base subobject we want to convert to. */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
tree
|
2004-07-28 03:11:36 +00:00
|
|
|
|
build_scoped_ref (tree datum, tree basetype, tree* binfo_p)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2002-02-01 18:16:02 +00:00
|
|
|
|
tree binfo;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
if (datum == error_mark_node)
|
|
|
|
|
return error_mark_node;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
if (*binfo_p)
|
|
|
|
|
binfo = *binfo_p;
|
|
|
|
|
else
|
|
|
|
|
binfo = lookup_base (TREE_TYPE (datum), basetype, ba_check, NULL);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
if (!binfo || binfo == error_mark_node)
|
|
|
|
|
{
|
|
|
|
|
*binfo_p = NULL_TREE;
|
|
|
|
|
if (!binfo)
|
|
|
|
|
error_not_base_type (basetype, TREE_TYPE (datum));
|
|
|
|
|
return error_mark_node;
|
|
|
|
|
}
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
*binfo_p = binfo;
|
|
|
|
|
return build_base_path (PLUS_EXPR, datum, binfo, 1);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Build a reference to an object specified by the C++ `->' operator.
|
|
|
|
|
Usually this just involves dereferencing the object, but if the
|
|
|
|
|
`->' operator is overloaded, then such overloads must be
|
|
|
|
|
performed until an object which does not have the `->' operator
|
|
|
|
|
overloaded is found. An error is reported when circular pointer
|
|
|
|
|
delegation is detected. */
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
tree
|
2004-07-28 03:11:36 +00:00
|
|
|
|
build_x_arrow (tree expr)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2004-07-28 03:11:36 +00:00
|
|
|
|
tree orig_expr = expr;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
tree types_memoized = NULL_TREE;
|
2004-07-28 03:11:36 +00:00
|
|
|
|
tree type = TREE_TYPE (expr);
|
1999-08-26 09:30:50 +00:00
|
|
|
|
tree last_rval = NULL_TREE;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
if (type == error_mark_node)
|
|
|
|
|
return error_mark_node;
|
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
if (processing_template_decl)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2004-07-28 03:11:36 +00:00
|
|
|
|
if (type_dependent_expression_p (expr))
|
|
|
|
|
return build_min_nt (ARROW_EXPR, expr);
|
|
|
|
|
expr = build_non_dependent_expr (expr);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
if (IS_AGGR_TYPE (type))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2004-07-28 03:11:36 +00:00
|
|
|
|
while ((expr = build_new_op (COMPONENT_REF, LOOKUP_NORMAL, expr,
|
|
|
|
|
NULL_TREE, NULL_TREE,
|
|
|
|
|
/*overloaded_p=*/NULL)))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2004-07-28 03:11:36 +00:00
|
|
|
|
if (expr == error_mark_node)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
return error_mark_node;
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
if (value_member (TREE_TYPE (expr), types_memoized))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
|
|
|
|
error ("circular pointer delegation detected");
|
|
|
|
|
return error_mark_node;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
2004-07-28 03:11:36 +00:00
|
|
|
|
types_memoized = tree_cons (NULL_TREE, TREE_TYPE (expr),
|
1996-09-18 05:35:50 +00:00
|
|
|
|
types_memoized);
|
|
|
|
|
}
|
2004-07-28 03:11:36 +00:00
|
|
|
|
last_rval = expr;
|
2007-05-19 01:19:51 +00:00
|
|
|
|
}
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
|
|
|
|
if (last_rval == NULL_TREE)
|
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
error ("base operand of %<->%> has non-pointer type %qT", type);
|
1999-08-26 09:30:50 +00:00
|
|
|
|
return error_mark_node;
|
|
|
|
|
}
|
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
if (TREE_CODE (TREE_TYPE (last_rval)) == REFERENCE_TYPE)
|
|
|
|
|
last_rval = convert_from_reference (last_rval);
|
|
|
|
|
}
|
|
|
|
|
else
|
2004-07-28 03:11:36 +00:00
|
|
|
|
last_rval = decay_conversion (expr);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
if (TREE_CODE (TREE_TYPE (last_rval)) == POINTER_TYPE)
|
2004-07-28 03:11:36 +00:00
|
|
|
|
{
|
|
|
|
|
if (processing_template_decl)
|
|
|
|
|
{
|
|
|
|
|
expr = build_min_non_dep (ARROW_EXPR, last_rval, orig_expr);
|
|
|
|
|
/* It will be dereferenced. */
|
|
|
|
|
TREE_TYPE (expr) = TREE_TYPE (TREE_TYPE (last_rval));
|
|
|
|
|
return expr;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return build_indirect_ref (last_rval, NULL);
|
|
|
|
|
}
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
if (types_memoized)
|
2007-05-19 01:19:51 +00:00
|
|
|
|
error ("result of %<operator->()%> yields non-pointer result");
|
1996-09-18 05:35:50 +00:00
|
|
|
|
else
|
2007-05-19 01:19:51 +00:00
|
|
|
|
error ("base operand of %<->%> is not a pointer");
|
1996-09-18 05:35:50 +00:00
|
|
|
|
return error_mark_node;
|
|
|
|
|
}
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* Return an expression for "DATUM .* COMPONENT". DATUM has not
|
|
|
|
|
already been checked out to be of aggregate type. */
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
tree
|
2004-07-28 03:11:36 +00:00
|
|
|
|
build_m_component_ref (tree datum, tree component)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2004-07-28 03:11:36 +00:00
|
|
|
|
tree ptrmem_type;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
tree objtype;
|
2004-07-28 03:11:36 +00:00
|
|
|
|
tree type;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
tree binfo;
|
2007-05-19 01:19:51 +00:00
|
|
|
|
tree ctype;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
if (error_operand_p (datum) || error_operand_p (component))
|
2002-02-01 18:16:02 +00:00
|
|
|
|
return error_mark_node;
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
ptrmem_type = TREE_TYPE (component);
|
|
|
|
|
if (!TYPE_PTR_TO_MEMBER_P (ptrmem_type))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
error ("%qE cannot be used as a member pointer, since it is of "
|
|
|
|
|
"type %qT",
|
2004-07-28 03:11:36 +00:00
|
|
|
|
component, ptrmem_type);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
return error_mark_node;
|
|
|
|
|
}
|
2007-05-19 01:19:51 +00:00
|
|
|
|
|
|
|
|
|
objtype = TYPE_MAIN_VARIANT (TREE_TYPE (datum));
|
1996-09-18 05:35:50 +00:00
|
|
|
|
if (! IS_AGGR_TYPE (objtype))
|
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
error ("cannot apply member pointer %qE to %qE, which is of "
|
|
|
|
|
"non-class type %qT",
|
|
|
|
|
component, datum, objtype);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
return error_mark_node;
|
|
|
|
|
}
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
type = TYPE_PTRMEM_POINTED_TO_TYPE (ptrmem_type);
|
2007-05-19 01:19:51 +00:00
|
|
|
|
ctype = complete_type (TYPE_PTRMEM_CLASS_TYPE (ptrmem_type));
|
|
|
|
|
|
|
|
|
|
if (!COMPLETE_TYPE_P (ctype))
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2007-05-19 01:19:51 +00:00
|
|
|
|
if (!same_type_p (ctype, objtype))
|
|
|
|
|
goto mismatch;
|
|
|
|
|
binfo = NULL;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
binfo = lookup_base (objtype, ctype, ba_check, NULL);
|
|
|
|
|
|
|
|
|
|
if (!binfo)
|
|
|
|
|
{
|
|
|
|
|
mismatch:
|
|
|
|
|
error ("pointer to member type %qT incompatible with object "
|
|
|
|
|
"type %qT",
|
|
|
|
|
type, objtype);
|
|
|
|
|
return error_mark_node;
|
|
|
|
|
}
|
|
|
|
|
else if (binfo == error_mark_node)
|
|
|
|
|
return error_mark_node;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
if (TYPE_PTRMEM_P (ptrmem_type))
|
|
|
|
|
{
|
|
|
|
|
/* Compute the type of the field, as described in [expr.ref].
|
|
|
|
|
There's no such thing as a mutable pointer-to-member, so
|
|
|
|
|
things are not as complex as they are for references to
|
|
|
|
|
non-static data members. */
|
|
|
|
|
type = cp_build_qualified_type (type,
|
2007-05-19 01:19:51 +00:00
|
|
|
|
(cp_type_quals (type)
|
2004-07-28 03:11:36 +00:00
|
|
|
|
| cp_type_quals (TREE_TYPE (datum))));
|
2007-05-19 01:19:51 +00:00
|
|
|
|
|
|
|
|
|
datum = build_address (datum);
|
|
|
|
|
|
|
|
|
|
/* Convert object to the correct base. */
|
|
|
|
|
if (binfo)
|
|
|
|
|
datum = build_base_path (PLUS_EXPR, datum, binfo, 1);
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
/* Build an expression for "object + offset" where offset is the
|
|
|
|
|
value stored in the pointer-to-data-member. */
|
2007-05-19 01:19:51 +00:00
|
|
|
|
datum = build2 (PLUS_EXPR, build_pointer_type (type),
|
|
|
|
|
datum, build_nop (ptrdiff_type_node, component));
|
2004-07-28 03:11:36 +00:00
|
|
|
|
return build_indirect_ref (datum, 0);
|
|
|
|
|
}
|
|
|
|
|
else
|
2007-05-19 01:19:51 +00:00
|
|
|
|
return build2 (OFFSET_REF, type, datum, component);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
/* Return a tree node for the expression TYPENAME '(' PARMS ')'. */
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
tree
|
2004-07-28 03:11:36 +00:00
|
|
|
|
build_functional_cast (tree exp, tree parms)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
|
|
|
|
/* This is either a call to a constructor,
|
|
|
|
|
or a C cast in C++'s `functional' notation. */
|
1999-08-26 09:30:50 +00:00
|
|
|
|
tree type;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
if (exp == error_mark_node || parms == error_mark_node)
|
|
|
|
|
return error_mark_node;
|
|
|
|
|
|
2004-07-28 03:11:36 +00:00
|
|
|
|
if (TREE_CODE (exp) == TYPE_DECL)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
type = TREE_TYPE (exp);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
else
|
|
|
|
|
type = exp;
|
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
if (processing_template_decl)
|
2004-07-28 03:11:36 +00:00
|
|
|
|
{
|
|
|
|
|
tree t = build_min (CAST_EXPR, type, parms);
|
|
|
|
|
/* We don't know if it will or will not have side effects. */
|
|
|
|
|
TREE_SIDE_EFFECTS (t) = 1;
|
|
|
|
|
return t;
|
|
|
|
|
}
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
1996-09-18 05:35:50 +00:00
|
|
|
|
if (! IS_AGGR_TYPE (type))
|
|
|
|
|
{
|
|
|
|
|
if (parms == NULL_TREE)
|
2007-05-19 01:19:51 +00:00
|
|
|
|
return cp_convert (type, integer_zero_node);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
/* This must build a C cast. */
|
|
|
|
|
parms = build_x_compound_expr_from_list (parms, "functional cast");
|
1999-08-26 09:30:50 +00:00
|
|
|
|
return build_c_cast (type, parms);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
/* Prepare to evaluate as a call to a constructor. If this expression
|
|
|
|
|
is actually used, for example,
|
2007-05-19 01:19:51 +00:00
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
return X (arg1, arg2, ...);
|
2007-05-19 01:19:51 +00:00
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
then the slot being initialized will be filled in. */
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
if (!complete_type_or_else (type, NULL_TREE))
|
|
|
|
|
return error_mark_node;
|
|
|
|
|
if (abstract_virtuals_error (NULL_TREE, type))
|
|
|
|
|
return error_mark_node;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
|
|
|
|
if (parms && TREE_CHAIN (parms) == NULL_TREE)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
return build_c_cast (type, TREE_VALUE (parms));
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2007-05-19 01:19:51 +00:00
|
|
|
|
/* We need to zero-initialize POD types. */
|
|
|
|
|
if (parms == NULL_TREE
|
|
|
|
|
&& !CLASSTYPE_NON_POD_P (type)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
&& TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
|
|
|
|
|
{
|
2007-08-14 02:45:23 +00:00
|
|
|
|
exp = build_zero_init (type,
|
|
|
|
|
/*nelts=*/NULL_TREE,
|
|
|
|
|
/*static_storage_p=*/false);
|
1999-08-26 09:30:50 +00:00
|
|
|
|
return get_target_expr (exp);
|
|
|
|
|
}
|
1996-09-18 05:35:50 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
exp = build_special_member_call (NULL_TREE, complete_ctor_identifier, parms,
|
2007-05-19 01:19:51 +00:00
|
|
|
|
type, LOOKUP_NORMAL);
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
|
|
|
|
if (exp == error_mark_node)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
return error_mark_node;
|
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
return build_cplus_new (type, exp);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
|
|
|
|
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Add new exception specifier SPEC, to the LIST we currently have.
|
|
|
|
|
If it's already in LIST then do nothing.
|
|
|
|
|
Moan if it's bad and we're allowed to. COMPLAIN < 0 means we
|
|
|
|
|
know what we're doing. */
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
tree
|
2004-07-28 03:11:36 +00:00
|
|
|
|
add_exception_specifier (tree list, tree spec, int complain)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2004-07-28 03:11:36 +00:00
|
|
|
|
bool ok;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
tree core = spec;
|
2004-07-28 03:11:36 +00:00
|
|
|
|
bool is_ptr;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
int diag_type = -1; /* none */
|
2007-05-19 01:19:51 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
if (spec == error_mark_node)
|
|
|
|
|
return list;
|
2007-05-19 01:19:51 +00:00
|
|
|
|
|
|
|
|
|
gcc_assert (spec && (!list || TREE_VALUE (list)));
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* [except.spec] 1, type in an exception specifier shall not be
|
|
|
|
|
incomplete, or pointer or ref to incomplete other than pointer
|
|
|
|
|
to cv void. */
|
|
|
|
|
is_ptr = TREE_CODE (core) == POINTER_TYPE;
|
|
|
|
|
if (is_ptr || TREE_CODE (core) == REFERENCE_TYPE)
|
|
|
|
|
core = TREE_TYPE (core);
|
|
|
|
|
if (complain < 0)
|
2004-07-28 03:11:36 +00:00
|
|
|
|
ok = true;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
else if (VOID_TYPE_P (core))
|
|
|
|
|
ok = is_ptr;
|
|
|
|
|
else if (TREE_CODE (core) == TEMPLATE_TYPE_PARM)
|
2004-07-28 03:11:36 +00:00
|
|
|
|
ok = true;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
else if (processing_template_decl)
|
2004-07-28 03:11:36 +00:00
|
|
|
|
ok = true;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
else
|
2003-07-11 03:40:53 +00:00
|
|
|
|
{
|
2004-07-28 03:11:36 +00:00
|
|
|
|
ok = true;
|
2003-07-11 03:40:53 +00:00
|
|
|
|
/* 15.4/1 says that types in an exception specifier must be complete,
|
2007-05-19 01:19:51 +00:00
|
|
|
|
but it seems more reasonable to only require this on definitions
|
|
|
|
|
and calls. So just give a pedwarn at this point; we will give an
|
|
|
|
|
error later if we hit one of those two cases. */
|
2003-07-11 03:40:53 +00:00
|
|
|
|
if (!COMPLETE_TYPE_P (complete_type (core)))
|
|
|
|
|
diag_type = 2; /* pedwarn */
|
|
|
|
|
}
|
2002-02-01 18:16:02 +00:00
|
|
|
|
|
|
|
|
|
if (ok)
|
1996-09-18 05:35:50 +00:00
|
|
|
|
{
|
2002-02-01 18:16:02 +00:00
|
|
|
|
tree probe;
|
2007-05-19 01:19:51 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
for (probe = list; probe; probe = TREE_CHAIN (probe))
|
2007-05-19 01:19:51 +00:00
|
|
|
|
if (same_type_p (TREE_VALUE (probe), spec))
|
|
|
|
|
break;
|
2002-02-01 18:16:02 +00:00
|
|
|
|
if (!probe)
|
2003-07-11 03:40:53 +00:00
|
|
|
|
list = tree_cons (NULL_TREE, spec, list);
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
2003-07-11 03:40:53 +00:00
|
|
|
|
else
|
|
|
|
|
diag_type = 0; /* error */
|
2007-05-19 01:19:51 +00:00
|
|
|
|
|
2003-07-11 03:40:53 +00:00
|
|
|
|
if (diag_type >= 0 && complain)
|
|
|
|
|
cxx_incomplete_type_diagnostic (NULL_TREE, core, diag_type);
|
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
return list;
|
1996-09-18 05:35:50 +00:00
|
|
|
|
}
|
1999-08-26 09:30:50 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
/* Combine the two exceptions specifier lists LIST and ADD, and return
|
2003-07-11 03:40:53 +00:00
|
|
|
|
their union. */
|
1999-10-16 06:09:09 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
tree
|
2004-07-28 03:11:36 +00:00
|
|
|
|
merge_exception_specifiers (tree list, tree add)
|
1999-08-26 09:30:50 +00:00
|
|
|
|
{
|
2002-02-01 18:16:02 +00:00
|
|
|
|
if (!list || !add)
|
|
|
|
|
return NULL_TREE;
|
|
|
|
|
else if (!TREE_VALUE (list))
|
|
|
|
|
return add;
|
|
|
|
|
else if (!TREE_VALUE (add))
|
|
|
|
|
return list;
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
tree orig_list = list;
|
2007-05-19 01:19:51 +00:00
|
|
|
|
|
2002-02-01 18:16:02 +00:00
|
|
|
|
for (; add; add = TREE_CHAIN (add))
|
2007-05-19 01:19:51 +00:00
|
|
|
|
{
|
|
|
|
|
tree spec = TREE_VALUE (add);
|
|
|
|
|
tree probe;
|
|
|
|
|
|
|
|
|
|
for (probe = orig_list; probe; probe = TREE_CHAIN (probe))
|
|
|
|
|
if (same_type_p (TREE_VALUE (probe), spec))
|
|
|
|
|
break;
|
|
|
|
|
if (!probe)
|
|
|
|
|
{
|
|
|
|
|
spec = build_tree_list (NULL_TREE, spec);
|
|
|
|
|
TREE_CHAIN (spec) = list;
|
|
|
|
|
list = spec;
|
|
|
|
|
}
|
|
|
|
|
}
|
2002-02-01 18:16:02 +00:00
|
|
|
|
}
|
|
|
|
|
return list;
|
1999-08-26 09:30:50 +00:00
|
|
|
|
}
|
2003-07-11 03:40:53 +00:00
|
|
|
|
|
|
|
|
|
/* Subroutine of build_call. Ensure that each of the types in the
|
|
|
|
|
exception specification is complete. Technically, 15.4/1 says that
|
|
|
|
|
they need to be complete when we see a declaration of the function,
|
|
|
|
|
but we should be able to get away with only requiring this when the
|
|
|
|
|
function is defined or called. See also add_exception_specifier. */
|
|
|
|
|
|
|
|
|
|
void
|
2004-07-28 03:11:36 +00:00
|
|
|
|
require_complete_eh_spec_types (tree fntype, tree decl)
|
2003-07-11 03:40:53 +00:00
|
|
|
|
{
|
|
|
|
|
tree raises;
|
|
|
|
|
/* Don't complain about calls to op new. */
|
|
|
|
|
if (decl && DECL_ARTIFICIAL (decl))
|
|
|
|
|
return;
|
|
|
|
|
for (raises = TYPE_RAISES_EXCEPTIONS (fntype); raises;
|
|
|
|
|
raises = TREE_CHAIN (raises))
|
|
|
|
|
{
|
|
|
|
|
tree type = TREE_VALUE (raises);
|
|
|
|
|
if (type && !COMPLETE_TYPE_P (type))
|
|
|
|
|
{
|
|
|
|
|
if (decl)
|
|
|
|
|
error
|
2007-05-19 01:19:51 +00:00
|
|
|
|
("call to function %qD which throws incomplete type %q#T",
|
2003-07-11 03:40:53 +00:00
|
|
|
|
decl, type);
|
|
|
|
|
else
|
2007-05-19 01:19:51 +00:00
|
|
|
|
error ("call to function which throws incomplete type %q#T",
|
2003-07-11 03:40:53 +00:00
|
|
|
|
decl);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
2007-05-19 01:19:51 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#include "gt-cp-typeck2.h"
|