BIND 10 #2057: ZoneFinder::Context::getWildcardProof
BIND 10 Development
do-not-reply at isc.org
Sat Oct 6 05:50:03 UTC 2012
#2057: ZoneFinder::Context::getWildcardProof
-------------------------------------------+----------------------------
Reporter: jinmei | Owner:
Type: task | Status: new
Priority: medium | Milestone:
Component: data source | Resolution:
Keywords: | Sensitive: 0
Defect Severity: N/A | Sub-Project: DNS
Feature Depending on Ticket: | Estimated Difficulty: 4
Add Hours to Ticket: 0 | Total Hours: 0
Internal?: 0 |
-------------------------------------------+----------------------------
Description changed by jinmei:
Old description:
> See #2056 for background. This is another one of such things,
> referring to trac1607exp branch:
>
> {{{#!cpp
> // Called for SUCCESS/CNAME cases when it's wildcard substitution
> // and return NSEC/NSEC3 RRset that proves the original qname doesn't
> // exist in the zone.
> // - With NSEC
> // Default version: calls find() for the qname again, with the
> // NO_WILDCARD option and add the returned NSEC.
> // Optimized in-memory version: same for the NSEC + NXRRSET case
> above.
> // - With NSEC3
> // Default version: call findNSEC3() in the recursive mode and
> returns
> // the NSEC3 covering the next closer name.
> // Optimized in-memory version: Like the NSEC case it should know
> the
> // closest encloser in the original search and easily construct
> the
> // next closer name from it. Then calculate hash for it and
> search
> // for the covering NSEC3.
> }}}
>
> And in this ticket we'll only need to do the "default version". It
> should be essentially straightforward refactoring.
New description:
See #2056 for background. This is another one of such things,
referring to trac1607exp branch:
{{{#!cpp
// Called for SUCCESS/CNAME cases when it's wildcard substitution
// and return NSEC/NSEC3 RRset that proves the original qname doesn't
// exist in the zone.
// - With NSEC
// Default version: calls find() for the qname again, with the
// NO_WILDCARD option and add the returned NSEC.
// Optimized in-memory version: same for the NSEC + NXRRSET case
above.
// - With NSEC3
// Default version: call findNSEC3() in the recursive mode and
returns
// the NSEC3 covering the next closer name.
// Optimized in-memory version: Like the NSEC case it should know
the
// closest encloser in the original search and easily construct
the
// next closer name from it. Then calculate hash for it and
search
// for the covering NSEC3.
}}}
And in this ticket we'll only need to do the "default version". It
should be essentially straightforward refactoring.
When done, also update `auth::Query` so it uses this implementation.
It's better to do it before trying to implement the in-memory
optimization in case we miss something in the interface.
--
--
Ticket URL: <http://bind10.isc.org/ticket/2057#comment:2>
BIND 10 Development <http://bind10.isc.org>
BIND 10 Development
More information about the bind10-tickets
mailing list