l4-hackers

l4-hackers@os.inf.tu-dresden.de

2827 discussions

GNURL on top of L4
by Frédéric BOYER 25 Sep '01

25 Sep '01

Hello .. I'd like to find people here who can help me to build GNURL on top of L4 (GNAT Run time lib). I'd like to use L4 to develop an RT unix like O.S., but I'd like to implement it in Ada. Any people interested ? Is there people who know Ada here ? bye bye Frederic BOYER. ___________________________________________________________ Do You Yahoo!? -- Un e-mail gratuit @yahoo.fr ! Yahoo! Courrier : http://fr.mail.yahoo.com

2 1

Re: GNURL on top of L4
by Michael Hohmuth 25 Sep '01

25 Sep '01

Frédéric BOYER <askliepios(a)yahoo.com> writes: > I'd like to find people here who can help me to build > GNURL on top of L4 (GNAT Run time lib). I'd like to > use L4 to develop an RT unix like O.S., but I'd like > to implement it in Ada. > > Any people interested ? Is there people who know Ada > here ? This sounds like a cool project. Do you envision a particular application, or are you interested in it just for hack value? Our group in Dresden currently has no ADA expertise or experience. However, depending on your project's focus, we might be willing to help out by directing students to your project and allowing them to earn credits this way. Michael -- hohmuth(a)innocent.com, hohmuth(a)inf.tu-dresden.de http://home.pages.de/~hohmuth/

1 0

Re: Recursive mapping trees?
by Jean Wolter 10 Sep '01

10 Sep '01

Martin Young <my(a)siroyan.com> writes: > Thinking it through however it's obvious that a task A can map a page P > to task B which can then map it back to task A at a different virtual > address. Is this allowed in L4? (I assume it is) Is it useful? Could > I get away with not allowing it? I ask because my initial > implementation includes a quick index from a taskid to a node in the > mapping tree (to avoid recursion rather than for speed) but this > requires that each task has only a single entry. L4Linux would not work on your L4 implementation, since we need more then one mapping for a page in the same address space to be able to implement vmalloc() and friends. To do this we currently map one page to a special helper task which immidiatly grants it back those creating a new mapping for the same page in the address space of L4Linux (we do this since for some reasons Jochen's L4 version didn't support intra task mappings, but I forgot the reasoning behind this design decision). Jean -- I get up each morning, gather my wits. Pick up the paper, read the obits. if I'm not there I know I'm not dead. So I eat a good breakfast and go back to bed. Peete Seeger

2 1

Recursive mapping trees?
by Martin Young 07 Sep '01

07 Sep '01

Hi, I've been adding mapping trees to my implementation of L4 and I have a question... The L4 reference manual states that address spaces are constructed recursively. Up 'till now I'd assumed that this was merely notional and that in real systems address spaces would be strictly n-ary trees, not graphs with cycles. Thinking it through however it's obvious that a task A can map a page P to task B which can then map it back to task A at a different virtual address. Is this allowed in L4? (I assume it is) Is it useful? Could I get away with not allowing it? I ask because my initial implementation includes a quick index from a taskid to a node in the mapping tree (to avoid recursion rather than for speed) but this requires that each task has only a single entry. Additionally, what effect should an unmap have: if task A unmaped P from task B, would the second mapping in task A disappear? I'd imagine that it would indeed remove the second mapping. I've had a look at the Fiasco souce and it wasn't clear to me where these situations are handled. Thanks. -- Martin Young, working for: | Phone: +44(0) 1454 615151 Siroyan Limited, Bristol Design Centre, | Mobile: +44(0) 7855 758771 West Point Court, Great Park Road, | web: www.siroyan.com Bradley Stoke, Bristol BS32 4QG. UK | email: my(a)siroyan.com ********************************************************************** This email and any files transmitted with it are confidential and intended solely for the use of the individual or entity to whom they are addressed. If you have received this email in error please notify the system manager. This footnote also confirms that this email message has been swept by MIMEsweeper for the presence of computer viruses. www.mimesweeper.com **********************************************************************

2 1

Race conditions
by Walt 07 Sep '01

07 Sep '01

Are there any papers that discuss the merits of microkernel and monolithic kernels in terms of race conditions? Regards Edsel __________________________________________________ Do You Yahoo!? Get email alerts & NEW webcam video instant messaging with Yahoo! Messenger http://im.yahoo.com

1 0

compilation errors
by rhim＠ufl.edu 05 Sep '01

05 Sep '01

Hi, while trying to compile the L4 system binaries and support servers, I ran into errors. Following is the snapshot of my system screen. --- make[2]: Entering directory `/root/Fiasco/l4/oskit/libc' gcc -c -MD -DHAVE_CONFIG_H -I. -I../libc/x86 -I../libc/stdio -I../libc/stdlib -I../libc/string -I../libc/gen -I../libc/malloc -I- -I.. -I.. -I../flux/c -nostdinc -DASSEMBLER -MD ../libc/x86/i16_bcopy.S /tmp/ccZPy7Kx.s: Assembler messages: /tmp/ccZPy7Kx.s:235: Error: `8(%ebp)' is not a valid 16 bit base/index expression /tmp/ccZPy7Kx.s:236: Error: `12(%ebp)' is not a valid 16 bit base/index expression /tmp/ccZPy7Kx.s:238: Error: `16(%ebp)' is not a valid 16 bit base/index expression /tmp/ccZPy7Kx.s:239: Error: `(%esi,%edx)' is not a valid 16 bit base/index expression /tmp/ccZPy7Kx.s:242: Error: `(%edi,%edx)' is not a valid 16 bit base/index expression /tmp/ccZPy7Kx.s:259: Error: `8(%ebp)' is not a valid 16 bit base/index expression /tmp/ccZPy7Kx.s:278: Error: `8(%ebp)' is not a valid 16 bit base/index expression /tmp/ccZPy7Kx.s:291: Error: `8(%ebp)' is not a valid 16 bit base/index expression /tmp/ccZPy7Kx.s:292: Error: `12(%ebp)' is not a valid 16 bit base/index expression ---- I am running Debian Linux 2.2.3 on pentium II on my laptop. Looking forward for help. Reagards, Himanshu

2 1

RE: L$Ka hazelnet kernel pnic
by Volkmar Uhlig 03 Sep '01

03 Sep '01

> When I boot l4ka-i586-dbg-vga (same problem happens with > l4ka-i686-rel-vga) I get a kernel panic. The message is: > startup.c:592: assertion failed (mbi->flags & MULTIBOOT_MODS) > > When I hit "k" to enter the kernel debugger, my machine > simply restarts and POSTs again, followed by my GRUB boot menu. Hi Karl, this sounds like you have problems with your version of GRUB. The error message you get is the resource manager complaining that you did not load any modules. Therefore, "k" reboots (bug/feature in RMGR) because no kernel is started yet. Try to run the ready-to-go grub image from http://i30www.ira.uka.de/~ud3/mkgrubdisk/. Volkmar PS: We try to keep L4Ka related technical problems off of l4-hackers. Please use l4ka(a)ira.uka.de instead.

1 0

L$Ka hazelnet kernel pnic
by karlm＠MIT.EDU 02 Sep '01

02 Sep '01

I downloaded the hazelnut x86 binary suite from l4ka.org I replaced lilo with grub on /dev/hda. Grub currently works fine for booting debian 2.2r3. I don't have a seperate /boot partition. My debian root partition in /dev/hda2. When I boot l4ka-i586-dbg-vga (same problem happens with l4ka-i686-rel-vga) I get a kernel panic. The message is: startup.c:592: assertion failed (mbi->flags & MULTIBOOT_MODS) When I hit "k" to enter the kernel debugger, my machine simply restarts and POSTs again, followed by my GRUB boot menu. Has anyone else experienced this? Any suggestions? I have 288 MB of RAM and a Pentium II 266 MHz CPU on a Dell Dimension XPS motherboard. All of the l4 microkernel stuff is in /boot/l4/. I copied various kernel versions over x86-kernel to see if it was a kernel version problem. rmgrlinux.cfg and glinux are identical to the files in the hazelnut x86 binaries tarball from l4Ka.org. Thanks, Karl P.S. for some reason, my menu options show empty strings in the grub boot menu. Anyone run into this, either? my grub menu.lst file reads as follows: ####### timeout = 10 default = 0 title=debian root = (hd0,1) kernel = /boot/vmlinuz root=/dev/hda2 title=L4Linux root = (hd0,1) kernel = (hd0,1)/boot/l4/rmgr -configfile -sigma0 modaddr = 0x03000000 module = (hd0,1)/boot/l4/x86-kernel module = (hd0,1)/boot/l4/sigma0 module = (hd0,1)/boot/l4/rmgrlinux.cfg module = (hd0,1)/boot/l4/glinux root=/dev/hda2 no-scroll ####### -------- Karl Alexander Magdsick PGP Fingerprint: FD9A 6DEC 0166 5331 619C D7EA 7B0C 2B90 2A83 F1FC www.keyserver.net ---------

1 0

New L4 Developer's bibliography online
by Michael Hohmuth 26 Jul '01

26 Jul '01

L4 Hackers, we have made available a new collection of L4 documentation for developers. Have a look at <URL:http://os.inf.tu-dresden.de/L4/bib.html>. This collection is meant to be platform- and kernel-implementation- agnostic. We have put in all documentation, reports, and papers we could find that could guide a developer's way through the L4 jungle. With this goal in mind, we have even added some documentation for our as-yet unreleased L4 Environment. This documentation contains many useful examples of putting L4 to use. If you have any corrections or additions, please do not hesitate to contact me. Cheers, Michael -- hohmuth(a)innocent.com, hohmuth(a)inf.tu-dresden.de http://home.pages.de/~hohmuth/

1 0

Re: L4-Linux as a real-time OS
by Michael Hohmuth 29 Jun '01

29 Jun '01

"Jun-ichi Odagiri" <jun-ichi.odagiri(a)kek.jp> writes: > [...] The essential point, for my application, is that the both > types of clients must work in a single user address space, i.e. they > must be user-level threads, which are to be created through the > Linux clone() system call. Please note that currently L4Linux puts threads started by clone(...CLONE_VM...) into different L4 tasks. They will have the same memory view, but they use different address spaces as far as L4 is concerned. In other words, the L4Linux page table is shared, but L4's isn't. > In standard Linux, a process does not cause page faults once it has > invoked the mlockall() system call. It does not apply to L4Linux since > you have two different sets of page tables for an L4Linux client. One in > the Linux server, and the other in the L4 kernel. The former is filled once > mlockall() has invoked. However, the latter is left unchanged even after > mlockall() returns. Page faults are still needed just to update the page > tables in the L4 kernel. As you pointed out in the above 1, my real-time > L4Linux client must not do Linux system calls, nor page faults. There is an additional problem. Suppose your program shares pages with another process (e.g., a shared-library text segment) and the L4Linux needs to flush these page mappings for the other process. In that case, L4Linux calls l4_fpage_unmap(fpage, L4_FP_OTHER_SPACES). This call results in the shared page being flushed not only from the other task's address space, but also from your address space. You will have to remap it on page fault. I don't quite remember all cases L4Linux would have to do that, but I seem to remember that it happens when a process is killed: L4Linux needs to flush all mappings a dying task owned. As there is no way for L4Linux to tell if a task had granted away some pages, a simple task deletion is not enough; L4Linux must flush all mappings separately. For this reason (no way to prevent granting), the L4 API currently does not have a primitive for flushing a page only in a specific address space. In consequence, L4Linux needs to flush all client mappings at once. A possible extension of the L4 API would provide these two mechanisms. A possible workaround for you might be to just disable the flushing at task-delete time (Jean or Frank probably could tell you what to change), although, as I said, I don't remember if there are other places that flush mappings. > So, I made a Linux system call that makes the Linux server fill the page > tables of the calling L4Linux client in the L4 kernel. In order to implement > the Linux system call, I had to add an L4 system call, l4_fpage_map(), > which allows an L4 task (the Linux server) to send a flex page to another > L4 task (an L4Linux client) without the recipient's agreement. I believe > you do not like it because it harms the security of the system. But, being > a control system, it's still acceptable by me (may be...). You could do without the L4-kernel modification if your L4Linux system call just toggled a flag that told L4Linux to map the whole address space (l4_fpage(...L4_WHOLE_ADDRESS_SPACE...)) to the current process on page-fault. Subsequently, your client can ``forge'' a page-fault message to the L4Linux server. > >See <URL:http://os.inf.tu-dresden.de/papers_ps/part98.ps> for a > >description of the implementation. > > I failed in openning the .ps file on my system. I'll try it later again. I had no problem in downloading and opening the file, so it probably is a transient problem. Regards, Michael -- hohmuth(a)innocent.com, hohmuth(a)inf.tu-dresden.de http://home.pages.de/~hohmuth/

3 2

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

l4-hackers