![]() | |||||||||||||
Messages in this thread |
> > It's impossible to be otherwise. A call requires > > that the return address be written to memory (the stack), > > using register indirection (the stack-pointer). > > and it's a so common pattern that it's optimized to death. Internally a > call gets transformed to 2 uops or so, one is push eip, the other is the > jmp (which gets then just absorbed by the "what is the next eip" logic, > just as a "jmp"s are 0 cycles) Arjan, you overlook the fact that kfree() contains 'if(!p) return;' too. call + test-and-branch can never be faster than test+and+branch. Maybe on the really clever CPU it can take the same time, but not faster... -- vda - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/ | ||||||||||||
| Last update: 2005-04-06 11:30 [W:0.344 / U:1.790 seconds] ©2003-2008 Jasper Spaans | |||||||||||||