[FIR] Remove ortho splines mode from CFG dump

This commit is contained in:
Dmitriy Novozhilov
2020-03-11 12:08:49 +03:00
parent f83cedd244
commit 3a5c30a581
54 changed files with 54 additions and 54 deletions
@@ -47,7 +47,7 @@ class FirControlFlowGraphRenderVisitor(
printer
.println("digraph ${file.name.replace(".", "_")} {")
.pushIndent()
.println("graph [splines=ortho nodesep=3]")
.println("graph [nodesep=3]")
.println("node [shape=box penwidth=2]")
.println("edge [penwidth=2]")
.println()
@@ -1,5 +1,5 @@
digraph binaryOperations_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph booleanOperatorsWithConsts_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
+1 -1
View File
@@ -1,5 +1,5 @@
digraph complex_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
+1 -1
View File
@@ -1,5 +1,5 @@
digraph emptyWhen_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
+1 -1
View File
@@ -1,5 +1,5 @@
digraph initBlock_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph initBlockAndInPlaceLambda_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
+1 -1
View File
@@ -1,5 +1,5 @@
digraph jumps_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph lambdaAsReturnOfLambda_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
+1 -1
View File
@@ -1,5 +1,5 @@
digraph lambdas_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
+1 -1
View File
@@ -1,5 +1,5 @@
digraph loops_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph postponedLambdas_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph propertiesAndInitBlocks_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph returnValuesFromLambda_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
+1 -1
View File
@@ -1,5 +1,5 @@
digraph safeCalls_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
+1 -1
View File
@@ -1,5 +1,5 @@
digraph simple_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
+1 -1
View File
@@ -1,5 +1,5 @@
digraph tryCatch_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
+1 -1
View File
@@ -1,5 +1,5 @@
digraph when_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph exhaustiveWhenAndDNNType_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph bangbang_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph booleanOperators_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph equalsToBoolean_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph jumpFromRhsOfOperator_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph boundSmartcasts_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph boundSmartcastsInBranches_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph functionCallBound_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
+1 -1
View File
@@ -1,5 +1,5 @@
digraph casts_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph elvis_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph returns_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph simpleIf_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph smartcastFromArgument_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph when_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph equalsAndIdentity_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph inPlaceLambdas_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph smartcastOnLambda_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph dataFlowInfoFromWhileCondition_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph endlessLoops_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph multipleCasts_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph nullability_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph implicitReceiverAsWhenSubject_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph implicitReceivers_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph thisOfExtensionProperty_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph assignSafeCall_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph safeCallAndEqualityToBool_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph safeCalls_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph smartCastInInit_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph smartcastToNothing_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph overridenOpenVal_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph delayedAssignment_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph smartcastAfterReassignment_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph callsInPlace_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph conditionalEffects_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph delegateWithAnonymousObject_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]
@@ -1,5 +1,5 @@
digraph tryWithLambdaInside_kt {
graph [splines=ortho nodesep=3]
graph [nodesep=3]
node [shape=box penwidth=2]
edge [penwidth=2]