pyos
a9be27e330
Quick quiz:
Q: In a CFG, what does `a -> b -> c -> d` mean?
A: `a`, then `b`, then `c`, then `d`.
Q: In a CFG, what does `a -> b -> d; a -> c -> d` mean?
A: `a`, then `b` or `c`, then `d`.
Q: So how do you encode "a, then (b, then c) or (c, then b), then d`?
A: You can't.
Problem is, you need to, because that's what `a; run2({ b }, { c }); d`
does when `run2` has a contract that it calls both its lambda arguments
in-place: `shuffle(listOf(block1, block2)).forEach { it() }` is a
perfectly valid implementation for it, as little sense as that makes.
So that's what union nodes solve. When a node implements
`UnionNodeMarker`, its inputs are interpreted as "all visited in some
order" instead of the normal "one of the inputs is visited".
Currently this is used for data flow. It *should* also be used for
control flow, but it isn't. But it should be. But that's not so easy.
BTW, `try` exit is NOT a union node; although lambdas in one branch can
be completed according to types' of lambdas in another, data does not
flow between the branches anyway (since we don't know how much of the
`try` executed before jumping into `catch`, and `catch`es are mutually
exclusive) so a `try` expression is more like `when` than a function
call with called-in-place-exactly-once arguments. The fact that
`exitTryExpression` used `processUnionOfArguments` in a weird way
should've hinted at that, but now we know for certain.
106 lines
3.3 KiB
Plaintext
Vendored
106 lines
3.3 KiB
Plaintext
Vendored
digraph dataFlowInfoFromWhileCondition_kt {
|
|
graph [nodesep=3]
|
|
node [shape=box penwidth=2]
|
|
edge [penwidth=2]
|
|
|
|
subgraph cluster_0 {
|
|
color=red
|
|
0 [label="Enter function foo" style="filled" fillcolor=red];
|
|
1 [label="Exit function foo" style="filled" fillcolor=red];
|
|
}
|
|
0 -> {1};
|
|
|
|
subgraph cluster_1 {
|
|
color=red
|
|
2 [label="Enter class A" style="filled" fillcolor=red];
|
|
3 [label="Exit class A" style="filled" fillcolor=red];
|
|
}
|
|
2 -> {3} [color=green];
|
|
|
|
subgraph cluster_2 {
|
|
color=red
|
|
4 [label="Enter class B" style="filled" fillcolor=red];
|
|
5 [label="Exit class B" style="filled" fillcolor=red];
|
|
}
|
|
4 -> {5} [color=green];
|
|
|
|
subgraph cluster_3 {
|
|
color=red
|
|
6 [label="Enter class C" style="filled" fillcolor=red];
|
|
7 [label="Exit class C" style="filled" fillcolor=red];
|
|
}
|
|
6 -> {7} [color=green];
|
|
|
|
subgraph cluster_4 {
|
|
color=red
|
|
8 [label="Enter function test" style="filled" fillcolor=red];
|
|
subgraph cluster_5 {
|
|
color=blue
|
|
9 [label="Enter block"];
|
|
10 [label="Const: Null(null)"];
|
|
11 [label="Variable declaration: lvar a: R|A?|"];
|
|
subgraph cluster_6 {
|
|
color=blue
|
|
12 [label="Enter while loop"];
|
|
subgraph cluster_7 {
|
|
color=blue
|
|
13 [label="Enter loop condition"];
|
|
subgraph cluster_8 {
|
|
color=blue
|
|
14 [label="Enter ||"];
|
|
15 [label="Access variable R|<local>/a|"];
|
|
16 [label="Type operator: (R|<local>/a| is R|B|)"];
|
|
17 [label="Exit left part of ||"];
|
|
18 [label="Enter right part of ||"];
|
|
19 [label="Access variable R|<local>/a|"];
|
|
20 [label="Type operator: (R|<local>/a| is R|C|)"];
|
|
21 [label="Exit ||"];
|
|
}
|
|
22 [label="Exit loop condition"];
|
|
}
|
|
subgraph cluster_9 {
|
|
color=blue
|
|
23 [label="Enter loop block"];
|
|
subgraph cluster_10 {
|
|
color=blue
|
|
24 [label="Enter block"];
|
|
25 [label="Access variable R|<local>/a|"];
|
|
26 [label="Smart cast: R|<local>/a|"];
|
|
27 [label="Function call: R|<local>/a|.R|/A.foo|()" style="filled" fillcolor=yellow];
|
|
28 [label="Exit block"];
|
|
}
|
|
29 [label="Exit loop block"];
|
|
}
|
|
30 [label="Exit whileloop"];
|
|
}
|
|
31 [label="Exit block"];
|
|
}
|
|
32 [label="Exit function test" style="filled" fillcolor=red];
|
|
}
|
|
8 -> {9};
|
|
9 -> {10};
|
|
10 -> {11};
|
|
11 -> {12};
|
|
12 -> {13};
|
|
13 -> {14};
|
|
14 -> {15};
|
|
15 -> {16};
|
|
16 -> {17};
|
|
17 -> {21 18};
|
|
18 -> {19};
|
|
19 -> {20};
|
|
20 -> {21};
|
|
21 -> {22};
|
|
22 -> {30 23};
|
|
23 -> {24};
|
|
24 -> {25};
|
|
25 -> {26};
|
|
26 -> {27};
|
|
27 -> {28};
|
|
28 -> {29};
|
|
29 -> {13} [color=green style=dashed];
|
|
30 -> {31};
|
|
31 -> {32};
|
|
|
|
}
|