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

Come on. Userland code constantly blows L1 cache. Almost any library call will churn the icache. For that matter, any memory access can collide the TLB. None of those things are syscall-specific. If you were concerned about L1 and icache, you needed to write your code meticulously to accomodate them anyways.

Yes, cache is important. But there's a world of difference between the "flush the caches and the TLB" behavior that system calls used to incur and the "expensive relative to local variable access" behavior we're talking about here.

"A bounce to non-local, non-current execution environment" literally doesn't mean anything. You could be talking about the CR3 change that swaps page hierarchies, the CPL3->0 change that allows privileged instructions, the CS change that got you there, or even the ESP change to "swap stacks". Which of these are expensive?

I'm chasing you down because it's fun, not because I think you don't know what you're talking about.

But, let's make this relevant: if system call overhead is drowned by disk I/O overhead, then one argument for mmap goes away.



Why do you insist on making this a flame war? Sit down and write a program that makes 10M trivial system calls (getpid() is a good choice) and one that calls a function to return a constant integer 10M times.

I'm sorry, but you seem to have a wildly inflated idea of the speed of system calls on modern OSs. The real world just doesn't work like that. This is my last post on this thread.


I did that a few months ago (http://boston.conman.org/2007/11/30.1) and found some surprising results (http://boston.conman.org/2007/12/02.1)which showed that using getpid() wasn't a good test of system call overhead.


That is a really nice catch.


By the way, you asked me to time getpid against "a function that returns a constant integer". Obviously that's a silly comparison (getpid isn't really returning a constant; it's a vectored call and it has to pull the PID out of a structure offset from %%fs). But here's a fairer fight: getpid vs. a trivial LFSR:

        s = (s >> 1) ^ (-(s & 1) & 0xd0000001);
I also timed it the way you asked, with wall clock time over 100M iterations (10M runs too fast to time). Surprising even me, getpid wins by almost a full second.

Got another challenge for me to write code for?


Here you go:

http://pastie.org/230109

Want the punch line? OSX getpid averages under 100 cycles; snprintf (no IO) averages over 1000.


Are you sure getpid() is doing a system call and not reading TLS?


What a great question! I just checked. Nope:

Breakpoint 1, 0x96210c44 in getpid ()

(gdb) disp/i $eip

2: x/i $eip 0x96210c44 <getpid>: call 0x96210c49 <getpid+5>

(gdb) stepi

0x96210c49 in getpid ()

2: x/i $eip 0x96210c49 <getpid+5>: pop %ecx

0x96210c4a in getpid ()

2: x/i $eip 0x96210c4a <getpid+6>: lea 0xa6427a3(%ecx),%ecx

0x96210c50 in getpid ()

2: x/i $eip 0x96210c50 <getpid+12>: mov (%ecx),%eax

0x96210c52 in getpid ()

2: x/i $eip 0x96210c52 <getpid+14>: test %eax,%eax

0x96210c54 in getpid ()

2: x/i $eip 0x96210c54 <getpid+16>: jle 0x96210c57 <getpid+19>

0x96210c57 in getpid () 2: x/i $eip 0x96210c57 <getpid+19>: mov $0x14,%eax

0x96210c5c in getpid ()

2: x/i $eip 0x96210c5c <getpid+24>: call 0x961e8cf4 <_sysenter_trap>




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

Search: