| commit | ad7654f7c4e8da1d76eacfff6381cf0bfd3af6c5 | [log] [tgz] |
|---|---|---|
| author | Tanya Lattner <tonic@nondot.org> | Thu Dec 02 07:22:15 2004 +0000 |
| committer | Tanya Lattner <tonic@nondot.org> | Thu Dec 02 07:22:15 2004 +0000 |
| tree | 3e5ccb40eaa9a98f3e3141804d7355c1407f3e58 | |
| parent | fa07e4fc302b1e274c292c2db4604e61d69458d5 [diff] [blame] |
Reworked branch adding in prologue. Added check for infinite loops which are not modulo scheduled. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@18419 91177308-0d34-0410-b5e6-96231b3b80d8
diff --git a/lib/Target/SparcV9/ModuloScheduling/ModuloScheduling.h b/lib/Target/SparcV9/ModuloScheduling/ModuloScheduling.h index e1f8d9e..fa523d1 100644 --- a/lib/Target/SparcV9/ModuloScheduling/ModuloScheduling.h +++ b/lib/Target/SparcV9/ModuloScheduling/ModuloScheduling.h
@@ -88,7 +88,7 @@ void addReccurrence(std::vector<MSchedGraphNode*> &recurrence, int II, MSchedGraphNode*, MSchedGraphNode*); void computePartialOrder(); - void computeSchedule(); + bool computeSchedule(); bool scheduleNode(MSchedGraphNode *node, int start, int end);