Denis Zharkov
edbf360852
The reason is that while there are optimizations for them definition of their state is both rather simple and may be confusing in testData
55 lines
2.0 KiB
Plaintext
Vendored
55 lines
2.0 KiB
Plaintext
Vendored
== foo ==
|
|
fun foo() {
|
|
"before"
|
|
val b = 1
|
|
fun local(x: Int) {
|
|
val a = x + b
|
|
}
|
|
"after"
|
|
}
|
|
---------------------
|
|
L0:
|
|
1 <START> INIT: in: {} out: {}
|
|
2 mark({ "before" val b = 1 fun local(x: Int) { val a = x + b } "after" })
|
|
mark("before")
|
|
r("before") -> <v0>
|
|
v(val b = 1) INIT: in: {} out: {}
|
|
r(1) -> <v1> INIT: in: {} out: {}
|
|
w(b|<v1>) INIT: in: {} out: {}
|
|
jmp?(L2) INIT: in: {} out: {}
|
|
d(fun local(x: Int) { val a = x + b }) INIT: in: {} out: {}
|
|
L2 [after local declaration]:
|
|
mark("after")
|
|
r("after") -> <v2>
|
|
L1:
|
|
1 <END>
|
|
error:
|
|
<ERROR>
|
|
sink:
|
|
<SINK> USE: in: {} out: {}
|
|
=====================
|
|
== local ==
|
|
fun local(x: Int) {
|
|
val a = x + b
|
|
}
|
|
---------------------
|
|
L3:
|
|
3 <START> INIT: in: {} out: {}
|
|
v(x: Int) INIT: in: {} out: {}
|
|
magic[FAKE_INITIALIZER](x: Int) -> <v0> INIT: in: {} out: {}
|
|
w(x|<v0>) INIT: in: {} out: {}
|
|
4 mark({ val a = x + b }) INIT: in: {} out: {}
|
|
v(val a = x + b) INIT: in: {} out: {}
|
|
r(x) -> <v1> INIT: in: {} out: {}
|
|
r(b) -> <v2>
|
|
mark(x + b)
|
|
call(x + b, plus|<v1>, <v2>) -> <v3>
|
|
w(a|<v3>) INIT: in: {} out: {}
|
|
L4:
|
|
3 <END> INIT: in: {} out: {}
|
|
error:
|
|
<ERROR>
|
|
sink:
|
|
<SINK> USE: in: {} out: {}
|
|
=====================
|