Home
last modified time | relevance | path

Searched refs:val_new_entry (Results 1 – 4 of 4) sorted by relevance

/dports/dns/knot-resolver/knot-resolver-5.4.3/lib/cache/
H A Dentry_list.c215 knot_db_val_t *val_new_entry, uint8_t rank, in entry_h_splice() argument
221 if (kr_fails_assert(val_new_entry && val_new_entry->len > 0)) in entry_h_splice()
275 return cache_write_or_clear(cache, &key, val_new_entry, qry); in entry_h_splice()
285 .len = val_new_entry->len, in entry_h_splice()
297 val_new_entry->data = (uint8_t *)val.data in entry_h_splice()
H A Dentry_pkt.c111 knot_db_val_t val_new_entry = { in stash_pkt() local
117 ret = entry_h_splice(&val_new_entry, rank, key, k->type, pkt_type, in stash_pkt()
119 if (ret || kr_fails_assert(val_new_entry.data)) return; /* some aren't really errors */ in stash_pkt()
120 struct entry_h *eh = val_new_entry.data; in stash_pkt()
136 type_str, owner_str, (int)val_new_entry.len); in stash_pkt()
H A Dapi.c582 knot_db_val_t val_new_entry = { in stash_rrset() local
589 ret = entry_h_splice(&val_new_entry, rank, key, k->type, rr->type, in stash_rrset()
592 if (kr_fails_assert(val_new_entry.data)) in stash_rrset()
599 struct entry_h *eh = val_new_entry.data; in stash_rrset()
606 if (kr_fails_assert(entry_h_consistent_E(val_new_entry, rr->type))) in stash_rrset()
630 (int)val_new_entry.len, (rr_sigs ? rr_sigs->rrs.count : 0) in stash_rrset()
634 return (ssize_t) val_new_entry.len; in stash_rrset()
H A Dimpl.h233 knot_db_val_t *val_new_entry, uint8_t rank,