On Mon, Oct 01, 2001 at 08:38:47PM +0200, [EMAIL PROTECTED] wrote: > On Sat, Sep 29, 2001 at 02:10:54PM -0400, Rocco Caputo wrote: > > Does anyone rely on I/O events arriving out of order? Right now > > they're dispatched without going through the queue, and it makes input > > flow control tricky.
[...] > I would use a general locking mechanism that is applied to input events > by defaults. I think this kind of locks is called barrier, only one event/ > process is active, but unlike critical sections waiting events are > processed in order. Barriers could be set even for handler groups. > It could be implemented in sessions or in the main event dispatch code > (waiting events not being taken from the queue). It would be faster if in > sessions (divide and conquer) but session queues would be needed. I'm totally lost here. Could you illustrate the idea in some pseudocode? If I understand correctly, barriers require a pre-emptive task manager. That's not going to happen until I get threads working. -- Rocco Caputo / [EMAIL PROTECTED] / poe.perl.org / poe.sourceforge.net
