mirror of
https://github.com/jlengrand/kotlin.git
synced 2026-05-09 00:21:47 +00:00
de1e27c584
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
22 lines
384 B
Kotlin
Vendored
22 lines
384 B
Kotlin
Vendored
// TARGET_BACKEND: JVM_IR
|
|
const val N = 'Z'
|
|
|
|
fun test(): Int {
|
|
var sum = 0
|
|
for (i in 'A' .. N) {
|
|
sum += i.toInt()
|
|
}
|
|
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
|
|
// 0 getFirst
|
|
// 0 getLast
|
|
// 0 getStep
|
|
// 1 IF_ICMPLE
|
|
// 1 IF |