|Optimised Node Splitting in Irreducible Flow Graphs email@example.com (2019-01-21)|
|Date:||Mon, 21 Jan 2019 22:09:58 -0500 (EST)|
|Injection-Info:||gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="1970"; mail-complaints-to="firstname.lastname@example.org"|
|Posted-Date:||21 Jan 2019 22:09:58 EST|
I am working on a hobbyist transpiler/optimiser for Java bytecode and am
interested in implementing the controlled node splitting algorithm specified
in "Making graphs reducible with controlled node splitting" by Johan Janssen
and Henk Corporaal. More specifically I am unsure what the best way to
identify the "loop-sets" are, defined as paths (n_1,...,n_k) where n_1 is an
immediate successor of n_k. The loopsets formed here seem similar to strongly
connected components to me but they are not the same. Perhaps there is a
reference implementation I could look at or is there something glaringly
obvious I am missing?
Return to the
Search the comp.compilers archives again.