for the declared type of the field) which it can possibly use, subject
to the condition that there is still enough available space remaining
in the containing object (when allocated at the selected point) to
- fully accomodate all of the bits of the bit-field itself.
+ fully accommodate all of the bits of the bit-field itself.
This simple rule makes it obvious why GCC allocates 8 bytes for each
object of the structure type shown above. When looking for a place to
don't do that. Instead we output a zero-length location descriptor
value as part of the location attribute.
- A variable which has been optimized out of existance will have a
+ A variable which has been optimized out of existence will have a
DECL_RTL value which denotes a pseudo-reg.
Currently, in some rare cases, variables can have DECL_RTL values
which look like (MEM (REG pseudo-reg#)). These cases are due to
bugs elsewhere in the compiler. We treat such cases
- as if the variable(s) in question had been optimized out of existance.
+ as if the variable(s) in question had been optimized out of existence.
Note that in all cases where we wish to express the fact that a
- variable has been optimized out of existance, we do not simply
+ variable has been optimized out of existence, we do not simply
suppress the generation of the entire location attribute because
the absence of a location attribute in certain kinds of DIEs is
used to indicate something else entirely... i.e. that the DIE
/* Return an rtx for the sum of X and the integer C.
- This fucntion should be used via the `plus_constant' macro. */
+ This function should be used via the `plus_constant' macro. */
rtx
plus_constant_wide (x, c)
if (code != CODE_FOR_nothing
/* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
here because if SIZE is less than the mode mask, as it is
- returned by the macro, it will definately be less than the
+ returned by the macro, it will definitely be less than the
actual mode mask. */
&& (unsigned) INTVAL (size) <= GET_MODE_MASK (mode)
&& (insn_operand_predicate[(int) code][0] == 0
return expand_binop (GET_MODE (value), binoptab, tmp,
force_operand (op2, NULL_RTX),
target, 0, OPTAB_LIB_WIDEN);
- /* We give UNSIGNEP = 0 to expand_binop
+ /* We give UNSIGNEDP = 0 to expand_binop
because the only operations we are expanding here are signed ones. */
}
return value;
op0 = expand_expr (tem, NULL_RTX, VOIDmode, EXPAND_SUM);
/* If this is a constant, put it into a register if it is a
- legimate constant and memory if it isn't. */
+ legitimate constant and memory if it isn't. */
if (CONSTANT_P (op0))
{
enum machine_mode mode = TYPE_MODE (TREE_TYPE (tem));
unsigned comparison since zero-extension is cheaper than sign
extension and comparisons with zero are done as unsigned. This is
the case even on machines that can do fast sign extension, since
- zero-extension is easier to combinen with other operations than
+ zero-extension is easier to combine with other operations than
sign-extension is. If we are comparing against a constant, we must
convert it to what it would look like unsigned. */
if ((code == EQ || code == NE) && ! unsignedp
extern int flag_inline_functions;
/* Nonzero for -fkeep-inline-functions: even if we make a function
- go inline everywhere, keep its defintion around for debugging
+ go inline everywhere, keep its definition around for debugging
purposes. */
extern int flag_keep_inline_functions;
instantiate_decls_1 (t, valid_only);
}
-/* Subroutine of the preceeding procedures: Given RTL representing a
+/* Subroutine of the preceding procedures: Given RTL representing a
decl and the size of the object, do any instantiation required.
If VALID_ONLY is non-zero, it means that the RTL should only be