* alias.c: Fix typos in comments.
* sched-rgn.c (init_ready_list): Ditto.
* unwind-dw2.c (uw_frame_state_for): Ditto.
* unwind-dw2-fde.c (_Unwind_Find_FDE): Ditto.
* unwind.inc (_Unwind_RaiseException_Phase2): Ditto.
* config/rs6000/rs6000.c (rs6000_adjust_priority): Ditto.
From-SVN: r45698
+2001-09-19 Stan Shebs <shebs@apple.com>
+
+ * alias.c: Fix typos in comments.
+ * sched-rgn.c (init_ready_list): Ditto.
+ * unwind-dw2.c (uw_frame_state_for): Ditto.
+ * unwind-dw2-fde.c (_Unwind_Find_FDE): Ditto.
+ * unwind.inc (_Unwind_RaiseException_Phase2): Ditto.
+ * config/rs6000/rs6000.c (rs6000_adjust_priority): Ditto.
+
2001-09-19 Richard Henderson <rth@redhat.com>
* cfg.c (force_nonfallthru_and_redirect): Handle redirecting
To see whether two alias sets can point to the same memory, we must
see if either alias set is a subset of the other. We need not trace
- past immediate decendents, however, since we propagate all
+ past immediate descendents, however, since we propagate all
grandchildren up one level.
Alias set zero is implicitly a superset of all other alias sets.
HOST_WIDE_INT alias_set;
/* The children of the alias set. These are not just the immediate
- children, but, in fact, all decendents. So, if we have:
+ children, but, in fact, all descendents. So, if we have:
struct T { struct S s; float f; }
rtx insn ATTRIBUTE_UNUSED;
int priority;
{
- /* On machines (like the 750) which have asymetric integer units, where one
+ /* On machines (like the 750) which have asymmetric integer units, where one
integer unit can do multiply and divides and the other can't, reduce the
priority of multiply/divide so it is scheduled before other integer
- operationss. */
+ operations. */
#if 0
if (! INSN_P (insn))
{
rtx next;
- /* Note that we havn't squirrled away the notes for
+ /* Note that we havn't squirreled away the notes for
blocks other than the current. So if this is a
speculative insn, NEXT might otherwise be a note. */
next = next_nonnote_insn (insn);
__gthread_mutex_lock (&object_mutex);
/* Linear search through the classified objects, to find the one
- containing the pc. Note that pc_begin is sorted decending, and
+ containing the pc. Note that pc_begin is sorted descending, and
we expect objects to be non-overlapping. */
for (ob = seen_objects; ob; ob = ob->next)
if (pc >= ob->pc_begin)
{
/* Couldn't find frame unwind info for this function. Try a
target-specific fallback mechanism. This will necessarily
- not profide a personality routine or LSDA. */
+ not provide a personality routine or LSDA. */
#ifdef MD_FALLBACK_FRAME_STATE_FOR
MD_FALLBACK_FRAME_STATE_FOR (context, fs, success);
return _URC_END_OF_STACK;
? _UA_HANDLER_FRAME : 0);
if (code != _URC_NO_REASON)
- /* Some error encountered. Ususally the unwinder doesn't
+ /* Some error encountered. Usually the unwinder doesn't
diagnose these and merely crashes. */
return _URC_FATAL_PHASE2_ERROR;