From owner-freebsd-hackers Sat Nov 9 21:12:57 1996 Return-Path: owner-hackers Received: (from root@localhost) by freefall.freebsd.org (8.7.5/8.7.3) id VAA14692 for hackers-outgoing; Sat, 9 Nov 1996 21:12:57 -0800 (PST) Received: from delphi.bsd.uchicago.edu (delphi.bsd.uchicago.edu [128.135.5.5]) by freefall.freebsd.org (8.7.5/8.7.3) with ESMTP id VAA14686 for ; Sat, 9 Nov 1996 21:12:45 -0800 (PST) Received: from bio-5.bsd.uchicago.edu (bio-5.bsd.uchicago.edu [128.135.75.14]) by delphi.bsd.uchicago.edu (8.7.6/8.7.3/BSD-4.0) with SMTP id XAA12202; Sat, 9 Nov 1996 23:12:30 -0600 (CST) Received: by bio-5.bsd.uchicago.edu (5.0/SMI-SVR4) id AA13579; Sat, 9 Nov 1996 23:12:27 +0600 Date: Sat, 9 Nov 1996 23:12:27 +0600 Message-Id: <9611100512.AA13579@bio-5.bsd.uchicago.edu> To: scrappy@ki.net Cc: hackers@freebsd.org In-Reply-To: (scrappy@ki.net) Subject: Re: semaphores/shared memory From: Tim Pierce Sender: owner-hackers@freebsd.org X-Loop: FreeBSD.org Precedence: bulk > essentially, I want the server to write a line of data to > shared memory, then signal all the clients at once that the data is > there, so that they all pick up the data... It sounds like this ought to be easy if you simply have each client wait on the semaphore, and then have the server increment the semaphore by a suitably high number (e.g. MAXINT) in order to ensure that they all are freed at once. Sort of a kluge, but it ought to work.