+2007-05-25 Kazu Hirata <kazu@codesourcery.com>
+
+ * cfglayout.c, cgraphunit.c, config/avr/avr.c, fold-const.c,
+ haifa-sched.c, optabs.h, tree-affine.c, tree-data-ref.c,
+ tree-predcom.c, tree-ssa-alias-warnings.c,
+ tree-ssa-forwprop.c, tree-vect-analyze.c, tree-vrp.c: Fix
+ comment typos. Follow spelling conventions.
+ * doc/cpp.texi, doc/invoke.texi: Fix typos.
+
2007-05-26 Uros Bizjak <ubizjak@gmail.com>
PR target/32065
int epilogue_locator;
/* Hold current location information and last location information, so the
- datastructures are built lazilly only when some instructions in given
+ datastructures are built lazily only when some instructions in given
place are needed. */
location_t curr_location, last_location;
static tree curr_block, last_block;
static GTY (()) tree static_dtors;
/* When target does not have ctors and dtors, we call all constructor
- and destructor by special initialization/destruction functio
+ and destructor by special initialization/destruction function
recognized by collect2.
When we are going to build this function, collect all constructors and
char buffer[40];
sprintf (buffer, "%s - %d", avr_init_stack, (int) size);
rtx sym = gen_rtx_SYMBOL_REF (HImode, ggc_strdup (buffer));
- /* Initialise stack pointer using frame pointer. */
+ /* Initialize stack pointer using frame pointer. */
insn = emit_move_insn (frame_pointer_rtx, sym);
RTX_FRAME_RELATED_P (insn) = 1;
insn = emit_move_insn (stack_pointer_rtx, frame_pointer_rtx);
@item __COUNTER__
This macro expands to sequential integral values starting from 0. In
-conjuction with the @code{##} operator, this provides a convenient means to
+conjunction with the @code{##} operator, this provides a convenient means to
generate unique identifiers. Care must be taken to ensure that
@code{__COUNTER__} is not expanded prior to inclusion of precompiled headers
which use it. Otherwise, the precompiled headers will not be used.
prints a banner like:
@smallexample
-Assember options
-================
+Assembler options
+=================
Use "-Wa,OPTION" to pass "OPTION" to the assembler.
@end smallexample
int1l = TREE_INT_CST_LOW (arg1);
int1h = TREE_INT_CST_HIGH (arg1);
- /* &obj[0] + -128 really should be compiled as &obj[-8] rahter than
+ /* &obj[0] + -128 really should be compiled as &obj[-8] rather than
&obj[some_exotic_number]. */
if (POINTER_TYPE_P (type))
{
if (! INSN_P (insn))
return 0;
- /* We should not be insterested in priority of an already scheduled insn. */
+ /* We should not be interested in priority of an already scheduled insn. */
gcc_assert (QUEUE_INDEX (insn) != QUEUE_SCHEDULED);
if (!INSN_PRIORITY_KNOWN (insn))
/* Signed multiply and add with the result and addend one machine mode
wider than the multiplicand and multiplier. */
OTI_smadd_widen,
- /* Unigned multiply and add with the result and addend one machine mode
+ /* Unsigned multiply and add with the result and addend one machine mode
wider than the multiplicand and multiplier. */
OTI_umadd_widen,
/* Signed multiply and subtract the result and minuend one machine mode
wider than the multiplicand and multiplier. */
OTI_smsub_widen,
- /* Unigned multiply and subtract the result and minuend one machine mode
+ /* Unsigned multiply and subtract the result and minuend one machine mode
wider than the multiplicand and multiplier. */
OTI_umsub_widen,
/* If VAL != CST * DIV for any constant CST, returns false.
Otherwise, if VAL != 0 (and hence CST != 0), and *MULT_SET is true,
additionally compares CST and MULT, and if they are different,
- returns false. Finally, if neither of these two cases occcur,
+ returns false. Finally, if neither of these two cases occur,
true is returned, and if CST != 0, CST is stored to MULT and
MULT_SET is set to true. */
}
/* Determines the base object and the list of indices of memory reference
- DR, analysed in loop nest NEST. */
+ DR, analyzed in loop nest NEST. */
static void
dr_analyze_indices (struct data_reference *dr, struct loop *nest)
/* If the base of the object is not invariant in the loop nest, we cannot
analyse it. TODO -- in fact, it would suffice to record that there may
- be arbitrary depencences in the loops where the base object varies. */
+ be arbitrary dependences in the loops where the base object varies. */
if (!object_address_invariant_in_loop_p (VEC_index (loop_p, loop_nest, 0),
DR_BASE_OBJECT (a)))
{
}
/* Returns true if the component COMP satisfies the conditions
- described in 2) at the begining of this file. LOOP is the current
+ described in 2) at the beginning of this file. LOOP is the current
loop. */
static bool
/* Check the conditions on references inside each of components COMPS,
and remove the unsuitable components from the list. The new list
of components is returned. The conditions are described in 2) at
- the begining of this file. LOOP is the current loop. */
+ the beginning of this file. LOOP is the current loop. */
static struct component *
filter_suitable_components (struct loop *loop, struct component *comps)
update_ssa (TODO_update_ssa_only_virtuals);
}
-/* For each reference in CHAINS, if its definining statement is
+/* For each reference in CHAINS, if its defining statement is
ssa name, set it to phi node that defines it. */
static void
}
}
-/* For each reference in CHAINS, if its definining statement is
+/* For each reference in CHAINS, if its defining statement is
phi node, set it to the ssa name that is defined by it. */
static void
/* Returns the common statement in that NAME1 and NAME2 have a use. If there
is no such statement, returns NULL_TREE. In case the operation used on
- NAME1 and NAME2 is associative and comutative, returns the root of the
+ NAME1 and NAME2 is associative and commutative, returns the root of the
tree formed by this operation instead of the statement that uses NAME1 or
NAME2. */
associate different tags with MEM while building points-to information,
thus before we get to analyze it.
XXX: this could be solved by either running with -fno-strict-aliasing
- or by recording the points-to information before splitting the orignal
+ or by recording the points-to information before splitting the original
tag based on type.
Example 3.
tree object;
bool is_ptr;
/* The difference between the number of references to OBJECT
- and the number of occurences of &OBJECT. */
+ and the number of occurrences of &OBJECT. */
int found;
};
/* Find the reference site for OBJECT.
- If IS_PTR is true, look for derferences of OBJECT instead.
+ If IS_PTR is true, look for dereferences of OBJECT instead.
XXX: only the first site is returned in the current
implementation. If there are no matching sites, return NULL_TREE. */
}
if (TREE_CODE (old_arg) == SSA_NAME)
- /* Reuse a formely created dereference. */
+ /* Reuse a formerly created dereference. */
new_var = phivn[SSA_NAME_VERSION (old_arg)].value;
else
{
- case 2: If STMT is a reduction phi and DEF_STMT is a reduction stmt, we
skip DEF_STMT cause it had already been processed.
- Return true if everyting is as expected. Return false otherwise. */
+ Return true if everything is as expected. Return false otherwise. */
static bool
process_use (tree stmt, tree use, loop_vec_info loop_vinfo, bool live_p,
}
/* Helper that gets the value range of the SSA_NAME with version I
- or a symbolic range contaning the SSA_NAME only if the value range
+ or a symbolic range containing the SSA_NAME only if the value range
is varying or undefined. */
static inline value_range_t
projects / thirdparty / gcc.git / commitdiff
