On Mon, Jun 19, 2000 at 12:02:41AM +0100, Alan Cox wrote:
: I think I've figured how to
: sort some of the stack handling stuff out and get some of our data space
: back.
You're not thinking of backtracing stack addresses, are you?
The last release can be found here:
and the source is now stored under CVS at sourceforge:
http://sourceforge.net/project/?group_id=3232
I'll grab the sourceforget copy and probably send you diffs. (I dont have
the local bandwidth to fight cvs)
Is this in some way related to your idea of moving the structure required from
the
We have far too much ifdef crap. We appear to have more build options than
users. I've stripped out some of them in my tree (NOFS, SUID, CORE DUMP)
and I'll clean up more as I go so we actually have one OS not one OS each.
I've rewritten the wait queue code. We now do it sort of V7 style. You
I've gotten pretty familiar with the linker, let me know if you
need a hack. Otherwise, my memory says that we've got enough
info in the current header to put the stack below the data, providing
the linker will change the beginning data offset to the max stack size.
We can already build
[The full patch is 80K - who wants to check it in ?]
--- elks/CHANGELOG Fri Mar 3 11:42:19 2000
+++ elks-ac/CHANGELOG Mon Jun 19 23:52:08 2000
@@ -6,6 +6,31 @@
Al
--
+Mon Jun 19 29:39 GMT 2000 Alan Cox
Could anyone explain me what is a V7 like wakeup mechanism?
Jesus Miguel Diaz Hdez
Grupo de Redes
Facultad de Matematica Cibernetica
Universidad de la Habana,Cuba
e-mail:
[EMAIL PROTECTED]
Could anyone explain me what is a V7 like wakeup mechanism?
Old old unix systems took the address of the thing they wanted to wait on
and placed it in the task structure. Since the number of processes is pretty
low its easy for the CPU to walk the process table on a wakeup checking
if the
