enum.c 28 KB

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