On Wed, Aug 30, 2000 at 08:11:56PM +, [EMAIL PROTECTED] wrote:
> In case it is relevant - back in days of 64K memory we had a real-time OS
> that kept a queue as a single linked circular list.
In any case, it's a small enough optimization that maybe I'll just add
it to the TODO list. ;-)
--
Joshua N Pritikin <[EMAIL PROTECTED]> writes:
>Wow! I am reading about the Linux linked list implementation. In
>comparison to Linux, Event wastes an unnecessary pointer on every link.
>I'd better fix this! :-)
In case it is relevant - back in days of 64K memory we had a real-time OS
that kep
On Wed, Aug 30, 2000 at 03:03:44PM -0400, [EMAIL PROTECTED] wrote:
> do you mean insque and remque?
No. Event has its own linked-list and so does Linux. See Event.h and
include/linux/list.h.
--
Never ascribe to malice that which can be explained by stupidity.
(via, but
pe_watcher.all, pe_event.peer, pe_event.que, and
JNP> pe_qcallback.ring. However, pe_timeable.ring is stored at lots of
JNP> different offsets. Hm hm. I guess some bytes are wasted but otherwise
JNP> Event will need two different kinds of linked lists...
do you mean insque and r
sted but otherwise
Event will need two different kinds of linked lists...
--
May the best description of competition prevail.
(via, but not speaking for Deutsche Bank)
Wow! I am reading about the Linux linked list implementation. In
comparison to Linux, Event wastes an unnecessary pointer on every link.
I'd better fix this! :-)
--
May the best description of competition prevail.
(via, but not speaking for Deutsche Bank)
