procyberian/gcc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

call.c: Fix comment formatting.

Browse source 
* call.c: Fix comment formatting.
	* class.c: Likewise.
	* cp-tree.h: Likewise.
	* cvt.c: Likewise.
	* cxx-pretty-print.c: Likewise.
	* decl.c: Likewise.
	* decl2.c: Likewise.
	* error.c: Likewise.
	* except.c: Likewise.
	* init.c: Likewise.
	* name-lookup.c: Likewise.
	* parser.c: Likewise.
	* pt.c: Likewise.
	* rtti.c: Likewise.
	* semantics.c: Likewise.
	* typeck.c: Likewise.
	* typeck2.c: Likewise.

From-SVN: r74916
This commit is contained in:
Kazu Hirata 2003-12-21 21:07:32 +00:00 • committed by Kazu Hirata
parent 90f107de3b
commit f4f206f46f
18 changed files with 86 additions and 65 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

20
gcc/cp/ChangeLog
View file

@ -1,3 +1,23 @@
2003-12-21 Kazu Hirata <kazu@cs.umass.edu>
* call.c: Fix comment formatting.
* class.c: Likewise.
* cp-tree.h: Likewise.
* cvt.c: Likewise.
* cxx-pretty-print.c: Likewise.
* decl.c: Likewise.
* decl2.c: Likewise.
* error.c: Likewise.
* except.c: Likewise.
* init.c: Likewise.
* name-lookup.c: Likewise.
* parser.c: Likewise.
* pt.c: Likewise.
* rtti.c: Likewise.
* semantics.c: Likewise.
* typeck.c: Likewise.
* typeck2.c: Likewise.
2003-12-19 Kazu Hirata <kazu@cs.umass.edu>
* cvt.c: Remove uses of "register" specifier in

6
gcc/cp/call.c
View file

@ -1744,7 +1744,7 @@ add_builtin_candidate (struct z_candidate **candidates, enum tree_code code,
type1 = type2;
break;
}
/* FALLTHROUGH */
/* Fall through. */
case LT_EXPR:
case GT_EXPR:
case LE_EXPR:
@ -2037,7 +2037,7 @@ add_builtin_candidates (struct z_candidate **candidates, enum tree_code code,
case GT_EXPR:
case GE_EXPR:
enum_p = 1;
/* FALLTHROUGH */
/* Fall through. */
default:
ref1 = 0;
@ -4102,7 +4102,7 @@ convert_like_real (tree convs, tree expr, tree fn, int argnum, int inner,
case RVALUE_CONV:
if (! IS_AGGR_TYPE (totype))
return expr;
/* else fall through */
/* Else fall through. */
case BASE_CONV:
if (TREE_CODE (convs) == BASE_CONV && !NEED_TEMPORARY_P (convs))
{

4
gcc/cp/class.c
View file

@ -1183,7 +1183,7 @@ handle_using_decl (tree using_decl, tree t)
return;
}
/* Make type T see field decl FDECL with access ACCESS.*/
/* Make type T see field decl FDECL with access ACCESS. */
if (flist)
for (; flist; flist = OVL_NEXT (flist))
{
@ -5039,7 +5039,7 @@ finish_struct_1 (tree t)
bases and members and add implicitly generated methods. */
check_bases_and_members (t);
/* Find the key method */
/* Find the key method. */
if (TYPE_CONTAINS_VPTR_P (t))
{
CLASSTYPE_KEY_METHOD (t) = key_method (t);

6
gcc/cp/cp-tree.h
View file

@ -1357,7 +1357,7 @@ struct lang_type GTY(())
#define TYPE_HAS_DEFAULT_CONSTRUCTOR(NODE) \
(LANG_TYPE_CLASS_CHECK (NODE)->h.has_default_ctor)
/* Nonzero means that this type contains a mutable member */
/* Nonzero means that this type contains a mutable member. */
#define CLASSTYPE_HAS_MUTABLE(NODE) (LANG_TYPE_CLASS_CHECK (NODE)->has_mutable)
#define TYPE_HAS_MUTABLE_P(NODE) (cp_has_mutable_p (NODE))
@ -2894,7 +2894,7 @@ struct lang_decl GTY(())
#define THUNK_VIRTUAL_OFFSET(DECL) \
(LANG_DECL_U2_CHECK (FUNCTION_DECL_CHECK (DECL), 0)->virtual_offset)
/* A thunk which is equivalent to another thunk. */
/* A thunk which is equivalent to another thunk. */
#define THUNK_ALIAS(DECL) \
(DECL_LANG_SPECIFIC (FUNCTION_DECL_CHECK (DECL))->decl_flags.u.thunk_alias)
@ -2946,7 +2946,7 @@ typedef enum cp_lvalue_kind {
clk_ordinary = 1, /* An ordinary lvalue. */
clk_class = 2, /* An rvalue of class-type. */
clk_bitfield = 4, /* An lvalue for a bit-field. */
clk_packed = 8 /* An lvalue for a packed field. */
clk_packed = 8 /* An lvalue for a packed field. */
} cp_lvalue_kind;
/* Various kinds of template specialization, instantiation, etc. */

2
gcc/cp/cvt.c
View file

@ -835,7 +835,7 @@ convert_to_void (tree expr, const char *implicit)
/* These have already decayed to rvalue. */
break;
case CALL_EXPR: /* we have a special meaning for volatile void fn() */
case CALL_EXPR: /* We have a special meaning for volatile void fn(). */
break;
case INDIRECT_REF:

2
gcc/cp/cxx-pretty-print.c
View file

@ -619,7 +619,7 @@ pp_cxx_pm_expression (cxx_pretty_printer *pp, tree t)
pp_cxx_qualified_id (pp, t);
break;
}
/* else fall through */
/* Else fall through. */
case MEMBER_REF:
case DOTSTAR_EXPR:
pp_cxx_pm_expression (pp, TREE_OPERAND (t, 0));

18
gcc/cp/decl.c
View file

@ -1856,7 +1856,7 @@ duplicate_decls (tree newdecl, tree olddecl)
DECL_COMMON (newdecl) = DECL_COMMON (olddecl);
COPY_DECL_ASSEMBLER_NAME (olddecl, newdecl);
/* If either declaration has a nondefault visibility, use it. */
/* If either declaration has a nondefault visibility, use it. */
if (DECL_VISIBILITY (olddecl) != VISIBILITY_DEFAULT)
{
if (DECL_VISIBILITY (newdecl) != VISIBILITY_DEFAULT
@ -3103,7 +3103,7 @@ cxx_init_decl_processing (void)
/* 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. */
filled in with the type of the init. */
tree
cp_fname_init (const char* name, tree *type_p)
@ -3377,7 +3377,7 @@ fixup_anonymous_aggr (tree t)
{
tree *q;
/* Wipe out memory of synthesized methods */
/* Wipe out memory of synthesized methods. */
TYPE_HAS_CONSTRUCTOR (t) = 0;
TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 0;
TYPE_HAS_INIT_REF (t) = 0;
@ -4925,7 +4925,7 @@ cp_finish_decl (tree decl, tree init, tree asmspec_tree, int flags)
mark_referenced (DECL_ASSEMBLER_NAME (decl));
}
/* This is here for a midend callback from c-common.c */
/* This is here for a midend callback from c-common.c. */
void
finish_decl (tree decl, tree init, tree asmspec_tree)
@ -6079,7 +6079,7 @@ compute_array_index_type (tree name, tree size)
cp_convert (ssizetype, size),
cp_convert (ssizetype, integer_one_node)));
if (!TREE_CONSTANT (itype))
/* A variable sized array. */
/* 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
@ -7088,7 +7088,7 @@ grokdeclarator (tree declarator,
else if (RIDBIT_SETP (RID_TYPEDEF, specbits))
;
else if (decl_context == FIELD
/* C++ allows static class elements */
/* C++ allows static class elements. */
&& RIDBIT_SETP (RID_STATIC, specbits))
/* C++ also allows inlines and signed and unsigned elements,
but in those cases we don't come in here. */
@ -8196,7 +8196,7 @@ grokdeclarator (tree declarator,
return void_type_node;
}
/* Structure field. It may not be a function, except for C++ */
/* Structure field. It may not be a function, except for C++. */
if (decl == NULL_TREE)
{
@ -8421,7 +8421,7 @@ require_complete_types_for_parms (tree parms)
for (; parms; parms = TREE_CHAIN (parms))
{
if (VOID_TYPE_P (TREE_TYPE (parms)))
/* grokparms will have already issued an error */
/* grokparms will have already issued an error. */
TREE_TYPE (parms) = error_mark_node;
else if (complete_type_or_else (TREE_TYPE (parms), parms))
{
@ -10938,7 +10938,7 @@ start_method (tree declspecs, tree declarator, tree attrlist)
cp_finish_decl (fndecl, NULL_TREE, NULL_TREE, 0);
/* Make a place for the parms */
/* Make a place for the parms. */
begin_scope (sk_function_parms, fndecl);
DECL_IN_AGGR_P (fndecl) = 1;

8
gcc/cp/decl2.c
View file

@ -1306,12 +1306,12 @@ coerce_new_type (tree type)
{
case 2:
args = tree_cons (NULL_TREE, size_type_node, args);
/* FALLTHROUGH */
/* Fall through. */
case 1:
type = build_exception_variant
(build_function_type (ptr_type_node, args),
TYPE_RAISES_EXCEPTIONS (type));
/* FALLTHROUGH */
/* Fall through. */
default:;
}
return type;
@ -1340,12 +1340,12 @@ coerce_delete_type (tree type)
{
case 2:
args = tree_cons (NULL_TREE, ptr_type_node, args);
/* FALLTHROUGH */
/* Fall through. */
case 1:
type = build_exception_variant
(build_function_type (void_type_node, args),
TYPE_RAISES_EXCEPTIONS (type));
/* FALLTHROUGH */
/* Fall through. */
default:;
}

12
gcc/cp/error.c
View file

@ -331,7 +331,7 @@ dump_type (tree t, int flags)
? DECL_ORIGINAL_TYPE (t) : TREE_TYPE (t), flags);
break;
}
/* else fallthrough */
/* Else fall through. */
case TEMPLATE_DECL:
case NAMESPACE_DECL:
@ -644,7 +644,7 @@ dump_type_suffix (tree t, int flags)
dump_type_suffix (TREE_TYPE (t), flags);
break;
/* Can only be reached through function pointer */
/* Can only be reached through function pointer. */
case FUNCTION_TYPE:
case METHOD_TYPE:
{
@ -788,7 +788,7 @@ dump_decl (tree t, int flags)
dump_type (DECL_CONTEXT (t), flags);
break;
}
/* else fall through */
/* Else fall through. */
case FIELD_DECL:
case PARM_DECL:
dump_simple_decl (t, TREE_TYPE (t), flags);
@ -1050,7 +1050,7 @@ dump_function_decl (tree t, int flags)
if (DECL_CLASS_SCOPE_P (t))
cname = DECL_CONTEXT (t);
/* this is for partially instantiated template methods */
/* This is for partially instantiated template methods. */
else if (TREE_CODE (fntype) == METHOD_TYPE)
cname = TREE_TYPE (TREE_VALUE (parmtypes));
@ -1269,7 +1269,7 @@ dump_template_parms (tree info, int primary, int flags)
pp_template_argument_list_end (cxx_pp);
}
/* Print out a list of initializers (subr of dump_expr) */
/* Print out a list of initializers (subr of dump_expr). */
static void
dump_expr_list (tree l, int flags)
@ -1596,7 +1596,7 @@ dump_expr (tree t, int flags)
pp_right_paren (cxx_pp);
break;
}
/* else FALLTHRU */
/* Else fall through. */
}
dump_expr (TREE_OPERAND (t, 0), flags | TFF_EXPR_IN_PARENS);
break;

4
gcc/cp/except.c
View file

@ -296,7 +296,7 @@ choose_personality_routine (enum languages lang)
return;
case chose_none:
; /* proceed to language selection */
; /* Proceed to language selection. */
}
switch (lang)
@ -892,7 +892,7 @@ can_convert_eh (tree to, tree from)
if (TREE_CODE (to) == VOID_TYPE)
return 1;
/* else fall through */
/* Else fall through. */
}
if (CLASS_TYPE_P (to) && CLASS_TYPE_P (from)

13
gcc/cp/init.c
View file

@ -1121,7 +1121,7 @@ build_aggr_init (tree exp, tree init, int flags)
}
if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
/* just know that we've seen something for this node */
/* Just know that we've seen something for this node. */
TREE_USED (exp) = 1;
TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
@ -1499,7 +1499,7 @@ build_offset_ref (tree type, tree name, bool address_p)
if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
{
/* Get rid of a potential OVERLOAD around it */
/* Get rid of a potential OVERLOAD around it. */
t = OVL_CURRENT (t);
/* Unique functions are handled easily. */
@ -1687,7 +1687,7 @@ build_new (tree placement, tree decl, tree init, int use_global_new)
if (absdcl && TREE_CODE (absdcl) == ARRAY_REF)
{
/* probably meant to be a vec new */
/* Probably meant to be a vec new. */
tree this_nelts;
while (TREE_OPERAND (absdcl, 0)
@ -1842,7 +1842,7 @@ build_java_class_ref (tree type)
jclass_node = TREE_TYPE (jclass_node);
}
/* Mangle the class$ field */
/* Mangle the class$ field. */
{
tree field;
for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
@ -2855,7 +2855,7 @@ build_delete (tree type, tree addr, special_function_kind auto_delete,
if (TREE_SIDE_EFFECTS (addr))
addr = save_expr (addr);
/* throw away const and volatile on target type of addr */
/* Throw away const and volatile on target type of addr. */
addr = convert_force (build_pointer_type (type), addr, 0);
}
else if (TREE_CODE (type) == ARRAY_TYPE)
@ -3115,7 +3115,8 @@ build_vec_delete (tree base, tree maxindex,
}
else if (TREE_CODE (type) == ARRAY_TYPE)
{
/* get the total number of things in the array, maxindex is a bad name */
/* Get the total number of things in the array, maxindex is a
bad name. */
maxindex = array_type_nelts_total (type);
type = strip_array_types (type);
base = build_unary_op (ADDR_EXPR, base, 1);

4
gcc/cp/name-lookup.c
View file

@ -525,7 +525,7 @@ add_decl_to_level (tree decl, cxx_scope *b)
b->names = decl;
b->names_size++;
/* If appropriate, add decl to separate list of statics */
/* If appropriate, add decl to separate list of statics. */
if (b->kind == sk_namespace)
if ((TREE_CODE (decl) == VAR_DECL && TREE_STATIC (decl))
|| (TREE_CODE (decl) == FUNCTION_DECL
@ -1269,7 +1269,7 @@ begin_scope (scope_kind kind, tree entity)
case sk_template_spec:
scope->explicit_spec_p = true;
kind = sk_template_parms;
/* fall through */
/* Fall through. */
case sk_template_parms:
case sk_block:
case sk_try:

2
gcc/cp/parser.c
View file

@ -2022,7 +2022,7 @@ cp_parser_skip_to_closing_parenthesis (cp_parser *parser,
token = cp_lexer_peek_token (parser->lexer);
/* This matches the processing in skip_to_end_of_statement */
/* This matches the processing in skip_to_end_of_statement. */
if (token->type == CPP_SEMICOLON && !brace_depth)
return 0;
if (token->type == CPP_OPEN_BRACE)

16
gcc/cp/pt.c
View file

@ -2223,7 +2223,7 @@ process_template_parm (tree list, tree next)
else
{
t = make_aggr_type (TEMPLATE_TYPE_PARM);
/* parm is either IDENTIFIER_NODE or NULL_TREE */
/* parm is either IDENTIFIER_NODE or NULL_TREE. */
decl = build_decl (TYPE_DECL, parm, t);
}
@ -3889,7 +3889,7 @@ mangle_class_name_for_template (const char* name, tree parms, tree arglist)
cat (IDENTIFIER_POINTER (DECL_NAME (arg)));
}
else
/* Output the parameter declaration */
/* Output the parameter declaration. */
cat (type_as_string (arg, TFF_CHASE_TYPEDEF));
continue;
}
@ -4630,7 +4630,7 @@ for_each_template_parm_r (tree* tp, int* walk_subtrees, void* d)
break;
case TEMPLATE_DECL:
/* A template template parameter is encountered */
/* A template template parameter is encountered. */
if (DECL_TEMPLATE_TEMPLATE_PARM_P (t)
&& for_each_template_parm (TREE_TYPE (t), fn, data, pfd->visited))
return error_mark_node;
@ -5755,7 +5755,7 @@ tsubst_aggr_type (tree t,
if (TYPE_PTRMEMFUNC_P (t))
return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t), args, complain, in_decl);
/* else fall through */
/* Else fall through. */
case ENUMERAL_TYPE:
case UNION_TYPE:
if (TYPE_TEMPLATE_INFO (t))
@ -6692,7 +6692,7 @@ tsubst (tree t, tree args, tsubst_flags_t complain, tree in_decl)
else if (TREE_CODE (t) == BOUND_TEMPLATE_TEMPLATE_PARM)
{
/* We are processing a type constructed from
a template template parameter */
a template template parameter. */
tree argvec = tsubst (TYPE_TI_ARGS (t),
args, complain, in_decl);
if (argvec == error_mark_node)
@ -8627,7 +8627,7 @@ instantiate_template (tree tmpl, tree targ_ptr, tsubst_flags_t complain)
deferring all checks until we have the FUNCTION_DECL. */
push_deferring_access_checks (dk_deferred);
/* substitute template parameters */
/* Substitute template parameters. */
fndecl = tsubst (DECL_TEMPLATE_RESULT (gen_tmpl),
targ_ptr, complain, gen_tmpl);
@ -9055,7 +9055,7 @@ type_unification_real (tree tparms,
are present, and the parm list isn't variadic. */
if (args && args != void_list_node && parms == void_list_node)
return 1;
/* Fail if parms are left and they don't have default values. */
/* Fail if parms are left and they don't have default values. */
if (parms
&& parms != void_list_node
&& TREE_PURPOSE (parms) == NULL_TREE)
@ -9993,7 +9993,7 @@ unify (tree tparms, tree targs, tree parm, tree arg, int strict)
return unify (tparms, targs, t1, t, strict);
}
/* else fall through */
/* Else fall through. */
default:
if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (parm))))

2
gcc/cp/rtti.c
View file

@ -1065,7 +1065,7 @@ get_pseudo_ti_init (tree type, tree var_desc, bool *non_public_p)
else
offset = BINFO_OFFSET (base_binfo);
/* combine offset and flags into one field */
/* Combine offset and flags into one field. */
offset = cp_build_binary_op (LSHIFT_EXPR, offset,
build_int_2 (8, 0));
offset = cp_build_binary_op (BIT_IOR_EXPR, offset,

2
gcc/cp/semantics.c
View file

@ -1232,7 +1232,7 @@ finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
type = TREE_TYPE (type);
else
{
/* Set the cv qualifiers */
/* Set the cv qualifiers. */
int quals = cp_type_quals (TREE_TYPE (current_class_ref));
if (DECL_MUTABLE_P (decl))

26
gcc/cp/typeck.c
View file

@ -900,7 +900,7 @@ comptypes (tree t1, tree t2, int strict)
if (t1 == t2)
return true;
/* Suppress errors caused by previously reported errors */
/* Suppress errors caused by previously reported errors. */
if (t1 == error_mark_node || t2 == error_mark_node)
return false;
@ -974,7 +974,7 @@ comptypes (tree t1, tree t2, int strict)
return true;
/* Don't check inheritance. */
strict = COMPARE_STRICT;
/* fall through */
/* Fall through. */
case RECORD_TYPE:
case UNION_TYPE:
@ -995,7 +995,7 @@ comptypes (tree t1, tree t2, int strict)
if (!comptypes (TYPE_OFFSET_BASETYPE (t1), TYPE_OFFSET_BASETYPE (t2),
strict & ~COMPARE_REDECLARATION))
return false;
/* FALLTHROUGH*/
/* Fall through. */
case POINTER_TYPE:
case REFERENCE_TYPE:
@ -2583,7 +2583,7 @@ convert_arguments (tree typelist, tree values, tree fndecl, int flags)
if (typetail != 0 && typetail != void_list_node)
{
/* See if there are default arguments that can be used */
/* See if there are default arguments that can be used. */
if (TREE_PURPOSE (typetail)
&& TREE_CODE (TREE_PURPOSE (typetail)) != DEFAULT_ARG)
{
@ -3501,7 +3501,7 @@ build_x_unary_op (enum tree_code code, tree xarg)
&& ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (xarg)))
&& !COMPLETE_TYPE_P (TREE_TYPE (xarg)))
|| (TREE_CODE (xarg) == OFFSET_REF)))
/* don't look for a function */;
/* Don't look for a function. */;
else
exp = build_new_op (code, LOOKUP_NORMAL, xarg, NULL_TREE, NULL_TREE);
if (!exp && code == ADDR_EXPR)
@ -3907,7 +3907,7 @@ build_unary_op (enum tree_code code, tree xarg, int noconvert)
return arg;
}
/* For &x[y], return x+y */
/* For &x[y], return x+y. */
if (TREE_CODE (arg) == ARRAY_REF)
{
if (!cxx_mark_addressable (TREE_OPERAND (arg, 0)))
@ -4230,10 +4230,10 @@ cxx_mark_addressable (tree exp)
if (x == current_class_ptr)
{
error ("cannot take the address of `this', which is an rvalue expression");
TREE_ADDRESSABLE (x) = 1; /* so compiler doesn't die later */
TREE_ADDRESSABLE (x) = 1; /* so compiler doesn't die later. */
return true;
}
/* FALLTHRU */
/* Fall through. */
case VAR_DECL:
/* Caller should not be trying to mark initialized
@ -4242,7 +4242,7 @@ cxx_mark_addressable (tree exp)
|| DECL_IN_AGGR_P (x) == 0
|| TREE_STATIC (x)
|| DECL_EXTERNAL (x), 314);
/* FALLTHRU */
/* Fall through. */
case CONST_DECL:
case RESULT_DECL:
@ -4927,7 +4927,7 @@ build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs)
/* Handle control structure constructs used as "lvalues". */
switch (TREE_CODE (lhs))
{
/* Handle --foo = 5; as these are valid constructs in C++ */
/* Handle --foo = 5; as these are valid constructs in C++. */
case PREDECREMENT_EXPR:
case PREINCREMENT_EXPR:
if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
@ -5006,7 +5006,7 @@ build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs)
return result;
}
else if (! IS_AGGR_TYPE (lhstype))
/* Do the default thing */;
/* Do the default thing. */;
else
{
result = build_special_member_call (lhs, complete_ctor_identifier,
@ -5033,7 +5033,7 @@ build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs)
{
/* `operator=' is not an inheritable operator. */
if (! IS_AGGR_TYPE (lhstype))
/* Do the default thing */;
/* Do the default thing. */;
else
{
result = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL,
@ -6186,7 +6186,7 @@ cp_type_quals (tree type)
return TYPE_QUALS (type);
}
/* Returns nonzero if the TYPE contains a mutable member */
/* Returns nonzero if the TYPE contains a mutable member. */
bool
cp_has_mutable_p (tree type)

4
gcc/cp/typeck2.c
View file

@ -615,7 +615,7 @@ process_init_constructor (tree type, tree init, tree* elts)
- TREE_INT_CST_LOW (TYPE_MIN_VALUE (domain))
+ 1);
else
len = -1; /* Take as many as there are */
len = -1; /* Take as many as there are. */
}
else
{
@ -1131,7 +1131,7 @@ build_functional_cast (tree exp, tree parms)
if (! IS_AGGR_TYPE (type))
{
/* this must build a C cast */
/* This must build a C cast. */
if (parms == NULL_TREE)
parms = integer_zero_node;
else