lkml.org 
[lkml]   [2002]   [May]   [26]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: patent on O_ATOMICLOOKUP [Re: [PATCH] loopable tmpfs (2.4.17)]
On Sun, May 26, 2002 at 10:33:14PM +0100, Alan Cox wrote:
> On Sun, 2002-05-26 at 20:06, Larry McVoy wrote:
> > > 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?
>
> I was very careful to say "pure mathematics". With perfect optimisation
> all implementations of the same algorithm should produce the same parse
> tree.

And I was very careful to ask for a specific counter example. In theory,
I'm sure you may be right, but theory doesn't count. We were discussing
how to show that the code was the same, in other words, we're in the
context of practice, you said it wouldn't work, and I said show me an
example. You don't get to fall back on theory, I specifically asked for
a real world example.

> The same exercise on library implementations of qsort, strcmp and so
> forth are probably also going to show that.

Right. I already agreed that the trivial cases would do it. What about
stdio? That's pretty simple set of interfaces, and I doubt that even
the gnu one and the v7 one compile to the same expression tree.

Let's put it this way: do you know of any expression tree, compiled
from two from scratch different implementations of the same thing,
with more than 5000 nodes, which results in the same thing? Not only
do you not, I'd go so far as to predict you'll never find one no matter
how long you look. Sure, you limit the solution space down to something
like strcmp, the set of possible expression trees is probably in single
digits or so. That doesn't prove anything other than you're looking at
a simplistic case.
--
---
Larry McVoy lm at bitmover.com http://www.bitmover.com/lm
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
\
 
 \ /
  Last update: 2005-03-22 13:26    [from the cache]
©2003-2011 Jasper Spaans