On Wed, Aug 16, 2017 at 2:09 PM, Christopher Li <sparse@xxxxxxxxxxx> wrote: > > Because the paper "simple and elegant" only cover the reducible > graph case. When you considering the irreducible graph source file > input, say having "goto", all the sudden it is not simple and elegant > any more. It is more like complex and ad-hoc. You mix two things together, Chris. > Exactly. I am totally agree with you. My worries are the hidden complexity > dealing with gotos in that paper. The code is there and running. -- 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
