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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 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 "../../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 < MAX_NUM_LEN) && ((_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[MAX_NUM_LEN];
  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, 0, 0, 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(_msg, &suffix, &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. str suffix;
  629. if (get_str_fparam(&suffix, _msg, (fparam_t*)_suffix) != 0) {
  630. LM_ERR("unable to get suffix\n");
  631. return -1;
  632. }
  633. return enum_query(_msg, &suffix, &service);
  634. }
  635. /*
  636. * Call enum_query_2 with given suffix and service.
  637. */
  638. int enum_query_2(struct sip_msg* _msg, char* _suffix, char* _service)
  639. {
  640. str suffix, *service;
  641. if (get_str_fparam(&suffix, _msg, (fparam_t*)_suffix) != 0) {
  642. LM_ERR("unable to get suffix\n");
  643. return -1;
  644. }
  645. service = (str*)_service;
  646. if ((service == NULL) || (service->len == 0)) {
  647. LM_ERR("invalid service parameter");
  648. return -1;
  649. }
  650. return enum_query(_msg, &suffix, service);
  651. }
  652. /*
  653. * See documentation in README file.
  654. */
  655. int enum_query(struct sip_msg* _msg, str* suffix, str* service)
  656. {
  657. char *user_s;
  658. int user_len, i, j;
  659. char name[MAX_DOMAIN_SIZE];
  660. char string[MAX_NUM_LEN];
  661. LM_DBG("enum_query on suffix <%.*s> service <%.*s>\n",
  662. suffix->len, suffix->s, service->len, service->s);
  663. if (parse_sip_msg_uri(_msg) < 0) {
  664. LM_ERR("Parsing of R-URI failed\n");
  665. return -1;
  666. }
  667. if (is_e164(&(_msg->parsed_uri.user)) == -1) {
  668. LM_ERR("R-URI user is not an E164 number\n");
  669. return -1;
  670. }
  671. user_s = _msg->parsed_uri.user.s;
  672. user_len = _msg->parsed_uri.user.len;
  673. memcpy(&(string[0]), user_s, user_len);
  674. string[user_len] = (char)0;
  675. j = 0;
  676. for (i = user_len - 1; i > 0; i--) {
  677. name[j] = user_s[i];
  678. name[j + 1] = '.';
  679. j = j + 2;
  680. }
  681. memcpy(name + j, suffix->s, suffix->len + 1);
  682. return do_query(_msg, string, name, service);
  683. }
  684. /*********** INFRASTRUCTURE ENUM ***************/
  685. /*
  686. * Call enum_query_2 with default suffix and service.
  687. */
  688. int i_enum_query_0(struct sip_msg* _msg, char* _suffix, char* _service)
  689. {
  690. return i_enum_query_2(_msg, (char *)(&i_suffix), (char *)(&service));
  691. }
  692. /*
  693. * Call enum_query_2 with given suffix and default service.
  694. */
  695. int i_enum_query_1(struct sip_msg* _msg, char* _suffix, char* _service)
  696. {
  697. return i_enum_query_2(_msg, _suffix, (char *)(&service));
  698. }
  699. int i_enum_query_2(struct sip_msg* _msg, char* _suffix, char* _service)
  700. {
  701. char *user_s;
  702. int user_len, i, j;
  703. char name[MAX_DOMAIN_SIZE];
  704. char apex[MAX_COMPONENT_SIZE + 1];
  705. char separator[MAX_COMPONENT_SIZE + 1];
  706. int sdl = 0; /* subdomain location: infrastructure enum offset */
  707. int cc_len;
  708. struct rdata* head;
  709. char string[MAX_NUM_LEN];
  710. str *suffix, *service;
  711. suffix = (str*)_suffix;
  712. service = (str*)_service;
  713. if (parse_sip_msg_uri(_msg) < 0) {
  714. LM_ERR("Parsing of R-URI failed\n");
  715. return -1;
  716. }
  717. if (is_e164(&(_msg->parsed_uri.user)) == -1) {
  718. LM_ERR("R-URI user is not an E164 number\n");
  719. return -1;
  720. }
  721. user_s = _msg->parsed_uri.user.s;
  722. user_len = _msg->parsed_uri.user.len;
  723. /* make sure we don't run out of space in strings */
  724. if (( 2*user_len + MAX_COMPONENT_SIZE + MAX_COMPONENT_SIZE + 4) > MAX_DOMAIN_SIZE) {
  725. LM_ERR("Strings too long\n");
  726. return -1;
  727. }
  728. if ( i_branchlabel.len > MAX_COMPONENT_SIZE ) {
  729. LM_ERR("i_branchlabel too long\n");
  730. return -1;
  731. }
  732. if ( suffix->len > MAX_COMPONENT_SIZE ) {
  733. LM_ERR("Suffix too long\n");
  734. return -1;
  735. }
  736. memcpy(&(string[0]), user_s, user_len);
  737. string[user_len] = (char)0;
  738. /* Set up parameters as for user-enum */
  739. memcpy(apex, suffix->s , suffix->len);
  740. apex[suffix->len] = (char)0;
  741. sdl = 0; /* where to insert i-enum separator */
  742. separator[0] = 0; /* don't insert anything */
  743. cc_len = cclen(string + 1);
  744. if (!strncasecmp(i_bl_alg.s,"ebl",i_bl_alg.len)) {
  745. sdl = cc_len; /* default */
  746. j = 0;
  747. memcpy(name, i_branchlabel.s, i_branchlabel.len);
  748. j += i_branchlabel.len;
  749. name[j++] = '.';
  750. for (i = cc_len ; i > 0; i--) {
  751. name[j++] = user_s[i];
  752. name[j++] = '.';
  753. }
  754. memcpy(name + j, suffix->s, suffix->len + 1);
  755. LM_DBG("Looking for EBL record for %s.\n", name);
  756. head = get_record(name, T_EBL, RES_ONLY_TYPE);
  757. if (head == 0) {
  758. LM_DBG("No EBL found for %s. Defaulting to user ENUM.\n",name);
  759. } else {
  760. struct ebl_rdata* ebl;
  761. ebl = (struct ebl_rdata *) head->rdata;
  762. LM_DBG("EBL record for %s is %d / %.*s / %.*s.\n",
  763. name, ebl->position, (int)ebl->separator_len,
  764. ebl->separator,(int)ebl->apex_len, ebl->apex);
  765. if ((ebl->apex_len > MAX_COMPONENT_SIZE) || (ebl->separator_len > MAX_COMPONENT_SIZE)) {
  766. LM_ERR("EBL strings too long\n");
  767. return -1;
  768. }
  769. if (ebl->position > 15) {
  770. LM_ERR("EBL position too large (%d)\n",
  771. ebl->position);
  772. return -1;
  773. }
  774. sdl = ebl->position;
  775. memcpy(separator, ebl->separator, ebl->separator_len);
  776. separator[ebl->separator_len] = 0;
  777. memcpy(apex, ebl->apex, ebl->apex_len);
  778. apex[ebl->apex_len] = 0;
  779. free_rdata_list(head);
  780. }
  781. } else if (!strncasecmp(i_bl_alg.s,"txt",i_bl_alg.len)) {
  782. sdl = cc_len; /* default */
  783. memcpy(separator, i_branchlabel.s, i_branchlabel.len);
  784. separator[i_branchlabel.len] = 0;
  785. /* no change to apex */
  786. j = 0;
  787. memcpy(name, i_branchlabel.s, i_branchlabel.len);
  788. j += i_branchlabel.len;
  789. name[j++] = '.';
  790. for (i = cc_len ; i > 0; i--) {
  791. name[j++] = user_s[i];
  792. name[j++] = '.';
  793. }
  794. memcpy(name + j, suffix->s, suffix->len + 1);
  795. head = get_record(name, T_TXT, RES_ONLY_TYPE);
  796. if (head == 0) {
  797. LM_DBG("TXT found for %s. Defaulting to %d\n",
  798. name, cc_len);
  799. } else {
  800. sdl = atoi(((struct txt_rdata*)head->rdata)->txt[0].cstr);
  801. LM_DBG("TXT record for %s is %d.\n", name, sdl);
  802. if ((sdl < 0) || (sdl > 10)) {
  803. LM_ERR("Sdl %d out of bounds. Set back to cc_len.\n", sdl);
  804. sdl = cc_len;
  805. }
  806. free_rdata_list(head);
  807. }
  808. } else { /* defaults to CC */
  809. sdl = cc_len;
  810. memcpy(separator, i_branchlabel.s, i_branchlabel.len);
  811. separator[i_branchlabel.len] = 0;
  812. /* no change to apex */
  813. }
  814. j = 0;
  815. sdl++; /* to avoid comparing i to (sdl+1) */
  816. for (i = user_len - 1; i > 0; i--) {
  817. name[j] = user_s[i];
  818. name[j + 1] = '.';
  819. j = j + 2;
  820. if (separator[0] && (i == sdl)) { /* insert the I-ENUM separator here? */
  821. strcpy(name + j, separator); /* we've checked string sizes. */
  822. j += strlen(separator);
  823. name[j++] = '.';
  824. }
  825. }
  826. memcpy(name + j, apex, strlen(apex)+1);
  827. return do_query(_msg, string, name, service);
  828. }
  829. /******************* FQUERY *******************/
  830. /*
  831. * Call enum_pv_query_3 with pv arg, module parameter suffix,
  832. * and default service.
  833. */
  834. int enum_pv_query_1(struct sip_msg* _msg, char* _sp)
  835. {
  836. return enum_pv_query_3(_msg, _sp, (char *)(&suffix), (char *)(&service));
  837. }
  838. /*
  839. * Call enum_pv_query_3 with pv and suffix args and default service.
  840. */
  841. int enum_pv_query_2(struct sip_msg* _msg, char* _sp, char* _suffix)
  842. {
  843. return enum_pv_query_3(_msg, _sp, _suffix, (char *)(&service));
  844. }
  845. /*
  846. * See documentation in README file.
  847. */
  848. int enum_pv_query_3(struct sip_msg* _msg, char* _sp, char* _suffix,
  849. char* _service)
  850. {
  851. char *user_s;
  852. int user_len, i, j, first;
  853. char name[MAX_DOMAIN_SIZE];
  854. char uri[MAX_URI_SIZE];
  855. char new_uri[MAX_URI_SIZE];
  856. unsigned int priority, curr_prio;
  857. qvalue_t q;
  858. struct rdata* head;
  859. struct rdata* l;
  860. struct naptr_rdata* naptr;
  861. str pattern, replacement, result, new_result;
  862. str *suffix, *service;
  863. char string[17];
  864. pv_spec_t *sp;
  865. pv_value_t pv_val;
  866. sp = (pv_spec_t *)_sp;
  867. suffix = (str*)_suffix;
  868. service = (str*)_service;
  869. /*
  870. * Get E.164 number from pseudo variable
  871. */
  872. if (sp && (pv_get_spec_value(_msg, sp, &pv_val) == 0)) {
  873. if (pv_val.flags & PV_VAL_STR) {
  874. if (pv_val.rs.len == 0 || pv_val.rs.s == NULL) {
  875. LM_DBG("Missing E.164 number\n");
  876. return -1;
  877. }
  878. } else {
  879. LM_DBG("Pseudo variable value is not string\n");
  880. return -1;
  881. }
  882. } else {
  883. LM_DBG("Cannot get pseudo variable value\n");
  884. return -1;
  885. }
  886. if (is_e164(&(pv_val.rs)) == -1) {
  887. LM_ERR("pseudo variable does not contain an E164 number\n");
  888. return -1;
  889. }
  890. user_s = pv_val.rs.s;
  891. user_len = pv_val.rs.len;
  892. memcpy(&(string[0]), user_s, user_len);
  893. string[user_len] = (char)0;
  894. j = 0;
  895. for (i = user_len - 1; i > 0; i--) {
  896. name[j] = user_s[i];
  897. name[j + 1] = '.';
  898. j = j + 2;
  899. }
  900. memcpy(name + j, suffix->s, suffix->len + 1);
  901. head = get_record(name, T_NAPTR, RES_ONLY_TYPE);
  902. if (head == 0) {
  903. LM_DBG("No NAPTR record found for %s.\n", name);
  904. return -1;
  905. }
  906. naptr_sort(&head);
  907. q = MAX_Q - 10;
  908. curr_prio = 0;
  909. first = 1;
  910. for (l = head; l; l = l->next) {
  911. if (l->type != T_NAPTR) continue; /*should never happen*/
  912. naptr = (struct naptr_rdata*)l->rdata;
  913. if (naptr == 0) {
  914. LM_ERR("Null rdata in DNS response\n");
  915. continue;
  916. }
  917. LM_DBG("ENUM query on %s: order %u, pref %u, flen %u, flags "
  918. "'%.*s', slen %u, services '%.*s', rlen %u, "
  919. "regexp '%.*s'\n",
  920. name, naptr->order, naptr->pref,
  921. naptr->flags_len, (int)(naptr->flags_len), ZSW(naptr->flags),
  922. naptr->services_len,
  923. (int)(naptr->services_len), ZSW(naptr->services), naptr->regexp_len,
  924. (int)(naptr->regexp_len), ZSW(naptr->regexp));
  925. if (sip_match(naptr, service) == 0) continue;
  926. if (parse_naptr_regexp(&(naptr->regexp[0]), naptr->regexp_len,
  927. &pattern, &replacement) < 0) {
  928. LM_ERR("Parsing of NAPTR regexp failed\n");
  929. continue;
  930. }
  931. result.s = &(uri[0]);
  932. result.len = MAX_URI_SIZE;
  933. /* Avoid making copies of pattern and replacement */
  934. pattern.s[pattern.len] = (char)0;
  935. replacement.s[replacement.len] = (char)0;
  936. if (reg_replace(pattern.s, replacement.s, &(string[0]),
  937. &result) < 0) {
  938. pattern.s[pattern.len] = '!';
  939. replacement.s[replacement.len] = '!';
  940. LM_ERR("Regexp replace failed\n");
  941. continue;
  942. }
  943. LM_DBG("Resulted in replacement: '%.*s'\n",
  944. result.len, ZSW(result.s));
  945. pattern.s[pattern.len] = '!';
  946. replacement.s[replacement.len] = '!';
  947. if (param.len > 0) {
  948. if (result.len + param.len > MAX_URI_SIZE - 1) {
  949. LM_ERR("URI is too long\n");
  950. continue;
  951. }
  952. new_result.s = &(new_uri[0]);
  953. new_result.len = MAX_URI_SIZE;
  954. if (add_uri_param(&result, &param, &new_result) == 0) {
  955. LM_ERR("Parsing of URI <%.*s> failed\n",
  956. result.len, result.s);
  957. continue;
  958. }
  959. if (new_result.len > 0) {
  960. result = new_result;
  961. }
  962. }
  963. if (first) {
  964. if (rewrite_uri(_msg, &result) == -1) {
  965. goto done;
  966. }
  967. set_ruri_q(q);
  968. first = 0;
  969. curr_prio = ((naptr->order) << 16) + naptr->pref;
  970. } else {
  971. priority = ((naptr->order) << 16) + naptr->pref;
  972. if (priority > curr_prio) {
  973. q = q - 10;
  974. curr_prio = priority;
  975. }
  976. if (append_branch(_msg, &result, 0, 0, q, 0, 0, 0, 0, 0, 0)
  977. == -1) {
  978. goto done;
  979. }
  980. }
  981. }
  982. done:
  983. free_rdata_list(head);
  984. return first ? -1 : 1;
  985. }