stub
struct iter_hints_stub *stub;
stub = (struct iter_hints_stub*)name_tree_find(&hints->tree,
has_dp = stub && stub->dp;
return has_dp?stub->dp:NULL;
struct iter_hints_stub *stub;
stub = hints_lookup_stub(qstate->env->hints, qinf->qname,
if(stub && stub->dp && dp) {
stub->dp->name, stub->dp->namelabs)) {
stub = NULL; /* ignore stub, forward is lower */
if (stub != NULL && stub->dp != NULL) {
int stub_no_cache = stub->dp->no_cache;
dname_str(stub->dp->name, dpname);
if(stub->dp->namelen > dpname_storage_len) {
memmove(dpname_storage, stub->dp->name,
stub->dp->namelen);
*retdpnamelen = stub->dp->namelen;
if(!stub) return 0;
stub_dp = stub->dp;
if(stub->noprime) {
struct iter_hints_stub* stub;
stub = hints_lookup_stub(
if(!stub || !stub->dp->has_parent_side_NS ||
dname_subdomain_c(iq->dp->name, stub->dp->name)) {
if(stub) { lock_rw_unlock(&qstate->env->hints->lock); }
struct iter_hints_stub* stub;
stub = hints_lookup_stub(qstate->env->hints, qname, qclass, iq->dp,
struct dma_fence *fence, *stub;
stub = dma_fence_get_stub();
dma_resv_replace_fences(resv, fence->context, stub,
dma_fence_put(stub);
struct dma_fence *stub = dma_fence_get_stub();
stub, DMA_RESV_USAGE_BOOKKEEP);
dma_fence_put(stub);
extern struct stub entry_points[];
struct stub *ep;
struct stub *ep;
if (area && !area->stub)
if ((opts & OSPF_OPTION_E && iface->area->stub) ||
((opts & OSPF_OPTION_E) == 0 && !iface->area->stub)) {
a->stub = xa->stub;
u_int8_t stub;
if (area->stub)
if (oeconf->redistribute && !area->stub)
if (!area->stub)
if (nbr->area->stub)
if (area && !area->stub)
tx_area.stub = area->stub;
if ((hello.opts & OSPF_OPTION_E && iface->area->stub) ||
((hello.opts & OSPF_OPTION_E) == 0 && !iface->area->stub)) {
if (a->stub != xa->stub && ospfd_process == PROC_OSPF_ENGINE)
if (xa->stub && ospfd_process == PROC_RDE_ENGINE) {
a->stub = xa->stub;
u_int8_t stub;
if (oeconf->redistribute && !area->stub)
if (area->stub)
| STUB { area->stub = 1; }
area->stub = 1;
if (area->stub) {
if (area->stub)
nbr->area->stub) {
if (!area->stub)
if (area->stub)
if (lsa->hdr.type == LSA_TYPE_AS_OPAQ && area->stub)
else if (nbr->area->stub)
if (!area->stub)
stub = hints_lookup_stub(worker->env.hints, nm, qinfo.qclass,
if(stub) {
if(stub->noprime) {
print_dp_main(ssl, stub->dp, NULL);
print_dp_details(ssl, worker, stub->dp);
struct iter_hints_stub* stub;
struct iter_hints_stub *stub;
stub = (struct iter_hints_stub*)name_tree_find(&hints->tree,
has_dp = stub && stub->dp;
return has_dp?stub->dp:NULL;
struct iter_hints_stub *stub;
stub = hints_lookup_stub(qstate->env->hints, qinf->qname,
if(stub && stub->dp && dp) {
stub->dp->name, stub->dp->namelabs)) {
stub = NULL; /* ignore stub, forward is lower */
if (stub != NULL && stub->dp != NULL) {
int stub_no_cache = stub->dp->no_cache;
dname_str(stub->dp->name, dpname);
if(stub->dp->namelen > dpname_storage_len) {
memmove(dpname_storage, stub->dp->name,
stub->dp->namelen);
*retdpnamelen = stub->dp->namelen;
if(!stub) return 0;
stub_dp = stub->dp;
if(stub->noprime) {
struct iter_hints_stub* stub;
stub = hints_lookup_stub(
if(!stub || !stub->dp->has_parent_side_NS ||
dname_subdomain_c(iq->dp->name, stub->dp->name)) {
if(stub) { lock_rw_unlock(&qstate->env->hints->lock); }
struct iter_hints_stub* stub;
stub = hints_lookup_stub(qstate->env->hints, qname, qclass, iq->dp,