gcc/

[pf3gnuchains/gcc-fork.git] / gcc / sched-deps.c

diff --git a/gcc/sched-deps.c b/gcc/sched-deps.c
index c0d9f55..cdd055b 100644 (file)
--- a/gcc/sched-deps.c
+++ b/gcc/sched-deps.c
@@ -359,7 +359,7 @@ free_deps_list (deps_list_t l)
 }
 
 /* Return true if there is no dep_nodes and deps_lists out there.
-   After the region is scheduled all the depedency nodes and lists
+   After the region is scheduled all the dependency nodes and lists
    should [generally] be returned to pool.  */
 bool
 deps_pools_are_empty_p (void)
@@ -648,7 +648,7 @@ sd_finish_insn (rtx insn)
 /* Find a dependency between producer PRO and consumer CON.
    Search through resolved dependency lists if RESOLVED_P is true.
    If no such dependency is found return NULL,
-   overwise return the dependency and initialize SD_IT_PTR [if it is nonnull]
+   otherwise return the dependency and initialize SD_IT_PTR [if it is nonnull]
    with an iterator pointing to it.  */
 static dep_t
 sd_find_dep_between_no_cache (rtx pro, rtx con, bool resolved_p,
@@ -943,7 +943,9 @@ change_spec_dep_to_hard (sd_iterator_def sd_it)
    data-speculative dependence should be updated.  */
 static enum DEPS_ADJUST_RESULT
 update_dep (dep_t dep, dep_t new_dep,
-           sd_iterator_def sd_it, rtx mem1, rtx mem2)
+           sd_iterator_def sd_it ATTRIBUTE_UNUSED,
+           rtx mem1 ATTRIBUTE_UNUSED,
+           rtx mem2 ATTRIBUTE_UNUSED)
 {
   enum DEPS_ADJUST_RESULT res = DEP_PRESENT;
   enum reg_note old_type = DEP_TYPE (dep);
@@ -2200,6 +2202,7 @@ sched_analyze_insn (struct deps *deps, rtx x, rtx insn)
   if (SCHED_GROUP_P (insn))
     fixup_sched_groups (insn);
 
+#ifdef INSN_SCHEDULING
   if ((current_sched_info->flags & DO_SPECULATION)
       && !sched_insn_is_legitimate_for_speculation_p (insn, 0))
     /* INSN has an internal dependency (e.g. r14 = [r14]) and thus cannot
@@ -2212,6 +2215,7 @@ sched_analyze_insn (struct deps *deps, rtx x, rtx insn)
           sd_iterator_cond (&sd_it, &dep);)
        change_spec_dep_to_hard (sd_it);
     }
+#endif
 }
 
 /* Analyze every insn between HEAD and TAIL inclusive, creating backward