diff options
| author | David Greene <greened@obbligato.org> | 2007-06-29 03:42:23 +0000 |
|---|---|---|
| committer | David Greene <greened@obbligato.org> | 2007-06-29 03:42:23 +0000 |
| commit | 4c1e6f38045add04d3c1eab299adcc572115aa3b (patch) | |
| tree | eacc70e41cd1aada68247619b15e2d68d71d7c25 /llvm/lib/CodeGen/SelectionDAG | |
| parent | 869e4b5dac55a80f474d906c9e4b2681b32f8ebf (diff) | |
| download | bcm5719-llvm-4c1e6f38045add04d3c1eab299adcc572115aa3b.tar.gz bcm5719-llvm-4c1e6f38045add04d3c1eab299adcc572115aa3b.zip | |
Remove unnecessary attributions in comments.
llvm-svn: 37799
Diffstat (limited to 'llvm/lib/CodeGen/SelectionDAG')
| -rw-r--r-- | llvm/lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp | 2 | ||||
| -rw-r--r-- | llvm/lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp | 4 |
2 files changed, 3 insertions, 3 deletions
diff --git a/llvm/lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp b/llvm/lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp index 50533580bf3..8feda9a0e00 100644 --- a/llvm/lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp +++ b/llvm/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/llvm/lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp b/llvm/lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp index 6251d381be1..6fe78cc9cae 100644 --- a/llvm/lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp +++ b/llvm/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(); |

