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:
ftp://ftp.ecs.soton.ac.uk/pub/elks/elks-0.0.83/
and the source is now stored under CVS at sourceforge:
http://sourceforge.net/project/?group_id=3232
Let me know if you have a username on sourceforge, and I will add you to the
project.
>
> No. Something much simpler. The idea being to get into a state where there
> is nothing on the kernel stack needed when a task is not in RUN state.. ie
> replacing the wait queue/select stuff with a V7 like setup.
Is this in some way related to your idea of moving the structure required from
the kernel stack to the task structure?
>
> User space Im very tempted to rebuild the system with the stack at the base
> of the data segment, although that would prevent chmem working without
> relocation maps on load. It trades it for the ability to truely grow process
> space once you have swap
>
I was working along these lines when I got distracted by other things and
stopped working on Linux-8086. I had implemented reading in the larger
header version of the minix format executable, and using one of the
fields in the extended header as the size of the stack below the datasegment.
I think this code had been developed to point where it worked, but
building binaries that it would load required extra compiler flags, and
hacking the header with a binary editor.
Al
