Hacker News new | ask | show | jobs
by ekiwi 2018 days ago
The problem with delay slots is that their optimal size is somewhat tied to the particular micro-architecture. I.e., different MIPS CPU implementations would have different optimal branch delay slot sizes. This doesn't matter too much if your compiler is allowed to optimize for your particular implementation, but we are still mostly shipping binaries and thus you would have to make trade-offs for portability reasons.
1 comments

They're also pointless once you do even a small amount of dynamic local reordering, which every fast CPU does.