Dmitry Petrov
49 lines
1.6 KiB
Kotlin
Vendored
49 lines
1.6 KiB
Kotlin
Vendored
// 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 box(): String {
|
|
for (i in (1..8 step 2).reversed()) {
|
|
}
|
|
|
|
return "OK"
|
|
}
|
|
|
|
// For "step" progressions in JVM IR, a call to getProgressionLastElement() is made to compute the "last" value.
|
|
// If the step is non-constant, there is a check that it is > 0, and if not, an IllegalArgumentException is thrown. However, when the
|
|
// step is constant and > 0, this check does not need to be added.
|
|
//
|
|
// Expected lowered form of loop:
|
|
//
|
|
// // Standard form of loop over progression
|
|
// val last = 1
|
|
// var inductionVar = getProgressionLastElement(1, 8, 2)
|
|
// if (last <= inductionVar) {
|
|
// // Loop is not empty
|
|
// do {
|
|
// val i = inductionVar
|
|
// inductionVar += -2
|
|
// // Loop body
|
|
// } while (last <= inductionVar)
|
|
// }
|
|
|
|
// 0 reversed
|
|
// 0 iterator
|
|
// 0 getStart
|
|
// 0 getEnd
|
|
// 0 getFirst
|
|
// 0 getLast
|
|
// 0 getStep
|
|
// 1 INVOKESTATIC kotlin/internal/ProgressionUtilKt.getProgressionLastElement
|
|
// 0 NEW java/lang/IllegalArgumentException
|
|
// 0 ATHROW
|
|
// 1 IF_ICMPGT
|
|
// 1 IF_ICMPLE
|
|
// 2 IF |