Linus Torvalds:
> On Thu, May 30, 2013 at 5:45 PM, Miklos Szeredi wrote:
> >
> > The third name is because of the replace-empty-directory wart in the
> > rename(2) definition. With overlay/union that can become
> >
> > 1) check if destination directory is empty: upper directory contains a
> >
On Thu, May 30, 2013 at 11:11 AM, Linus Torvalds
wrote:
> On Thu, May 30, 2013 at 5:45 PM, Miklos Szeredi wrote:
>> 1) check if destination directory is empty: upper directory contains a
>> whiteout for each lower directory entry and nothing else
>> 2) if empty then remove whiteouts in destin
On Thu, May 30, 2013 at 5:45 PM, Miklos Szeredi wrote:
>
> The third name is because of the replace-empty-directory wart in the
> rename(2) definition. With overlay/union that can become
>
> 1) check if destination directory is empty: upper directory contains a
> whiteout for each lower directo
> >> +static void sort_parents3(struct dentry **p)
> >> +void sort_parents(struct dentry **p, unsigned *nump)
> >
> > Yikes, that's a bunch of fiddly code. Is it *really* worth all that to
> > avoid calling the generic sort helpers?
>
> AFAICS, I cannot make the compare function transitive, e.g.:
On Tue, May 28, 2013 at 7:36 PM, Zach Brown wrote:
> Some quick thoughts:
>
>> Permute the location of files. E.g. 'permute(A, B, C)' is equivalent to
>> A->B,
>> B->C and C->A. This is essentially a series of renames done as a single
>> atomic
>> operation.
>
> Hmm. Can we choose a more spe
Some quick thoughts:
> Permute the location of files. E.g. 'permute(A, B, C)' is equivalent to
> A->B,
> B->C and C->A. This is essentially a series of renames done as a single
> atomic
> operation.
Hmm. Can we choose a more specific name than 'permute'? To me,
->permute() tells me just as
6 matches
Mail list logo
