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

Well, you could embed a machine-checked proof that instruction sequences of the targeted form will sometimes survive previous optimization passes and therefore the given optimization will always be contributing something.

But that's hard, so every compiler I've used leaves it to human engineering instead.




You can emit stats for time and # of instructions changed by each pass. gcc certainly does the first, don't remember the second.




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

Search: