Ivan Kochurkin
34 lines
834 B
Kotlin
Vendored
34 lines
834 B
Kotlin
Vendored
// 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.
|
|
|
|
const val M = 1L
|
|
|
|
fun f(a: Long): Int {
|
|
var n = 0
|
|
for (i in a downTo M) {
|
|
n++
|
|
}
|
|
return n
|
|
}
|
|
|
|
// 0 iterator
|
|
// 0 getStart
|
|
// 0 getEnd
|
|
// 0 getFirst
|
|
// 0 getLast
|
|
// 0 getStep
|
|
// 1 LCMP
|
|
// 1 IF
|
|
|
|
// JVM_IR_TEMPLATES
|
|
// 1 ILOAD
|
|
// 1 ISTORE
|
|
// 0 IADD
|
|
// 0 ISUB
|
|
// 1 IINC |