JVM_IR generate range-based loop closer to Java counter loop

KT-48435 KT-48507

compiler/testData/codegen/bytecodeText/forLoop/stepped/stepThenStepNonConst.kt

@@ -1,4 +1,14 @@
 // TARGET_BACKEND: JVM_IR
+
+// 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 one() = 1
 
 fun box(): String {
@@ -11,26 +21,6 @@ fun box(): String {
 // For "step" progressions in JVM IR, if the step is non-constant, there is a check that it is > 0, and if not, an IllegalArgumentException
 // is thrown.
 //
-// Expected lowered form of loop:
-//
-//   // Additional statments:
-//   var innerStepArg = one()
-//   if (innerStepArg <= 0) throw IllegalArgumentException("Step must be positive, was: $innerStepArg.")
-//   val outerNestedLast = getProgressionLastElement(1, 6, innerStepArg)
-//   var outerStepArg = one()
-//   if (outerStepArg <= 0) throw IllegalArgumentException("Step must be positive, was: $outerStepArg.")
-//
-//   // Standard form of loop over progression
-//   var inductionVar = 1
-//   val last = getProgressionLastElement(1, outerNestedLast, outerStepArg)
-//   if (inductionVar <= last) {
-//     // Loop is not empty
-//     do {
-//       val i = inductionVar
-//       inductionVar += outerStepArg
-//       // Loop body
-//     } while (i != last)
-//   }
 
 // 0 iterator
 // 0 getStart
@@ -42,6 +32,11 @@ fun box(): String {
 // 2 NEW java/lang/IllegalArgumentException
 // 2 ATHROW
 // 1 IF_ICMPGT
-// 1 IF_ICMPNE
+// 1 IF_ICMPEQ
 // 2 IFGT
-// 4 IF
+// 4 IF
+// 13 ILOAD
+// 6 ISTORE
+// 1 IADD
+// 0 ISUB
+// 0 IINC