From a629b48a668c778e0cb951c7eb2b47bda0c922f0 Mon Sep 17 00:00:00 2001
From: Dan Gohman <gohman@apple.com>
Date: Mon, 8 Dec 2008 17:50:35 +0000
Subject: [PATCH] Fix the top-level comments, and fix some 80-column
 violations.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@60707 91177308-0d34-0410-b5e6-96231b3b80d8
---
 lib/CodeGen/ScheduleDAGInstrs.cpp | 16 +++++++++-------
 1 file changed, 9 insertions(+), 7 deletions(-)

diff --git a/lib/CodeGen/ScheduleDAGInstrs.cpp b/lib/CodeGen/ScheduleDAGInstrs.cpp
index b72df3a4639..fba8192c015 100644
--- a/lib/CodeGen/ScheduleDAGInstrs.cpp
+++ b/lib/CodeGen/ScheduleDAGInstrs.cpp
@@ -1,4 +1,4 @@
-//===---- ScheduleDAG.cpp - Implement the ScheduleDAG class ---------------===//
+//===---- ScheduleDAGInstrs.cpp - MachineInstr Rescheduling ---------------===//
 //
 //                     The LLVM Compiler Infrastructure
 //
@@ -7,8 +7,8 @@
 //
 //===----------------------------------------------------------------------===//
 //
-// This implements the ScheduleDAG class, which is a base class used by
-// scheduling implementation classes.
+// This implements the ScheduleDAGInstrs class, which implements re-scheduling
+// of MachineInstrs.
 //
 //===----------------------------------------------------------------------===//
 
@@ -114,7 +114,8 @@ void ScheduleDAGInstrs::BuildSchedUnits() {
     if (TID.isCall() || TID.isReturn() || TID.isBranch() ||
         TID.hasUnmodeledSideEffects()) {
     new_chain:
-      // This is the conservative case. Add dependencies on all memory references.
+      // This is the conservative case. Add dependencies on all memory
+      // references.
       if (Chain)
         Chain->addPred(SU, /*isCtrl=*/true, /*isArtificial=*/false);
       Chain = SU;
@@ -161,7 +162,8 @@ void ScheduleDAGInstrs::BuildSchedUnits() {
           MemDefs[V] = SU;
         }
         // Handle the uses in MemUses, if there are any.
-        std::map<const Value *, std::vector<SUnit *> >::iterator J = MemUses.find(V);
+        std::map<const Value *, std::vector<SUnit *> >::iterator J =
+          MemUses.find(V);
         if (J != MemUses.end()) {
           for (unsigned i = 0, e = J->second.size(); i != e; ++i)
             J->second[i]->addPred(SU, /*isCtrl=*/true, /*isArtificial=*/false);
@@ -203,8 +205,8 @@ void ScheduleDAGInstrs::BuildSchedUnits() {
       }
     }
 
-    // Add chain edges from the terminator to ensure that all the work of the block is
-    // completed before any control transfers.
+    // Add chain edges from the terminator to ensure that all the work of the
+    // block is completed before any control transfers.
     if (Terminator && SU->Succs.empty())
       Terminator->addPred(SU, /*isCtrl=*/true, /*isArtificial=*/false);
     if (TID.isTerminator() || MI->isLabel())