Date: Sat, 12 Aug 2000 12:17:27 +0200 From: Jonas Bulow <jonas.bulow@servicefactory.se> To: Ronald G Minnich <rminnich@lanl.gov> Cc: hackers@FreeBSD.ORG Subject: Re: IPC, shared memory, syncronization Message-ID: <39952437.EFCAA381@servicefactory.se> References: <Pine.LNX.4.20.0008112101590.6759-100000@mini.acl.lanl.gov>
next in thread | previous in thread | raw e-mail | index | archive | help
Ronald G Minnich wrote: > On Fri, 11 Aug 2000, John Polstra wrote: > > In article <39948331.5E83DE1B@servicefactory.se>, > > Jonas Bulow <jonas.bulow@servicefactory.se> wrote: > > > Jonas Bulow wrote: > > > > > > > > What is the "BSD-way" of access to shared memory (mmap:ed) secure (avoid > > > > race conditions, etc)? Right now I'm using posix semaphores but I would > > > > like to know if there is a substitute like the way kqueue is for > > > > select/poll. > > I don't know about the "bsd" or whatever way. If you're doing real > parallel programming and want real performance, you'll use a test-and-set > like function that uses the low-level machine instructions for same. That is exacly what I'm looking for! I found it to be overkill to involve the kernel just because I wanted to have a context switch during the "test-and-set". > > I do have one of these (posted to this list about 6 years ago) if you want > it. I tried to find it but didn't have any luck. Maybe you can point me to it? /jcb To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-hackers" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?39952437.EFCAA381>