enum.c 28 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143
  1. /*
  2. * $Id$
  3. *
  4. * Enum and E164 related functions
  5. *
  6. * Copyright (C) 2002-2008 Juha Heinanen
  7. *
  8. * This file is part of Kamailio, a free SIP server.
  9. *
  10. * Kamailio is free software; you can redistribute it and/or modify
  11. * it under the terms of the GNU General Public License as published by
  12. * the Free Software Foundation; either version 2 of the License, or
  13. * (at your option) any later version
  14. *
  15. * Kamailio is distributed in the hope that it will be useful,
  16. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  18. * GNU General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU General Public License
  21. * along with this program; if not, write to the Free Software
  22. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  23. *
  24. */
  25. /*!
  26. * \file
  27. * \brief SIP-router enum :: Enum and E164 related functions (module interface)
  28. * \ingroup enum
  29. * Module: \ref enum
  30. */
  31. /*! \defgroup enum Enum and E.164-related functions
  32. * Enum module implements [i_]enum_query functions that make an enum query
  33. * based on the user part of the current Request-URI. These functions
  34. * assume that the Request URI user part consists of an international
  35. * phone number of the form +decimal-digits, where the number of digits is
  36. * at least 2 and at most 15. Out of this number enum_query forms a domain
  37. * name, where the digits are in reverse order and separated by dots
  38. * followed by domain suffix that by default is "e164.arpa.". For example,
  39. * if the user part is +35831234567, the domain name will be
  40. * "7.6.5.4.3.2.1.3.8.5.3.e164.arpa.". i_enum_query operates in a similar
  41. * fashion. The only difference is that it adds a label (default "i") to
  42. * branch off from the default, user-ENUM tree to an infrastructure ENUM
  43. * tree.
  44. */
  45. #include <stdlib.h>
  46. #include "enum.h"
  47. #include "../../parser/parse_uri.h"
  48. #include "../../parser/parse_from.h"
  49. #include "../../ut.h"
  50. #include "../../resolve.h"
  51. #include "../../mem/mem.h"
  52. #include "../../dset.h"
  53. #include "../../qvalue.h"
  54. #include "enum_mod.h"
  55. #include "../../lib/kcore/regexp.h"
  56. #include "../../lib/kcore/parser_helpers.h"
  57. #include "../../pvar.h"
  58. /*
  59. * Input: E.164 number w/o leading +
  60. *
  61. * Output: number of digits in the country code
  62. * 0 on invalid number
  63. *
  64. * convention:
  65. * 3 digits is the default length of a country code.
  66. * country codes 1 and 7 are a single digit.
  67. * the following country codes are two digits: 20, 27, 30-34, 36, 39,
  68. * 40, 41, 43-49, 51-58, 60-66, 81, 82, 84, 86, 90-95, 98.
  69. */
  70. static int cclen(const char *number)
  71. {
  72. char d1,d2;
  73. if (!number || (strlen(number) < 3))
  74. return(0);
  75. d1 = number[0];
  76. d2 = number[1];
  77. if (!isdigit((int)d2))
  78. return(0);
  79. switch(d1) {
  80. case '1':
  81. case '7':
  82. return(1);
  83. case '2':
  84. if ((d2 == '0') || (d1 == '7'))
  85. return(2);
  86. break;
  87. case '3':
  88. if ((d2 >= '0') && (d1 <= '4'))
  89. return(2);
  90. if ((d2 == '6') || (d1 == '9'))
  91. return(2);
  92. break;
  93. case '4':
  94. if (d2 != '2')
  95. return(2);
  96. break;
  97. case '5':
  98. if ((d2 >= '1') && (d1 <= '8'))
  99. return(2);
  100. break;
  101. case '6':
  102. if (d1 <= '6')
  103. return(2);
  104. break;
  105. case '8':
  106. if ((d2 == '1') || (d1 == '2') || (d1 == '4') || (d1 == '6'))
  107. return(2);
  108. break;
  109. case '9':
  110. if (d1 <= '5')
  111. return(2);
  112. if (d2 == '8')
  113. return(2);
  114. break;
  115. default:
  116. return(0);
  117. }
  118. return(3);
  119. }
  120. /* return the length of the string until c, if not found returns n */
  121. static inline int findchr(char* p, int c, unsigned int size)
  122. {
  123. int len=0;
  124. for(;len<size;p++){
  125. if (*p==(unsigned char)c) {
  126. return len;
  127. }
  128. len++;
  129. }
  130. return len;
  131. }
  132. /* Parse NAPTR regexp field of the form !pattern!replacement! and return its
  133. * components in pattern and replacement parameters. Regexp field starts at
  134. * address first and is len characters long.
  135. */
  136. static inline int parse_naptr_regexp(char* first, int len, str* pattern,
  137. str* replacement)
  138. {
  139. char *second, *third;
  140. if (len > 0) {
  141. if (*first == '!') {
  142. second = (char *)memchr((void *)(first + 1), '!', len - 1);
  143. if (second) {
  144. len = len - (second - first + 1);
  145. if (len > 0) {
  146. third = memchr(second + 1, '!', len);
  147. if (third) {
  148. pattern->len = second - first - 1;
  149. pattern->s = first + 1;
  150. replacement->len = third - second - 1;
  151. replacement->s = second + 1;
  152. return 1;
  153. } else {
  154. LM_ERR("Third ! missing from regexp\n");
  155. return -1;
  156. }
  157. } else {
  158. LM_ERR("Third ! missing from regexp\n");
  159. return -2;
  160. }
  161. } else {
  162. LM_ERR("Second ! missing from regexp\n");
  163. return -3;
  164. }
  165. } else {
  166. LM_ERR("First ! missing from regexp\n");
  167. return -4;
  168. }
  169. } else {
  170. LM_ERR("Regexp missing\n");
  171. return -5;
  172. }
  173. }
  174. /* Checks if NAPTR record has flag u and its services field
  175. * e2u+[service:]sip or
  176. * e2u+service[+service[+service[+...]]]
  177. */
  178. static inline int sip_match( struct naptr_rdata* naptr, str* service)
  179. {
  180. if (service->len == 0) {
  181. return (naptr->flags_len == 1) &&
  182. ((naptr->flags[0] == 'u') || (naptr->flags[0] == 'U')) &&
  183. (naptr->services_len == 7) &&
  184. ((strncasecmp(naptr->services, "e2u+sip", 7) == 0) ||
  185. (strncasecmp(naptr->services, "sip+e2u", 7) == 0));
  186. } else if (service->s[0] != '+') {
  187. return (naptr->flags_len == 1) &&
  188. ((naptr->flags[0] == 'u') || (naptr->flags[0] == 'U')) &&
  189. (naptr->services_len == service->len + 8) &&
  190. (strncasecmp(naptr->services, "e2u+", 4) == 0) &&
  191. (strncasecmp(naptr->services + 4, service->s, service->len) == 0) &&
  192. (strncasecmp(naptr->services + 4 + service->len, ":sip", 4) == 0);
  193. } else { /* handle compound NAPTRs and multiple services */
  194. str bakservice, baknaptr; /* we bakup the str */
  195. int naptrlen, len; /* length of the extracted service */
  196. /* RFC 3761, NAPTR service field must start with E2U+ */
  197. if (strncasecmp(naptr->services, "e2u+", 4) != 0) {
  198. return 0;
  199. }
  200. baknaptr.s = naptr->services + 4; /* leading 'e2u+' */
  201. baknaptr.len = naptr->services_len - 4;
  202. for (;;) { /* iterate over services in NAPTR */
  203. bakservice.s = service->s + 1; /* leading '+' */
  204. bakservice.len = service->len - 1;
  205. naptrlen = findchr(baknaptr.s,'+',baknaptr.len);
  206. for (;;) { /* iterate over services in enum_query */
  207. len = findchr(bakservice.s,'+',bakservice.len);
  208. if ((naptrlen == len ) && !strncasecmp(baknaptr.s, bakservice.s, len)){
  209. return 1;
  210. }
  211. if ( (bakservice.len -= len+1) > 0) {
  212. bakservice.s += len+1;
  213. continue;
  214. }
  215. break;
  216. }
  217. if ( (baknaptr.len -= naptrlen+1) > 0) {
  218. baknaptr.s += naptrlen+1;
  219. continue;
  220. }
  221. break;
  222. }
  223. /* no matching service found */
  224. return 0;
  225. }
  226. }
  227. /*
  228. * Checks if argument is an e164 number starting with +
  229. */
  230. static inline int is_e164(str* _user)
  231. {
  232. int i;
  233. char c;
  234. if ((_user->len > 2) && (_user->len < 17) && ((_user->s)[0] == '+')) {
  235. for (i = 1; i < _user->len; i++) {
  236. c = (_user->s)[i];
  237. if ((c < '0') || (c > '9')) return -1;
  238. }
  239. return 1;
  240. } else {
  241. return -1;
  242. }
  243. }
  244. /*
  245. * Call is_from_user_enum_2 with module parameter suffix and default service.
  246. */
  247. int is_from_user_enum_0(struct sip_msg* _msg, char* _str1, char* _str2)
  248. {
  249. return is_from_user_enum_2(_msg, (char *)(&suffix), (char *)(&service));
  250. }
  251. /*
  252. * Call is_from_user_enum_2 with given suffix and default service.
  253. */
  254. int is_from_user_enum_1(struct sip_msg* _msg, char* _suffix, char* _str2)
  255. {
  256. return is_from_user_enum_2(_msg, _suffix, (char *)(&service));
  257. }
  258. /*
  259. * Check if from user is a valid enum based user, and check to make sure
  260. * that the src_ip == an srv record that maps to the enum from user.
  261. */
  262. int is_from_user_enum_2(struct sip_msg* _msg, char* _suffix, char* _service)
  263. {
  264. struct ip_addr addr;
  265. struct hostent* he;
  266. unsigned short zp;
  267. char proto;
  268. char *user_s;
  269. int user_len, i, j;
  270. char name[MAX_DOMAIN_SIZE];
  271. char uri[MAX_URI_SIZE];
  272. struct sip_uri *furi;
  273. struct sip_uri luri;
  274. struct rdata* head;
  275. str* suffix;
  276. str* service;
  277. struct rdata* l;
  278. struct naptr_rdata* naptr;
  279. str pattern, replacement, result;
  280. char string[17];
  281. if (parse_from_header(_msg) < 0) {
  282. LM_ERR("Failed to parse From header\n");
  283. return -1;
  284. }
  285. if(_msg->from==NULL || get_from(_msg)==NULL) {
  286. LM_DBG("No From header\n");
  287. return -1;
  288. }
  289. if ((furi = parse_from_uri(_msg)) == NULL) {
  290. LM_ERR("Failed to parse From URI\n");
  291. return -1;
  292. }
  293. suffix = (str*)_suffix;
  294. service = (str*)_service;
  295. if (is_e164(&(furi->user)) == -1) {
  296. LM_ERR("From URI user is not an E164 number\n");
  297. return -1;
  298. }
  299. /* assert: the from user is a valid formatted e164 string */
  300. user_s = furi->user.s;
  301. user_len = furi->user.len;
  302. j = 0;
  303. for (i = user_len - 1; i > 0; i--) {
  304. name[j] = user_s[i];
  305. name[j + 1] = '.';
  306. j = j + 2;
  307. }
  308. memcpy(name + j, suffix->s, suffix->len + 1);
  309. head = get_record(name, T_NAPTR, RES_ONLY_TYPE);
  310. if (head == 0) {
  311. LM_DBG("No NAPTR record found for %s.\n", name);
  312. return -3;
  313. }
  314. /* we have the naptr records, loop and find an srv record with */
  315. /* same ip address as source ip address, if we do then true is returned */
  316. for (l = head; l; l = l->next) {
  317. if (l->type != T_NAPTR) continue; /*should never happen*/
  318. naptr = (struct naptr_rdata*)l->rdata;
  319. if (naptr == 0) {
  320. LM_ERR("Null rdata in DNS response\n");
  321. free_rdata_list(head);
  322. return -4;
  323. }
  324. LM_DBG("ENUM query on %s: order %u, pref %u, flen %u, flags "
  325. "'%.*s', slen %u, services '%.*s', rlen %u, "
  326. "regexp '%.*s'\n",
  327. name, naptr->order, naptr->pref,
  328. naptr->flags_len, (int)(naptr->flags_len), ZSW(naptr->flags), naptr->services_len,
  329. (int)(naptr->services_len), ZSW(naptr->services), naptr->regexp_len,
  330. (int)(naptr->regexp_len), ZSW(naptr->regexp));
  331. if (sip_match(naptr, service) != 0) {
  332. if (parse_naptr_regexp(&(naptr->regexp[0]), naptr->regexp_len,
  333. &pattern, &replacement) < 0) {
  334. free_rdata_list(head); /*clean up*/
  335. LM_ERR("Parsing of NAPTR regexp failed\n");
  336. return -5;
  337. }
  338. #ifdef LATER
  339. if ((pattern.len == 4) && (strncmp(pattern.s, "^.*$", 4) == 0)) {
  340. LM_DBG("Resulted in replacement: '%.*s'\n",
  341. replacement.len, ZSW(replacement.s));
  342. retval = set_uri(_msg, replacement.s, replacement.len);
  343. free_rdata_list(head); /*clean up*/
  344. return retval;
  345. }
  346. #endif
  347. result.s = &(uri[0]);
  348. result.len = MAX_URI_SIZE;
  349. /* Avoid making copies of pattern and replacement */
  350. pattern.s[pattern.len] = (char)0;
  351. replacement.s[replacement.len] = (char)0;
  352. /* We have already checked the size of
  353. _msg->parsed_uri.user.s */
  354. memcpy(&(string[0]), user_s, user_len);
  355. string[user_len] = (char)0;
  356. if (reg_replace(pattern.s, replacement.s, &(string[0]),
  357. &result) < 0) {
  358. pattern.s[pattern.len] = '!';
  359. replacement.s[replacement.len] = '!';
  360. LM_ERR("Regexp replace failed\n");
  361. free_rdata_list(head); /*clean up*/
  362. return -6;
  363. }
  364. LM_DBG("Resulted in replacement: '%.*s'\n",
  365. result.len, ZSW(result.s));
  366. if(parse_uri(result.s, result.len, &luri) < 0)
  367. {
  368. LM_ERR("Parsing of URI <%.*s> failed\n",
  369. result.len, result.s);
  370. free_rdata_list(head); /*clean up*/
  371. return -7;
  372. }
  373. pattern.s[pattern.len] = '!';
  374. replacement.s[replacement.len] = '!';
  375. zp = 0;
  376. proto = PROTO_NONE;
  377. he = sip_resolvehost(&luri.host, &zp, &proto);
  378. hostent2ip_addr(&addr, he, 0);
  379. if(ip_addr_cmp(&addr, &_msg->rcv.src_ip))
  380. {
  381. free_rdata_list(head);
  382. return(1);
  383. }
  384. }
  385. }
  386. free_rdata_list(head); /*clean up*/
  387. LM_DBG("FAIL\n");
  388. /* must not have found the record */
  389. return(-8);
  390. }
  391. /*
  392. * Add parameter to URI.
  393. */
  394. int add_uri_param(str *uri, str *param, str *new_uri)
  395. {
  396. struct sip_uri puri;
  397. char *at;
  398. if (parse_uri(uri->s, uri->len, &puri) < 0) {
  399. return 0;
  400. }
  401. /* if current uri has no headers, pad param to the end of uri */
  402. if (puri.headers.len == 0) {
  403. memcpy(uri->s + uri->len, param->s, param->len);
  404. uri->len = uri->len + param->len;
  405. new_uri->len = 0;
  406. return 1;
  407. }
  408. /* otherwise take the long path and create new_uri */
  409. at = new_uri->s;
  410. switch (puri.type) {
  411. case SIP_URI_T:
  412. memcpy(at, "sip:", 4);
  413. at = at + 4;
  414. break;
  415. case SIPS_URI_T:
  416. memcpy(at, "sips:", 5);
  417. at = at + 5;
  418. break;
  419. case TEL_URI_T:
  420. memcpy(at, "tel:", 4);
  421. at = at + 4;
  422. break;
  423. case TELS_URI_T:
  424. memcpy(at, "tels:", 5);
  425. at = at + 5;
  426. break;
  427. default:
  428. LM_ERR("Unknown URI scheme <%d>\n", puri.type);
  429. return 0;
  430. }
  431. if (puri.user.len) {
  432. memcpy(at, puri.user.s, puri.user.len);
  433. at = at + puri.user.len;
  434. if (puri.passwd.len) {
  435. *at = ':';
  436. at = at + 1;
  437. memcpy(at, puri.passwd.s, puri.passwd.len);
  438. at = at + puri.passwd.len;
  439. };
  440. *at = '@';
  441. at = at + 1;
  442. }
  443. memcpy(at, puri.host.s, puri.host.len);
  444. at = at + puri.host.len;
  445. if (puri.port.len) {
  446. *at = ':';
  447. at = at + 1;
  448. memcpy(at, puri.port.s, puri.port.len);
  449. at = at + puri.port.len;
  450. }
  451. if (puri.params.len) {
  452. *at = ';';
  453. at = at + 1;
  454. memcpy(at, puri.params.s, puri.params.len);
  455. at = at + puri.params.len;
  456. }
  457. memcpy(at, param->s, param->len);
  458. at = at + param->len;
  459. *at = '?';
  460. at = at + 1;
  461. memcpy(at, puri.headers.s, puri.headers.len);
  462. at = at + puri.headers.len;
  463. new_uri->len = at - new_uri->s;
  464. return 1;
  465. }
  466. /*
  467. * Tests if one result record is "greater" that the other. Non-NAPTR records
  468. * greater that NAPTR record. An invalid NAPTR record is greater than a
  469. * valid one. Valid NAPTR records are compared based on their
  470. * (order,preference).
  471. */
  472. static inline int naptr_greater(struct rdata* a, struct rdata* b)
  473. {
  474. struct naptr_rdata *na, *nb;
  475. if (a->type != T_NAPTR) return 1;
  476. if (b->type != T_NAPTR) return 0;
  477. na = (struct naptr_rdata*)a->rdata;
  478. if (na == 0) return 1;
  479. nb = (struct naptr_rdata*)b->rdata;
  480. if (nb == 0) return 0;
  481. return (((na->order) << 16) + na->pref) >
  482. (((nb->order) << 16) + nb->pref);
  483. }
  484. /*
  485. * Bubble sorts result record list according to naptr (order,preference).
  486. */
  487. static inline void naptr_sort(struct rdata** head)
  488. {
  489. struct rdata *p, *q, *r, *s, *temp, *start;
  490. /* r precedes p and s points to the node up to which comparisons
  491. are to be made */
  492. s = NULL;
  493. start = *head;
  494. while ( s != start -> next ) {
  495. r = p = start ;
  496. q = p -> next ;
  497. while ( p != s ) {
  498. if ( naptr_greater(p, q) ) {
  499. if ( p == start ) {
  500. temp = q -> next ;
  501. q -> next = p ;
  502. p -> next = temp ;
  503. start = q ;
  504. r = q ;
  505. } else {
  506. temp = q -> next ;
  507. q -> next = p ;
  508. p -> next = temp ;
  509. r -> next = q ;
  510. r = q ;
  511. }
  512. } else {
  513. r = p ;
  514. p = p -> next ;
  515. }
  516. q = p -> next ;
  517. if ( q == s ) s = p ;
  518. }
  519. }
  520. *head = start;
  521. }
  522. /*
  523. * Makes enum query on name. On success, rewrites user part and
  524. * replaces Request-URI.
  525. */
  526. int do_query(struct sip_msg* _msg, char *user, char *name, str *service) {
  527. char uri[MAX_URI_SIZE];
  528. char new_uri[MAX_URI_SIZE];
  529. unsigned int priority, curr_prio, first;
  530. qvalue_t q;
  531. struct rdata* head;
  532. struct rdata* l;
  533. struct naptr_rdata* naptr;
  534. str pattern, replacement, result, new_result;
  535. head = get_record(name, T_NAPTR, RES_ONLY_TYPE);
  536. if (head == 0) {
  537. LM_DBG("No NAPTR record found for %s.\n", name);
  538. return -1;
  539. }
  540. naptr_sort(&head);
  541. q = MAX_Q - 10;
  542. curr_prio = 0;
  543. first = 1;
  544. for (l = head; l; l = l->next) {
  545. if (l->type != T_NAPTR) continue; /*should never happen*/
  546. naptr = (struct naptr_rdata*)l->rdata;
  547. if (naptr == 0) {
  548. LM_ERR("Null rdata in DNS response\n");
  549. continue;
  550. }
  551. LM_DBG("ENUM query on %s: order %u, pref %u, flen %u, flags '%.*s', "
  552. "slen %u, services '%.*s', rlen %u, regexp '%.*s'\n",
  553. name, naptr->order, naptr->pref,
  554. naptr->flags_len, (int)(naptr->flags_len), ZSW(naptr->flags),
  555. naptr->services_len,
  556. (int)(naptr->services_len), ZSW(naptr->services), naptr->regexp_len,
  557. (int)(naptr->regexp_len), ZSW(naptr->regexp));
  558. if (sip_match(naptr, service) == 0) continue;
  559. if (parse_naptr_regexp(&(naptr->regexp[0]), naptr->regexp_len,
  560. &pattern, &replacement) < 0) {
  561. LM_ERR("Parsing of NAPTR regexp failed\n");
  562. continue;
  563. }
  564. result.s = &(uri[0]);
  565. result.len = MAX_URI_SIZE;
  566. /* Avoid making copies of pattern and replacement */
  567. pattern.s[pattern.len] = (char)0;
  568. replacement.s[replacement.len] = (char)0;
  569. if (reg_replace(pattern.s, replacement.s, user, &result) < 0) {
  570. pattern.s[pattern.len] = '!';
  571. replacement.s[replacement.len] = '!';
  572. LM_ERR("Regexp replace failed\n");
  573. continue;
  574. }
  575. LM_DBG("Resulted in replacement: '%.*s'\n", result.len, ZSW(result.s));
  576. pattern.s[pattern.len] = '!';
  577. replacement.s[replacement.len] = '!';
  578. if (param.len > 0) {
  579. if (result.len + param.len > MAX_URI_SIZE - 1) {
  580. LM_ERR("URI is too long\n");
  581. continue;
  582. }
  583. new_result.s = &(new_uri[0]);
  584. new_result.len = MAX_URI_SIZE;
  585. if (add_uri_param(&result, &param, &new_result) == 0) {
  586. LM_ERR("Parsing of URI <%.*s> failed\n",
  587. result.len, result.s);
  588. continue;
  589. }
  590. if (new_result.len > 0) {
  591. result = new_result;
  592. }
  593. }
  594. if (first) {
  595. if (rewrite_uri(_msg, &result) == -1) {
  596. goto done;
  597. }
  598. set_ruri_q(q);
  599. first = 0;
  600. curr_prio = ((naptr->order) << 16) + naptr->pref;
  601. } else {
  602. priority = ((naptr->order) << 16) + naptr->pref;
  603. if (priority > curr_prio) {
  604. q = q - 10;
  605. curr_prio = priority;
  606. }
  607. if (append_branch(_msg, &result, 0, 0, q, 0, 0) == -1) {
  608. goto done;
  609. }
  610. }
  611. }
  612. done:
  613. free_rdata_list(head);
  614. return first ? -1 : 1;
  615. }
  616. /*
  617. * Call enum_query_2 with module parameter suffix and default service.
  618. */
  619. int enum_query_0(struct sip_msg* _msg, char* _str1, char* _str2)
  620. {
  621. return enum_query_2(_msg, (char *)(&suffix), (char *)(&service));
  622. }
  623. /*
  624. * Call enum_query_2 with given suffix and default service.
  625. */
  626. int enum_query_1(struct sip_msg* _msg, char* _suffix, char* _str2)
  627. {
  628. return enum_query_2(_msg, _suffix, (char *)(&service));
  629. }
  630. /*
  631. * See documentation in README file.
  632. */
  633. int enum_query_2(struct sip_msg* _msg, char* _suffix, char* _service)
  634. {
  635. char *user_s;
  636. int user_len, i, j;
  637. char name[MAX_DOMAIN_SIZE];
  638. char string[17];
  639. str *suffix, *service;
  640. suffix = (str*)_suffix;
  641. service = (str*)_service;
  642. if (parse_sip_msg_uri(_msg) < 0) {
  643. LM_ERR("Parsing of R-URI failed\n");
  644. return -1;
  645. }
  646. if (is_e164(&(_msg->parsed_uri.user)) == -1) {
  647. LM_ERR("R-URI user is not an E164 number\n");
  648. return -1;
  649. }
  650. user_s = _msg->parsed_uri.user.s;
  651. user_len = _msg->parsed_uri.user.len;
  652. memcpy(&(string[0]), user_s, user_len);
  653. string[user_len] = (char)0;
  654. j = 0;
  655. for (i = user_len - 1; i > 0; i--) {
  656. name[j] = user_s[i];
  657. name[j + 1] = '.';
  658. j = j + 2;
  659. }
  660. memcpy(name + j, suffix->s, suffix->len + 1);
  661. return do_query(_msg, string, name, service);
  662. }
  663. /*********** INFRASTRUCTURE ENUM ***************/
  664. /*
  665. * Call enum_query_2 with default suffix and service.
  666. */
  667. int i_enum_query_0(struct sip_msg* _msg, char* _suffix, char* _service)
  668. {
  669. return i_enum_query_2(_msg, (char *)(&i_suffix), (char *)(&service));
  670. }
  671. /*
  672. * Call enum_query_2 with given suffix and default service.
  673. */
  674. int i_enum_query_1(struct sip_msg* _msg, char* _suffix, char* _service)
  675. {
  676. return i_enum_query_2(_msg, _suffix, (char *)(&service));
  677. }
  678. int i_enum_query_2(struct sip_msg* _msg, char* _suffix, char* _service)
  679. {
  680. char *user_s;
  681. int user_len, i, j;
  682. char name[MAX_DOMAIN_SIZE];
  683. char apex[MAX_COMPONENT_SIZE + 1];
  684. char separator[MAX_COMPONENT_SIZE + 1];
  685. int sdl = 0; /* subdomain location: infrastructure enum offset */
  686. int cc_len;
  687. struct rdata* head;
  688. char string[17];
  689. str *suffix, *service;
  690. suffix = (str*)_suffix;
  691. service = (str*)_service;
  692. if (parse_sip_msg_uri(_msg) < 0) {
  693. LM_ERR("Parsing of R-URI failed\n");
  694. return -1;
  695. }
  696. if (is_e164(&(_msg->parsed_uri.user)) == -1) {
  697. LM_ERR("R-URI user is not an E164 number\n");
  698. return -1;
  699. }
  700. user_s = _msg->parsed_uri.user.s;
  701. user_len = _msg->parsed_uri.user.len;
  702. /* make sure we don't run out of space in strings */
  703. if (( 2*user_len + MAX_COMPONENT_SIZE + MAX_COMPONENT_SIZE + 4) > MAX_DOMAIN_SIZE) {
  704. LM_ERR("Strings too long\n");
  705. return -1;
  706. }
  707. if ( i_branchlabel.len > MAX_COMPONENT_SIZE ) {
  708. LM_ERR("i_branchlabel too long\n");
  709. return -1;
  710. }
  711. if ( suffix->len > MAX_COMPONENT_SIZE ) {
  712. LM_ERR("Suffix too long\n");
  713. return -1;
  714. }
  715. memcpy(&(string[0]), user_s, user_len);
  716. string[user_len] = (char)0;
  717. /* Set up parameters as for user-enum */
  718. memcpy(apex, suffix->s , suffix->len);
  719. apex[suffix->len] = (char)0;
  720. sdl = 0; /* where to insert i-enum separator */
  721. separator[0] = 0; /* don't insert anything */
  722. cc_len = cclen(string + 1);
  723. if (!strncasecmp(i_bl_alg.s,"ebl",i_bl_alg.len)) {
  724. sdl = cc_len; /* default */
  725. j = 0;
  726. memcpy(name, i_branchlabel.s, i_branchlabel.len);
  727. j += i_branchlabel.len;
  728. name[j++] = '.';
  729. for (i = cc_len ; i > 0; i--) {
  730. name[j++] = user_s[i];
  731. name[j++] = '.';
  732. }
  733. memcpy(name + j, suffix->s, suffix->len + 1);
  734. LM_DBG("Looking for EBL record for %s.\n", name);
  735. head = get_record(name, T_EBL, RES_ONLY_TYPE);
  736. if (head == 0) {
  737. LM_DBG("No EBL found for %s. Defaulting to user ENUM.\n",name);
  738. } else {
  739. struct ebl_rdata* ebl;
  740. ebl = (struct ebl_rdata *) head->rdata;
  741. LM_DBG("EBL record for %s is %d / %.*s / %.*s.\n",
  742. name, ebl->position, (int)ebl->separator_len,
  743. ebl->separator,(int)ebl->apex_len, ebl->apex);
  744. if ((ebl->apex_len > MAX_COMPONENT_SIZE) || (ebl->separator_len > MAX_COMPONENT_SIZE)) {
  745. LM_ERR("EBL strings too long\n");
  746. return -1;
  747. }
  748. if (ebl->position > 15) {
  749. LM_ERR("EBL position too large (%d)\n",
  750. ebl->position);
  751. return -1;
  752. }
  753. sdl = ebl->position;
  754. memcpy(separator, ebl->separator, ebl->separator_len);
  755. separator[ebl->separator_len] = 0;
  756. memcpy(apex, ebl->apex, ebl->apex_len);
  757. apex[ebl->apex_len] = 0;
  758. free_rdata_list(head);
  759. }
  760. } else if (!strncasecmp(i_bl_alg.s,"txt",i_bl_alg.len)) {
  761. sdl = cc_len; /* default */
  762. memcpy(separator, i_branchlabel.s, i_branchlabel.len);
  763. separator[i_branchlabel.len] = 0;
  764. /* no change to apex */
  765. j = 0;
  766. memcpy(name, i_branchlabel.s, i_branchlabel.len);
  767. j += i_branchlabel.len;
  768. name[j++] = '.';
  769. for (i = cc_len ; i > 0; i--) {
  770. name[j++] = user_s[i];
  771. name[j++] = '.';
  772. }
  773. memcpy(name + j, suffix->s, suffix->len + 1);
  774. head = get_record(name, T_TXT, RES_ONLY_TYPE);
  775. if (head == 0) {
  776. LM_DBG("TXT found for %s. Defaulting to %d\n",
  777. name, cc_len);
  778. } else {
  779. sdl = atoi(((struct txt_rdata*)head->rdata)->txt[0].cstr);
  780. LM_DBG("TXT record for %s is %d.\n", name, sdl);
  781. if ((sdl < 0) || (sdl > 10)) {
  782. LM_ERR("Sdl %d out of bounds. Set back to cc_len.\n", sdl);
  783. sdl = cc_len;
  784. }
  785. free_rdata_list(head);
  786. }
  787. } else { /* defaults to CC */
  788. sdl = cc_len;
  789. memcpy(separator, i_branchlabel.s, i_branchlabel.len);
  790. separator[i_branchlabel.len] = 0;
  791. /* no change to apex */
  792. }
  793. j = 0;
  794. sdl++; /* to avoid comparing i to (sdl+1) */
  795. for (i = user_len - 1; i > 0; i--) {
  796. name[j] = user_s[i];
  797. name[j + 1] = '.';
  798. j = j + 2;
  799. if (separator[0] && (i == sdl)) { /* insert the I-ENUM separator here? */
  800. strcpy(name + j, separator); /* we've checked string sizes. */
  801. j += strlen(separator);
  802. name[j++] = '.';
  803. }
  804. }
  805. memcpy(name + j, apex, strlen(apex)+1);
  806. return do_query(_msg, string, name, service);
  807. }
  808. /******************* FQUERY *******************/
  809. /*
  810. * Call enum_pv_query_3 with pv arg, module parameter suffix,
  811. * and default service.
  812. */
  813. int enum_pv_query_1(struct sip_msg* _msg, char* _sp)
  814. {
  815. return enum_pv_query_3(_msg, _sp, (char *)(&suffix), (char *)(&service));
  816. }
  817. /*
  818. * Call enum_pv_query_3 with pv and suffix args and default service.
  819. */
  820. int enum_pv_query_2(struct sip_msg* _msg, char* _sp, char* _suffix)
  821. {
  822. return enum_pv_query_3(_msg, _sp, _suffix, (char *)(&service));
  823. }
  824. /*
  825. * See documentation in README file.
  826. */
  827. int enum_pv_query_3(struct sip_msg* _msg, char* _sp, char* _suffix,
  828. char* _service)
  829. {
  830. char *user_s;
  831. int user_len, i, j, first;
  832. char name[MAX_DOMAIN_SIZE];
  833. char uri[MAX_URI_SIZE];
  834. char new_uri[MAX_URI_SIZE];
  835. unsigned int priority, curr_prio;
  836. qvalue_t q;
  837. char tostring[17];
  838. struct rdata* head;
  839. struct rdata* l;
  840. struct naptr_rdata* naptr;
  841. str pattern, replacement, result, new_result;
  842. str *suffix, *service;
  843. char string[17];
  844. pv_spec_t *sp;
  845. pv_value_t pv_val;
  846. sp = (pv_spec_t *)_sp;
  847. suffix = (str*)_suffix;
  848. service = (str*)_service;
  849. /*
  850. * Get R-URI user to tostring
  851. */
  852. if (parse_sip_msg_uri(_msg) < 0) {
  853. LM_ERR("R-URI parsing failed\n");
  854. return -1;
  855. }
  856. if (is_e164(&(_msg->parsed_uri.user)) == -1) {
  857. LM_ERR("R-URI user is not an E164 number\n");
  858. return -1;
  859. }
  860. user_s = _msg->parsed_uri.user.s;
  861. user_len = _msg->parsed_uri.user.len;
  862. memcpy(&(tostring[0]), user_s, user_len);
  863. tostring[user_len] = (char)0;
  864. /*
  865. * Get E.164 number from pseudo variable
  866. */
  867. if (sp && (pv_get_spec_value(_msg, sp, &pv_val) == 0)) {
  868. if (pv_val.flags & PV_VAL_STR) {
  869. if (pv_val.rs.len == 0 || pv_val.rs.s == NULL) {
  870. LM_DBG("Missing E.164 number\n");
  871. return -1;
  872. }
  873. } else {
  874. LM_DBG("Pseudo variable value is not string\n");
  875. return -1;
  876. }
  877. } else {
  878. LM_DBG("Cannot get pseudo variable value\n");
  879. return -1;
  880. }
  881. if (is_e164(&(pv_val.rs)) == -1) {
  882. LM_ERR("pseudo variable does not contain an E164 number\n");
  883. return -1;
  884. }
  885. user_s = pv_val.rs.s;
  886. user_len = pv_val.rs.len;
  887. memcpy(&(string[0]), user_s, user_len);
  888. string[user_len] = (char)0;
  889. j = 0;
  890. for (i = user_len - 1; i > 0; i--) {
  891. name[j] = user_s[i];
  892. name[j + 1] = '.';
  893. j = j + 2;
  894. }
  895. memcpy(name + j, suffix->s, suffix->len + 1);
  896. head = get_record(name, T_NAPTR, RES_ONLY_TYPE);
  897. if (head == 0) {
  898. LM_DBG("No NAPTR record found for %s.\n", name);
  899. return -1;
  900. }
  901. naptr_sort(&head);
  902. q = MAX_Q - 10;
  903. curr_prio = 0;
  904. first = 1;
  905. for (l = head; l; l = l->next) {
  906. if (l->type != T_NAPTR) continue; /*should never happen*/
  907. naptr = (struct naptr_rdata*)l->rdata;
  908. if (naptr == 0) {
  909. LM_ERR("Null rdata in DNS response\n");
  910. continue;
  911. }
  912. LM_DBG("ENUM query on %s: order %u, pref %u, flen %u, flags "
  913. "'%.*s', slen %u, services '%.*s', rlen %u, "
  914. "regexp '%.*s'\n",
  915. name, naptr->order, naptr->pref,
  916. naptr->flags_len, (int)(naptr->flags_len), ZSW(naptr->flags),
  917. naptr->services_len,
  918. (int)(naptr->services_len), ZSW(naptr->services), naptr->regexp_len,
  919. (int)(naptr->regexp_len), ZSW(naptr->regexp));
  920. if (sip_match(naptr, service) == 0) continue;
  921. if (parse_naptr_regexp(&(naptr->regexp[0]), naptr->regexp_len,
  922. &pattern, &replacement) < 0) {
  923. LM_ERR("Parsing of NAPTR regexp failed\n");
  924. continue;
  925. }
  926. result.s = &(uri[0]);
  927. result.len = MAX_URI_SIZE;
  928. /* Avoid making copies of pattern and replacement */
  929. pattern.s[pattern.len] = (char)0;
  930. replacement.s[replacement.len] = (char)0;
  931. if (reg_replace(pattern.s, replacement.s, &(tostring[0]),
  932. &result) < 0) {
  933. pattern.s[pattern.len] = '!';
  934. replacement.s[replacement.len] = '!';
  935. LM_ERR("Regexp replace failed\n");
  936. continue;
  937. }
  938. LM_DBG("Resulted in replacement: '%.*s'\n",
  939. result.len, ZSW(result.s));
  940. pattern.s[pattern.len] = '!';
  941. replacement.s[replacement.len] = '!';
  942. if (param.len > 0) {
  943. if (result.len + param.len > MAX_URI_SIZE - 1) {
  944. LM_ERR("URI is too long\n");
  945. continue;
  946. }
  947. new_result.s = &(new_uri[0]);
  948. new_result.len = MAX_URI_SIZE;
  949. if (add_uri_param(&result, &param, &new_result) == 0) {
  950. LM_ERR("Parsing of URI <%.*s> failed\n",
  951. result.len, result.s);
  952. continue;
  953. }
  954. if (new_result.len > 0) {
  955. result = new_result;
  956. }
  957. }
  958. if (first) {
  959. if (rewrite_uri(_msg, &result) == -1) {
  960. goto done;
  961. }
  962. set_ruri_q(q);
  963. first = 0;
  964. curr_prio = ((naptr->order) << 16) + naptr->pref;
  965. } else {
  966. priority = ((naptr->order) << 16) + naptr->pref;
  967. if (priority > curr_prio) {
  968. q = q - 10;
  969. curr_prio = priority;
  970. }
  971. if (append_branch(_msg, &result, 0, 0, q, 0, 0) == -1) {
  972. goto done;
  973. }
  974. }
  975. }
  976. done:
  977. free_rdata_list(head);
  978. return first ? -1 : 1;
  979. }