+2013-07-21 OndÅ\99ej 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),
/* 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;
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.
&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)
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
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
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);
/* 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
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;
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. */
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;
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.