>It's a LOT easier (and much more efficient) to just implement an
>allocation map.
But not at all needed if you use a flat, contiguous file system.
And remember, the question was asking for the simplest file
system... and a block/sector/whatever allocation map and the
associated code to handle it is not as simple as one can get.
Not to mention the fact that you need tables of pointers to the
blocks so that a file can be reassembled, or read in order... and
the risks to the whole file if the pointers are lost...
I can't tell you how many RT disks I've been able to recover
from truly bad blocks in the directory by virtue of the fact
that the RT directory structure is so simple...
Megan Gentry
Former RT-11 Developer
+--------------------------------+-------------------------------------+
| Megan Gentry, EMT/B, PP-ASEL | email: mbg at world.std.com |
| Member of Technical Staff | megan at savaje.com |
| SavaJe Technologies, Inc. | (s/ at /_at_/) |
| 100 Apollo Drive | URL:
http://world.std.com/~mbg/ |
| Chelmsford, MA 01824 | "pdp-11 programmer - some assembler |
| (978) 256 6521 (DEC '77-'98) | required." - mbg KB1FCA |
+--------------------------------+-------------------------------------+
Received on Mon Jul 28 2003 - 00:25:01 BST