sp-04/test-output/all.dt.dot

449 lines
9.8 KiB
Plaintext

digraph root {
node [label="\N"];
subgraph dominatorTree_gv5 {
graph [label=allocAndInitObjectArrayMethod];
node [label="\N",
style=""
];
"D(-1)_gv5" [style=filled];
"D(-1)_gv5" -> "D(0)_gv5";
"D(0)_gv5" -> "D(-2)_gv5";
}
subgraph dominatorTree_gv6 {
graph [label=allocIncomplete2dArrayMethod];
node [label="\N",
style=""
];
"D(-1)_gv6" [style=filled];
"D(-1)_gv6" -> "D(0)_gv6";
"D(0)_gv6" -> "D(-2)_gv6";
}
subgraph dominatorTree_gv7 {
graph [label=allocIntArrayMethod];
node [label="\N",
style=""
];
"D(-1)_gv7" [style=filled];
"D(-1)_gv7" -> "D(0)_gv7";
"D(0)_gv7" -> "D(-2)_gv7";
}
subgraph dominatorTree_gv8 {
graph [label=allocObjectArrayMethod];
node [label="\N",
style=""
];
"D(-1)_gv8" [style=filled];
"D(-1)_gv8" -> "D(0)_gv8";
"D(0)_gv8" -> "D(-2)_gv8";
}
subgraph dominatorTree_gv9 {
graph [label=allocObjectMethod];
node [label="\N",
style=""
];
"D(-1)_gv9" [style=filled];
"D(-1)_gv9" -> "D(0)_gv9";
"D(0)_gv9" -> "D(-2)_gv9";
}
subgraph dominatorTree_gv10 {
graph [label=arrayLengthMethod];
node [label="\N",
style=""
];
"D(-1)_gv10" [style=filled];
"D(-1)_gv10" -> "D(0)_gv10";
"D(0)_gv10" -> "D(-2)_gv10";
}
subgraph dominatorTree_gv11 {
graph [label=arrayReadMethod];
node [label="\N",
style=""
];
"D(-1)_gv11" [style=filled];
"D(-1)_gv11" -> "D(0)_gv11";
"D(0)_gv11" -> "D(-2)_gv11";
}
subgraph dominatorTree_gv12 {
graph [label=arrayWriteMethod];
node [label="\N",
style=""
];
"D(-1)_gv12" [style=filled];
"D(-1)_gv12" -> "D(0)_gv12";
"D(0)_gv12" -> "D(-2)_gv12";
}
subgraph dominatorTree_gv13 {
graph [label=condMethod];
node [label="\N",
style=""
];
"D(-1)_gv13" [style=filled];
"D(-1)_gv13" -> "D(0)_gv13";
"D(0)_gv13" -> "D(7)";
"D(0)_gv13" -> "D(10)";
"D(0)_gv13" -> "D(5)";
"D(10)" -> "D(-2)_gv13";
}
subgraph dominatorTree_gv14 {
graph [label=doWhileMethod];
node [label="\N",
style=""
];
"D(-1)_gv14" [style=filled];
"D(-1)_gv14" -> "D(0)_gv14";
"D(0)_gv14" -> "D(4)";
"D(18)" -> "D(-2)_gv14";
"D(4)" -> "D(18)";
}
subgraph dominatorTree_gv15 {
graph [label=doWhileTrue];
node [label="\N",
style=""
];
"D(-1)_gv15" [style=filled];
"D(-1)_gv15" -> "D(0)_gv15";
}
subgraph dominatorTree_gv16 {
graph [label=emptyMethod];
node [label="\N",
style=""
];
"D(-1)_gv16" [style=filled];
"D(-1)_gv16" -> "D(0)_gv16";
"D(0)_gv16" -> "D(-2)_gv15";
}
subgraph dominatorTree_gv17 {
graph [label=fieldReadMethod];
node [label="\N",
style=""
];
"D(-1)_gv17" [style=filled];
"D(-1)_gv17" -> "D(0)_gv17";
"D(0)_gv17" -> "D(-2)_gv16";
}
subgraph dominatorTree_gv18 {
graph [label=fieldWriteMethod];
node [label="\N",
style=""
];
"D(-1)_gv18" [style=filled];
"D(-1)_gv18" -> "D(0)_gv18";
"D(0)_gv18" -> "D(-2)_gv17";
}
subgraph dominatorTree_gv19 {
graph [label=forEachArrayMethod];
node [label="\N",
style=""
];
"D(-1)_gv19" [style=filled];
"D(-1)_gv19" -> "D(0)_gv19";
"D(13)" -> "D(29)";
"D(13)" -> "D(18)_gv1";
"D(29)" -> "D(-2)_gv18";
"D(0)_gv19" -> "D(13)";
}
subgraph dominatorTree_gv20 {
graph [label=forEachCollectionMethod];
node [label="\N",
style=""
];
"D(-1)_gv20" [style=filled];
"D(-1)_gv20" -> "D(0)_gv20";
"D(9)" -> "D(14)";
"D(9)" -> "D(24)";
"D(0)_gv20" -> "D(9)";
"D(24)" -> "D(-2)_gv19";
}
subgraph dominatorTree_gv21 {
graph [label=forEver];
node [label="\N",
style=""
];
"D(-1)_gv21" [style=filled];
"D(-1)_gv21" -> "D(0)_gv21";
"D(0)_gv21" -> "D(4)_gv1";
}
subgraph dominatorTree_gv22 {
graph [label=forMethod];
node [label="\N",
style=""
];
"D(-1)_gv22" [style=filled];
"D(-1)_gv22" -> "D(0)_gv22";
"D(0)_gv22" -> "D(8)";
"D(8)" -> "D(23)";
"D(8)" -> "D(13)_gv1";
"D(23)" -> "D(-2)_gv20";
}
subgraph dominatorTree_gv23 {
graph [label=forWithBreakMethod];
node [label="\N",
style=""
];
"D(-1)_gv23" [style=filled];
"D(-1)_gv23" -> "D(0)_gv23";
"D(0)_gv23" -> "D(8)_gv1";
"D(32)" -> "D(-2)_gv21";
"D(13)_gv2" -> "D(21)";
"D(13)_gv2" -> "D(18)_gv2";
"D(8)_gv1" -> "D(32)";
"D(8)_gv1" -> "D(13)_gv2";
}
subgraph dominatorTree_gv24 {
graph [label=forWithContinueMethod];
node [label="\N",
style=""
];
"D(-1)_gv24" [style=filled];
"D(-1)_gv24" -> "D(0)_gv24";
"D(33)" -> "D(-2)_gv22";
"D(8)_gv2" -> "D(33)";
"D(8)_gv2" -> "D(13)_gv3";
"D(13)_gv3" -> "D(21)_gv1";
"D(13)_gv3" -> "D(18)_gv3";
"D(13)_gv3" -> "D(28)";
"D(0)_gv24" -> "D(8)_gv2";
}
subgraph dominatorTree_gv25 {
graph [label=ifElseMethod];
node [label="\N",
style=""
];
"D(-1)_gv25" [style=filled];
"D(-1)_gv25" -> "D(0)_gv25";
"D(0)_gv25" -> "D(13)_gv4";
"D(0)_gv25" -> "D(18)_gv4";
"D(0)_gv25" -> "D(8)_gv3";
"D(18)_gv4" -> "D(-2)_gv23";
}
subgraph dominatorTree_gv26 {
graph [label=ifMethod];
node [label="\N",
style=""
];
"D(-1)_gv26" [style=filled];
"D(-1)_gv26" -> "D(0)_gv26";
"D(0)_gv26" -> "D(8)_gv4";
"D(0)_gv26" -> "D(12)";
"D(12)" -> "D(-2)_gv24";
}
subgraph dominatorTree_gv27 {
graph [label=instanceCallMethod];
node [label="\N",
style=""
];
"D(-1)_gv27" [style=filled];
"D(-1)_gv27" -> "D(0)_gv27";
"D(0)_gv27" -> "D(-2)_gv25";
}
subgraph dominatorTree_gv28 {
graph [label=instanceCallTarget];
node [label="\N",
style=""
];
"D(-1)_gv28" [style=filled];
"D(-1)_gv28" -> "D(0)_gv28";
"D(0)_gv28" -> "D(-2)_gv26";
}
subgraph dominatorTree_gv29 {
graph [label=interfaceCallMethod];
node [label="\N",
style=""
];
"D(-1)_gv29" [style=filled];
"D(-1)_gv29" -> "D(0)_gv29";
"D(0)_gv29" -> "D(-2)_gv27";
}
subgraph dominatorTree_gv30 {
graph [label=nestedFor];
node [label="\N",
style=""
];
"D(-1)_gv30" [style=filled];
"D(-1)_gv30" -> "D(0)_gv30";
"D(17)" -> "D(32)_gv1";
"D(17)" -> "D(22)";
"D(0)_gv30" -> "D(8)_gv5";
"D(8)_gv5" -> "D(13)_gv5";
"D(8)_gv5" -> "D(37)";
"D(13)_gv5" -> "D(17)";
"D(37)" -> "D(-2)_gv28";
}
subgraph dominatorTree_gv31 {
graph [label=nonShortCircuitMethod];
node [label="\N",
style=""
];
"D(-1)_gv31" [style=filled];
"D(-1)_gv31" -> "D(0)_gv31";
"D(10)_gv1" -> "D(20)";
"D(10)_gv1" -> "D(17)_gv1";
"D(10)_gv1" -> "D(15)";
"D(20)" -> "D(-2)_gv29";
"D(20)" -> "D(28)_gv1";
"D(20)" -> "D(24)_gv1";
"D(0)_gv31" -> "D(10)_gv1";
"D(0)_gv31" -> "D(7)_gv1";
"D(0)_gv31" -> "D(5)_gv1";
}
subgraph dominatorTree_gv32 {
graph [label=privateInstanceCallMethod];
node [label="\N",
style=""
];
"D(-1)_gv32" [style=filled];
"D(-1)_gv32" -> "D(0)_gv32";
"D(0)_gv32" -> "D(-2)_gv30";
}
subgraph dominatorTree_gv33 {
graph [label=privateInstanceCallTarget];
node [label="\N",
style=""
];
"D(-1)_gv33" [style=filled];
"D(-1)_gv33" -> "D(0)_gv33";
"D(0)_gv33" -> "D(-2)_gv31";
}
subgraph dominatorTree_gv34 {
graph [label=shortCircuitMethod];
node [label="\N",
style=""
];
"D(-1)_gv34" [style=filled];
"D(-1)_gv34" -> "D(0)_gv34";
"D(0)_gv34" -> "D(5)_gv2";
"D(0)_gv34" -> "D(12)_gv1";
"D(0)_gv34" -> "D(-2)_gv32";
"D(5)_gv2" -> "D(8)_gv6";
}
subgraph dominatorTree_gv35 {
graph [label=staticCallMethod];
node [label="\N",
style=""
];
"D(-1)_gv35" [style=filled];
"D(-1)_gv35" -> "D(0)_gv35";
"D(0)_gv35" -> "D(-2)_gv33";
}
subgraph dominatorTree_gv36 {
graph [label=staticCallTarget];
node [label="\N",
style=""
];
"D(-1)_gv36" [style=filled];
"D(-1)_gv36" -> "D(0)_gv36";
"D(0)_gv36" -> "D(-2)_gv34";
}
subgraph dominatorTree_gv37 {
graph [label=staticFieldReadMethod];
node [label="\N",
style=""
];
"D(-1)_gv37" [style=filled];
"D(-1)_gv37" -> "D(0)_gv37";
"D(0)_gv37" -> "D(-2)_gv35";
}
subgraph dominatorTree_gv38 {
graph [label=staticFieldWriteMethod];
node [label="\N",
style=""
];
"D(-1)_gv38" [style=filled];
"D(-1)_gv38" -> "D(0)_gv38";
"D(0)_gv38" -> "D(-2)_gv36";
}
subgraph dominatorTree_gv39 {
graph [label=switchMethod];
node [label="\N",
style=""
];
"D(-1)_gv39" [style=filled];
"D(-1)_gv39" -> "D(0)_gv39";
"D(31)" -> "D(-2)_gv37";
"D(0)_gv39" -> "D(31)";
"D(0)_gv39" -> "D(26)";
"D(0)_gv39" -> "D(8)_gv7";
"D(0)_gv39" -> "D(20)_gv1";
"D(0)_gv39" -> "D(14)_gv1";
}
subgraph dominatorTree_gv40 {
graph [label=switchMethod2];
node [label="\N",
style=""
];
"D(-1)_gv40" [style=filled];
"D(-1)_gv40" -> "D(0)_gv40";
"D(0)_gv40" -> "D(31)_gv1";
"D(0)_gv40" -> "D(8)_gv8";
"D(0)_gv40" -> "D(14)_gv2";
"D(0)_gv40" -> "D(20)_gv2";
"D(0)_gv40" -> "D(26)_gv1";
"D(31)_gv1" -> "D(-2)_gv38";
}
subgraph dominatorTree_gv41 {
graph [label=whileMethod];
node [label="\N",
style=""
];
"D(-1)_gv41" [style=filled];
"D(-1)_gv41" -> "D(0)_gv41";
"D(0)_gv41" -> "D(4)_gv2";
"D(4)_gv2" -> "D(19)";
"D(4)_gv2" -> "D(9)_gv1";
"D(19)" -> "D(-2)_gv39";
}
subgraph dominatorTree_gv42 {
graph [label=whileTrueMethod];
node [label="\N",
style=""
];
"D(-1)_gv42" [style=filled];
"D(-1)_gv42" -> "D(0)_gv42";
}
subgraph dominatorTree {
graph [label="<init>"];
node [label="\N",
style=""
];
"D(-1)" [style=filled];
"D(-1)" -> "D(0)";
"D(0)" -> "D(-2)";
}
subgraph dominatorTree_gv1 {
graph [label=alloc2Of3dArrayMethod];
node [label="\N",
style=""
];
"D(-1)_gv1" [style=filled];
"D(-1)_gv1" -> "D(0)_gv1";
"D(0)_gv1" -> "D(-2)_gv1";
}
subgraph dominatorTree_gv2 {
graph [label=alloc2dArrayMethod];
node [label="\N",
style=""
];
"D(-1)_gv2" [style=filled];
"D(-1)_gv2" -> "D(0)_gv2";
"D(0)_gv2" -> "D(-2)_gv2";
}
subgraph dominatorTree_gv3 {
graph [label=allocAndInit2dArrayMethod];
node [label="\N",
style=""
];
"D(-1)_gv3" [style=filled];
"D(-1)_gv3" -> "D(0)_gv3";
"D(0)_gv3" -> "D(-2)_gv3";
}
subgraph dominatorTree_gv4 {
graph [label=allocAndInitIntArrayMethod];
node [label="\N",
style=""
];
"D(-1)_gv4" [style=filled];
"D(-1)_gv4" -> "D(0)_gv4";
"D(0)_gv4" -> "D(-2)_gv4";
}
}