HN user

xtdx

69 karma
Posts1
Comments38
View on HN

"Each kernel release is a different work; the chances that any given piece of code has been modified in a new release are pretty high. One could argue that each kernel release comes with its own license; the termination of one does not necessarily affect rights to other releases."

That is the argument I am making.

You could also align the pointer over the button, shine a laser pointer on your mouse button, and have your cat click it for you. Since you didn't click the button, you didn't accept the license. Arguably.

Term 5? All that says is if you don't accept the terms, you don't get to use the software. There's no irrevocable termination of rights.

At worst, all they have to do is download a new copy of mount and presto, they have a new license.

[err, that's for gpl2. gpl3 has a more complicated termination procedure.]

ok, so in light of gpl3, they just need to go back and get a gpl2 copy of mount. It's not like mount has changed all that much, I'm sure the 2007 version will suffice. Or they could just write their own. How many lines of code are we talking about here?

One of the causes of the Revolution was lack of representation and a means to change the law. Now that we have a representative government as a result of that war, one might hope we would use it.

Indeed, I may have read the code wrong. But look at line 188.

    m_prevLink->m_nextNode = m_nextNode;
I don't see where m_prevLink is changed. If the previous link has gone away, and you call RemoveFromList on this node a second time, it's going to chase that pointer.

One thing about intrusive lists, you have to know and specify every list the item may be on. Maybe you like that, maybe you don't.

Also, it doesn't appear the provided code gracefully handles removing an item from a list twice.

All a color table is is a series of integers. Any random byte, or two, or four, is a valid integer.