Re: Importing chewiefs

2011-11-24 Thread Tamas Toth
On Wed, 23 Nov 2011 19:24:43 +0100, Adam Hoka wrote: On 11/23/2011 6:03 PM, Christos Zoulas wrote: In article <46DA345771B043F283B5E67C674DAA76@desktop>, Adam Hoka wrote: Hi! If no one argues otherwise, I would like to import chewiefs to the NetBSD tree. The import would have minimal im

Re: ChewieFS

2011-11-11 Thread Tamas Toth
On Thu, 10 Nov 2011 17:54:57 +0100, Greg Troxel wrote: What are your plans for moving it into the main tree? We don't have exact plans just hope that it will be part of the kernel soon. Can you explain at greater length what works and what doesn't work, and the degree to which it is usef

Re: ChewieFS

2011-11-11 Thread Tamas Toth
On Fri, 11 Nov 2011 05:06:13 +0100, Toru Nishimura wrote: There are increasing number of NAND only (NOR less) embeded devices on market. How difficult to have chewieFS LIBSA support to allow kernel image loading from the filesys on NAND? Toru Nishimura / ALKYL Technology I don't know a

Re: ChewieFS

2011-11-11 Thread Tamas Toth
ll be working on it, but if you truncate it longer before remounting, the file will be filled by the original data instead of zeros. I didn't find how i can drop the "dirty" page_cache if the FS doesn't need it anymore. But, how Adam said, the ChewieFS isn't designed for SSD. Tamas Toth

ChewieFS

2011-11-10 Thread Tamas Toth
re welcome. Tamas Toth Software Engineering Department University of Szeged

Re: rb_tree_find_node_leq

2011-03-28 Thread Tamas Toth
Ahoka helped me. The manpage wasn't updated. On 03/28/2011 02:47 PM, Tamas Toth wrote: Hi, I'm using rb_tree_find_node_leq, but I think it doesn't work as the manual says. The manual entry (RBTREE(3)) contains: "rb_tree_find_node_leq(rbt, key) Search the tree rbt for

rb_tree_find_node_leq

2011-03-28 Thread Tamas Toth
Hi, I'm using rb_tree_find_node_leq, but I think it doesn't work as the manual says. The manual entry (RBTREE(3)) contains: "rb_tree_find_node_leq(rbt, key) Search the tree rbt for a node that exactly matches key and return it. If no such node is present, return the first node preceding key o