course. It's probably slower than arranging the bits on the hard
drive directly, and hand-coding everything in assembly. But there's
always a performance price to pay for maintaining the programmer's
sanity. There's always a price to pay when writing cross-platform
stuff.
--
operating
system, or emulate it using some ugly hack on operating systems that
don't support extended attributes.
Isn't that the whole point of having a VFS?
--
Hubert Chan <[EMAIL PROTECTED]> - http://www.uhoreg.ca/
PGP/GnuPG key: 1024D/124B61FA
Fingerprint: 96C5 012F 5F74 A5F7 1F
AIL PROTECTED]> wrote:
>>> If you're sysadmining a multiuser reiser4 box, and your users are
>>> able to modify the metadata of files they don't own, then you go to
>>> sysadmin purgatory.
Actually, you could use something like unionfs to allow users to keep
On Fri, 01 Jul 2005 03:06:19 -0500, David Masover <[EMAIL PROTECTED]> said:
> Hubert Chan wrote:
>> The main thing blocking file-as-dir is that there are some
>> locking(IIRC?) issues. And, of course, some people wouldn't want it
>> to be merged into the mainline
And a question: is it feasible to store, for each inode, its parent(s),
instead of just the hard link count?
--
Hubert Chan <[EMAIL PROTECTED]> - http://www.uhoreg.ca/
PGP/GnuPG key: 1024D/124B61FA
Fingerprint: 96C5 012F 5F74 A5F7 1FF7 5291 AF29 C719 124B 61FA
Key available at w
On Tue, 05 Jul 2005 22:51:07 -0400, Horst von Brand <[EMAIL PROTECTED]> said:
> Hubert Chan <[EMAIL PROTECTED]> wrote:
>> On Fri, 01 Jul 2005 03:41:00 -0400, Chet Hosey <[EMAIL PROTECTED]>
>> said:
>> > Horst von Brand wrote:
>> >> And who
On Wed, 06 Jul 2005 12:52:23 -0600, Jonathan Briggs <[EMAIL PROTECTED]> said:
> On Tue, 2005-07-05 at 23:44 -0700, Hans Reiser wrote:
>> Hubert Chan wrote:
>>> And a question: is it feasible to store, for each
>>> inode, its parent(s), instead of just the hard li
On Wed, 06 Jul 2005 14:33:18 -0600, Jonathan Briggs <[EMAIL PROTECTED]> said:
> On Wed, 2005-07-06 at 15:51 -0400, Hubert Chan wrote:
>> On Wed, 06 Jul 2005 12:52:23 -0600, Jonathan Briggs
>> <[EMAIL PROTECTED]> said:
> [snip]
>>> It still has the perfo
On Wed, 06 Jul 2005 16:33:23 -0400, Horst von Brand <[EMAIL PROTECTED]> said:
> Hubert Chan <[EMAIL PROTECTED]> wrote:
>> If you can store the parents, then finding cycles (relatively)
>> quickly is pretty easy: before you try to make A the parent of B,
>> wal
at a node
doesn't have "too many" parents, and the filesystem hierarchy is not
"too deep".
[1] BTW, I had also previously looked at online/dynamic algorithms, for
those who are familiar with that area. The best known so far is still
O(n) worst case, but much, much smaller in &q
Did you mean to reply to the list? I'm taking the liberty of sending
my reply to the list.
On 2005-07-06 17:50:07 -0400 Horst von Brand <[EMAIL PROTECTED]>
wrote:
Hubert Chan <[EMAIL PROTECTED]> wrote:
On Wed, 06 Jul 2005 16:33:23 -0400, Horst von Brand
<[EMAIL PROTEC
11 matches
Mail list logo
