mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-08-15 06:29:05 +00:00
fix indentation
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@149857 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
@@ -1152,11 +1152,11 @@ namespace {
|
||||
}
|
||||
if (!CanAdd) continue;
|
||||
|
||||
// To check for non-trivial cycles formed by the addition of the
|
||||
// current pair we've formed a list of all relevant pairs, now use a
|
||||
// graph walk to check for a cycle. We start from the current pair and
|
||||
// walk the use tree to see if we again reach the current pair. If we
|
||||
// do, then the current pair is rejected.
|
||||
// To check for non-trivial cycles formed by the addition of the
|
||||
// current pair we've formed a list of all relevant pairs, now use a
|
||||
// graph walk to check for a cycle. We start from the current pair and
|
||||
// walk the use tree to see if we again reach the current pair. If we
|
||||
// do, then the current pair is rejected.
|
||||
|
||||
// FIXME: It may be more efficient to use a topological-ordering
|
||||
// algorithm to improve the cycle check. This should be investigated.
|
||||
|
Reference in New Issue
Block a user