ForLoopsLowering: Add additional bytecode text tests for optimization of
unsigned progressions.
This commit is contained in:
committed by
Alexander Udalov
parent
0e6af517d7
commit
f249e7f5e9
+45
@@ -0,0 +1,45 @@
|
||||
// TARGET_BACKEND: JVM_IR
|
||||
// WITH_RUNTIME
|
||||
fun box(): String {
|
||||
for (i in 1u..7u step 3 step 2) {
|
||||
}
|
||||
|
||||
return "OK"
|
||||
}
|
||||
|
||||
// For "step" progressions in JVM IR, a call to getProgressionLastElement() is made to compute the "last" value. This is done for each
|
||||
// nested call to "step".
|
||||
// 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:
|
||||
//
|
||||
// // Additional variables:
|
||||
// val outerNestedLast = getProgressionLastElement(1u, 7u, 3)
|
||||
//
|
||||
// // Standard form of loop over progression
|
||||
// var inductionVar = 1u
|
||||
// val last = getProgressionLastElement(1u, outerNestedLast, 2)
|
||||
// val step = 2
|
||||
// if (inductionVar <= last) {
|
||||
// // Loop is not empty
|
||||
// do {
|
||||
// val i = inductionVar
|
||||
// inductionVar += step
|
||||
// // Loop body
|
||||
// } while (i != last)
|
||||
// }
|
||||
|
||||
// 0 iterator
|
||||
// 0 getStart
|
||||
// 0 getEnd
|
||||
// 0 getFirst
|
||||
// 0 getLast
|
||||
// 0 getStep
|
||||
// 2 INVOKESTATIC kotlin/internal/UProgressionUtilKt.getProgressionLastElement
|
||||
// 0 NEW java/lang/IllegalArgumentException
|
||||
// 0 ATHROW
|
||||
// 1 INVOKESTATIC kotlin/UnsignedKt.uintCompare
|
||||
// 1 IFGT
|
||||
// 1 IF_ICMPNE
|
||||
// 2 IF
|
||||
Reference in New Issue
Block a user