Re: A question
On Tue, 20 Jun 2000, Alan Cox wrote: hybrid crossing between the V7 and the linux method. Like allocating a relatively small struct, but then make it an option to grow the struct by making a linked list of these structs. Given the low computative power of The struct size is fixed - I dont follow you From what I understand, using the task struct to keep track of sleeping processes, limits the number of processes the kernel can handle. If you allow a situation where the list of sleeping processes is stored in the task struct, but can also contain a pointer to another list of sleeping processes, you can increase functionality. If the number of sleeping processes is more then a certain number, you can activate the pointer and the kernel can follow the pointer like in a linked list. So you don't really use a linked list like linux does, but you use an array and when it's full, you can point to another array. I usually only do a bit of kernel module programming and I'm following the ELKS mailing in hope of learning a bit more about things like scheduling, so forgive me if what I say sound a bit stupid *grin*. Groeten, Dries
Re: Common letters in the Alphabet.
Simon Wood wrote: For ELKSibo I have had to include a font bit map (as I have to draw each character to the LCD), this only has a few of the 255 ASCII codes and is the form: ASCII Value, data, data, data, etc, The renderer compares the first byte with it's desired character and moves to the next character should they not match. I would like to sequence the data so that the most common characters are near the start of the list and therefore speed up the display driver (believe me every little bit helps). Does anyone have letter probability table I could use??? (or any idea how to generate one) Letter probability is closely related to the letter typed earlier. Maybe it's an idea to enlarge the size of you fint bit map struct and store after each character a pointer to the character most likely to follow it. The probability table could be easily found by simply downloading a few books in the language of your choice and have a script count letters and correlations between letters. Furthermore I don't quite understand why you choose to step through the font bit map structure. If you have stored it as an array, isn't it simpler to simply use the ascii code as a memory index. This would only require you to place the array at a smart location (for instance at the beginning of some segment or an integer number of pages from it) so that you can avoid having to do multiplications when calculating the memory adress. If you fix it in such a way that each entry in the array is some power of 2 bytes long, you can calcuted the memory adress from the index by doing a shift and an add. Correct me if this is a stupid idea, I'm ne wat this. Simon Wood Dries
ramdisk/shell problem?
I'm using 0.0.81 elks and I'm trying to make a ramdisk with the ramdisk utils. When I enter ramdisk, it says something like usage blablabla, but when I give options such as suggested by that, it says ramdisk:no such file or directory. Now I thought this might be a shell problem, so let me add that I use sash, but ash also gives the problem. What to do? Groeten, Dries p.s. Apart from trying to read the source codes, what can one do to understand ELKS. I would like to play around with it, since it is less complicated then the full linux kernel. My background is in mild linux kernel module programming.
