Index: llvm/lib/Transforms/Scalar/Reassociate.cpp
===================================================================
--- llvm/lib/Transforms/Scalar/Reassociate.cpp
+++ llvm/lib/Transforms/Scalar/Reassociate.cpp
@@ -11,10 +11,10 @@
 //
 // For example: 4 + (x + 5) -> x + (4 + 5)
 //
-// In the implementation of this algorithm, constants are assigned rank = 0,
-// function arguments are rank = 1, and other values are assigned ranks
-// corresponding to the reverse post order traversal of current function
-// (starting at 2), which effectively gives values in deep loops higher rank
+// In the implementation of this algorithm, constants are assigned rank 0
+// firstly, the function arguments rank following constants, and at last, other
+// values are assigned ranks corresponding to the reverse post order traversal
+// of current function, which effectively gives values in deep loops higher rank
 // than values not in loops.
 //
 //===----------------------------------------------------------------------===//