ChangeLog: Fix typos.
* ChangeLog: Fix typos. * call.c: Fix comment typos. * class.c: Likewise. * cp-tree.h: Likewise. * cvt.c: Likewise. * cxx-pretty-print.c: Likewise. * decl.c: Likewise. * decl2.c: Likewise. * init.c: Likewise. * mangle.c: Likewise. * name-lookup.c: Likewise. * parser.c: Likewise. * search.c: Likewise. * semantics.c: Likewise. * tree.c: Likewise. * typeck.c: Likewise. From-SVN: r72737
This commit is contained in:
parent
be03ccc9da
commit
cd0be382c9
|
@ -1,3 +1,22 @@
|
|||
2003-10-20 Kazu Hirata <kazu@cs.umass.edu>
|
||||
|
||||
* ChangeLog: Fix typos.
|
||||
* call.c: Fix comment typos.
|
||||
* class.c: Likewise.
|
||||
* cp-tree.h: Likewise.
|
||||
* cvt.c: Likewise.
|
||||
* cxx-pretty-print.c: Likewise.
|
||||
* decl.c: Likewise.
|
||||
* decl2.c: Likewise.
|
||||
* init.c: Likewise.
|
||||
* mangle.c: Likewise.
|
||||
* name-lookup.c: Likewise.
|
||||
* parser.c: Likewise.
|
||||
* search.c: Likewise.
|
||||
* semantics.c: Likewise.
|
||||
* tree.c: Likewise.
|
||||
* typeck.c: Likewise.
|
||||
|
||||
2003-10-20 Jan Hubicka <jh@suse.cz>
|
||||
|
||||
* decl.c (start_cleanup_fn): Set DECL_DECLARED_INLINE_P to deffer
|
||||
|
@ -1206,7 +1225,7 @@
|
|||
* typeck2.c (build_functional_cast): Do not perform name lookups.
|
||||
|
||||
PR c++/10717
|
||||
* decl.c (expand_static_init): Remove unncessary code.
|
||||
* decl.c (expand_static_init): Remove unnecessary code.
|
||||
|
||||
2003-08-19 Andrew Pinski <pinskia@physics.uc.edu>
|
||||
|
||||
|
@ -1694,7 +1713,7 @@
|
|||
(decay_conversion): Use convert_to_integer.
|
||||
(build_unary_op): Use build_nop.
|
||||
(get_delta_difference): Use convert_to_integer.
|
||||
(build_ptrmemfunc): Avoid unncessary conversions.
|
||||
(build_ptrmemfunc): Avoid unnecessary conversions.
|
||||
|
||||
2003-07-28 Jan Hubicka <jh@suse.cz>
|
||||
|
||||
|
@ -4550,7 +4569,7 @@
|
|||
* decl2.c (is_namespace_ancestor): Rename to ...
|
||||
(namespace_anecestor): ... this.
|
||||
(set_decl_namespace): Adjust accordingly.
|
||||
(handle_class_head): Remove unncessary parameters.
|
||||
(handle_class_head): Remove unnecessary parameters.
|
||||
* parser.c (cp_parser_class_head): Check that
|
||||
nested-name-specifiers are used appropriately.
|
||||
|
||||
|
@ -8569,7 +8588,7 @@
|
|||
(instantiate_class_template): Adjust call to xref_basetypes.
|
||||
* semantics.c (begin_mem_initializers): New function.
|
||||
* tree.c (is_overloaded_fn): Use BASELINK_FUNCTIONS.
|
||||
(really_overlaoded_fn): Likewise.
|
||||
(really_overloaded_fn): Likewise.
|
||||
(get_overloaded_fn): New function.'
|
||||
(get_first_fn): USe BASELINK_FUNCTIONS.
|
||||
|
||||
|
|
|
@ -3805,7 +3805,7 @@ build_op_delete_call (enum tree_code code, tree addr, tree size,
|
|||
the lookup selects a placement deallocation function, the
|
||||
program is ill-formed.
|
||||
|
||||
Therefore, we ask lookup_fnfields to complain ambout ambiguity. */
|
||||
Therefore, we ask lookup_fnfields to complain about ambiguity. */
|
||||
{
|
||||
fns = lookup_fnfields (TYPE_BINFO (type), fnname, 1);
|
||||
if (fns == error_mark_node)
|
||||
|
@ -5262,7 +5262,7 @@ compare_ics (tree ics1, tree ics2)
|
|||
{
|
||||
/* XXX Isn't this an extension? */
|
||||
/* Both ICS are bad. We try to make a decision based on what
|
||||
would have happenned if they'd been good. */
|
||||
would have happened if they'd been good. */
|
||||
if (ICS_USER_FLAG (ics1) > ICS_USER_FLAG (ics2)
|
||||
|| ICS_STD_RANK (ics1) > ICS_STD_RANK (ics2))
|
||||
return -1;
|
||||
|
|
|
@ -1939,7 +1939,7 @@ typedef struct find_final_overrider_data_s {
|
|||
tree most_derived_type;
|
||||
/* The candidate overriders. */
|
||||
tree candidates;
|
||||
/* Binfos which inherited virtually on the currrent path. */
|
||||
/* Binfos which inherited virtually on the current path. */
|
||||
tree vpath;
|
||||
} find_final_overrider_data;
|
||||
|
||||
|
@ -2167,7 +2167,7 @@ update_vtable_entry_for_fn (tree t, tree binfo, tree fn, tree* virtuals,
|
|||
if (!virtual_offset)
|
||||
{
|
||||
/* There was no existing virtual thunk (which takes
|
||||
precidence). */
|
||||
precedence). */
|
||||
tree thunk_binfo;
|
||||
base_kind kind;
|
||||
|
||||
|
|
|
@ -362,7 +362,7 @@ typedef enum cp_id_kind
|
|||
CP_ID_KIND_NONE,
|
||||
/* An unqualified-id that is not a template-id. */
|
||||
CP_ID_KIND_UNQUALIFIED,
|
||||
/* An uqualified-id that is a dependent name. */
|
||||
/* An unqualified-id that is a dependent name. */
|
||||
CP_ID_KIND_UNQUALIFIED_DEPENDENT,
|
||||
/* An unqualified template-id. */
|
||||
CP_ID_KIND_TEMPLATE_ID,
|
||||
|
@ -1474,7 +1474,7 @@ struct lang_type GTY(())
|
|||
#define BINFO_PUSHDECLS_MARKED(NODE) BINFO_VTABLE_PATH_MARKED (NODE)
|
||||
|
||||
/* Nonzero if this BINFO is a primary base class. Note, this can be
|
||||
set for non-canononical virtual bases. For a virtual primary base
|
||||
set for non-canonical virtual bases. For a virtual primary base
|
||||
you might also need to check whether it is canonical. */
|
||||
|
||||
#define BINFO_PRIMARY_P(NODE) \
|
||||
|
|
|
@ -770,7 +770,7 @@ ocp_convert (tree type, tree expr, int convtype, int flags)
|
|||
no lvalue-rvalue and similar conversions happen [expr.static.cast/4,
|
||||
stmt.expr/1, expr.comma/1]. This permits dereferencing an incomplete type
|
||||
in a void context. The C++ standard does not define what an `access' to an
|
||||
object is, but there is reason to beleive that it is the lvalue to rvalue
|
||||
object is, but there is reason to believe that it is the lvalue to rvalue
|
||||
conversion -- if it were not, `*&*p = 1' would violate [expr]/4 in that it
|
||||
accesses `*p' not to calculate the value to be stored. But, dcl.type.cv/8
|
||||
indicates that volatile semantics should be the same between C and C++
|
||||
|
|
|
@ -261,7 +261,7 @@ pp_cxx_qualified_id (cxx_pretty_printer *pp, tree t)
|
|||
}
|
||||
|
||||
/* id-expression:
|
||||
unaqualified-id
|
||||
unqualified-id
|
||||
qualified-id */
|
||||
static inline void
|
||||
pp_cxx_id_expression (cxx_pretty_printer *pp, tree t)
|
||||
|
@ -986,7 +986,7 @@ pp_cxx_simple_type_specifier (cxx_pretty_printer *pp, tree t)
|
|||
class-specifier
|
||||
enum-specifier
|
||||
elaborated-type-specifier
|
||||
cv-qualifer */
|
||||
cv-qualifier */
|
||||
|
||||
static void
|
||||
pp_cxx_type_specifier_seq (cxx_pretty_printer *pp, tree t)
|
||||
|
@ -1287,7 +1287,7 @@ pp_cxx_abstract_declarator (cxx_pretty_printer *pp, tree t)
|
|||
|
||||
/* direct-abstract-declarator:
|
||||
direct-abstract-declarator(opt) ( parameter-declaration-clause )
|
||||
cv-quafilier-seq(opt) exception-specification(opt)
|
||||
cv-qualifier-seq(opt) exception-specification(opt)
|
||||
direct-abstract-declarator(opt) [ constant-expression(opt) ]
|
||||
( abstract-declarator ) */
|
||||
static void
|
||||
|
|
|
@ -3877,7 +3877,7 @@ start_decl_1 (tree decl)
|
|||
/* Handle initialization of references. DECL, TYPE, and INIT have the
|
||||
same meaning as in cp_finish_decl. *CLEANUP must be NULL on entry,
|
||||
but will be set to a new CLEANUP_STMT if a temporary is created
|
||||
that must be destroeyd subsequently.
|
||||
that must be destroyed subsequently.
|
||||
|
||||
Returns an initializer expression to use to initialize DECL, or
|
||||
NULL if the initialization can be performed statically.
|
||||
|
|
|
@ -2084,7 +2084,7 @@ start_static_storage_duration_function (unsigned count)
|
|||
/* Put the function in the global scope. */
|
||||
pushdecl (ssdf_decl);
|
||||
|
||||
/* Start the function itself. This is equivalent to declarating the
|
||||
/* Start the function itself. This is equivalent to declaring the
|
||||
function as:
|
||||
|
||||
static void __ssdf (int __initialize_p, init __priority_p);
|
||||
|
|
|
@ -292,7 +292,7 @@ build_default_init (tree type, tree nelts)
|
|||
return NULL_TREE;
|
||||
|
||||
/* At this point, TYPE is either a POD class type, an array of POD
|
||||
classes, or something even more inoccuous. */
|
||||
classes, or something even more innocuous. */
|
||||
return build_zero_init (type, nelts, /*static_storage_p=*/false);
|
||||
}
|
||||
|
||||
|
|
|
@ -1028,7 +1028,7 @@ write_conversion_operator_name (const tree type)
|
|||
write_type (type);
|
||||
}
|
||||
|
||||
/* Non-termial <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
|
||||
/* Non-terminal <source-name>. IDENTIFIER is an IDENTIFIER_NODE.
|
||||
|
||||
<source-name> ::= </length/ number> <identifier> */
|
||||
|
||||
|
@ -1329,7 +1329,7 @@ discriminator_for_local_entity (tree entity)
|
|||
}
|
||||
|
||||
/* Return the discriminator for STRING, a string literal used inside
|
||||
FUNCTION. The disciminator is the lexical ordinal of STRING among
|
||||
FUNCTION. The discriminator is the lexical ordinal of STRING among
|
||||
string literals used in FUNCTION. */
|
||||
|
||||
static int
|
||||
|
|
|
@ -1195,7 +1195,7 @@ cxx_scope_descriptor (cxx_scope *scope)
|
|||
return scope_kind_names[kind];
|
||||
}
|
||||
|
||||
/* Output a debugging information about SCOPE when performning
|
||||
/* Output a debugging information about SCOPE when performing
|
||||
ACTION at LINE. */
|
||||
static void
|
||||
cxx_scope_debug (cxx_scope *scope, int line, const char *action)
|
||||
|
@ -1334,7 +1334,7 @@ leave_scope (void)
|
|||
|
||||
/* Namespace-scopes are left most probably temporarily, not completely;
|
||||
they can be reopen later, e.g. in namespace-extension or any name
|
||||
binding acttivity that requires us to resume a namespace. For other
|
||||
binding activity that requires us to resume a namespace. For other
|
||||
scopes, we just make the structure available for reuse. */
|
||||
if (scope->kind != sk_namespace)
|
||||
{
|
||||
|
@ -1814,7 +1814,7 @@ clear_anon_tags (void)
|
|||
last_cnt = anon_cnt;
|
||||
}
|
||||
|
||||
/* Return (from the stack of) the BINDING, if any, establihsed at SCOPE. */
|
||||
/* Return (from the stack of) the BINDING, if any, established at SCOPE. */
|
||||
|
||||
static inline cxx_binding *
|
||||
find_binding (cxx_scope *scope, cxx_binding *binding)
|
||||
|
@ -3694,7 +3694,7 @@ lookup_qualified_name (tree scope, tree name, bool is_type_p, bool complain)
|
|||
return error_mark_node;
|
||||
}
|
||||
|
||||
/* Subroutine of unualified_namespace_lookup:
|
||||
/* Subroutine of unqualified_namespace_lookup:
|
||||
Add the bindings of NAME in used namespaces to VAL.
|
||||
We are currently looking for names in namespace SCOPE, so we
|
||||
look through USINGS for using-directives of namespaces
|
||||
|
|
|
@ -1200,7 +1200,7 @@ typedef struct cp_parser GTY(())
|
|||
|
||||
/* TRUE if default arguments are allowed within a parameter list
|
||||
that starts at this point. FALSE if only a gnu extension makes
|
||||
them permissable. */
|
||||
them permissible. */
|
||||
bool default_arg_ok_p;
|
||||
|
||||
/* TRUE if we are parsing an integral constant-expression. See
|
||||
|
@ -1790,7 +1790,7 @@ cp_parser_check_for_definition_in_return_type (tree declarator,
|
|||
error ("new types may not be defined in a return type");
|
||||
}
|
||||
|
||||
/* Issue an eror message about the fact that THING appeared in a
|
||||
/* Issue an error message about the fact that THING appeared in a
|
||||
constant-expression. Returns ERROR_MARK_NODE. */
|
||||
|
||||
static tree
|
||||
|
@ -2502,7 +2502,7 @@ cp_parser_primary_expression (cp_parser *parser,
|
|||
named is a template.
|
||||
|
||||
If DECLARATOR_P is true, the id-expression is appearing as part of
|
||||
a declarator, rather than as part of an exprsesion. */
|
||||
a declarator, rather than as part of an expression. */
|
||||
|
||||
static tree
|
||||
cp_parser_id_expression (cp_parser *parser,
|
||||
|
@ -12088,7 +12088,7 @@ cp_parser_member_declaration (cp_parser* parser)
|
|||
= 0
|
||||
|
||||
Returns INTEGER_ZERO_NODE if a pure specifier is found.
|
||||
Otherwiser, ERROR_MARK_NODE is returned. */
|
||||
Otherwise, ERROR_MARK_NODE is returned. */
|
||||
|
||||
static tree
|
||||
cp_parser_pure_specifier (cp_parser* parser)
|
||||
|
@ -12829,7 +12829,7 @@ cp_parser_attribute_list (cp_parser* parser)
|
|||
if (token->type != CPP_COMMA)
|
||||
break;
|
||||
|
||||
/* Consume the commma and keep going. */
|
||||
/* Consume the comma and keep going. */
|
||||
cp_lexer_consume_token (parser->lexer);
|
||||
}
|
||||
|
||||
|
@ -13885,7 +13885,7 @@ cp_parser_late_parsing_for_member (cp_parser* parser, tree member_function)
|
|||
= TREE_CHAIN (parser->unparsed_functions_queues);
|
||||
}
|
||||
|
||||
/* If DECL contains any default args, remeber it on the unparsed
|
||||
/* If DECL contains any default args, remember it on the unparsed
|
||||
functions queue. */
|
||||
|
||||
static void
|
||||
|
@ -14277,7 +14277,7 @@ cp_parser_check_class_key (enum tag_types class_key, tree type)
|
|||
type);
|
||||
}
|
||||
|
||||
/* Issue an error message if DECL is redeclared with differnt
|
||||
/* Issue an error message if DECL is redeclared with different
|
||||
access than its original declaration [class.access.spec/3].
|
||||
This applies to nested classes and nested class templates.
|
||||
[class.mem/1]. */
|
||||
|
|
|
@ -602,7 +602,7 @@ context_for_name_lookup (tree decl)
|
|||
}
|
||||
|
||||
/* The accessibility routines use BINFO_ACCESS for scratch space
|
||||
during the computation of the accssibility of some declaration. */
|
||||
during the computation of the accessibility of some declaration. */
|
||||
|
||||
#define BINFO_ACCESS(NODE) \
|
||||
((access_kind) ((TREE_PUBLIC (NODE) << 1) | TREE_PRIVATE (NODE)))
|
||||
|
|
|
@ -1439,7 +1439,7 @@ finish_stmt_expr_expr (tree expr)
|
|||
|
||||
/* Build a TARGET_EXPR for this aggregate. finish_stmt_expr
|
||||
will then pull it apart so the lifetime of the target is
|
||||
within the scope of the expresson containing this statement
|
||||
within the scope of the expression containing this statement
|
||||
expression. */
|
||||
if (TREE_CODE (expr) == TARGET_EXPR)
|
||||
;
|
||||
|
@ -2240,7 +2240,7 @@ finish_base_specifier (tree base, tree access, bool virtual_p)
|
|||
}
|
||||
|
||||
/* Called when multiple declarators are processed. If that is not
|
||||
premitted in this context, an error is issued. */
|
||||
permitted in this context, an error is issued. */
|
||||
|
||||
void
|
||||
check_multiple_declarators (void)
|
||||
|
@ -2452,7 +2452,7 @@ finish_id_expression (tree id_expression,
|
|||
}
|
||||
|
||||
/* If there are no dependent template arguments, go through
|
||||
the overlaoded functions. */
|
||||
the overloaded functions. */
|
||||
while (fns && !dependent_p)
|
||||
{
|
||||
tree fn = OVL_CURRENT (fns);
|
||||
|
|
|
@ -99,7 +99,7 @@ lvalue_p_1 (tree ref,
|
|||
/* Clear the ordinary bit. If this object was a class
|
||||
rvalue we want to preserve that information. */
|
||||
op1_lvalue_kind &= ~clk_ordinary;
|
||||
/* The lvalue is for a btifield. */
|
||||
/* The lvalue is for a bitfield. */
|
||||
op1_lvalue_kind |= clk_bitfield;
|
||||
}
|
||||
else if (DECL_PACKED (TREE_OPERAND (ref, 1)))
|
||||
|
|
|
@ -4361,7 +4361,7 @@ build_compound_expr (tree lhs, tree rhs)
|
|||
{
|
||||
/* If the rhs is a TARGET_EXPR, then build the compound
|
||||
expression inside the target_expr's initializer. This
|
||||
helps the compiler to eliminate unncessary temporaries. */
|
||||
helps the compiler to eliminate unnecessary temporaries. */
|
||||
tree init = TREE_OPERAND (rhs, 1);
|
||||
|
||||
init = build (COMPOUND_EXPR, TREE_TYPE (init), lhs, init);
|
||||
|
|
Loading…
Reference in New Issue