ldns(3)

πŸ“¦
version 1.9.2 Β· 2 versions
, in alpine 3.22, alpine 3.23, alpine 3.24, arch rolling, debian trixie, fedora 43, fedora 44, nixos 26.05, nixpkgs unstable, opensuse-leap 16.0, ubuntu questing, ubuntu resolute, ubuntu stonking

πŸ’– ldns(3) β€” the DNSSEC trust tree era πŸ’–

okay bestie, sit down, hydrate, because today we're getting into ldns β€” specifically the ldns_dnssec_trust_tree girlies. this is a Library Functions Manual situation and it's lowkey iconic. we're talking trust trees: building them, freeing them, measuring them, printing them, and vibing with DNSSEC status codes. no cap. πŸŽ€


✨ NAME ✨

ldns_dnssec_trust_tree_new, ldns_dnssec_trust_tree_free, ldns_dnssec_trust_tree_depth, ldns_dnssec_derive_trust_tree, ldns_dnssec_trust_tree_contains_keys, ldns_dnssec_trust_tree_print, ldns_dnssec_trust_tree_print_sm, ldns_dnssec_trust_tree_add_parent, ldns_dnssec_derive_trust_tree_normal_rrset, ldns_dnssec_derive_trust_tree_dnskey_rrset, ldns_dnssec_derive_trust_tree_ds_rrset, ldns_dnssec_derive_trust_tree_no_sig β€” functions for ldns_dnssec_trust_tree

like yes, that's a LOT of names in one title, it's giving main character energy but make it a whole friend group πŸ’…


🌸 SYNOPSIS 🌸

#include <stdint.h>
#include <stdbool.h>

#include <ldns/ldns.h>

ldns_dnssec_trust_tree* ldns_dnssec_trust_tree_new(void);

void ldns_dnssec_trust_tree_free(ldns_dnssec_trust_tree *tree);

size_t ldns_dnssec_trust_tree_depth(ldns_dnssec_trust_tree *tree);

ldns_dnssec_trust_tree* ldns_dnssec_derive_trust_tree(
ldns_dnssec_data_chain *data_chain, ldns_rr *rr);

ldns_status ldns_dnssec_trust_tree_contains_keys( ldns_dnssec_trust_tree
*tree, ldns_rr_list *keys);

void ldns_dnssec_trust_tree_print(FILE *out, ldns_dnssec_trust_tree
*tree, size_t tabs, bool extended);

 ldns_dnssec_trust_tree_print_sm();

ldns_status ldns_dnssec_trust_tree_add_parent(ldns_dnssec_trust_tree
*tree, const ldns_dnssec_trust_tree *parent, const ldns_rr
*parent_signature, const ldns_status parent_status);

void ldns_dnssec_derive_trust_tree_normal_rrset( ldns_dnssec_trust_tree
*new_tree, ldns_dnssec_data_chain *data_chain, ldns_rr *cur_sig_rr);

void ldns_dnssec_derive_trust_tree_dnskey_rrset( ldns_dnssec_trust_tree
*new_tree, ldns_dnssec_data_chain *data_chain, ldns_rr *cur_rr, ldns_rr
*cur_sig_rr);

void ldns_dnssec_derive_trust_tree_ds_rrset( ldns_dnssec_trust_tree
*new_tree, ldns_dnssec_data_chain *data_chain, ldns_rr *cur_rr);

void ldns_dnssec_derive_trust_tree_no_sig( ldns_dnssec_trust_tree
*new_tree, ldns_dnssec_data_chain *data_chain);
ngl, we are not fixing the weird spacing in those declarations. that's the original's vibe and we respect it. 🫢

πŸ¦‹ DESCRIPTION πŸ¦‹

🌟 ldns_dnssec_trust_tree_new()

Creates a new (empty) dnssec_trust_tree structure.

  • Returns ldns_dnssec_trust_tree *

fresh out the box, empty, ready to be filled with trust πŸ’–

🌟 ldns_dnssec_trust_tree_free()

Frees the dnssec_trust_tree recursively.

There is no deep free; all data in the trust tree consists of pointers to a data_chain.

  • tree: The tree to free

so like, it lets go of the tree but it is NOT out here freeing the stuff the tree is pointing at. the data_chain is somebody else's problem, fr fr.

🌟 ldns_dnssec_trust_tree_depth()

returns the depth of the trust tree

  • tree: tree to calculate the depth of
  • Returns: The depth of the tree

how deep does the tree go?? we're measuring. πŸ“

🌟 ldns_dnssec_derive_trust_tree()

Generates a dnssec_trust_tree for the given rr from the given data_chain.

This does not clone the actual data; Don't free the data_chain before you are done with this tree.

  • *data_chain: The chain to derive the trust tree from
  • *rr: The RR this tree will be about
  • Returns ldns_dnssec_trust_tree *
⚠️ bestie, listen: the tree is holding pointers into that data_chain. free the chain early and you've got a dangling situation. do not do that to yourself. πŸ’€

🌟 ldns_dnssec_trust_tree_contains_keys()

Returns OK if there is a trusted path in the tree to one of the DNSKEY or DS RRs in the given list.

\param *tree The trust tree so search \param *keys A ldns_rr_list of DNSKEY and DS rrs to look for

  • Returns LDNS_STATUS_OK if there is a trusted path to one of the keys, or the first error encountered if there were no paths

(yes, the first error. not the last. not an average. the first. it's giving "we're not doing extra work" 😭)

🌟 ldns_dnssec_trust_tree_print()

Prints the dnssec_trust_tree structure to the given file stream.

If a link status is not LDNS_STATUS_OK; the status and relevant signatures are printed too.

  • *out: The file stream to print to
  • tree: The trust tree to print
  • tabs: Prepend each line with tabs*2 spaces
  • extended: If true, add little explanation lines to the output

🌟 ldns_dnssec_trust_tree_print_sm()

that's it. that's the entry. it's just ldns_dnssec_trust_tree_print_sm(); and honestly? mysterious. slay. 🧚

🌟 ldns_dnssec_trust_tree_add_parent()

Adds a trust tree as a parent for the given trust tree.

  • *tree: The tree to add the parent to
  • *parent: The parent tree to add
  • *parent_signature: The RRSIG relevant to this parent/child connection
  • parent_status: The DNSSEC status for this parent, child and RRSIG
  • Returns LDNS_STATUS_OK if the addition succeeds, error otherwise

adopting a parent into the family tree, literally 🌈

🌟 ldns_dnssec_derive_trust_tree_normal_rrset()

Sub function for derive_trust_tree that is used for a 'normal' rrset.

  • new_tree: The trust tree that we are building
  • data_chain: The data chain containing the data for the trust tree
  • cur_sig_rr: The currently relevant signature

just a regular rrset, living its regular rrset life ✨

🌟 ldns_dnssec_derive_trust_tree_dnskey_rrset()

Sub function for derive_trust_tree that is used for DNSKEY rrsets.

  • new_tree: The trust tree that we are building
  • data_chain: The data chain containing the data for the trust tree
  • cur_rr: The currently relevant DNSKEY RR
  • cur_sig_rr: The currently relevant signature

🌟 ldns_dnssec_derive_trust_tree_ds_rrset()

Sub function for derive_trust_tree that is used for DS rrsets.

  • new_tree: The trust tree that we are building
  • data_chain: The data chain containing the data for the trust tree
  • cur_rr: The currently relevant DS RR

🌟 ldns_dnssec_derive_trust_tree_no_sig()

Sub function for derive_trust_tree that is used when there are no signatures.

  • new_tree: The trust tree that we are building
  • data_chain: The data chain containing the data for the trust tree

no signature?? no problem, we still build the tree πŸŽ€


πŸ‘‘ AUTHOR πŸ‘‘

The ldns team at NLnet Labs.


πŸ› REPORTING BUGS πŸ›

Please report bugs to dns-team@nlnetlabs.nl or on GitHub at https://github.com/NLnetLabs/ldns/issues


Copyright (c) 2004 - 2006 NLnet Labs.

Licensed under the BSD License. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.

like, none. zero. not even the "fitness for a particular purpose" one. that's the whole point of the caps. 😌

πŸ”₯ SEE ALSO πŸ”₯

ldns_dnssec_data_chain, ldns_dnssec_trust_tree. And perldoc Net::DNS, RFC1034, RFC1035, RFC4033, RFC4034 and RFC4035.


πŸ’… REMARKS πŸ’…

This manpage was automatically generated from the ldns source code.


and that's the whole page, bestie!! this little gem is from the Library Functions Manual, dated 30 May 2006 β€” yeah, it's been serving since 2006 and it still ate. go build a trust tree, don't leak your data_chain, and stay iconic πŸ¦‹πŸ’–βœ¨