Newer
Older
* Written by Mark Spencer <markster@digium.com>
*
* Funding provided by nic.at
*
* Distributed under the terms of the GNU GPL
*
*/
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/nameser.h>
#if __APPLE_CC__ >= 1495
#include <arpa/nameser_compat.h>
#endif
Kevin P. Fleming
committed
#include "asterisk/logger.h"
#include "asterisk/options.h"
#include "asterisk/enum.h"
#include "asterisk/dns.h"
#include "asterisk/channel.h"
#include "asterisk/config.h"
#include "asterisk/utils.h"
#ifdef __APPLE__
#undef T_NAPTR
#define T_NAPTR 35
#endif
#ifdef __APPLE__
#undef T_TXT
#define T_TXT 16
#endif
/* The IETF Enum standard root, managed by the ITU */
struct enum_search *next;
} *toplevs;
static int enumver = 0;
AST_MUTEX_DEFINE_STATIC(enumlock);
struct naptr {
unsigned short order;
unsigned short pref;
} __attribute__ ((__packed__));
/*--- parse_ie: Parse NAPTR record information elements */
static int parse_ie(char *data, int maxdatalen, char *src, int srclen)
len = olen = (int)src[0];
src++;
srclen--;
if (len > srclen) {
ast_log(LOG_WARNING, "Want %d, got %d\n", len, srclen);
return -1;
}
if (len > maxdatalen)
len = maxdatalen;
memcpy(data, src, len);
return olen + 1;
}
/*--- parse_naptr: Parse DNS NAPTR record used in ENUM ---*/
static int parse_naptr(char *dst, int dstsize, char *tech, int techsize, char *answer, int len, char *naptrinput)
Kevin P. Fleming
committed
char tech_return[80];
char flags[512] = "";
char services[512] = "";
Kevin P. Fleming
committed
unsigned char *p;
char regexp[512] = "";
char repl[512] = "";
char temp[512] = "";
char delim;
char *delim2;
char *pattern, *subst, *d;
int regexp_len, size, backref;
int d_len = sizeof(temp) - 1;
regex_t preg;
regmatch_t pmatch[9];
Kevin P. Fleming
committed
tech_return[0] = '\0';
Kevin P. Fleming
committed
ast_log(LOG_WARNING, "NAPTR record length too short\n");
return -1;
}
answer += sizeof(struct naptr);
len -= sizeof(struct naptr);
if ((res = parse_ie(flags, sizeof(flags) - 1, answer, len)) < 0) {
ast_log(LOG_WARNING, "Failed to get flags from NAPTR record\n");
Kevin P. Fleming
committed
return -1;
} else {
answer += res;
len -= res;
if ((res = parse_ie(services, sizeof(services) - 1, answer, len)) < 0) {
ast_log(LOG_WARNING, "Failed to get services from NAPTR record\n");
Kevin P. Fleming
committed
return -1;
} else {
answer += res;
len -= res;
}
if ((res = parse_ie(regexp, sizeof(regexp) - 1, answer, len)) < 0) {
ast_log(LOG_WARNING, "Failed to get regexp from NAPTR record\n");
Kevin P. Fleming
committed
return -1;
} else {
answer += res;
len -= res;
Kevin P. Fleming
committed
if ((res = dn_expand((unsigned char *)oanswer, (unsigned char *)answer + len, (unsigned char *)answer, repl, sizeof(repl) - 1)) < 0) {
ast_log(LOG_WARNING, "Failed to expand hostname\n");
return -1;
Kevin P. Fleming
committed
}
if (option_debug > 2) /* Advanced NAPTR debugging */
ast_log(LOG_DEBUG, "NAPTR input='%s', flags='%s', services='%s', regexp='%s', repl='%s'\n",
naptrinput, flags, services, regexp, repl);
ast_log(LOG_WARNING, "NAPTR Flag must be 'U' or 'u'.\n");
Kevin P. Fleming
committed
p = strstr(services, "e2u+");
if(p == NULL)
p = strstr(services, "E2U+");
if(p){
p = p + 4;
if(strchr(p, ':')){
p = strchr(p, ':') + 1;
}
ast_copy_string(tech_return, p, sizeof(tech_return));
Kevin P. Fleming
committed
p = strstr(services, "+e2u");
if(p == NULL)
p = strstr(services, "+E2U");
if(p){
*p = 0;
p = strchr(services, ':');
if(p)
*p = 0;
ast_copy_string(tech_return, services, sizeof(tech_return));
}
ast_copy_string(regexp, "!^\\+43(.*)$!\\1@bla.fasel!", sizeof(regexp) - 1);
*/
regexp_len = strlen(regexp);
if (regexp_len < 7) {
ast_log(LOG_WARNING, "Regex too short to be meaningful.\n");
return -1;
Kevin P. Fleming
committed
}
delim = regexp[0];
delim2 = strchr(regexp + 1, delim);
if ((delim2 == NULL) || (regexp[regexp_len-1] != delim)) {
ast_log(LOG_WARNING, "Regex delimiter error (on \"%s\").\n",regexp);
return -1;
}
pattern = regexp + 1;
*delim2 = 0;
subst = delim2 + 1;
regexp[regexp_len-1] = 0;
printf("Pattern: %s\n", pattern);
printf("Subst: %s\n", subst);
Kevin P. Fleming
committed
printf("Input: %s\n", naptrinput);
/*
* now do the regex wizardry.
*/
if (regcomp(&preg, pattern, REG_EXTENDED | REG_NEWLINE)) {
ast_log(LOG_WARNING, "NAPTR Regex compilation error (regex = \"%s\").\n",regexp);
return -1;
}
if (preg.re_nsub > 9) {
ast_log(LOG_WARNING, "NAPTR Regex compilation error: too many subs.\n");
regfree(&preg);
return -1;
}
if (regexec(&preg, naptrinput, 9, pmatch, 0)) {
ast_log(LOG_WARNING, "NAPTR Regex match failed.\n");
regfree(&preg);
return -1;
}
regfree(&preg);
Kevin P. Fleming
committed
d = temp;
d_len--;
while( *subst && (d_len > 0) ) {
if ((subst[0] == '\\') && isdigit(subst[1]) && (pmatch[subst[1]-'0'].rm_so != -1)) {
backref = subst[1]-'0';
size = pmatch[backref].rm_eo - pmatch[backref].rm_so;
if (size > d_len) {
ast_log(LOG_WARNING, "Not enough space during NAPTR regex substitution.\n");
return -1;
}
memcpy(d, naptrinput + pmatch[backref].rm_so, size);
d += size;
d_len -= size;
subst += 2;
} else if (isprint(*subst)) {
*d++ = *subst++;
d_len--;
} else {
ast_log(LOG_WARNING, "Error during regex substitution.\n");
return -1;
dst[dstsize - 1] = '\0';
Kevin P. Fleming
committed
if(*tech != '\0'){ /* check if it is requested NAPTR */
if(!strncasecmp(tech, "ALL", techsize)){
return 1; /* return or count any RR */
}
if(!strncasecmp(tech_return, tech, sizeof(tech_return)<techsize?sizeof(tech_return):techsize)){
ast_copy_string(tech, tech_return, techsize);
return 1; /* we got out RR */
} else { /* go to the next RR in the DNS answer */
return 0;
}
}
/* tech was not specified, return first parsed RR */
ast_copy_string(tech, tech_return, techsize);
return 1;
Kevin P. Fleming
committed
/* do not return requested value, just count RRs and return thei number in dst */
#define ENUMLOOKUP_OPTIONS_COUNT 1
struct enum_naptr_rr {
struct naptr naptr; /* order and preference of RR */
char *result; /* result of naptr parsing,e.g.: tel:+5553 */
char *tech; /* Technology (from URL scheme) */
int sort_pos; /* sort position */
};
char *dst; /* Destination part of URL from ENUM */
int dstlen; /* Length */
char *tech; /* Technology (from URL scheme) */
int techlen; /* Length */
char *txt; /* TXT record in TXT lookup */
int txtlen; /* Length */
char *naptrinput; /* The number to lookup */
Kevin P. Fleming
committed
int position; /* used as counter for RRs or specifies position of required RR */
int options; /* options , see ENUMLOOKUP_OPTIONS_* defined above */
struct enum_naptr_rr *naptr_rrs; /* array of parsed NAPTR RRs */
int naptr_rrs_count; /* Size of array naptr_rrs */
/*--- txt_callback: Callback for TXT record lookup */
static int txt_callback(void *context, char *answer, int len, char *fullanswer)
{
struct enum_context *c = (struct enum_context *)context;
#if 0
printf("ENUMTXT Called\n");
#endif
c->txt = NULL;
c->txtlen = 0;
return 0;
}
/* skip over first byte, as for some reason it's a vertical tab character */
answer += 1;
len -= 1;
/* answer is not null-terminated, but should be */
Kevin P. Fleming
committed
/* this is safe to do, as answer has extra bytes on the end we can
/* now increment len so that len includes the null, so that we can
compare apples to apples */
len +=1;
/* finally, copy the answer into c->txt */
ast_copy_string(c->txt, answer, len < c->txtlen ? len : (c->txtlen));
Kevin P. Fleming
committed
/* just to be safe, let's make sure c->txt is null terminated */
/*--- enum_callback: Callback from ENUM lookup function */
static int enum_callback(void *context, char *answer, int len, char *fullanswer)
struct enum_context *c = (struct enum_context *)context;
Kevin P. Fleming
committed
void *p = NULL;
int res;
Kevin P. Fleming
committed
res = parse_naptr(c->dst, c->dstlen, c->tech, c->techlen, answer, len, c->naptrinput);
if(res < 0){
return -1;
Kevin P. Fleming
committed
} else if(res > 0 && !ast_strlen_zero(c->dst)){ /* ok, we got needed NAPTR */
if(c->options & ENUMLOOKUP_OPTIONS_COUNT){ /* counting RRs */
c->position++;
snprintf(c->dst, c->dstlen, "%d", c->position);
} else {
p = realloc(c->naptr_rrs, sizeof(struct enum_naptr_rr)*(c->naptr_rrs_count+1));
if(p){
c->naptr_rrs = (struct enum_naptr_rr*)p;
memcpy(&c->naptr_rrs[c->naptr_rrs_count].naptr, answer, sizeof(struct naptr));
/* printf("order=%d, pref=%d\n", ntohs(c->naptr_rrs[c->naptr_rrs_count].naptr.order), ntohs(c->naptr_rrs[c->naptr_rrs_count].naptr.pref)); */
c->naptr_rrs[c->naptr_rrs_count].result = strdup(c->dst);
c->naptr_rrs[c->naptr_rrs_count].tech = strdup(c->tech);
c->naptr_rrs[c->naptr_rrs_count].sort_pos = c->naptr_rrs_count;
c->naptr_rrs_count++;
}
c->dst[0] = 0;
}
return 0;
}
Kevin P. Fleming
committed
if(c->options & ENUMLOOKUP_OPTIONS_COUNT){ /* counting RRs */
snprintf(c->dst, c->dstlen, "%d", c->position);
}
Kevin P. Fleming
committed
int ast_get_enum(struct ast_channel *chan, const char *number, char *dst, int dstlen, char *tech, int techlen, char* suffix, char* options)
Kevin P. Fleming
committed
char naptrinput[512];
struct enum_search *s = NULL;
int version = -1;
Kevin P. Fleming
committed
/* for ISN rewrite */
char *p1 = NULL;
char *p2 = NULL;
int k = 0;
int i = 0;
int z = 0;
if(number[0] == 'n'){
strncpy(naptrinput, number+1, sizeof(naptrinput));
} else {
strncpy(naptrinput, number, sizeof(naptrinput));
}
context.naptrinput = naptrinput; /* The number */
context.dst = dst; /* Return string */
Kevin P. Fleming
committed
context.tech = tech;
Kevin P. Fleming
committed
context.options = 0;
context.position = 1;
context.naptr_rrs = NULL;
context.naptr_rrs_count = 0;
if(options != NULL){
if(*options == 'c'){
context.options = ENUMLOOKUP_OPTIONS_COUNT;
context.position = 0;
} else {
context.position = atoi(options);
if(context.position < 1)
context.position = 1;
}
}
Kevin P. Fleming
committed
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
/* ISN rewrite */
p1 = strchr(number, '*');
if(number[0] == 'n'){ /* do not perform ISN rewrite ('n' is testing flag) */
p1 = NULL;
k = 1; /* strip 'n' from number */
}
if(p1 != NULL){
p2 = p1+1;
while(p1 > number){
p1--;
tmp[newpos++] = *p1;
tmp[newpos++] = '.';
}
if(*p2){
while(*p2 && newpos < 128){
tmp[newpos++] = *p2;
p2++;
}
tmp[newpos++] = '.';
}
} else {
while(pos >= k) {
if(isdigit(number[pos])){
tmp[newpos++] = number[pos];
tmp[newpos++] = '.';
}
pos--;
}
Kevin P. Fleming
committed
if (chan && ast_autoservice_start(chan) < 0)
return -1;
ast_mutex_lock(&enumlock);
if (version != enumver) {
/* Ooh, a reload... */
s = toplevs;
Kevin P. Fleming
committed
if(suffix != NULL){
strncpy(tmp + newpos, suffix, sizeof(tmp) - newpos - 1);
} else if (s) {
strncpy(tmp + newpos, s->toplev, sizeof(tmp) - newpos - 1);
ast_mutex_unlock(&enumlock);
ret = ast_search_dns(&context, tmp, C_IN, T_NAPTR, enum_callback);
if (ret > 0)
Kevin P. Fleming
committed
if(suffix != NULL)
break;
ast_log(LOG_DEBUG, "No such number found: %s (%s)\n", tmp, strerror(errno));
ret = 0;
}
Kevin P. Fleming
committed
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
if(context.naptr_rrs_count >= context.position && ! (context.options & ENUMLOOKUP_OPTIONS_COUNT)){
/* sort array by NAPTR order/preference */
for(k=0; k<context.naptr_rrs_count; k++){
for(i=0; i<context.naptr_rrs_count; i++){
/* use order first and then preference to compare */
if((ntohs(context.naptr_rrs[k].naptr.order) < ntohs(context.naptr_rrs[i].naptr.order)
&& context.naptr_rrs[k].sort_pos > context.naptr_rrs[i].sort_pos)
|| (ntohs(context.naptr_rrs[k].naptr.order) > ntohs(context.naptr_rrs[i].naptr.order)
&& context.naptr_rrs[k].sort_pos < context.naptr_rrs[i].sort_pos)){
z = context.naptr_rrs[k].sort_pos;
context.naptr_rrs[k].sort_pos = context.naptr_rrs[i].sort_pos;
context.naptr_rrs[i].sort_pos = z;
continue;
}
if(ntohs(context.naptr_rrs[k].naptr.order) == ntohs(context.naptr_rrs[i].naptr.order)){
if((ntohs(context.naptr_rrs[k].naptr.pref) < ntohs(context.naptr_rrs[i].naptr.pref)
&& context.naptr_rrs[k].sort_pos > context.naptr_rrs[i].sort_pos)
|| (ntohs(context.naptr_rrs[k].naptr.pref) > ntohs(context.naptr_rrs[i].naptr.pref)
&& context.naptr_rrs[k].sort_pos < context.naptr_rrs[i].sort_pos)){
z = context.naptr_rrs[k].sort_pos;
context.naptr_rrs[k].sort_pos = context.naptr_rrs[i].sort_pos;
context.naptr_rrs[i].sort_pos = z;
}
}
}
}
for(k=0; k<context.naptr_rrs_count; k++){
if(context.naptr_rrs[k].sort_pos == context.position-1){
ast_copy_string(context.dst, context.naptr_rrs[k].result, dstlen);
ast_copy_string(context.tech, context.naptr_rrs[k].tech, techlen);
break;
}
}
} else if( !(context.options & ENUMLOOKUP_OPTIONS_COUNT) ) {
context.dst[0] = 0;
}
Kevin P. Fleming
committed
for(k=0; k<context.naptr_rrs_count; k++){
free(context.naptr_rrs[k].result);
free(context.naptr_rrs[k].tech);
}
free(context.naptr_rrs);
return ret;
}
Kevin P. Fleming
committed
/*--- ast_get_txt: Get TXT record from DNS.
Really has nothing to do with enum, but anyway...
*/
int ast_get_txt(struct ast_channel *chan, const char *number, char *dst, int dstlen, char *tech, int techlen, char *txt, int txtlen)
{
struct enum_context context;
char tmp[259 + 512];
char naptrinput[512] = "+";
int pos = strlen(number) - 1;
int newpos = 0;
int ret = -1;
struct enum_search *s = NULL;
int version = -1;
strncat(naptrinput, number, sizeof(naptrinput) - 2);
context.naptrinput = naptrinput;
context.dst = dst;
context.dstlen = dstlen;
context.tech = tech;
context.techlen = techlen;
context.txt = txt;
context.txtlen = txtlen;
if (pos > 128)
pos = 128;
while(pos >= 0) {
tmp[newpos++] = number[pos--];
tmp[newpos++] = '.';
}
Kevin P. Fleming
committed
if (chan && ast_autoservice_start(chan) < 0)
return -1;
for(;;) {
ast_mutex_lock(&enumlock);
if (version != enumver) {
/* Ooh, a reload... */
s = toplevs;
version = enumver;
} else {
s = s->next;
}
if (s) {
strncpy(tmp + newpos, s->toplev, sizeof(tmp) - newpos - 1);
}
ast_mutex_unlock(&enumlock);
if (!s)
break;
ret = ast_search_dns(&context, tmp, C_IN, T_TXT, txt_callback);
if (ret > 0)
break;
}
if (ret < 0) {
ast_log(LOG_DEBUG, "No such number found: %s (%s)\n", tmp, strerror(errno));
ret = 0;
}
if (chan)
ret |= ast_autoservice_stop(chan);
/*--- enum_newtoplev: Add enum tree to linked list ---*/
static struct enum_search *enum_newtoplev(char *s)
{
struct enum_search *tmp;
tmp = malloc(sizeof(struct enum_search));
if (tmp) {
memset(tmp, 0, sizeof(struct enum_search));
ast_copy_string(tmp->toplev, s, sizeof(tmp->toplev));
/*--- ast_enum_init: Initialize the ENUM support subsystem */
int ast_enum_init(void)
{
struct ast_config *cfg;
struct enum_search *s, *sl;
struct ast_variable *v;
/* Destroy existing list */
ast_mutex_lock(&enumlock);
s = toplevs;
while(s) {
sl = s;
s = s->next;
free(sl);
}
toplevs = NULL;
if (cfg) {
sl = NULL;
v = ast_variable_browse(cfg, "general");
while(v) {
if (!strcasecmp(v->name, "search")) {
s = enum_newtoplev(v->value);
if (s) {
if (sl)
sl->next = s;
else
toplevs = s;
sl = s;
}
}
v = v->next;
}
} else {
toplevs = enum_newtoplev(TOPLEV);
}
enumver++;
ast_mutex_unlock(&enumlock);
return 0;
}
int ast_enum_reload(void)
{
return ast_enum_init();
}