/* Copyright (C) 2015-2017 CZ.NIC, z.s.p.o. This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see . */ #pragma once #include "lib/generic/map.h" #include /** * Find TA RRSet by name. * @param trust_anchors trust store * @param name name of the TA * @return non-empty RRSet or NULL */ KR_EXPORT knot_rrset_t *kr_ta_get(map_t *trust_anchors, const knot_dname_t *name); /** * Add TA to trust store. DS or DNSKEY types are supported. * @param trust_anchors trust store * @param name name of the TA * @param type RR type of the TA (DS or DNSKEY) * @param ttl * @param rdata * @param rdlen * @return 0 or an error */ KR_EXPORT int kr_ta_add(map_t *trust_anchors, const knot_dname_t *name, uint16_t type, uint32_t ttl, const uint8_t *rdata, uint16_t rdlen); /** * Return true if the name is below/at any TA in the store. * This can be useful to check if it's possible to validate a name beforehand. * @param trust_anchors trust store * @param name name of the TA * @return boolean */ KR_EXPORT KR_PURE int kr_ta_covers(map_t *trust_anchors, const knot_dname_t *name); struct kr_context; /** * A wrapper around kr_ta_covers that is aware of negative TA and types. */ KR_EXPORT KR_PURE bool kr_ta_covers_qry(struct kr_context *ctx, const knot_dname_t *name, const uint16_t type); /** * Remove TA from trust store. * @param trust_anchors trust store * @param name name of the TA * @return 0 or an error */ KR_EXPORT int kr_ta_del(map_t *trust_anchors, const knot_dname_t *name); /** * Clear trust store. * @param trust_anchors trust store */ KR_EXPORT void kr_ta_clear(map_t *trust_anchors); /** * Return TA with the longest name that covers given name. * @param trust_anchors trust store * @param name name of the TA * @return pointer to name or NULL. if not NULL, points inside the name parameter. */ KR_EXPORT const knot_dname_t *kr_ta_get_longest_name(map_t *trust_anchors, const knot_dname_t *name);