[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index][Old Index]
Re: 16 year old bug
On Mon, Aug 23, 2010 at 11:21:37PM -0400, Thor Lancelot Simon wrote:
> That's silly. A bitmask is a bitmask, and there's nothing magical or
> difficult about masked compare. Even the bug OpenBSD just fixed -- now
> that it basically doesn't matter any more -- is hardly complex nor is
> the fix so.
The issue with non-cont netmask is that it dramatically complicates the
lookup code. I'd say that at least 1/3 of the radix tree implementation
is just related to this "feature".
Main Index |
Thread Index |