dname.h

Go to the documentation of this file.

/*
 * util/data/dname.h - domain name routines
 *
 * Copyright (c) 2007, NLnet Labs. All rights reserved.
 *
 * This software is open source.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 
 * Redistributions of source code must retain the above copyright notice,
 * this list of conditions and the following disclaimer.
 * 
 * Redistributions in binary form must reproduce the above copyright notice,
 * this list of conditions and the following disclaimer in the documentation
 * and/or other materials provided with the distribution.
 * 
 * Neither the name of the NLNET LABS nor the names of its contributors may
 * be used to endorse or promote products derived from this software without
 * specific prior written permission.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
 * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

 
#ifndef UTIL_DATA_DNAME_H
#define UTIL_DATA_DNAME_H
#include "util/storage/lruhash.h"
struct sldns_buffer;

#define MAX_COMPRESS_PTRS 256

size_t query_dname_len(struct sldns_buffer* query);

size_t dname_valid(uint8_t* dname, size_t len);

void query_dname_tolower(uint8_t* dname);

void pkt_dname_tolower(struct sldns_buffer* pkt, uint8_t* dname);

int query_dname_compare(uint8_t* d1, uint8_t* d2);

size_t pkt_dname_len(struct sldns_buffer* pkt);

int dname_pkt_compare(struct sldns_buffer* pkt, uint8_t* d1, uint8_t* d2);

hashvalue_type dname_query_hash(uint8_t* dname, hashvalue_type h);

hashvalue_type dname_pkt_hash(struct sldns_buffer* pkt, uint8_t* dname,
    hashvalue_type h);

void dname_pkt_copy(struct sldns_buffer* pkt, uint8_t* to, uint8_t* dname);

int dname_buffer_write(struct sldns_buffer* pkt, uint8_t* dname);

int dname_count_labels(uint8_t* dname);

int dname_count_size_labels(uint8_t* dname, size_t* size);

int dname_lab_cmp(uint8_t* d1, int labs1, uint8_t* d2, int labs2, int* mlabs);

int dname_lab_startswith(uint8_t* label, char* prefix, char** endptr);

int dname_strict_subdomain(uint8_t* d1, int labs1, uint8_t* d2, int labs2);

int dname_strict_subdomain_c(uint8_t* d1, uint8_t* d2);

int dname_subdomain_c(uint8_t* d1, uint8_t* d2);

void dname_print(FILE* out, struct sldns_buffer* pkt, uint8_t* dname);

void dname_str(uint8_t* dname, char* str);

int dname_is_root(uint8_t* dname);

void dname_remove_label(uint8_t** dname, size_t* len);

void dname_remove_labels(uint8_t** dname, size_t* len, int n);

int dname_signame_label_count(uint8_t* dname);

int dname_is_wild(uint8_t* dname);

int dname_canon_lab_cmp(uint8_t* d1, int labs1, uint8_t* d2, int labs2, 
    int* mlabs);

int dname_canonical_compare(uint8_t* d1, uint8_t* d2);

uint8_t* dname_get_shared_topdomain(uint8_t* d1, uint8_t* d2);
 
#endif /* UTIL_DATA_DNAME_H */