JVM_IR generate range-based loop closer to Java counter loop

KT-48435 KT-48507

compiler/testData/codegen/bytecodeText/forLoop/unsigned/illegalStepConst.kt

@@ -1,5 +1,15 @@
 // TARGET_BACKEND: JVM_IR
 // WITH_RUNTIME
+
+// IMPORTANT!
+// Please, when your changes cause failures in bytecodeText tests for 'for' loops,
+// examine the resulting bytecode shape carefully.
+// Range and progression-based loops generated with Kotlin compiler should be
+// as close as possible to Java counter loops ('for (int i = a; i < b; ++i) { ... }').
+// Otherwise it may result in performance regression due to missing HotSpot optimizations.
+// Run Kotlin compiler benchmarks (https://github.com/Kotlin/kotlin-benchmarks)
+// with compiler built from your changes if you are not sure.
+
 fun box(): String {
     for (i in 1u..6u step 0) {
     }
@@ -9,23 +19,6 @@ fun box(): String {
 
 // For "step" progressions in JVM IR, if the step is constant and <= 0, the expression for step is replaced with an
 // IllegalArgumentException. The backend can then eliminate the entire loop and the rest of the function as dead code.
-//
-// Expected lowered form of loop (before bytecode optimization):
-//
-//   // Additional statements:
-//   throw IllegalArgumentException("Step must be positive, was: 0.")
-//
-//   // Standard form of loop over progression
-//   var inductionVar = 1u
-//   val last = getProgressionLastElement(1u, 6u, 0)
-//   if (inductionVar <= last) {
-//     // Loop is not empty
-//     do {
-//       val i = inductionVar
-//       inductionVar += 0
-//       // Loop body
-//     } while (i != last)
-//   }
 
 // 0 iterator
 // 0 getStart