mirror of git://gcc.gnu.org/git/gcc.git
class.c: Fix typos.
2013-07-21 OndÅej BÃlka <neleai@seznam.cz> * class.c: Fix typos. * cp-array-notation.c: Likewise. * cp-objcp-common.c: Likewise. * decl.c: Likewise. * init.c: Likewise. * mangle.c: Likewise. * parser.c: Likewise. * pt.c: Likewise. * semantics.c: Likewise. From-SVN: r201106
This commit is contained in:
Ondřej Bílka
Mike Stump
parent
631b20a7fc
commit
c65cb8d1f0
|
|
@ -1,3 +1,15 @@
|
|||
2013-07-21 OndÅej BÃlka <neleai@seznam.cz>
|
||||
|
||||
* class.c: Fix typos.
|
||||
* cp-array-notation.c: Likewise.
|
||||
* cp-objcp-common.c: Likewise.
|
||||
* decl.c: Likewise.
|
||||
* init.c: Likewise.
|
||||
* mangle.c: Likewise.
|
||||
* parser.c: Likewise.
|
||||
* pt.c: Likewise.
|
||||
* semantics.c: Likewise.
|
||||
|
||||
2013-07-14 Adam Butcher <adam@jessamine.co.uk>
|
||||
|
||||
* semantics.c (build_lambda_expr),
|
||||
|
|
|
|||
|
|
@ -5864,7 +5864,7 @@ layout_class_type (tree t, tree *virtuals_p)
|
|||
/* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
|
||||
types that appear at that offset. */
|
||||
splay_tree empty_base_offsets;
|
||||
/* True if the last field layed out was a bit-field. */
|
||||
/* True if the last field laid out was a bit-field. */
|
||||
bool last_field_was_bitfield = false;
|
||||
/* The location at which the next field should be inserted. */
|
||||
tree *next_field;
|
||||
|
|
@ -6829,7 +6829,7 @@ fixed_type_or_null (tree instance, int *nonnull, int *cdtorp)
|
|||
INSTANCE is really a pointer. Return negative if this is a
|
||||
ctor/dtor. There the dynamic type is known, but this might not be
|
||||
the most derived base of the original object, and hence virtual
|
||||
bases may not be layed out according to this type.
|
||||
bases may not be laid out according to this type.
|
||||
|
||||
Used to determine whether the virtual function table is needed
|
||||
or not.
|
||||
|
|
|
|||
|
|
@ -810,7 +810,7 @@ cp_expand_cond_array_notations (tree orig_stmt)
|
|||
&no_rank))
|
||||
return error_mark_node;
|
||||
/* If the condition has a zero rank, then handle array notations in body
|
||||
seperately. */
|
||||
separately. */
|
||||
if (cond_rank == 0)
|
||||
return orig_stmt;
|
||||
if (cond_rank != yes_rank && yes_rank != 0)
|
||||
|
|
|
|||
|
|
@ -226,7 +226,7 @@ init_shadowed_var_for_decl (void)
|
|||
tree_decl_map_eq, 0);
|
||||
}
|
||||
|
||||
/* Return true if stmt can fall thru. Used by block_may_fallthru
|
||||
/* Return true if stmt can fall through. Used by block_may_fallthru
|
||||
default case. */
|
||||
|
||||
bool
|
||||
|
|
|
|||
|
|
@ -4888,7 +4888,7 @@ layout_var_decl (tree decl)
|
|||
if (type == error_mark_node)
|
||||
return;
|
||||
|
||||
/* If we haven't already layed out this declaration, do so now.
|
||||
/* If we haven't already laid out this declaration, do so now.
|
||||
Note that we must not call complete type for an external object
|
||||
because it's type might involve templates that we are not
|
||||
supposed to instantiate yet. (And it's perfectly valid to say
|
||||
|
|
|
|||
|
|
@ -2384,7 +2384,7 @@ build_new_1 (vec<tree, va_gc> **placement, tree type, tree nelts,
|
|||
cookie_size = targetm.cxx.get_cookie_size (elt_type);
|
||||
gcc_assert (TREE_CODE (cookie_size) == INTEGER_CST);
|
||||
gcc_checking_assert (TREE_INT_CST (cookie_size).ult (max_size));
|
||||
/* Unconditionally substract the cookie size. This decreases the
|
||||
/* Unconditionally subtract the cookie size. This decreases the
|
||||
maximum object size and is safe even if we choose not to use
|
||||
a cookie after all. */
|
||||
max_size -= TREE_INT_CST (cookie_size);
|
||||
|
|
|
|||
|
|
@ -1446,7 +1446,7 @@ write_closure_type_name (const tree type)
|
|||
/* Convert NUMBER to ascii using base BASE and generating at least
|
||||
MIN_DIGITS characters. BUFFER points to the _end_ of the buffer
|
||||
into which to store the characters. Returns the number of
|
||||
characters generated (these will be layed out in advance of where
|
||||
characters generated (these will be laid out in advance of where
|
||||
BUFFER points). */
|
||||
|
||||
static int
|
||||
|
|
|
|||
|
|
@ -7204,7 +7204,7 @@ lookup_template_class_1 (tree d1, tree arglist, tree in_decl, tree context,
|
|||
int use_partial_inst_tmpl = false;
|
||||
|
||||
if (template_type == error_mark_node)
|
||||
/* An error occured while building the template TEMPL, and a
|
||||
/* An error occurred while building the template TEMPL, and a
|
||||
diagnostic has most certainly been emitted for that
|
||||
already. Let's propagate that error. */
|
||||
return error_mark_node;
|
||||
|
|
|
|||
|
|
@ -6478,7 +6478,7 @@ typedef struct GTY(()) constexpr_call {
|
|||
constexpr_fundef *fundef;
|
||||
/* Parameter bindings environment. A TREE_LIST where each TREE_PURPOSE
|
||||
is a parameter _DECL and the TREE_VALUE is the value of the parameter.
|
||||
Note: This arrangement is made to accomodate the use of
|
||||
Note: This arrangement is made to accommodate the use of
|
||||
iterative_hash_template_arg (see pt.c). If you change this
|
||||
representation, also change the hash calculation in
|
||||
cxx_eval_call_expression. */
|
||||
|
|
@ -6684,7 +6684,7 @@ cxx_bind_parameters_in_call (const constexpr_call *old_call, tree t,
|
|||
tree x, arg;
|
||||
tree type = parms ? TREE_TYPE (parms) : void_type_node;
|
||||
/* For member function, the first argument is a pointer to the implied
|
||||
object. And for an object contruction, don't bind `this' before
|
||||
object. And for an object construction, don't bind `this' before
|
||||
it is fully constructed. */
|
||||
if (i == 0 && DECL_CONSTRUCTOR_P (fun))
|
||||
goto next;
|
||||
|
|
@ -8385,7 +8385,7 @@ check_automatic_or_tls (tree ref)
|
|||
C++0x [expr.const] used to say
|
||||
|
||||
6 An expression is a potential constant expression if it is
|
||||
a constant expression where all occurences of function
|
||||
a constant expression where all occurrences of function
|
||||
parameters are replaced by arbitrary constant expressions
|
||||
of the appropriate type.
|
||||
|
||||
|
|
|
|||
Loading…
Reference in New Issue