{"id":115831,"date":"2024-05-16T14:59:20","date_gmt":"2024-05-16T12:59:20","guid":{"rendered":"https:\/\/prohoster.info\/blog\/novosti-interneta\/dlya-yadra-linux-predlozhen-drajver-ext2-napisannyj-na-yazyke-rust"},"modified":"2024-05-16T14:59:20","modified_gmt":"2024-05-16T12:59:20","slug":"dlya-yadra-linux-predlozhen-drajver-ext2-napisannyj-na-yazyke-rust","status":"publish","type":"post","link":"https:\/\/prohoster.info\/en\/blog\/news\/dlya-yadra-linux-predlozhen-drajver-ext2-napisannyj-na-yazyke-rust","title":{"rendered":"An EXT2 driver written in Rust has been proposed for the Linux kernel","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"
Wedson Almeida Filho from Microsoft has proposed for discussion in the Linux kernel developers mailing list a second version of patches with a set of bindings over the VFS subsystem, aimed at developing read-only file systems in the Rust programming language. Along with the bindings, two drivers based on them have been published, implementing ext2 and tarfs file systems in read-only mode. Unlike the previously available Rust implementation of the ext2 file system \u2014 ext2-rs, the new variant operates at the kernel level (module rust_ext2) rather than in user space. The rust_ext2 driver contains about 700 lines of Rust code and can be used as a starting point for developing more complex FS implementations, such as ext4. <\/p>\n
The tarfs file system allows mounting archives in Tar format as a file system. The driver uses an index attached to the tar files for navigating files within the archive without having to scan the entire contents. <\/p>\n
Another file system in Rust, utilizing the proposed abstraction layer, is being developed separately \u2014 PuzzleFS. PuzzleFS is designed for hosting isolated containers and offers features such as efficient storage of duplicate data, the ability to directly mount file systems, repeatable image builds, very fast image building and mounting, the option to use an optional intermediate stage for image transformation (canonicalization), and the non-requirement for full tree traversals when using a layered structure with change overlays in a casync style. \n Source: opennet.ru<\/a> <\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"