Searched refs:rrs (Results 1 - 14 of 14) sorted by relevance

/freebsd-11-stable/contrib/ldns/
H A Ddnssec_zone.c21 ldns_dnssec_rrs_free_internal(ldns_dnssec_rrs *rrs, int deep) argument
24 while (rrs) {
25 next = rrs->next;
27 ldns_rr_free(rrs->rr);
29 LDNS_FREE(rrs);
30 rrs = next;
35 ldns_dnssec_rrs_free(ldns_dnssec_rrs *rrs) argument
37 ldns_dnssec_rrs_free_internal(rrs, 0);
41 ldns_dnssec_rrs_deep_free(ldns_dnssec_rrs *rrs) argument
43 ldns_dnssec_rrs_free_internal(rrs,
47 ldns_dnssec_rrs_add_rr(ldns_dnssec_rrs *rrs, ldns_rr *rr) argument
80 ldns_dnssec_rrs_print_fmt(FILE *out, const ldns_output_format *fmt, ldns_dnssec_rrs *rrs) argument
97 ldns_dnssec_rrs_print(FILE *out, ldns_dnssec_rrs *rrs) argument
[all...]
H A Dpacket.c257 ldns_rr_list *rrs; local
265 rrs = ldns_pkt_get_section_clone(packet, sec);
268 for(i = 0; i < ldns_rr_list_rr_count(rrs); i++) {
270 ldns_rr_list_rr(rrs, i)),
276 ldns_rr_list_push_rr(ret, ldns_rr_list_rr(rrs, i));
288 ldns_rr_list *rrs; local
296 rrs = ldns_pkt_get_section_clone(packet, sec);
299 for(i = 0; i < ldns_rr_list_rr_count(rrs); i++) {
300 if (type == ldns_rr_get_type(ldns_rr_list_rr(rrs, i))) {
304 ldns_rr_list_rr(rrs,
325 ldns_rr_list *rrs; local
[all...]
H A Ddnssec.c31 const ldns_rr_list *rrs)
36 if (!name || !rrs) {
40 for (i = 0; i < ldns_rr_list_rr_count(rrs); i++) {
41 candidate = ldns_rr_list_rr(rrs, i);
58 const ldns_rr_list *rrs)
63 if (!rrsig || !rrs) {
67 for (i = 0; i < ldns_rr_list_rr_count(rrs); i++) {
68 candidate = ldns_rr_list_rr(rrs, i);
94 /*return the owner name of the closest encloser for name from the list of rrs */
924 ldns_create_nsec(ldns_rdf *cur_owner, ldns_rdf *next_owner, ldns_rr_list *rrs) argument
29 ldns_dnssec_get_rrsig_for_name_and_type(const ldns_rdf *name, const ldns_rr_type type, const ldns_rr_list *rrs) argument
57 ldns_dnssec_get_dnskey_for_rrsig(const ldns_rr *rrsig, const ldns_rr_list *rrs) argument
1144 ldns_create_nsec3(ldns_rdf *cur_owner, ldns_rdf *cur_zone, ldns_rr_list *rrs, uint8_t algorithm, uint8_t flags, uint16_t iterations, uint8_t salt_length, uint8_t *salt, bool emptynonterminal) argument
[all...]
H A Ddnssec_sign.c532 * Pushes all rrs from the rrsets of type A and AAAA on gluelist.
543 for (cur_rrs = cur_rrset->rrs;
575 * \param[in] glue_list the list to which to push the glue rrs
710 /* the TTL of NSEC rrs should be set to the minimum TTL of
718 if (soa && soa->rrs && soa->rrs->rr
719 && (ldns_rr_rdf(soa->rrs->rr, 6) != NULL)) {
720 nsec_ttl = ldns_rdf2native_int32(ldns_rr_rdf(soa->rrs->rr, 6));
804 /* the TTL of NSEC rrs should be set to the minimum TTL of
812 if (soa && soa->rrs
[all...]
H A Drr.c1106 ldns_rr **rrs; local
1111 rrs = LDNS_XREALLOC(rr_list->_rrs, ldns_rr *, cap);
1112 if (!rrs) {
1115 rr_list->_rrs = rrs;
1577 rrs with different lengths might be sorted erroneously */
/freebsd-11-stable/sys/dev/random/
H A Drandomdev.c321 struct random_sources *rrs; local
325 rrs = malloc(sizeof(*rrs), M_ENTROPY, M_WAITOK);
326 rrs->rrs_source = rsource;
329 LIST_INSERT_HEAD(&source_list, rrs, rrs_entries);
335 struct random_sources *rrs = NULL; local
338 LIST_FOREACH(rrs, &source_list, rrs_entries)
339 if (rrs->rrs_source == rsource) {
340 LIST_REMOVE(rrs, rrs_entries);
343 if (rrs !
350 struct random_sources *rrs; local
[all...]
H A Drandom_harvestq.c203 struct random_sources *rrs; local
220 LIST_FOREACH(rrs, &source_list, rrs_entries) {
222 n = rrs->rrs_source->rs_read(entropy, sizeof(entropy));
230 printf("%s: rs_read for hardware device '%s' returned no entropy.\n", __func__, rrs->rrs_source->rs_ident);
233 random_harvest_direct(entropy, n, (n*8)/2, rrs->rrs_source->rs_source);
/freebsd-11-stable/contrib/ldns/ldns/
H A Ddnssec_zone.h19 * Singly linked list of rrs
34 ldns_dnssec_rrs *rrs; member in struct:ldns_struct_dnssec_rrsets
107 * Creates a new entry for 1 pointer to an rr and 1 pointer to the next rrs
113 * Frees the list of rrs, but *not* the individual ldns_rr records
116 * \param[in] rrs the data structure to free
118 void ldns_dnssec_rrs_free(ldns_dnssec_rrs *rrs);
121 * Frees the list of rrs, and the individual ldns_rr records
124 * \param[in] rrs the data structure to free
126 void ldns_dnssec_rrs_deep_free(ldns_dnssec_rrs *rrs);
132 * \param[in] rrs th
[all...]
H A Ddnssec.h58 * \param[in] rrs List of rrs to search in
64 const ldns_rr_list *rrs);
71 * \param[in] rrs The rr list to find the key in
75 ldns_rr *ldns_dnssec_get_dnskey_for_rrsig(const ldns_rr *rrsig, const ldns_rr_list *rrs);
250 * \param[in] rrs all rrs from the zone, to find all RR types of cur_owner in
253 ldns_rr * ldns_create_nsec(ldns_rdf *cur_owner, ldns_rdf *next_owner, ldns_rr_list *rrs);
288 ldns_rr_list *rrs,
/freebsd-11-stable/contrib/bmake/mk/
H A Ddoc.mk43 rm -f paper.* [eE]rrs mklog ${CLEANFILES}
H A Djava.mk91 rm -f [Ee]rrs mklog core *.core ${PROG} ${CLEANFILES}
H A Dprog.mk144 rm -f a.out [Ee]rrs mklog core *.core \
H A Dlib.mk477 rm -f a.out [Ee]rrs mklog core *.core ${CLEANFILES}
/freebsd-11-stable/contrib/unbound/validator/
H A Dval_sigcrypt.c81 /** return number of rrs in an rrset */
677 /* loop while there are rdata bytes available for both rrs,
894 * @param rrs: rr storage.
898 rbtree_type* sortree, struct canon_rr* rrs)
903 rrs[i].node.key = &rrs[i];
904 rrs[i].rrset = rrset;
905 rrs[i].rr_idx = i;
906 if(!rbtree_insert(sortree, &rrs[i].node)) {
1142 struct canon_rr* rrs; local
897 canonical_sort(struct ub_packed_rrset_key* rrset, struct packed_rrset_data* d, rbtree_type* sortree, struct canon_rr* rrs) argument
[all...]

Completed in 110 milliseconds