Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

One trick could be to run the program in a "lazy" way. E.g. don't run a statement like "a=b+c", but evaluate it only when a is needed. This would require a complete and automatic rewrite at the assembly level, but you wouldn't be doing anything that you don't need. Then from this you could determine the "hot" paths, and optimize those for speed (translate back into non-lazy form).


Tracking all those dependencies is not free either.

Unfortunately there isn't a magic bullet to code bloat.


Optimizing hot paths is already done via PGO (https://en.wikipedia.org/wiki/Profile-guided_optimization).




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

Search: