aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorDavid Greene <greened@obbligato.org>2007-06-29 03:42:23 +0000
committerDavid Greene <greened@obbligato.org>2007-06-29 03:42:23 +0000
commita2a488594df335efa17bc253436465c2ae984f91 (patch)
tree9d8d861fd5e08b702ebd0d53cf4cbcf01e76a6ff
parentcba291821d353f1afbef8e4c04dbe14415240289 (diff)
downloadexternal_llvm-a2a488594df335efa17bc253436465c2ae984f91.zip
external_llvm-a2a488594df335efa17bc253436465c2ae984f91.tar.gz
external_llvm-a2a488594df335efa17bc253436465c2ae984f91.tar.bz2
Remove unnecessary attributions in comments.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@37799 91177308-0d34-0410-b5e6-96231b3b80d8
-rw-r--r--lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp2
-rw-r--r--lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp4
2 files changed, 3 insertions, 3 deletions
diff --git a/lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp b/lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp
index 5053358..8feda9a 100644
--- a/lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp
+++ b/lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp
@@ -618,7 +618,7 @@ bool bu_ls_rr_sort::operator()(const SUnit *left, const SUnit *right) const {
bool LIsTarget = left->Node->isTargetOpcode();
bool RIsTarget = right->Node->isTargetOpcode();
- // Cray: There used to be a special tie breaker here that looked for
+ // There used to be a special tie breaker here that looked for
// two-address instructions and preferred the instruction with a
// def&use operand. The special case triggered diagnostics when
// _GLIBCXX_DEBUG was enabled because it broke the strict weak
diff --git a/lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp b/lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp
index 6251d38..6fe78cc 100644
--- a/lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp
+++ b/lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp
@@ -1700,8 +1700,8 @@ unsigned SelectionDAGLowering::Clusterify(CaseVector& Cases,
// Merge case into clusters
if (Cases.size()>=2)
- // Cray [dag]: Must recompute end() each iteration because it may
- // be invalidated by erase if we hold on to it
+ // Must recompute end() each iteration because it may be
+ // invalidated by erase if we hold on to it
for (CaseItr I=Cases.begin(), J=++(Cases.begin()); J!=Cases.end(); ) {
int64_t nextValue = cast<ConstantInt>(J->Low)->getSExtValue();
int64_t currentValue = cast<ConstantInt>(I->High)->getSExtValue();