On Wed, Aug 16, 2017 at 02:33:30AM -0400, Christopher Li wrote: > I have spend some time reading the paper > > http://compilers.cs.uni-saarland.de/papers/bbhlmz13cc.pdf > > "Simple and Efficient SSA Construction". Which is luc's SSA > conversion is based on: > > Here is some random thoughts about the paper I might just > share with you guys. If I make a mistake some where along > the line, I am very glad if some one can point it out to me. > > - I think the main point of the paper doing SSA without > the CFG is not particular useful to us. We need to generate > CFG *anyway*. I think you mis-understnd the point. Of course the CFG is needed at the end. The point of the article is that with their method you don't have to *first* build a CFG and a non-SSA representation and *then directly convert* this into the SSA form (and maybe having to throw away most of what was previously build) because their method construct the CFG and the SSA form at once, directly from the AST. In short it does the SSA construction directly during the linearization. OTOH, with the current method (and the traditional ones) we have first to linearize and do all access to local vars as memory access and what all of this is done, we need another pass which will create the SSA form and destroy most load & write to these local vars. -- Luc -- 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
