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
> "JNP" == Joshua N Pritikin <[EMAIL PROTECTED]> writes:
JNP> False alarm? Linux is able to make the assumption that the next & prev
JNP> pointers are always the same offset from the top of the structure. This
JNP> assumption is true for pe_watcher.all, pe_event.peer, pe_event.que, an
On Wed, Aug 30, 2000 at 02:50:20PM -0400, Joshua N Pritikin wrote:
> 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! :-)
False alarm? Linux is able to make the assumption that th
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)
