Date: Wed, 26 May 2004 17:28:49 -0400 (EDT) From: Robert Watson <rwatson@freebsd.org> To: Julian Elischer <julian@elischer.org> Cc: Alan Cox <alc@cs.rice.edu> Subject: Re: Network Stack Locking Message-ID: <Pine.NEB.3.96L.1040526172654.20947H-100000@fledge.watson.org> In-Reply-To: <Pine.BSF.4.21.0405251410580.43418-100000@InterJet.elischer.org>
next in thread | previous in thread | raw e-mail | index | archive | help
On Tue, 25 May 2004, Julian Elischer wrote: > This is how netgraph works. (particularly in 5.x) It's also worth pointing out, for those looking at various approaches, that NetBSD is currently discussing continuation primitives on the tech-kern mailing list (I seem to have gotten added to the CC line lately, which I don't object to :-). You can also argue that things like bio's, PCB's, et al, are implementations of the continuation philosophy, just lacking a abstracted primitive. They maintain state to be picked up by a context but discarding the stack. Callouts and callbacks are used to perform scheduling, however, rather than the scheduler explicitly. Robert N M Watson FreeBSD Core Team, TrustedBSD Projects robert@fledge.watson.org Senior Research Scientist, McAfee Research
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?Pine.NEB.3.96L.1040526172654.20947H-100000>