Re: light weight user level semaphores

2001-04-19 Thread George Talbot
On Tue, 17 Apr 2001 12:48:48 -0700 (PDT) Linus Torvalds wrote: [deletia] > /* > * a fast semaphore is a 128-byte opaque thing, > * aligned on a 128-byte boundary. This is partly > * to minimize false sharing in the L1 (we assume > * that 128-byte cache

Re: Can EINTR be handled the way BSD handles it? -- a plea from a user-land

2000-11-06 Thread George Talbot
You know, a more concise way of stating my underlying question might be: Does POSIX require that programs be aware of signals, in the "returning EINTR" sense, if they do not use signals, and only use pthreads? I might want to write a program that uses pthreads instead of

Re: Can EINTR be handled the way BSD handles it? -- a plea from auser-land programmer...

2000-11-06 Thread George Talbot
I respectfully disagree that programs which don't surround some of the most common system calls with do { rv = __some_system_call__(...); } while (rv == -1 && errno == EINTR); are broken. Especially if those programs don't use signals. The problem that I

Re: Can EINTR be handled the way BSD handles it? -- a plea from a user-land

2000-11-06 Thread George Talbot
On Fri, 3 Nov 2000, Theodore Y. Ts'o wrote: >Date: Fri, 03 Nov 2000 14:44:17 -0500 >From: [EMAIL PROTECTED] > >My problem is that pthread_create (glibc 2.1.3, kernel 2.2.17 i686) is >failing because, deep inside glibc somewhere, nanosleep() is returning >EINTR. > > Soun