Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.compilers > #2149 > unrolled thread

Optimised Node Splitting in Irreducible Flow Graphs

Back to article view | Back to comp.compilers

Contents

  Optimised Node Splitting in Irreducible Flow Graphs bilal.a.tariq@gmail.com - 2019-01-21 22:09 -0500

#2149 — Optimised Node Splitting in Irreducible Flow Graphs

Hello

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?

B. Tariq

[toc] | [standalone]

Back to top | Article view | comp.compilers

csiph-web