Make all progression headers inclusive, and decrement last for

last-exclusive progressions (i.e., "until" progressions and loop over
array indices).

This change makes it possible to correctly implement the handling of
"step" progressions. Computing the last element of a stepped progression
requires that the last is inclusive.

Also invert the while loop (into if + do-while) that is used when
lowering for-loops over progressions that cannot overflow. This keeps
the performance characteristics closer to the ForLoopsLowering in
kotlin-native, since the goal is to converge to this shared version.

Also used IrType instead of KotlinType, where possible.

 https://github.com/JetBrains/kotlin/pull/2390
 https://github.com/JetBrains/kotlin/pull/2305

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

@@ -1,3 +1,4 @@
+// IGNORE_BACKEND: JVM_IR
 const val N = 42
 
 fun test(): Int {
@@ -8,6 +9,9 @@ fun test(): Int {
     return sum
 }
 
+// JVM non-IR uses while.
+// JVM IR uses if + do-while. The surrounding "if" gets optimized in this test (constant condition).
+
 // 0 iterator
 // 0 getStart
 // 0 getEnd