* call.c: Fix comment formatting.
* class.c: Likewise.
* cxx-pretty-print.c: Likewise.
* init.c: Likewise.
* parser.c: Likewise.
* pt.c: Likewise.
* semantics.c: Likewise.
* tree.c: Likewise.
* typeck.c: Likewise.
* typeck2.c: Likewise.
From-SVN: r72828
+2003-10-22 Kazu Hirata <kazu@cs.umass.edu>
+
+ * call.c: Fix comment formatting.
+ * class.c: Likewise.
+ * cxx-pretty-print.c: Likewise.
+ * init.c: Likewise.
+ * parser.c: Likewise.
+ * pt.c: Likewise.
+ * semantics.c: Likewise.
+ * tree.c: Likewise.
+ * typeck.c: Likewise.
+ * typeck2.c: Likewise.
+
2003-10-21 Mark Mitchell <mark@codesourcery.com>
PR c++/11962
else if (fromref || (expr && lvalue_p (expr)))
conv = build_conv (RVALUE_CONV, from, conv);
- /* Allow conversion between `__complex__' data types */
+ /* Allow conversion between `__complex__' data types. */
if (tcode == COMPLEX_TYPE && fcode == COMPLEX_TYPE)
{
/* The standard conversion sequence to convert FROM to TO is
if (addr != error_mark_node
&& TREE_SIDE_EFFECTS (TREE_OPERAND (rhs, 0)))
- /* Do not lose object's side effects. */
+ /* Do not lose object's side effects. */
addr = build (COMPOUND_EXPR, TREE_TYPE (addr),
TREE_OPERAND (rhs, 0), addr);
return addr;
}
-/* Expressions. */
+/* Expressions. */
static inline bool
is_destructor_name (tree name)
{
const enum tree_code code = TREE_CODE (parm);
- /* Brings type template parameters to the canonical forms */
+ /* Brings type template parameters to the canonical forms. */
if (code == TEMPLATE_TYPE_PARM || code == TEMPLATE_TEMPLATE_PARM
|| code == BOUND_TEMPLATE_TEMPLATE_PARM)
parm = TEMPLATE_TYPE_PARM_INDEX (parm);
stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
- /* Now convert make the result have the correct type. */
+ /* Now convert make the result have the correct type. */
atype = build_pointer_type (atype);
stmt_expr = build1 (NOP_EXPR, atype, stmt_expr);
stmt_expr = build_indirect_ref (stmt_expr, NULL);
CP_PARSER_DECLARATOR_ABSTRACT,
/* We want a named declarator. */
CP_PARSER_DECLARATOR_NAMED,
- /* We don't mind, but the name must be an unqualified-id */
+ /* We don't mind, but the name must be an unqualified-id. */
CP_PARSER_DECLARATOR_EITHER
} cp_parser_declarator_kind;
unsigned num_template_parameter_lists;
} cp_parser;
-/* The type of a function that parses some kind of expression */
+/* The type of a function that parses some kind of expression. */
typedef tree (*cp_parser_expression_fn) (cp_parser *);
/* Prototypes. */
tree statement = NULL_TREE;
/* If the next token is a ';', then there is no expression
- statement. */
+ statement. */
if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
statement = cp_parser_expression (parser);
template-argument
template-argument-list , template-argument
- Returns a TREE_VEC containing the arguments. */
+ Returns a TREE_VEC containing the arguments. */
static tree
cp_parser_template_argument_list (cp_parser* parser)
tree argument;
if (n_args)
- /* Consume the comma. */
+ /* Consume the comma. */
cp_lexer_consume_token (parser->lexer);
/* Parse the template-argument. */
-- the address of an object or function with external linkage...
- -- a pointer to member... */
+ -- a pointer to member... */
/* Look for a non-type template parameter. */
if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
{
cp_parser_error (parser, "invalid non-type template argument");
return error_mark_node;
}
- /* The argument must be a constant-expression. */
+ /* The argument must be a constant-expression. */
argument = cp_parser_constant_expression (parser,
/*allow_non_constant_p=*/false,
/*non_constant_p=*/NULL);
/* Consume the `typeof' token. */
cp_lexer_consume_token (parser->lexer);
- /* Parse the operand to `typeof' */
+ /* Parse the operand to `typeof'. */
operand = cp_parser_sizeof_operand (parser, RID_TYPEOF);
/* If it is not already a TYPE, take its type. */
if (!TYPE_P (operand))
CPP_SEMICOLON))
{
cp_parser_error (parser, "expected `;'");
- /* Skip tokens until we find a `;' */
+ /* Skip tokens until we find a `;'. */
cp_parser_skip_to_end_of_statement (parser);
break;
if (i < nargs)
arg = TREE_VEC_ELT (inner_args, i);
else if (require_all_arguments)
- /* There must be a default arg in this case. */
+ /* There must be a default arg in this case. */
arg = tsubst_template_arg (TREE_PURPOSE (parm), new_args,
complain, in_decl);
else
class, rather than the instantiated class.
In addition, lookups that were not ambiguous before may be
- ambiguous now. Therefore, we perform the lookup again. */
+ ambiguous now. Therefore, we perform the lookup again. */
qualifying_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink));
fns = BASELINK_FUNCTIONS (baselink);
if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
{
case USING_DECL:
t = DECL_NAME (t);
- /* Fallthrough. */
+ /* Fallthrough. */
case IDENTIFIER_NODE:
{
tree decl;
if (TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM)
return true;
/* ... or any of the template arguments is a dependent type or
- an expression that is type-dependent or value-dependent. */
+ an expression that is type-dependent or value-dependent. */
else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INFO (type)
&& (any_dependent_template_arguments_p
(INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type)))))
return r;
}
-/* Finish a compound-statement, which is given by COMPOUND_STMT. */
+/* Finish a compound-statement, which is given by COMPOUND_STMT. */
tree
finish_compound_stmt (tree compound_stmt)
if (code == COMPOUND_EXPR && TREE_CODE (non_dep) != COMPOUND_EXPR)
/* This should not be considered a COMPOUND_EXPR, because it
- resolves to an overload. */
+ resolves to an overload. */
COMPOUND_EXPR_OVERLOADED (t) = 1;
va_end (p);
}
\f
/* Given a list of expressions, return a compound expression
- that performs them all and returns the value of the last of them. */
+ that performs them all and returns the value of the last of them. */
tree build_x_compound_expr_from_list (tree list, const char *msg)
{
return result;
}
-/* Build a compound expression. */
+/* Build a compound expression. */
tree
build_compound_expr (tree lhs, tree rhs)
{
tree t = build_min (CAST_EXPR, type,
tree_cons (NULL_TREE, value, NULL_TREE));
- /* We don't know if it will or will not have side effects. */
+ /* We don't know if it will or will not have side effects. */
TREE_SIDE_EFFECTS (t) = 1;
return t;
}
if (processing_template_decl)
{
expr = build_min_non_dep (ARROW_EXPR, last_rval, orig_expr);
- /* It will be dereferenced. */
+ /* It will be dereferenced. */
TREE_TYPE (expr) = TREE_TYPE (TREE_TYPE (last_rval));
return expr;
}