On 2 March 2018 at 11:53, Christopher Li <sparse@xxxxxxxxxxx> wrote: > Here is the git branch > > https://git.kernel.org/pub/scm/devel/sparse/chrisl/sparse.git/log/?h=dominator-flat > > This is what I have been working on for a while. I want to try some textbook > way to fix up the SSA issue in the sparse. A big step towards SSA conversion > is calculating the dominance frontier, that is where the phi node needs to > be place on. > > After this perform the proper SSA conversion on memory to register > should be pretty straight forward. > Is this patch something I could try out in my repo - i.e. does it change the SSA gen or is it just a preparatory patch? > BTW, I really appreciate if some one can write some validation function > to double check the output dominator tree and DF is correct and bug free. > I would like to understand the whole simplification phase and review / participate / test it, but I struggle with the code a bit. Partly because I cannot visualize what is going on - and the use of unions makes it hard to follow even with a debugger. Any advice on how best to get started with this? Of course I probably need to write one myself to really understand it - but short of that, how can I best understand what is going on here? Thanks and Regards Dibyendu -- To unsubscribe from this list: send the line "unsubscribe linux-sparse" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html
