Re: patent on O_ATOMICLOOKUP [Re: [PATCH] loopable tmpfs (2.4.17)]

Larry McVoy
2002-05-26T19:06:31Z

On Sun, May 26, 2002 at 08:40:44PM +0100, Alan Cox wrote:
> On Sun, 2002-05-26 at 05:03, Larry McVoy wrote:
> > Me too. I've been here before, I was one of about 8 people who actually
> > knew that AT&T should have won the BSD lawsuit because I diffed the code.
> > And you can't diff it with a perl script, that simply doesn't work. The
>
> And then went on to cite bmap which is clearly different. Yes Larry, now
> would you mind returning to the ward like a good patient 8)

Sniffle, whimper. It is clearly different in that it calls out to the
BSD allocation policy, which is completely different.

However, if you diff the code, there is more than enough which is the same
that there is now way you can call that a rewrite of bmap(). I was wrong in
saying it was bit for bit identical, but other than showing me to be a clutz,
it doesn't detrack from the point.

But I'm headed for he ward. Sniff.

> > only real ways that I know of are
> > a) have a human do it, function by function
> > b) compile the code to an expression tree and then diff the expression
> > trees.
>
> b) doesn't work because copyright does not apply to the fundamental
> algorithms. If you want to look at it at that level you need to remember
> there are many different implementations which are very different but
> which in pure mathematics are strictly identical.

Is this theory or practice, Alan? We're not talking about pure copyright,
we're also discussing derived works. And anyway, I'd like you to cite a
case where two independently developed substantial chunks of code compile
to the same expression tree. I'm sure you can find strcmp() implementations
which do, but I'd be surprised if you could find a stdio implementation that
was, and you sure as hell won't find two file system implementations that do.
Righ? Or do you have a counter example?
--
---
Larry McVoy lm at bitmover.com http://www.bitmover.com/lm