2015-03-25 12:32:26 +00:00
|
|
|
/*
|
|
|
|
* Asterisk -- An open source telephony toolkit.
|
|
|
|
*
|
|
|
|
* Copyright (C) 2015, Digium, Inc.
|
|
|
|
*
|
|
|
|
* Joshua Colp <jcolp@digium.com>
|
|
|
|
*
|
|
|
|
* See http://www.asterisk.org for more information about
|
|
|
|
* the Asterisk project. Please do not directly contact
|
|
|
|
* any of the maintainers of this project for assistance;
|
|
|
|
* the project provides a web site, mailing lists and IRC
|
|
|
|
* channels for your use.
|
|
|
|
*
|
|
|
|
* This program is free software, distributed under the terms of
|
|
|
|
* the GNU General Public License Version 2. See the LICENSE file
|
|
|
|
* at the top of the source tree.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*! \file
|
|
|
|
*
|
|
|
|
* \brief DNS SRV Record Support
|
|
|
|
*
|
|
|
|
* \author Joshua Colp <jcolp@digium.com>
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*** MODULEINFO
|
|
|
|
<support_level>core</support_level>
|
|
|
|
***/
|
|
|
|
|
|
|
|
#include "asterisk.h"
|
|
|
|
|
git migration: Refactor the ASTERISK_FILE_VERSION macro
Git does not support the ability to replace a token with a version
string during check-in. While it does have support for replacing a
token on clone, this is somewhat sub-optimal: the token is replaced
with the object hash, which is not particularly easy for human
consumption. What's more, in practice, the source file version was often
not terribly useful. Generally, when triaging bugs, the overall version
of Asterisk is far more useful than an individual SVN version of a file. As a
result, this patch removes Asterisk's support for showing source file
versions.
Specifically, it does the following:
* Rename ASTERISK_FILE_VERSION macro to ASTERISK_REGISTER_FILE, and
remove passing the version in with the macro. Other facilities
than 'core show file version' make use of the file names, such as
setting a debug level only on a specific file. As such, the act of
registering source files with the Asterisk core still has use. The
macro rename now reflects the new macro purpose.
* main/asterisk:
- Refactor the file_version structure to reflect that it no longer
tracks a version field.
- Remove the "core show file version" CLI command. Without the file
version, it is no longer useful.
- Remove the ast_file_version_find function. The file version is no
longer tracked.
- Rename ast_register_file_version/ast_unregister_file_version to
ast_register_file/ast_unregister_file, respectively.
* main/manager: Remove value from the Version key of the ModuleCheck
Action. The actual key itself has not been removed, as doing so would
absolutely constitute a backwards incompatible change. However, since
the file version is no longer tracked, there is no need to attempt to
include it in the Version key.
* UPGRADE: Add notes for:
- Modification to the ModuleCheck AMI Action
- Removal of the "core show file version" CLI command
Change-Id: I6cf0ff280e1668bf4957dc21f32a5ff43444a40e
2015-04-12 02:38:22 +00:00
|
|
|
ASTERISK_REGISTER_FILE()
|
2015-03-25 12:32:26 +00:00
|
|
|
|
2015-04-01 16:27:48 +00:00
|
|
|
#include <netinet/in.h>
|
|
|
|
#include <arpa/nameser.h>
|
|
|
|
#include <resolv.h>
|
|
|
|
|
2015-03-25 12:32:26 +00:00
|
|
|
#include "asterisk/dns_core.h"
|
|
|
|
#include "asterisk/dns_srv.h"
|
2015-04-01 16:27:48 +00:00
|
|
|
#include "asterisk/linkedlists.h"
|
|
|
|
#include "asterisk/dns_internal.h"
|
|
|
|
#include "asterisk/utils.h"
|
|
|
|
|
2015-04-09 14:58:02 +00:00
|
|
|
struct ast_dns_record *dns_srv_alloc(struct ast_dns_query *query, const char *data, const size_t size)
|
2015-04-01 16:27:48 +00:00
|
|
|
{
|
|
|
|
uint16_t priority;
|
|
|
|
uint16_t weight;
|
|
|
|
uint16_t port;
|
|
|
|
const char *ptr;
|
|
|
|
const char *end_of_record;
|
|
|
|
struct ast_dns_srv_record *srv;
|
|
|
|
int host_size;
|
|
|
|
char host[NI_MAXHOST] = "";
|
|
|
|
|
2015-04-09 14:58:02 +00:00
|
|
|
ptr = dns_find_record(data, size, query->result->answer, query->result->answer_size);
|
2015-04-01 16:27:48 +00:00
|
|
|
ast_assert(ptr != NULL);
|
|
|
|
|
|
|
|
end_of_record = ptr + size;
|
|
|
|
|
|
|
|
/* PRIORITY */
|
2015-04-09 14:58:02 +00:00
|
|
|
ptr += dns_parse_short((unsigned char *) ptr, &priority);
|
2015-04-01 16:27:48 +00:00
|
|
|
if (ptr >= end_of_record) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* WEIGHT */
|
2015-04-09 14:58:02 +00:00
|
|
|
ptr += dns_parse_short((unsigned char *) ptr, &weight);
|
2015-04-01 16:27:48 +00:00
|
|
|
if (ptr >= end_of_record) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* PORT */
|
2015-04-09 14:58:02 +00:00
|
|
|
ptr += dns_parse_short((unsigned char *) ptr, &port);
|
2015-04-01 16:27:48 +00:00
|
|
|
if (ptr >= end_of_record) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
host_size = dn_expand((unsigned char *)query->result->answer, (unsigned char *) end_of_record, (unsigned char *) ptr, host, sizeof(host) - 1);
|
|
|
|
if (host_size < 0) {
|
|
|
|
ast_log(LOG_ERROR, "Failed to expand domain name: %s\n", strerror(errno));
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!strcmp(host, ".")) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
srv = ast_calloc(1, sizeof(*srv) + size + host_size + 1);
|
|
|
|
if (!srv) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
srv->priority = priority;
|
|
|
|
srv->weight = weight;
|
|
|
|
srv->port = port;
|
|
|
|
|
|
|
|
srv->host = srv->data + size;
|
|
|
|
strcpy((char *)srv->host, host); /* SAFE */
|
|
|
|
((char *)srv->host)[host_size] = '\0';
|
|
|
|
|
|
|
|
srv->generic.data_ptr = srv->data;
|
|
|
|
|
|
|
|
return (struct ast_dns_record *)srv;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* This implementation was taken from the existing srv.c which, after reading the RFC, implements it
|
|
|
|
* as it should.
|
|
|
|
*/
|
2015-04-09 14:58:02 +00:00
|
|
|
void dns_srv_sort(struct ast_dns_result *result)
|
2015-04-01 16:27:48 +00:00
|
|
|
{
|
|
|
|
struct ast_dns_record *current;
|
|
|
|
struct dns_records newlist = AST_LIST_HEAD_NOLOCK_INIT_VALUE;
|
|
|
|
|
|
|
|
while (AST_LIST_FIRST(&result->records)) {
|
2015-05-10 13:36:51 +00:00
|
|
|
unsigned short cur_priority = ((struct ast_dns_srv_record *)(AST_LIST_FIRST(&result->records)))->priority;
|
2015-04-01 16:27:48 +00:00
|
|
|
struct dns_records temp_list = AST_LIST_HEAD_NOLOCK_INIT_VALUE;
|
|
|
|
|
2015-05-10 13:36:51 +00:00
|
|
|
/* Find the lowest current priority to work on, but if the priority is already zero there is no lower priority */
|
|
|
|
if (cur_priority) {
|
|
|
|
AST_LIST_TRAVERSE(&result->records, current, list) {
|
|
|
|
if (((struct ast_dns_srv_record *)current)->priority < cur_priority) {
|
|
|
|
cur_priority = ((struct ast_dns_srv_record *)current)->priority;
|
|
|
|
}
|
2015-04-01 16:27:48 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Find all records which match this priority */
|
|
|
|
AST_LIST_TRAVERSE_SAFE_BEGIN(&result->records, current, list) {
|
|
|
|
if (((struct ast_dns_srv_record *)current)->priority != cur_priority) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
AST_LIST_REMOVE_CURRENT(list);
|
|
|
|
|
|
|
|
/* Records with a weight of zero must always be at the head */
|
|
|
|
if (((struct ast_dns_srv_record *)current)->weight == 0) {
|
|
|
|
AST_LIST_INSERT_HEAD(&temp_list, current, list);
|
|
|
|
} else {
|
|
|
|
AST_LIST_INSERT_TAIL(&temp_list, current, list);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
AST_LIST_TRAVERSE_SAFE_END;
|
|
|
|
|
|
|
|
/* Apply weighting - as each record is passed the sum of all previous weights (plus its own) is stored away, and then a random weight
|
|
|
|
* is calculated. The first record with a weight sum greater than the random weight is put in the new list and the whole thing starts
|
|
|
|
* once again.
|
|
|
|
*/
|
|
|
|
while (AST_LIST_FIRST(&temp_list)) {
|
|
|
|
unsigned int weight_sum = 0;
|
|
|
|
unsigned int random_weight;
|
|
|
|
|
|
|
|
AST_LIST_TRAVERSE(&temp_list, current, list) {
|
|
|
|
((struct ast_dns_srv_record *)current)->weight_sum = weight_sum += ((struct ast_dns_srv_record *)current)->weight;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* if all the remaining entries have weight == 0,
|
|
|
|
then just append them to the result list and quit */
|
|
|
|
if (weight_sum == 0) {
|
|
|
|
AST_LIST_APPEND_LIST(&newlist, &temp_list, list);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
random_weight = 1 + (unsigned int) ((float) weight_sum * (ast_random() / ((float) RAND_MAX + 1.0)));
|
|
|
|
|
|
|
|
AST_LIST_TRAVERSE_SAFE_BEGIN(&temp_list, current, list) {
|
|
|
|
if (((struct ast_dns_srv_record *)current)->weight_sum < random_weight) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
AST_LIST_MOVE_CURRENT(&newlist, list);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
AST_LIST_TRAVERSE_SAFE_END;
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
/* now that the new list has been ordered,
|
|
|
|
put it in place */
|
|
|
|
|
|
|
|
AST_LIST_APPEND_LIST(&result->records, &newlist, list);
|
|
|
|
}
|
2015-03-25 12:32:26 +00:00
|
|
|
|
|
|
|
const char *ast_dns_srv_get_host(const struct ast_dns_record *record)
|
|
|
|
{
|
2015-04-01 16:27:48 +00:00
|
|
|
struct ast_dns_srv_record *srv = (struct ast_dns_srv_record *) record;
|
|
|
|
|
|
|
|
ast_assert(ast_dns_record_get_rr_type(record) == ns_t_srv);
|
|
|
|
return srv->host;
|
2015-03-25 12:32:26 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
unsigned short ast_dns_srv_get_priority(const struct ast_dns_record *record)
|
|
|
|
{
|
2015-04-01 16:27:48 +00:00
|
|
|
struct ast_dns_srv_record *srv = (struct ast_dns_srv_record *) record;
|
|
|
|
|
|
|
|
ast_assert(ast_dns_record_get_rr_type(record) == ns_t_srv);
|
|
|
|
return srv->priority;
|
2015-03-25 12:32:26 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
unsigned short ast_dns_srv_get_weight(const struct ast_dns_record *record)
|
|
|
|
{
|
2015-04-01 16:27:48 +00:00
|
|
|
struct ast_dns_srv_record *srv = (struct ast_dns_srv_record *) record;
|
|
|
|
|
|
|
|
ast_assert(ast_dns_record_get_rr_type(record) == ns_t_srv);
|
|
|
|
return srv->weight;
|
2015-03-25 12:32:26 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
unsigned short ast_dns_srv_get_port(const struct ast_dns_record *record)
|
|
|
|
{
|
2015-04-01 16:27:48 +00:00
|
|
|
struct ast_dns_srv_record *srv = (struct ast_dns_srv_record *) record;
|
|
|
|
|
|
|
|
ast_assert(ast_dns_record_get_rr_type(record) == ns_t_srv);
|
|
|
|
return srv->port;
|
|
|
|
}
|