Hacker News new | past | comments | ask | show | jobs | submit login

If you search gcc-patches, we quantified the cost of doing this at one point, though i have no recollection of the results.

Back in the day, I talked with Ken Zadeck (who used to be my office mate at IBM) and some others at IBM Research, and it turns out there is a bunch of good unpublished algorithms and research on both eliminating and analyzing irreducible control flow.

Sadly, this seems to be a case where this knowledge won't make it out of IBM :(




This challenge covers much of compilers research. Many heuristics and techniques that are used in practice in compilers (certainly in ours and GHC and ocaml and other research ones I've talked with) have solutions we've all verbally shared with one another on how to solve these problems. But we're all convinced we couldn't get a paper out of it (novel enough, but it's too hard to meet the "evaluation bar"), so it remains stuff we talk about during breaks at conferences and in "Limited" circles on G+...




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: