Use while loop for progressions that cannot overflow (instead of

do-while with enclosing "not empty" check).

Also do not add additional "not empty" condition for `until` loops when
the given bound is a constant != MIN_VALUE.

compiler/testData/codegen/bytecodeText/forLoop/forInRangeToIntMaxValue.kt

@@ -0,0 +1,14 @@
+const val M = Int.MAX_VALUE
+
+fun f(a: Int) {
+    for (i in a..M) {
+    }
+}
+
+// 0 iterator
+// 0 getStart
+// 0 getEnd
+// 0 getFirst
+// 0 getLast
+// 0 getStep
+// 2 IF_ICMP