pv_trans.c 64 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843
  1. /*
  2. * $Id$
  3. *
  4. * Copyright (C) 2007 voice-system.ro
  5. * Copyright (C) 2009 asipto.com
  6. *
  7. * This file is part of Kamailio, a free SIP server.
  8. *
  9. * Kamailio is free software; you can redistribute it and/or modify
  10. * it under the terms of the GNU General Public License as published by
  11. * the Free Software Foundation; either version 2 of the License, or
  12. * (at your option) any later version
  13. *
  14. * Kamailio is distributed in the hope that it will be useful,
  15. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  16. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  17. * GNU General Public License for more details.
  18. *
  19. * You should have received a copy of the GNU General Public License
  20. * along with this program; if not, write to the Free Software
  21. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  22. *
  23. */
  24. /*! \file
  25. * \brief Support for transformations
  26. */
  27. #include <stdio.h>
  28. #include <string.h>
  29. #include <stdlib.h>
  30. #include <time.h>
  31. #include <sys/types.h>
  32. #include <unistd.h>
  33. #include "../../dprint.h"
  34. #include "../../mem/mem.h"
  35. #include "../../ut.h"
  36. #include "../../trim.h"
  37. #include "../../pvapi.h"
  38. #include "../../dset.h"
  39. #include "../../basex.h"
  40. #include "../../parser/parse_param.h"
  41. #include "../../parser/parse_uri.h"
  42. #include "../../parser/parse_to.h"
  43. #include "../../parser/parse_nameaddr.h"
  44. #include "../../lib/kcore/strcommon.h"
  45. #include "../../lib/srutils/shautils.h"
  46. #include "pv_trans.h"
  47. static char _empty_str[] = "";
  48. static str _tr_empty = { _empty_str, 0 };
  49. static str _tr_uri = {0, 0};
  50. static struct sip_uri _tr_parsed_uri;
  51. static param_t* _tr_uri_params = NULL;
  52. /*! transformation buffer size */
  53. #define TR_BUFFER_SIZE 65536
  54. #define TR_BUFFER_SLOTS 4
  55. /*! transformation buffer */
  56. static char **_tr_buffer_list = NULL;
  57. static char *_tr_buffer = NULL;
  58. static int _tr_buffer_idx = 0;
  59. /*!
  60. *
  61. */
  62. int tr_init_buffers(void)
  63. {
  64. int i;
  65. _tr_buffer_list = (char**)malloc(TR_BUFFER_SLOTS * sizeof(char*));
  66. if(_tr_buffer_list==NULL)
  67. return -1;
  68. for(i=0; i<TR_BUFFER_SLOTS; i++) {
  69. _tr_buffer_list[i] = (char*)malloc(TR_BUFFER_SIZE);
  70. if(_tr_buffer_list[i]==NULL)
  71. return -1;
  72. }
  73. return 0;
  74. }
  75. /*!
  76. *
  77. */
  78. char *tr_set_crt_buffer(void)
  79. {
  80. _tr_buffer = _tr_buffer_list[_tr_buffer_idx];
  81. _tr_buffer_idx = (_tr_buffer_idx + 1) % TR_BUFFER_SLOTS;
  82. return _tr_buffer;
  83. }
  84. #define tr_string_clone_result do { \
  85. if(val->rs.len>TR_BUFFER_SIZE-1) { \
  86. LM_ERR("result is too big\n"); \
  87. return -1; \
  88. } \
  89. strncpy(_tr_buffer, val->rs.s, val->rs.len); \
  90. val->rs.s = _tr_buffer; \
  91. } while(0);
  92. /* -- helper functions */
  93. /* Converts a hex character to its integer value */
  94. static char pv_from_hex(char ch)
  95. {
  96. return isdigit(ch) ? ch - '0' : tolower(ch) - 'a' + 10;
  97. }
  98. /* Converts an integer value to its hex character */
  99. static char pv_to_hex(char code)
  100. {
  101. static char hex[] = "0123456789abcdef";
  102. return hex[code & 15];
  103. }
  104. /*! \brief
  105. * URL Encodes a string for use in a HTTP query
  106. */
  107. static int urlencode_param(str *sin, str *sout)
  108. {
  109. char *at, *p;
  110. if (sin==NULL || sout==NULL || sin->s==NULL || sout->s==NULL ||
  111. sin->len<0 || sout->len < 3*sin->len+1)
  112. return -1;
  113. at = sout->s;
  114. p = sin->s;
  115. while (p < sin->s+sin->len) {
  116. if (isalnum(*p) || *p == '-' || *p == '_' || *p == '.' || *p == '~')
  117. *at++ = *p;
  118. else if (*p == ' ')
  119. *at++ = '+';
  120. else
  121. *at++ = '%', *at++ = pv_to_hex(*p >> 4), *at++ = pv_to_hex(*p & 15);
  122. p++;
  123. }
  124. *at = 0;
  125. sout->len = at - sout->s;
  126. LM_DBG("urlencoded string is <%s>\n", sout->s);
  127. return 0;
  128. }
  129. /* URL Decode a string */
  130. static int urldecode_param(str *sin, str *sout) {
  131. char *at, *p;
  132. at = sout->s;
  133. p = sin->s;
  134. while (p < sin->s+sin->len) {
  135. if (*p == '%') {
  136. if (p[1] && p[2]) {
  137. *at++ = pv_from_hex(p[1]) << 4 | pv_from_hex(p[2]);
  138. p += 2;
  139. }
  140. } else if (*p == '+') {
  141. *at++ = ' ';
  142. } else {
  143. *at++ = *p;
  144. }
  145. p++;
  146. }
  147. *at = 0;
  148. sout->len = at - sout->s;
  149. LM_DBG("urldecoded string is <%s>\n", sout->s);
  150. return 0;
  151. }
  152. /* Encode 7BIT PDU */
  153. static int pdu_7bit_encode(str sin) {
  154. int i, j;
  155. unsigned char hex;
  156. unsigned char nleft;
  157. unsigned char fill;
  158. char HexTbl[] = {"0123456789ABCDEF"};
  159. nleft = 1;
  160. j = 0;
  161. for(i = 0; i < sin.len; i++) {
  162. hex = *(sin.s) >> (nleft - 1);
  163. fill = *(sin.s+1) << (8-nleft);
  164. hex = hex | fill;
  165. _tr_buffer[j++] = HexTbl[hex >> 4];
  166. _tr_buffer[j++] = HexTbl[hex & 0x0F];
  167. nleft++;
  168. if(nleft == 8) {
  169. sin.s++;
  170. i++;
  171. nleft = 1;
  172. }
  173. sin.s++;
  174. }
  175. _tr_buffer[j] = '\0';
  176. return j;
  177. }
  178. /* Decode 7BIT PDU */
  179. static int pdu_7bit_decode(str sin) {
  180. int i, j;
  181. unsigned char nleft = 1;
  182. unsigned char fill = 0;
  183. unsigned char oldfill = 0;
  184. j = 0;
  185. for(i = 0; i < sin.len; i += 2) {
  186. _tr_buffer[j] = (unsigned char)pv_from_hex(sin.s[i]) << 4;
  187. _tr_buffer[j] |= (unsigned char)pv_from_hex(sin.s[i+1]);
  188. fill = (unsigned char)_tr_buffer[j];
  189. fill >>= (8 - nleft);
  190. _tr_buffer[j] <<= (nleft -1 );
  191. _tr_buffer[j] &= 0x7F;
  192. _tr_buffer[j] |= oldfill;
  193. oldfill = fill;
  194. j++;
  195. nleft++;
  196. if(nleft == 8) {
  197. _tr_buffer[j++] = oldfill;
  198. nleft = 1;
  199. oldfill = 0;
  200. }
  201. }
  202. _tr_buffer[j] = '\0';
  203. return j;
  204. }
  205. /* -- transformations functions */
  206. /*!
  207. * \brief Evaluate string transformations
  208. * \param msg SIP message
  209. * \param tp transformation
  210. * \param subtype transformation type
  211. * \param val pseudo-variable
  212. * \return 0 on success, -1 on error
  213. */
  214. int tr_eval_string(struct sip_msg *msg, tr_param_t *tp, int subtype,
  215. pv_value_t *val)
  216. {
  217. int i, j, max;
  218. char *p, *s;
  219. str st, st2;
  220. pv_value_t v, w;
  221. time_t t;
  222. if(val==NULL || val->flags&PV_VAL_NULL)
  223. return -1;
  224. tr_set_crt_buffer();
  225. switch(subtype)
  226. {
  227. case TR_S_LEN:
  228. if(!(val->flags&PV_VAL_STR))
  229. val->rs.s = int2str(val->ri, &val->rs.len);
  230. val->flags = PV_TYPE_INT|PV_VAL_INT|PV_VAL_STR;
  231. val->ri = val->rs.len;
  232. val->rs.s = int2str(val->ri, &val->rs.len);
  233. break;
  234. case TR_S_INT:
  235. if(!(val->flags&PV_VAL_INT))
  236. {
  237. if(str2sint(&val->rs, &val->ri)!=0)
  238. return -1;
  239. } else {
  240. if(!(val->flags&PV_VAL_STR))
  241. val->rs.s = int2str(val->ri, &val->rs.len);
  242. }
  243. val->flags = PV_TYPE_INT|PV_VAL_INT|PV_VAL_STR;
  244. break;
  245. case TR_S_MD5:
  246. if(!(val->flags&PV_VAL_STR))
  247. val->rs.s = int2str(val->ri, &val->rs.len);
  248. compute_md5(_tr_buffer, val->rs.s, val->rs.len);
  249. _tr_buffer[MD5_LEN] = '\0';
  250. val->flags = PV_VAL_STR;
  251. val->ri = 0;
  252. val->rs.s = _tr_buffer;
  253. val->rs.len = MD5_LEN;
  254. break;
  255. case TR_S_SHA256:
  256. if(!(val->flags&PV_VAL_STR))
  257. val->rs.s = int2str(val->ri, &val->rs.len);
  258. compute_sha256(_tr_buffer, (u_int8_t*)val->rs.s, val->rs.len);
  259. _tr_buffer[SHA256_DIGEST_STRING_LENGTH -1] = '\0';
  260. val->flags = PV_VAL_STR;
  261. val->ri = 0;
  262. val->rs.s = _tr_buffer;
  263. val->rs.len = SHA256_DIGEST_STRING_LENGTH -1 ;
  264. break;
  265. case TR_S_SHA384:
  266. if(!(val->flags&PV_VAL_STR))
  267. val->rs.s = int2str(val->ri, &val->rs.len);
  268. compute_sha384(_tr_buffer, (u_int8_t*)val->rs.s, val->rs.len);
  269. _tr_buffer[SHA384_DIGEST_STRING_LENGTH -1] = '\0';
  270. val->flags = PV_VAL_STR;
  271. val->ri = 0;
  272. val->rs.s = _tr_buffer;
  273. val->rs.len = SHA384_DIGEST_STRING_LENGTH -1;
  274. break;
  275. case TR_S_SHA512:
  276. if(!(val->flags&PV_VAL_STR))
  277. val->rs.s = int2str(val->ri, &val->rs.len);
  278. compute_sha512(_tr_buffer, (u_int8_t*)val->rs.s, val->rs.len);
  279. _tr_buffer[SHA512_DIGEST_STRING_LENGTH -1] = '\0';
  280. val->flags = PV_VAL_STR;
  281. val->ri = 0;
  282. val->rs.s = _tr_buffer;
  283. val->rs.len = SHA512_DIGEST_STRING_LENGTH -1;
  284. break;
  285. case TR_S_ENCODEHEXA:
  286. if(!(val->flags&PV_VAL_STR))
  287. val->rs.s = int2str(val->ri, &val->rs.len);
  288. if(val->rs.len>TR_BUFFER_SIZE/2-1)
  289. return -1;
  290. j = 0;
  291. for(i=0; i<val->rs.len; i++)
  292. {
  293. _tr_buffer[j++] = fourbits2char[val->rs.s[i] >> 4];
  294. _tr_buffer[j++] = fourbits2char[val->rs.s[i] & 0xf];
  295. }
  296. _tr_buffer[j] = '\0';
  297. memset(val, 0, sizeof(pv_value_t));
  298. val->flags = PV_VAL_STR;
  299. val->rs.s = _tr_buffer;
  300. val->rs.len = j;
  301. break;
  302. case TR_S_DECODEHEXA:
  303. if(!(val->flags&PV_VAL_STR))
  304. val->rs.s = int2str(val->ri, &val->rs.len);
  305. if(val->rs.len>TR_BUFFER_SIZE*2-1)
  306. return -1;
  307. for(i=0; i<val->rs.len/2; i++)
  308. {
  309. if(val->rs.s[2*i]>='0'&&val->rs.s[2*i]<='9')
  310. _tr_buffer[i] = (val->rs.s[2*i]-'0') << 4;
  311. else if(val->rs.s[2*i]>='a'&&val->rs.s[2*i]<='f')
  312. _tr_buffer[i] = (val->rs.s[2*i]-'a'+10) << 4;
  313. else if(val->rs.s[2*i]>='A'&&val->rs.s[2*i]<='F')
  314. _tr_buffer[i] = (val->rs.s[2*i]-'A'+10) << 4;
  315. else return -1;
  316. if(val->rs.s[2*i+1]>='0'&&val->rs.s[2*i+1]<='9')
  317. _tr_buffer[i] += val->rs.s[2*i+1]-'0';
  318. else if(val->rs.s[2*i+1]>='a'&&val->rs.s[2*i+1]<='f')
  319. _tr_buffer[i] += val->rs.s[2*i+1]-'a'+10;
  320. else if(val->rs.s[2*i+1]>='A'&&val->rs.s[2*i+1]<='F')
  321. _tr_buffer[i] += val->rs.s[2*i+1]-'A'+10;
  322. else return -1;
  323. }
  324. _tr_buffer[i] = '\0';
  325. memset(val, 0, sizeof(pv_value_t));
  326. val->flags = PV_VAL_STR;
  327. val->rs.s = _tr_buffer;
  328. val->rs.len = i;
  329. break;
  330. case TR_S_ENCODE7BIT:
  331. if(!(val->flags&PV_VAL_STR))
  332. val->rs.s = int2str(val->ri, &val->rs.len);
  333. if(val->rs.len > (TR_BUFFER_SIZE*7/8) -1)
  334. return -1;
  335. i = pdu_7bit_encode(val->rs);
  336. memset(val, 0, sizeof(pv_value_t));
  337. val->flags = PV_VAL_STR;
  338. val->rs.s = _tr_buffer;
  339. val->rs.len = i;
  340. break;
  341. case TR_S_DECODE7BIT:
  342. if(!(val->flags&PV_VAL_STR))
  343. val->rs.s = int2str(val->ri, &val->rs.len);
  344. if(val->rs.len>TR_BUFFER_SIZE/2-1)
  345. return -1;
  346. i = pdu_7bit_decode(val->rs);
  347. memset(val, 0, sizeof(pv_value_t));
  348. val->flags = PV_VAL_STR;
  349. val->rs.s = _tr_buffer;
  350. val->rs.len = i;
  351. break;
  352. case TR_S_ENCODEBASE64:
  353. if(!(val->flags&PV_VAL_STR))
  354. val->rs.s = int2str(val->ri, &val->rs.len);
  355. i = base64_enc((unsigned char *) val->rs.s, val->rs.len,
  356. (unsigned char *) _tr_buffer, TR_BUFFER_SIZE-1);
  357. if (i < 0)
  358. return -1;
  359. _tr_buffer[i] = '\0';
  360. memset(val, 0, sizeof(pv_value_t));
  361. val->flags = PV_VAL_STR;
  362. val->rs.s = _tr_buffer;
  363. val->rs.len = i;
  364. break;
  365. case TR_S_DECODEBASE64:
  366. if(!(val->flags&PV_VAL_STR))
  367. val->rs.s = int2str(val->ri, &val->rs.len);
  368. i = base64_dec((unsigned char *) val->rs.s, val->rs.len,
  369. (unsigned char *) _tr_buffer, TR_BUFFER_SIZE-1);
  370. if (i < 0 || (i == 0 && val->rs.len > 0))
  371. return -1;
  372. _tr_buffer[i] = '\0';
  373. memset(val, 0, sizeof(pv_value_t));
  374. val->flags = PV_VAL_STR;
  375. val->rs.s = _tr_buffer;
  376. val->rs.len = i;
  377. break;
  378. case TR_S_ESCAPECOMMON:
  379. if(!(val->flags&PV_VAL_STR))
  380. val->rs.s = int2str(val->ri, &val->rs.len);
  381. if(val->rs.len>TR_BUFFER_SIZE/2-1)
  382. return -1;
  383. i = escape_common(_tr_buffer, val->rs.s, val->rs.len);
  384. _tr_buffer[i] = '\0';
  385. memset(val, 0, sizeof(pv_value_t));
  386. val->flags = PV_VAL_STR;
  387. val->rs.s = _tr_buffer;
  388. val->rs.len = i;
  389. break;
  390. case TR_S_UNESCAPECOMMON:
  391. if(!(val->flags&PV_VAL_STR))
  392. val->rs.s = int2str(val->ri, &val->rs.len);
  393. if(val->rs.len>TR_BUFFER_SIZE-1)
  394. return -1;
  395. i = unescape_common(_tr_buffer, val->rs.s, val->rs.len);
  396. _tr_buffer[i] = '\0';
  397. memset(val, 0, sizeof(pv_value_t));
  398. val->flags = PV_VAL_STR;
  399. val->rs.s = _tr_buffer;
  400. val->rs.len = i;
  401. break;
  402. case TR_S_ESCAPEUSER:
  403. if(!(val->flags&PV_VAL_STR))
  404. val->rs.s = int2str(val->ri, &val->rs.len);
  405. if(val->rs.len>TR_BUFFER_SIZE/2-1)
  406. return -1;
  407. st.s = _tr_buffer;
  408. st.len = TR_BUFFER_SIZE;
  409. if (escape_user(&val->rs, &st))
  410. return -1;
  411. memset(val, 0, sizeof(pv_value_t));
  412. val->flags = PV_VAL_STR;
  413. val->rs = st;
  414. break;
  415. case TR_S_UNESCAPEUSER:
  416. if(!(val->flags&PV_VAL_STR))
  417. val->rs.s = int2str(val->ri, &val->rs.len);
  418. if(val->rs.len>TR_BUFFER_SIZE-1)
  419. return -1;
  420. st.s = _tr_buffer;
  421. st.len = TR_BUFFER_SIZE;
  422. if (unescape_user(&val->rs, &st))
  423. return -1;
  424. memset(val, 0, sizeof(pv_value_t));
  425. val->flags = PV_VAL_STR;
  426. val->rs = st;
  427. break;
  428. case TR_S_ESCAPEPARAM:
  429. if(!(val->flags&PV_VAL_STR))
  430. val->rs.s = int2str(val->ri, &val->rs.len);
  431. if(val->rs.len>TR_BUFFER_SIZE/2-1)
  432. return -1;
  433. st.s = _tr_buffer;
  434. st.len = TR_BUFFER_SIZE;
  435. if (escape_param(&val->rs, &st) < 0)
  436. return -1;
  437. memset(val, 0, sizeof(pv_value_t));
  438. val->flags = PV_VAL_STR;
  439. val->rs = st;
  440. break;
  441. case TR_S_UNESCAPEPARAM:
  442. if(!(val->flags&PV_VAL_STR))
  443. val->rs.s = int2str(val->ri, &val->rs.len);
  444. if(val->rs.len>TR_BUFFER_SIZE-1)
  445. return -1;
  446. st.s = _tr_buffer;
  447. st.len = TR_BUFFER_SIZE;
  448. if (unescape_param(&val->rs, &st) < 0)
  449. return -1;
  450. memset(val, 0, sizeof(pv_value_t));
  451. val->flags = PV_VAL_STR;
  452. val->rs = st;
  453. break;
  454. case TR_S_SUBSTR:
  455. if(tp==NULL || tp->next==NULL)
  456. {
  457. LM_ERR("substr invalid parameters\n");
  458. return -1;
  459. }
  460. if(!(val->flags&PV_VAL_STR))
  461. val->rs.s = int2str(val->ri, &val->rs.len);
  462. if(tp->type==TR_PARAM_NUMBER)
  463. {
  464. i = tp->v.n;
  465. } else {
  466. if(pv_get_spec_value(msg, (pv_spec_p)tp->v.data, &v)!=0
  467. || (!(v.flags&PV_VAL_INT)))
  468. {
  469. LM_ERR("substr cannot get p1\n");
  470. return -1;
  471. }
  472. i = v.ri;
  473. }
  474. if(tp->next->type==TR_PARAM_NUMBER)
  475. {
  476. j = tp->next->v.n;
  477. } else {
  478. if(pv_get_spec_value(msg, (pv_spec_p)tp->next->v.data, &v)!=0
  479. || (!(v.flags&PV_VAL_INT)))
  480. {
  481. LM_ERR("substr cannot get p2\n");
  482. return -1;
  483. }
  484. j = v.ri;
  485. }
  486. LM_DBG("i=%d j=%d\n", i, j);
  487. if(j<0)
  488. {
  489. LM_ERR("substr negative offset\n");
  490. return -1;
  491. }
  492. val->flags = PV_VAL_STR;
  493. val->ri = 0;
  494. if(i>=0)
  495. {
  496. if(i>=val->rs.len)
  497. {
  498. LM_ERR("substr out of range\n");
  499. return -1;
  500. }
  501. if(i+j>=val->rs.len) j=0;
  502. if(j==0)
  503. { /* to end */
  504. val->rs.s += i;
  505. val->rs.len -= i;
  506. tr_string_clone_result;
  507. break;
  508. }
  509. val->rs.s += i;
  510. val->rs.len = j;
  511. break;
  512. }
  513. i = -i;
  514. if(i>val->rs.len)
  515. {
  516. LM_ERR("substr out of range\n");
  517. return -1;
  518. }
  519. if(i<j) j=0;
  520. if(j==0)
  521. { /* to end */
  522. val->rs.s += val->rs.len-i;
  523. val->rs.len = i;
  524. tr_string_clone_result;
  525. break;
  526. }
  527. val->rs.s += val->rs.len-i;
  528. val->rs.len = j;
  529. tr_string_clone_result;
  530. break;
  531. case TR_S_SELECT:
  532. if(tp==NULL || tp->next==NULL)
  533. {
  534. LM_ERR("select invalid parameters\n");
  535. return -1;
  536. }
  537. if(!(val->flags&PV_VAL_STR))
  538. val->rs.s = int2str(val->ri, &val->rs.len);
  539. if(tp->type==TR_PARAM_NUMBER)
  540. {
  541. i = tp->v.n;
  542. } else {
  543. if(pv_get_spec_value(msg, (pv_spec_p)tp->v.data, &v)!=0
  544. || (!(v.flags&PV_VAL_INT)))
  545. {
  546. LM_ERR("select cannot get p1\n");
  547. return -1;
  548. }
  549. i = v.ri;
  550. }
  551. val->flags = PV_VAL_STR;
  552. val->ri = 0;
  553. if(i<0)
  554. {
  555. s = val->rs.s+val->rs.len-1;
  556. p = s;
  557. i = -i;
  558. i--;
  559. while(p>=val->rs.s)
  560. {
  561. if(*p==tp->next->v.s.s[0])
  562. {
  563. if(i==0)
  564. break;
  565. s = p-1;
  566. i--;
  567. }
  568. p--;
  569. }
  570. if(i==0)
  571. {
  572. val->rs.s = p+1;
  573. val->rs.len = s-p;
  574. } else {
  575. val->rs = _tr_empty;
  576. }
  577. } else {
  578. s = val->rs.s;
  579. p = s;
  580. while(p<val->rs.s+val->rs.len)
  581. {
  582. if(*p==tp->next->v.s.s[0])
  583. {
  584. if(i==0)
  585. break;
  586. s = p + 1;
  587. i--;
  588. }
  589. p++;
  590. }
  591. if(i==0)
  592. {
  593. val->rs.s = s;
  594. val->rs.len = p-s;
  595. } else {
  596. val->rs = _tr_empty;
  597. }
  598. }
  599. tr_string_clone_result;
  600. break;
  601. case TR_S_TOLOWER:
  602. if(!(val->flags&PV_VAL_STR))
  603. {
  604. val->rs.s = int2str(val->ri, &val->rs.len);
  605. val->flags |= PV_VAL_STR;
  606. break;
  607. }
  608. if(val->rs.len>TR_BUFFER_SIZE-1)
  609. return -1;
  610. st.s = _tr_buffer;
  611. st.len = val->rs.len;
  612. for (i=0; i<st.len; i++)
  613. st.s[i]=(val->rs.s[i]>='A' && val->rs.s[i]<='Z')
  614. ?('a' + val->rs.s[i] -'A'):val->rs.s[i];
  615. memset(val, 0, sizeof(pv_value_t));
  616. val->flags = PV_VAL_STR;
  617. val->rs = st;
  618. break;
  619. case TR_S_TOUPPER:
  620. if(!(val->flags&PV_VAL_STR))
  621. {
  622. val->rs.s = int2str(val->ri, &val->rs.len);
  623. val->flags |= PV_VAL_STR;
  624. break;
  625. }
  626. if(val->rs.len>TR_BUFFER_SIZE-1)
  627. return -1;
  628. st.s = _tr_buffer;
  629. st.len = val->rs.len;
  630. for (i=0; i<st.len; i++)
  631. st.s[i]=(val->rs.s[i]>='a' && val->rs.s[i]<='z')
  632. ?('A' + val->rs.s[i] -'a'):val->rs.s[i];
  633. memset(val, 0, sizeof(pv_value_t));
  634. val->flags = PV_VAL_STR;
  635. val->rs = st;
  636. break;
  637. case TR_S_STRIP:
  638. case TR_S_STRIPTAIL:
  639. if(tp==NULL)
  640. {
  641. LM_ERR("strip invalid parameters\n");
  642. return -1;
  643. }
  644. if(!(val->flags&PV_VAL_STR))
  645. val->rs.s = int2str(val->ri, &val->rs.len);
  646. if(tp->type==TR_PARAM_NUMBER)
  647. {
  648. i = tp->v.n;
  649. } else {
  650. if(pv_get_spec_value(msg, (pv_spec_p)tp->v.data, &v)!=0
  651. || (!(v.flags&PV_VAL_INT)))
  652. {
  653. LM_ERR("select cannot get p1\n");
  654. return -1;
  655. }
  656. i = v.ri;
  657. }
  658. val->flags = PV_VAL_STR;
  659. val->ri = 0;
  660. if(i<=0)
  661. break;
  662. if(i>=val->rs.len)
  663. {
  664. _tr_buffer[0] = '\0';
  665. val->rs.s = _tr_buffer;
  666. val->rs.len = 0;
  667. break;
  668. }
  669. if(subtype==TR_S_STRIP)
  670. val->rs.s += i;
  671. val->rs.len -= i;
  672. tr_string_clone_result;
  673. break;
  674. case TR_S_STRIPTO:
  675. if(tp==NULL)
  676. {
  677. LM_ERR("stripto invalid parameters\n");
  678. return -1;
  679. }
  680. if(!(val->flags&PV_VAL_STR))
  681. val->rs.s = int2str(val->ri, &val->rs.len);
  682. if(tp->type==TR_PARAM_STRING)
  683. {
  684. st = tp->v.s;
  685. } else {
  686. if(pv_get_spec_value(msg, (pv_spec_p)tp->v.data, &v)!=0
  687. || (!(v.flags&PV_VAL_STR)) || v.rs.len<=0)
  688. {
  689. LM_ERR("stripto cannot get p1\n");
  690. return -1;
  691. }
  692. st = v.rs;
  693. }
  694. val->flags = PV_VAL_STR;
  695. val->ri = 0;
  696. for(i=0; i<val->rs.len; i++)
  697. {
  698. if(val->rs.s[i] == st.s[0])
  699. break;
  700. }
  701. if(i>=val->rs.len)
  702. {
  703. _tr_buffer[0] = '\0';
  704. val->rs.s = _tr_buffer;
  705. val->rs.len = 0;
  706. break;
  707. }
  708. val->rs.s += i;
  709. val->rs.len -= i;
  710. tr_string_clone_result;
  711. break;
  712. case TR_S_PREFIXES:
  713. case TR_S_PREFIXES_QUOT:
  714. if(!(val->flags&PV_VAL_STR))
  715. val->rs.s = int2str(val->ri, &val->rs.len);
  716. /* Set maximum prefix length */
  717. max = val->rs.len;
  718. if(tp!=NULL) {
  719. if(tp->type==TR_PARAM_NUMBER) {
  720. if (tp->v.n > 0 && tp->v.n < max)
  721. max = tp->v.n;
  722. } else {
  723. if(pv_get_spec_value(msg, (pv_spec_p)tp->v.data, &v)!=0
  724. || (!(v.flags&PV_VAL_INT)))
  725. {
  726. LM_ERR("prefixes cannot get max\n");
  727. return -1;
  728. }
  729. if (v.ri > 0 && v.ri < max)
  730. max = v.ri;
  731. }
  732. }
  733. if(max * (max/2 + (subtype==TR_S_PREFIXES_QUOT ? 1 : 3)) > TR_BUFFER_SIZE-1) {
  734. LM_ERR("prefixes buffer too short\n");
  735. return -1;
  736. }
  737. j = 0;
  738. for (i=1; i <= max; i++) {
  739. if (subtype==TR_S_PREFIXES_QUOT)
  740. _tr_buffer[j++] = '\'';
  741. memcpy(&(_tr_buffer[j]), val->rs.s, i);
  742. j += i;
  743. if (subtype==TR_S_PREFIXES_QUOT)
  744. _tr_buffer[j++] = '\'';
  745. _tr_buffer[j++] = ',';
  746. }
  747. memset(val, 0, sizeof(pv_value_t));
  748. val->flags = PV_VAL_STR;
  749. val->rs.s = _tr_buffer;
  750. val->rs.len = j-1;
  751. break;
  752. case TR_S_REPLACE:
  753. if(tp==NULL || tp->next==NULL)
  754. {
  755. LM_ERR("select invalid parameters\n");
  756. return -1;
  757. }
  758. if(!(val->flags&PV_VAL_STR))
  759. val->rs.s = int2str(val->ri, &val->rs.len);
  760. if(tp->type==TR_PARAM_STRING)
  761. {
  762. st = tp->v.s;
  763. } else {
  764. if(pv_get_spec_value(msg, (pv_spec_p)tp->v.data, &v)!=0
  765. || (!(v.flags&PV_VAL_STR)) || v.rs.len<=0)
  766. {
  767. LM_ERR("replace cannot get p1\n");
  768. return -1;
  769. }
  770. st = v.rs;
  771. }
  772. if(tp->next->type==TR_PARAM_STRING)
  773. {
  774. st2 = tp->next->v.s;
  775. } else {
  776. if(pv_get_spec_value(msg, (pv_spec_p)tp->next->v.data, &w)!=0
  777. || (!(w.flags&PV_VAL_STR)) || w.rs.len<=0)
  778. {
  779. LM_ERR("replace cannot get p2\n");
  780. return -1;
  781. }
  782. st2 = w.rs;
  783. }
  784. val->flags = PV_VAL_STR;
  785. val->ri = 0;
  786. i = 0;
  787. j = 0;
  788. max = val->rs.len - st.len;
  789. while (i < val->rs.len && j < TR_BUFFER_SIZE) {
  790. if (i <= max && val->rs.s[i] == st.s[0]
  791. && strncmp(val->rs.s+i, st.s, st.len) == 0) {
  792. strncpy(_tr_buffer+j, st2.s, st2.len);
  793. i += st.len;
  794. j += st2.len;
  795. } else {
  796. _tr_buffer[j++] = val->rs.s[i++];
  797. }
  798. }
  799. val->rs.s = _tr_buffer;
  800. val->rs.len = j;
  801. break;
  802. case TR_S_TIMEFORMAT:
  803. if(tp==NULL)
  804. {
  805. LM_ERR("timeformat invalid parameters\n");
  806. return -1;
  807. }
  808. if(!(val->flags&PV_VAL_INT) && (str2int(&val->rs,
  809. (unsigned int*) &val->ri)!=0))
  810. {
  811. LM_ERR("value is not numeric\n");
  812. return -1;
  813. }
  814. if(tp->type==TR_PARAM_STRING)
  815. {
  816. st = tp->v.s;
  817. } else {
  818. if(pv_get_spec_value(msg, (pv_spec_p)tp->v.data, &v)!=0
  819. || (!(v.flags&PV_VAL_STR)) || v.rs.len<=0)
  820. {
  821. LM_ERR("timeformat cannot get p1\n");
  822. return -1;
  823. }
  824. st = v.rs;
  825. }
  826. s = pkg_malloc(st.len + 1);
  827. if (s==NULL)
  828. {
  829. LM_ERR("no more pkg memory\n");
  830. return -1;
  831. }
  832. memcpy(s, st.s, st.len);
  833. s[st.len] = '\0';
  834. t = val->ri;
  835. val->rs.len = strftime(_tr_buffer, TR_BUFFER_SIZE-1, s,
  836. localtime(&t));
  837. pkg_free(s);
  838. val->flags = PV_VAL_STR;
  839. val->rs.s = _tr_buffer;
  840. break;
  841. case TR_S_TRIM:
  842. if(!(val->flags&PV_VAL_STR))
  843. val->rs.s = int2str(val->ri, &val->rs.len);
  844. if(val->rs.len>TR_BUFFER_SIZE-2)
  845. return -1;
  846. memcpy(_tr_buffer, val->rs.s, val->rs.len);
  847. val->flags = PV_VAL_STR;
  848. val->rs.s = _tr_buffer;
  849. trim(&val->rs);
  850. val->rs.s[val->rs.len] = '\0';
  851. break;
  852. case TR_S_RTRIM:
  853. if(!(val->flags&PV_VAL_STR))
  854. val->rs.s = int2str(val->ri, &val->rs.len);
  855. if(val->rs.len>TR_BUFFER_SIZE-2)
  856. return -1;
  857. memcpy(_tr_buffer, val->rs.s, val->rs.len);
  858. val->flags = PV_VAL_STR;
  859. val->rs.s = _tr_buffer;
  860. trim_trailing(&val->rs);
  861. val->rs.s[val->rs.len] = '\0';
  862. break;
  863. case TR_S_LTRIM:
  864. if(!(val->flags&PV_VAL_STR))
  865. val->rs.s = int2str(val->ri, &val->rs.len);
  866. if(val->rs.len>TR_BUFFER_SIZE-2)
  867. return -1;
  868. memcpy(_tr_buffer, val->rs.s, val->rs.len);
  869. val->flags = PV_VAL_STR;
  870. val->rs.s = _tr_buffer;
  871. trim_leading(&val->rs);
  872. val->rs.s[val->rs.len] = '\0';
  873. break;
  874. case TR_S_RM:
  875. if(tp==NULL)
  876. {
  877. LM_ERR("invalid parameters\n");
  878. return -1;
  879. }
  880. if(!(val->flags&PV_VAL_STR))
  881. val->rs.s = int2str(val->ri, &val->rs.len);
  882. if(val->rs.len>TR_BUFFER_SIZE-2)
  883. return -1;
  884. if(tp->type==TR_PARAM_STRING)
  885. {
  886. st = tp->v.s;
  887. if(memchr(st.s, '\\', st.len)) {
  888. p = pv_get_buffer();
  889. if(st.len>=pv_get_buffer_size()-1)
  890. return -1;
  891. j=0;
  892. for(i=0; i<st.len-1; i++) {
  893. if(st.s[i]=='\\') {
  894. switch(st.s[i+1]) {
  895. case 'n':
  896. p[j++] = '\n';
  897. break;
  898. case 'r':
  899. p[j++] = '\r';
  900. break;
  901. case 't':
  902. p[j++] = '\t';
  903. break;
  904. case '\\':
  905. p[j++] = '\\';
  906. break;
  907. default:
  908. p[j++] = st.s[i+1];
  909. }
  910. i++;
  911. } else {
  912. p[j++] = st.s[i];
  913. }
  914. }
  915. if(i==st.len-1)
  916. p[j++] = st.s[i];
  917. p[j] = '\0';
  918. st.s = p;
  919. st.len = j;
  920. }
  921. } else {
  922. if(pv_get_spec_value(msg, (pv_spec_p)tp->v.data, &v)!=0
  923. || (!(v.flags&PV_VAL_STR)) || v.rs.len<=0)
  924. {
  925. LM_ERR("cannot get parameter value\n");
  926. return -1;
  927. }
  928. st = v.rs;
  929. }
  930. LM_DBG("removing [%.*s](%d) in [%.*s](%d)\n",
  931. st.len, st.s, st.len, val->rs.len, val->rs.s, val->rs.len);
  932. val->flags = PV_VAL_STR;
  933. val->ri = 0;
  934. i = 0;
  935. j = 0;
  936. max = val->rs.len - st.len;
  937. while (i < val->rs.len && j < TR_BUFFER_SIZE) {
  938. if (i <= max && val->rs.s[i] == st.s[0]
  939. && strncmp(val->rs.s+i, st.s, st.len) == 0) {
  940. i += st.len;
  941. } else {
  942. _tr_buffer[j++] = val->rs.s[i++];
  943. }
  944. }
  945. val->rs.s = _tr_buffer;
  946. val->rs.s[j] = '\0';
  947. val->rs.len = j;
  948. break;
  949. case TR_S_URLENCODEPARAM:
  950. if(!(val->flags&PV_VAL_STR))
  951. val->rs.s = int2str(val->ri, &val->rs.len);
  952. if(val->rs.len>TR_BUFFER_SIZE-1)
  953. return -1;
  954. st.s = _tr_buffer;
  955. st.len = TR_BUFFER_SIZE;
  956. if (urlencode_param(&val->rs, &st) < 0)
  957. return -1;
  958. memset(val, 0, sizeof(pv_value_t));
  959. val->flags = PV_VAL_STR;
  960. val->rs = st;
  961. break;
  962. case TR_S_URLDECODEPARAM:
  963. if(!(val->flags&PV_VAL_STR))
  964. val->rs.s = int2str(val->ri, &val->rs.len);
  965. if(val->rs.len>TR_BUFFER_SIZE-1)
  966. return -1;
  967. st.s = _tr_buffer;
  968. st.len = TR_BUFFER_SIZE;
  969. if (urldecode_param(&val->rs, &st) < 0)
  970. return -1;
  971. memset(val, 0, sizeof(pv_value_t));
  972. val->flags = PV_VAL_STR;
  973. val->rs = st;
  974. break;
  975. default:
  976. LM_ERR("unknown subtype %d\n",
  977. subtype);
  978. return -1;
  979. }
  980. return 0;
  981. }
  982. /*!
  983. * \brief Evaluate URI transformations
  984. * \param msg SIP message
  985. * \param tp transformation
  986. * \param subtype transformation type
  987. * \param val pseudo-variable
  988. * \return 0 on success, -1 on error
  989. */
  990. int tr_eval_uri(struct sip_msg *msg, tr_param_t *tp, int subtype,
  991. pv_value_t *val)
  992. {
  993. pv_value_t v;
  994. str sv;
  995. param_hooks_t phooks;
  996. param_t *pit=NULL;
  997. if(val==NULL || (!(val->flags&PV_VAL_STR)) || val->rs.len<=0)
  998. return -1;
  999. if(_tr_uri.len==0 || _tr_uri.len!=val->rs.len ||
  1000. strncmp(_tr_uri.s, val->rs.s, val->rs.len)!=0)
  1001. {
  1002. if(val->rs.len>_tr_uri.len)
  1003. {
  1004. if(_tr_uri.s) pkg_free(_tr_uri.s);
  1005. _tr_uri.s = (char*)pkg_malloc((val->rs.len+1)*sizeof(char));
  1006. if(_tr_uri.s==NULL)
  1007. {
  1008. LM_ERR("no more private memory\n");
  1009. if(_tr_uri_params != NULL)
  1010. {
  1011. free_params(_tr_uri_params);
  1012. _tr_uri_params = 0;
  1013. }
  1014. memset(&_tr_uri, 0, sizeof(str));
  1015. memset(&_tr_parsed_uri, 0, sizeof(struct sip_uri));
  1016. return -1;
  1017. }
  1018. }
  1019. _tr_uri.len = val->rs.len;
  1020. memcpy(_tr_uri.s, val->rs.s, val->rs.len);
  1021. _tr_uri.s[_tr_uri.len] = '\0';
  1022. /* reset old values */
  1023. memset(&_tr_parsed_uri, 0, sizeof(struct sip_uri));
  1024. if(_tr_uri_params != NULL)
  1025. {
  1026. free_params(_tr_uri_params);
  1027. _tr_uri_params = 0;
  1028. }
  1029. /* parse uri -- params only when requested */
  1030. if(parse_uri(_tr_uri.s, _tr_uri.len, &_tr_parsed_uri)!=0)
  1031. {
  1032. LM_ERR("invalid uri [%.*s]\n", val->rs.len,
  1033. val->rs.s);
  1034. if(_tr_uri_params != NULL)
  1035. {
  1036. free_params(_tr_uri_params);
  1037. _tr_uri_params = 0;
  1038. }
  1039. pkg_free(_tr_uri.s);
  1040. memset(&_tr_uri, 0, sizeof(str));
  1041. memset(&_tr_parsed_uri, 0, sizeof(struct sip_uri));
  1042. return -1;
  1043. }
  1044. }
  1045. memset(val, 0, sizeof(pv_value_t));
  1046. val->flags = PV_VAL_STR;
  1047. switch(subtype)
  1048. {
  1049. case TR_URI_USER:
  1050. val->rs = (_tr_parsed_uri.user.s)?_tr_parsed_uri.user:_tr_empty;
  1051. break;
  1052. case TR_URI_HOST:
  1053. val->rs = (_tr_parsed_uri.host.s)?_tr_parsed_uri.host:_tr_empty;
  1054. break;
  1055. case TR_URI_PASSWD:
  1056. val->rs = (_tr_parsed_uri.passwd.s)?_tr_parsed_uri.passwd:_tr_empty;
  1057. break;
  1058. case TR_URI_PORT:
  1059. val->flags |= PV_TYPE_INT|PV_VAL_INT;
  1060. val->rs = (_tr_parsed_uri.port.s)?_tr_parsed_uri.port:_tr_empty;
  1061. val->ri = _tr_parsed_uri.port_no;
  1062. break;
  1063. case TR_URI_PARAMS:
  1064. val->rs = (_tr_parsed_uri.sip_params.s)?_tr_parsed_uri.sip_params:_tr_empty;
  1065. break;
  1066. case TR_URI_PARAM:
  1067. if(tp==NULL)
  1068. {
  1069. LM_ERR("param invalid parameters\n");
  1070. return -1;
  1071. }
  1072. if(_tr_parsed_uri.sip_params.len<=0)
  1073. {
  1074. val->rs = _tr_empty;
  1075. val->flags = PV_VAL_STR;
  1076. val->ri = 0;
  1077. break;
  1078. }
  1079. if(_tr_uri_params == NULL)
  1080. {
  1081. sv = _tr_parsed_uri.sip_params;
  1082. if (parse_params(&sv, CLASS_ANY, &phooks, &_tr_uri_params)<0)
  1083. return -1;
  1084. }
  1085. if(tp->type==TR_PARAM_STRING)
  1086. {
  1087. sv = tp->v.s;
  1088. } else {
  1089. if(pv_get_spec_value(msg, (pv_spec_p)tp->v.data, &v)!=0
  1090. || (!(v.flags&PV_VAL_STR)) || v.rs.len<=0)
  1091. {
  1092. LM_ERR("param cannot get p1\n");
  1093. return -1;
  1094. }
  1095. sv = v.rs;
  1096. }
  1097. for (pit = _tr_uri_params; pit; pit=pit->next)
  1098. {
  1099. if (pit->name.len==sv.len
  1100. && strncasecmp(pit->name.s, sv.s, sv.len)==0)
  1101. {
  1102. val->rs = pit->body;
  1103. goto done;
  1104. }
  1105. }
  1106. val->rs = _tr_empty;
  1107. break;
  1108. case TR_URI_HEADERS:
  1109. val->rs = (_tr_parsed_uri.headers.s)?_tr_parsed_uri.headers:
  1110. _tr_empty;
  1111. break;
  1112. case TR_URI_TRANSPORT:
  1113. val->rs = (_tr_parsed_uri.transport_val.s)?
  1114. _tr_parsed_uri.transport_val:_tr_empty;
  1115. break;
  1116. case TR_URI_TTL:
  1117. val->rs = (_tr_parsed_uri.ttl_val.s)?
  1118. _tr_parsed_uri.ttl_val:_tr_empty;
  1119. break;
  1120. case TR_URI_UPARAM:
  1121. val->rs = (_tr_parsed_uri.user_param_val.s)?
  1122. _tr_parsed_uri.user_param_val:_tr_empty;
  1123. break;
  1124. case TR_URI_MADDR:
  1125. val->rs = (_tr_parsed_uri.maddr_val.s)?
  1126. _tr_parsed_uri.maddr_val:_tr_empty;
  1127. break;
  1128. case TR_URI_METHOD:
  1129. val->rs = (_tr_parsed_uri.method_val.s)?
  1130. _tr_parsed_uri.method_val:_tr_empty;
  1131. break;
  1132. case TR_URI_LR:
  1133. val->rs = (_tr_parsed_uri.lr_val.s)?
  1134. _tr_parsed_uri.lr_val:_tr_empty;
  1135. break;
  1136. case TR_URI_R2:
  1137. val->rs = (_tr_parsed_uri.r2_val.s)?
  1138. _tr_parsed_uri.r2_val:_tr_empty;
  1139. break;
  1140. default:
  1141. LM_ERR("unknown subtype %d\n",
  1142. subtype);
  1143. return -1;
  1144. }
  1145. done:
  1146. return 0;
  1147. }
  1148. static str _tr_params_str = {0, 0};
  1149. static param_t* _tr_params_list = NULL;
  1150. static char _tr_params_separator = ';';
  1151. /*!
  1152. * \brief Evaluate parameter transformations
  1153. * \param msg SIP message
  1154. * \param tp transformation
  1155. * \param subtype transformation type
  1156. * \param val pseudo-variable
  1157. * \return 0 on success, -1 on error
  1158. */
  1159. int tr_eval_paramlist(struct sip_msg *msg, tr_param_t *tp, int subtype,
  1160. pv_value_t *val)
  1161. {
  1162. pv_value_t v;
  1163. str sv;
  1164. int n, i;
  1165. char separator = ';';
  1166. param_hooks_t phooks;
  1167. param_t *pit=NULL;
  1168. if(val==NULL || (!(val->flags&PV_VAL_STR)) || val->rs.len<=0)
  1169. return -1;
  1170. if (tp != NULL)
  1171. {
  1172. if (subtype == TR_PL_COUNT)
  1173. {
  1174. if(tp->type != TR_PARAM_STRING || tp->v.s.len != 1)
  1175. return -1;
  1176. separator = tp->v.s.s[0];
  1177. }
  1178. else if (tp->next != NULL)
  1179. {
  1180. if(tp->next->type != TR_PARAM_STRING
  1181. || tp->next->v.s.len != 1)
  1182. return -1;
  1183. separator = tp->next->v.s.s[0];
  1184. }
  1185. }
  1186. if(_tr_params_str.len==0 || _tr_params_str.len!=val->rs.len ||
  1187. strncmp(_tr_params_str.s, val->rs.s, val->rs.len)!=0 ||
  1188. _tr_params_separator != separator)
  1189. {
  1190. _tr_params_separator = separator;
  1191. if(val->rs.len>_tr_params_str.len)
  1192. {
  1193. if(_tr_params_str.s) pkg_free(_tr_params_str.s);
  1194. _tr_params_str.s = (char*)pkg_malloc((val->rs.len+1)*sizeof(char));
  1195. if(_tr_params_str.s==NULL)
  1196. {
  1197. LM_ERR("no more private memory\n");
  1198. memset(&_tr_params_str, 0, sizeof(str));
  1199. if(_tr_params_list != NULL)
  1200. {
  1201. free_params(_tr_params_list);
  1202. _tr_params_list = 0;
  1203. }
  1204. return -1;
  1205. }
  1206. }
  1207. _tr_params_str.len = val->rs.len;
  1208. memcpy(_tr_params_str.s, val->rs.s, val->rs.len);
  1209. _tr_params_str.s[_tr_params_str.len] = '\0';
  1210. /* reset old values */
  1211. if(_tr_params_list != NULL)
  1212. {
  1213. free_params(_tr_params_list);
  1214. _tr_params_list = 0;
  1215. }
  1216. /* parse params */
  1217. sv = _tr_params_str;
  1218. if (parse_params2(&sv, CLASS_ANY, &phooks, &_tr_params_list,
  1219. _tr_params_separator)<0)
  1220. return -1;
  1221. }
  1222. if(_tr_params_list==NULL)
  1223. return -1;
  1224. memset(val, 0, sizeof(pv_value_t));
  1225. val->flags = PV_VAL_STR;
  1226. switch(subtype)
  1227. {
  1228. case TR_PL_VALUE:
  1229. if(tp==NULL)
  1230. {
  1231. LM_ERR("value invalid parameters\n");
  1232. return -1;
  1233. }
  1234. if(tp->type==TR_PARAM_STRING)
  1235. {
  1236. sv = tp->v.s;
  1237. } else {
  1238. if(pv_get_spec_value(msg, (pv_spec_p)tp->v.data, &v)!=0
  1239. || (!(v.flags&PV_VAL_STR)) || v.rs.len<=0)
  1240. {
  1241. LM_ERR("value cannot get p1\n");
  1242. return -1;
  1243. }
  1244. sv = v.rs;
  1245. }
  1246. for (pit = _tr_params_list; pit; pit=pit->next)
  1247. {
  1248. if (pit->name.len==sv.len
  1249. && strncasecmp(pit->name.s, sv.s, sv.len)==0)
  1250. {
  1251. val->rs = pit->body;
  1252. goto done;
  1253. }
  1254. }
  1255. val->rs = _tr_empty;
  1256. break;
  1257. case TR_PL_VALUEAT:
  1258. if(tp==NULL)
  1259. {
  1260. LM_ERR("name invalid parameters\n");
  1261. return -1;
  1262. }
  1263. if(tp->type==TR_PARAM_NUMBER)
  1264. {
  1265. n = tp->v.n;
  1266. } else {
  1267. if(pv_get_spec_value(msg, (pv_spec_p)tp->v.data, &v)!=0
  1268. || (!(v.flags&PV_VAL_INT)))
  1269. {
  1270. LM_ERR("name cannot get p1\n");
  1271. return -1;
  1272. }
  1273. n = v.ri;
  1274. }
  1275. if(n<0)
  1276. {
  1277. n = -n;
  1278. n--;
  1279. for (pit = _tr_params_list; pit; pit=pit->next)
  1280. {
  1281. if(n==0)
  1282. {
  1283. val->rs = pit->body;
  1284. goto done;
  1285. }
  1286. n--;
  1287. }
  1288. } else {
  1289. /* ugly hack -- params are in reverse order
  1290. * - first count then find */
  1291. i = 0;
  1292. for (pit = _tr_params_list; pit; pit=pit->next)
  1293. i++;
  1294. if(n<i)
  1295. {
  1296. n = i - n - 1;
  1297. for (pit = _tr_params_list; pit; pit=pit->next)
  1298. {
  1299. if(n==0)
  1300. {
  1301. val->rs = pit->body;
  1302. goto done;
  1303. }
  1304. n--;
  1305. }
  1306. }
  1307. }
  1308. val->rs = _tr_empty;
  1309. break;
  1310. case TR_PL_NAME:
  1311. if(tp==NULL)
  1312. {
  1313. LM_ERR("name invalid parameters\n");
  1314. return -1;
  1315. }
  1316. if(tp->type==TR_PARAM_NUMBER)
  1317. {
  1318. n = tp->v.n;
  1319. } else {
  1320. if(pv_get_spec_value(msg, (pv_spec_p)tp->v.data, &v)!=0
  1321. || (!(v.flags&PV_VAL_INT)))
  1322. {
  1323. LM_ERR("name cannot get p1\n");
  1324. return -1;
  1325. }
  1326. n = v.ri;
  1327. }
  1328. if(n<0)
  1329. {
  1330. n = -n;
  1331. n--;
  1332. for (pit = _tr_params_list; pit; pit=pit->next)
  1333. {
  1334. if(n==0)
  1335. {
  1336. val->rs = pit->name;
  1337. goto done;
  1338. }
  1339. n--;
  1340. }
  1341. } else {
  1342. /* ugly hack -- params are in reverse order
  1343. * - first count then find */
  1344. i = 0;
  1345. for (pit = _tr_params_list; pit; pit=pit->next)
  1346. i++;
  1347. if(n<i)
  1348. {
  1349. n = i - n - 1;
  1350. for (pit = _tr_params_list; pit; pit=pit->next)
  1351. {
  1352. if(n==0)
  1353. {
  1354. val->rs = pit->name;
  1355. goto done;
  1356. }
  1357. n--;
  1358. }
  1359. }
  1360. }
  1361. val->rs = _tr_empty;
  1362. break;
  1363. case TR_PL_COUNT:
  1364. val->ri = 0;
  1365. for (pit = _tr_params_list; pit; pit=pit->next)
  1366. val->ri++;
  1367. val->flags = PV_TYPE_INT|PV_VAL_INT|PV_VAL_STR;
  1368. val->rs.s = int2str(val->ri, &val->rs.len);
  1369. break;
  1370. default:
  1371. LM_ERR("unknown subtype %d\n",
  1372. subtype);
  1373. return -1;
  1374. }
  1375. done:
  1376. return 0;
  1377. }
  1378. static str _tr_nameaddr_str = {0, 0};
  1379. static name_addr_t _tr_nameaddr;
  1380. /*!
  1381. * \brief Evaluate name-address transformations
  1382. * \param msg SIP message
  1383. * \param tp transformation
  1384. * \param subtype transformation type
  1385. * \param val pseudo-variable
  1386. * \return 0 on success, -1 on error
  1387. */
  1388. int tr_eval_nameaddr(struct sip_msg *msg, tr_param_t *tp, int subtype,
  1389. pv_value_t *val)
  1390. {
  1391. str sv;
  1392. int ret;
  1393. if(val==NULL || (!(val->flags&PV_VAL_STR)) || val->rs.len<=0)
  1394. return -1;
  1395. if(_tr_nameaddr_str.len==0 || _tr_nameaddr_str.len!=val->rs.len ||
  1396. strncmp(_tr_nameaddr_str.s, val->rs.s, val->rs.len)!=0)
  1397. {
  1398. if(val->rs.len>_tr_nameaddr_str.len)
  1399. {
  1400. if(_tr_nameaddr_str.s)
  1401. pkg_free(_tr_nameaddr_str.s);
  1402. _tr_nameaddr_str.s = (char*)pkg_malloc((val->rs.len+1)*sizeof(char));
  1403. if(_tr_nameaddr_str.s==NULL)
  1404. {
  1405. LM_ERR("no more private memory\n");
  1406. memset(&_tr_nameaddr_str, 0, sizeof(str));
  1407. memset(&_tr_nameaddr, 0, sizeof(name_addr_t));
  1408. return -1;
  1409. }
  1410. }
  1411. _tr_nameaddr_str.len = val->rs.len;
  1412. memcpy(_tr_nameaddr_str.s, val->rs.s, val->rs.len);
  1413. _tr_nameaddr_str.s[_tr_nameaddr_str.len] = '\0';
  1414. /* reset old values */
  1415. memset(&_tr_nameaddr, 0, sizeof(name_addr_t));
  1416. /* parse params */
  1417. sv = _tr_nameaddr_str;
  1418. ret = parse_nameaddr(&sv, &_tr_nameaddr);
  1419. if (ret < 0) {
  1420. if(ret != -3) return -1;
  1421. /* -3 means no "<" found so treat whole nameaddr as an URI */
  1422. _tr_nameaddr.uri = _tr_nameaddr_str;
  1423. _tr_nameaddr.name = _tr_empty;
  1424. _tr_nameaddr.len = _tr_nameaddr_str.len;
  1425. }
  1426. }
  1427. memset(val, 0, sizeof(pv_value_t));
  1428. val->flags = PV_VAL_STR;
  1429. switch(subtype)
  1430. {
  1431. case TR_NA_URI:
  1432. val->rs = (_tr_nameaddr.uri.s)?_tr_nameaddr.uri:_tr_empty;
  1433. break;
  1434. case TR_NA_LEN:
  1435. val->flags = PV_TYPE_INT|PV_VAL_INT|PV_VAL_STR;
  1436. val->ri = _tr_nameaddr.len;
  1437. val->rs.s = int2str(val->ri, &val->rs.len);
  1438. break;
  1439. case TR_NA_NAME:
  1440. val->rs = (_tr_nameaddr.name.s)?_tr_nameaddr.name:_tr_empty;
  1441. break;
  1442. default:
  1443. LM_ERR("unknown subtype %d\n",
  1444. subtype);
  1445. return -1;
  1446. }
  1447. return 0;
  1448. }
  1449. static str _tr_tobody_str = {0, 0};
  1450. static struct to_body _tr_tobody = {0};
  1451. /*!
  1452. * \brief Evaluate To-Body transformations
  1453. * \param msg SIP message
  1454. * \param tp transformation
  1455. * \param subtype transformation type
  1456. * \param val pseudo-variable
  1457. * \return 0 on success, -1 on error
  1458. */
  1459. int tr_eval_tobody(struct sip_msg *msg, tr_param_t *tp, int subtype,
  1460. pv_value_t *val)
  1461. {
  1462. str sv;
  1463. if(val==NULL || (!(val->flags&PV_VAL_STR)) || val->rs.len<=0)
  1464. return -1;
  1465. if(_tr_tobody_str.len==0 || _tr_tobody_str.len!=val->rs.len ||
  1466. strncmp(_tr_tobody_str.s, val->rs.s, val->rs.len)!=0)
  1467. {
  1468. if(_tr_tobody_str.s==NULL || val->rs.len>_tr_tobody_str.len)
  1469. {
  1470. if(_tr_tobody_str.s)
  1471. pkg_free(_tr_tobody_str.s);
  1472. _tr_tobody_str.s = (char*)pkg_malloc((val->rs.len+3)*sizeof(char));
  1473. if(_tr_tobody_str.s==NULL)
  1474. {
  1475. LM_ERR("no more private memory\n");
  1476. free_to_params(&_tr_tobody);
  1477. memset(&_tr_tobody, 0, sizeof(struct to_body));
  1478. memset(&_tr_tobody_str, 0, sizeof(str));
  1479. return -1;
  1480. }
  1481. }
  1482. _tr_tobody_str.len = val->rs.len;
  1483. memcpy(_tr_tobody_str.s, val->rs.s, val->rs.len);
  1484. _tr_tobody_str.s[_tr_tobody_str.len] = '\r';
  1485. _tr_tobody_str.s[_tr_tobody_str.len+1] = '\n';
  1486. _tr_tobody_str.s[_tr_tobody_str.len+2] = '\0';
  1487. /* reset old values */
  1488. free_to_params(&_tr_tobody);
  1489. memset(&_tr_tobody, 0, sizeof(struct to_body));
  1490. /* parse params */
  1491. sv = _tr_tobody_str;
  1492. parse_to(sv.s, sv.s + sv.len + 2, &_tr_tobody);
  1493. if (_tr_tobody.error == PARSE_ERROR)
  1494. {
  1495. free_to_params(&_tr_tobody);
  1496. memset(&_tr_tobody, 0, sizeof(struct to_body));
  1497. pkg_free(_tr_tobody_str.s);
  1498. memset(&_tr_tobody_str, 0, sizeof(str));
  1499. return -1;
  1500. }
  1501. if (parse_uri(_tr_tobody.uri.s, _tr_tobody.uri.len,
  1502. &_tr_tobody.parsed_uri)<0)
  1503. {
  1504. free_to_params(&_tr_tobody);
  1505. memset(&_tr_tobody, 0, sizeof(struct to_body));
  1506. pkg_free(_tr_tobody_str.s);
  1507. memset(&_tr_tobody_str, 0, sizeof(str));
  1508. return -1;
  1509. }
  1510. }
  1511. memset(val, 0, sizeof(pv_value_t));
  1512. val->flags = PV_VAL_STR;
  1513. switch(subtype)
  1514. {
  1515. case TR_TOBODY_URI:
  1516. val->rs = (_tr_tobody.uri.s)?_tr_tobody.uri:_tr_empty;
  1517. break;
  1518. case TR_TOBODY_TAG:
  1519. val->rs = (_tr_tobody.tag_value.s)?_tr_tobody.tag_value:_tr_empty;
  1520. break;
  1521. case TR_TOBODY_DISPLAY:
  1522. val->rs = (_tr_tobody.display.s)?_tr_tobody.display:_tr_empty;
  1523. break;
  1524. case TR_TOBODY_URI_USER:
  1525. val->rs = (_tr_tobody.parsed_uri.user.s)
  1526. ?_tr_tobody.parsed_uri.user:_tr_empty;
  1527. break;
  1528. case TR_TOBODY_URI_HOST:
  1529. val->rs = (_tr_tobody.parsed_uri.host.s)
  1530. ?_tr_tobody.parsed_uri.host:_tr_empty;
  1531. break;
  1532. case TR_TOBODY_PARAMS:
  1533. if(_tr_tobody.param_lst!=NULL)
  1534. {
  1535. val->rs.s = _tr_tobody.param_lst->name.s;
  1536. val->rs.len = _tr_tobody_str.s + _tr_tobody_str.len
  1537. - val->rs.s;
  1538. } else val->rs = _tr_empty;
  1539. break;
  1540. default:
  1541. LM_ERR("unknown subtype %d\n", subtype);
  1542. return -1;
  1543. }
  1544. return 0;
  1545. }
  1546. void *memfindrchr(const void *buf, int c, size_t n)
  1547. {
  1548. int i;
  1549. unsigned char *p;
  1550. p = (unsigned char*)buf;
  1551. for (i=n-1; i>=0; i--) {
  1552. if (p[i] == (unsigned char)c) {
  1553. return (void*)(p+i);
  1554. }
  1555. }
  1556. return NULL;
  1557. }
  1558. /*!
  1559. * \brief Evaluate line transformations
  1560. * \param msg SIP message
  1561. * \param tp transformation
  1562. * \param subtype transformation type
  1563. * \param val pseudo-variable
  1564. * \return 0 on success, -1 on error
  1565. */
  1566. int tr_eval_line(struct sip_msg *msg, tr_param_t *tp, int subtype,
  1567. pv_value_t *val)
  1568. {
  1569. pv_value_t v;
  1570. str sv;
  1571. str mv;
  1572. char *p;
  1573. int n, i;
  1574. if(val==NULL || (!(val->flags&PV_VAL_STR)) || val->rs.len<=0)
  1575. return -1;
  1576. switch(subtype)
  1577. {
  1578. case TR_LINE_SW:
  1579. if(tp==NULL)
  1580. {
  1581. LM_ERR("value invalid parameters\n");
  1582. return -1;
  1583. }
  1584. if(tp->type==TR_PARAM_STRING)
  1585. {
  1586. sv = tp->v.s;
  1587. } else {
  1588. if(pv_get_spec_value(msg, (pv_spec_p)tp->v.data, &v)!=0
  1589. || (!(v.flags&PV_VAL_STR)) || v.rs.len<=0)
  1590. {
  1591. LM_ERR("value cannot get p1\n");
  1592. return -1;
  1593. }
  1594. sv = v.rs;
  1595. }
  1596. if(val->rs.len < sv.len)
  1597. {
  1598. val->rs = _tr_empty;
  1599. goto done;
  1600. }
  1601. p = val->rs.s;
  1602. do {
  1603. if(strncmp(p, sv.s, sv.len)==0)
  1604. {
  1605. /* match */
  1606. mv.s = p;
  1607. p += sv.len;
  1608. p = memchr(p, '\n', (val->rs.s + val->rs.len) - p);
  1609. if(p==NULL)
  1610. {
  1611. /* last line */
  1612. mv.len = (val->rs.s + val->rs.len) - mv.s;
  1613. } else {
  1614. mv.len = p - mv.s;
  1615. }
  1616. val->rs = mv;
  1617. goto done;
  1618. }
  1619. p = memchr(p, '\n', (val->rs.s + val->rs.len) - p);
  1620. } while(p && ((++p)<=val->rs.s+val->rs.len-sv.len));
  1621. val->rs = _tr_empty;
  1622. break;
  1623. case TR_LINE_AT:
  1624. if(tp==NULL)
  1625. {
  1626. LM_ERR("name invalid parameters\n");
  1627. return -1;
  1628. }
  1629. if(tp->type==TR_PARAM_NUMBER)
  1630. {
  1631. n = tp->v.n;
  1632. } else {
  1633. if(pv_get_spec_value(msg, (pv_spec_p)tp->v.data, &v)!=0
  1634. || (!(v.flags&PV_VAL_INT)))
  1635. {
  1636. LM_ERR("name cannot get p1\n");
  1637. return -1;
  1638. }
  1639. n = v.ri;
  1640. }
  1641. if(n<0)
  1642. {
  1643. p = val->rs.s + val->rs.len - 1;
  1644. if(*p=='\n')
  1645. p--;
  1646. mv.s = p;
  1647. n = -n;
  1648. i=1;
  1649. p = memfindrchr(val->rs.s, '\n', p - val->rs.s);
  1650. if(p!=NULL)
  1651. p--;
  1652. while(i<n && p)
  1653. {
  1654. mv.s = p;
  1655. p = memfindrchr(val->rs.s, '\n', p - val->rs.s);
  1656. if(p!=NULL)
  1657. p--;
  1658. i++;
  1659. }
  1660. if(i==n)
  1661. {
  1662. if(p==NULL)
  1663. {
  1664. /* first line */
  1665. mv.len = mv.s - val->rs.s + 1;
  1666. mv.s = val->rs.s;
  1667. } else {
  1668. mv.len = mv.s - p - 1;
  1669. mv.s = p + 2;
  1670. }
  1671. val->rs = mv;
  1672. goto done;
  1673. }
  1674. } else {
  1675. p = val->rs.s;
  1676. i = 0;
  1677. while(i<n && p)
  1678. {
  1679. p = memchr(p, '\n', (val->rs.s + val->rs.len) - p);
  1680. if(p!=NULL)
  1681. p++;
  1682. i++;
  1683. }
  1684. if(i==n && p!=NULL)
  1685. {
  1686. /* line found */
  1687. mv.s = p;
  1688. p = memchr(p, '\n', (val->rs.s + val->rs.len) - p);
  1689. if(p==NULL)
  1690. {
  1691. /* last line */
  1692. mv.len = (val->rs.s + val->rs.len) - mv.s;
  1693. } else {
  1694. mv.len = p - mv.s;
  1695. }
  1696. val->rs = mv;
  1697. goto done;
  1698. }
  1699. }
  1700. val->rs = _tr_empty;
  1701. break;
  1702. case TR_LINE_COUNT:
  1703. n=0;
  1704. for(i=0; i<val->rs.len; i++)
  1705. if(val->rs.s[i]=='\n')
  1706. n++;
  1707. if(n==0 && val->rs.len>0)
  1708. n = 1;
  1709. val->flags = PV_TYPE_INT|PV_VAL_INT|PV_VAL_STR;
  1710. val->ri = n;
  1711. val->rs.s = int2str(val->ri, &val->rs.len);
  1712. break;
  1713. break;
  1714. default:
  1715. LM_ERR("unknown subtype %d\n",
  1716. subtype);
  1717. return -1;
  1718. }
  1719. done:
  1720. if(val->rs.len>0)
  1721. {
  1722. /* skip ending '\r' if present */
  1723. if(val->rs.s[val->rs.len-1]=='\r')
  1724. val->rs.len--;
  1725. }
  1726. val->flags = PV_VAL_STR;
  1727. return 0;
  1728. }
  1729. #define _tr_parse_nparam(_p, _p0, _tp, _spec, _n, _sign, _in, _s) \
  1730. while(is_in_str(_p, _in) && (*_p==' ' || *_p=='\t' || *_p=='\n')) _p++; \
  1731. if(*_p==PV_MARKER) \
  1732. { /* pseudo-variable */ \
  1733. _spec = (pv_spec_t*)pkg_malloc(sizeof(pv_spec_t)); \
  1734. if(_spec==NULL) \
  1735. { \
  1736. LM_ERR("no more private memory!\n"); \
  1737. goto error; \
  1738. } \
  1739. _s.s = _p; _s.len = _in->s + _in->len - _p; \
  1740. _p0 = pv_parse_spec(&_s, _spec); \
  1741. if(_p0==NULL) \
  1742. { \
  1743. LM_ERR("invalid spec in substr transformation: %.*s!\n", \
  1744. _in->len, _in->s); \
  1745. goto error; \
  1746. } \
  1747. _p = _p0; \
  1748. _tp = (tr_param_t*)pkg_malloc(sizeof(tr_param_t)); \
  1749. if(_tp==NULL) \
  1750. { \
  1751. LM_ERR("no more private memory!\n"); \
  1752. goto error; \
  1753. } \
  1754. memset(_tp, 0, sizeof(tr_param_t)); \
  1755. _tp->type = TR_PARAM_SPEC; \
  1756. _tp->v.data = (void*)_spec; \
  1757. } else { \
  1758. if(*_p=='+' || *_p=='-' || (*_p>='0' && *_p<='9')) \
  1759. { /* number */ \
  1760. _sign = 1; \
  1761. if(*_p=='-') { \
  1762. _p++; \
  1763. _sign = -1; \
  1764. } else if(*_p=='+') _p++; \
  1765. _n = 0; \
  1766. while(is_in_str(_p, _in) && (*_p==' ' || *_p=='\t' || *_p=='\n')) \
  1767. _p++; \
  1768. while(is_in_str(_p, _in) && *_p>='0' && *_p<='9') \
  1769. { \
  1770. _n = _n*10 + *_p - '0'; \
  1771. _p++; \
  1772. } \
  1773. _tp = (tr_param_t*)pkg_malloc(sizeof(tr_param_t)); \
  1774. if(_tp==NULL) \
  1775. { \
  1776. LM_ERR("no more private memory!\n"); \
  1777. goto error; \
  1778. } \
  1779. memset(_tp, 0, sizeof(tr_param_t)); \
  1780. _tp->type = TR_PARAM_NUMBER; \
  1781. _tp->v.n = sign*n; \
  1782. } else { \
  1783. LM_ERR("tinvalid param in transformation: %.*s!!\n", \
  1784. _in->len, _in->s); \
  1785. goto error; \
  1786. } \
  1787. }
  1788. #define _tr_parse_sparam(_p, _p0, _tp, _spec, _ps, _in, _s) \
  1789. while(is_in_str(_p, _in) && (*_p==' ' || *_p=='\t' || *_p=='\n')) _p++; \
  1790. if(*_p==PV_MARKER) \
  1791. { /* pseudo-variable */ \
  1792. _spec = (pv_spec_t*)pkg_malloc(sizeof(pv_spec_t)); \
  1793. if(_spec==NULL) \
  1794. { \
  1795. LM_ERR("no more private memory!\n"); \
  1796. goto error; \
  1797. } \
  1798. _s.s = _p; _s.len = _in->s + _in->len - _p; \
  1799. _p0 = pv_parse_spec(&_s, _spec); \
  1800. if(_p0==NULL) \
  1801. { \
  1802. LM_ERR("invalid spec in substr transformation: %.*s!\n", \
  1803. _in->len, _in->s); \
  1804. goto error; \
  1805. } \
  1806. _p = _p0; \
  1807. _tp = (tr_param_t*)pkg_malloc(sizeof(tr_param_t)); \
  1808. if(_tp==NULL) \
  1809. { \
  1810. LM_ERR("no more private memory!\n"); \
  1811. goto error; \
  1812. } \
  1813. memset(_tp, 0, sizeof(tr_param_t)); \
  1814. _tp->type = TR_PARAM_SPEC; \
  1815. _tp->v.data = (void*)_spec; \
  1816. } else { /* string */ \
  1817. _ps = _p; \
  1818. while(is_in_str(_p, _in) && *_p!='\t' && *_p!='\n' \
  1819. && *_p!=TR_PARAM_MARKER && *_p!=TR_RBRACKET) \
  1820. _p++; \
  1821. if(*_p=='\0') \
  1822. { \
  1823. LM_ERR("invalid param in transformation: %.*s!!\n", \
  1824. _in->len, _in->s); \
  1825. goto error; \
  1826. } \
  1827. _tp = (tr_param_t*)pkg_malloc(sizeof(tr_param_t)); \
  1828. if(_tp==NULL) \
  1829. { \
  1830. LM_ERR("no more private memory!\n"); \
  1831. goto error; \
  1832. } \
  1833. memset(_tp, 0, sizeof(tr_param_t)); \
  1834. _tp->type = TR_PARAM_STRING; \
  1835. _tp->v.s.s = _ps; \
  1836. _tp->v.s.len = _p - _ps; \
  1837. }
  1838. /*!
  1839. * \brief Helper fuction to parse a string transformation
  1840. * \param in parsed string
  1841. * \param t transformation
  1842. * \return pointer to the end of the transformation in the string - '}', null on error
  1843. */
  1844. char* tr_parse_string(str* in, trans_t *t)
  1845. {
  1846. char *p;
  1847. char *p0;
  1848. char *ps;
  1849. str name;
  1850. str s;
  1851. pv_spec_t *spec = NULL;
  1852. int n;
  1853. int sign;
  1854. tr_param_t *tp = NULL;
  1855. if(in==NULL || t==NULL)
  1856. return NULL;
  1857. p = in->s;
  1858. name.s = in->s;
  1859. t->type = TR_STRING;
  1860. t->trf = tr_eval_string;
  1861. /* find next token */
  1862. while(is_in_str(p, in) && *p!=TR_PARAM_MARKER && *p!=TR_RBRACKET) p++;
  1863. if(*p=='\0')
  1864. {
  1865. LM_ERR("invalid transformation: %.*s\n",
  1866. in->len, in->s);
  1867. goto error;
  1868. }
  1869. name.len = p - name.s;
  1870. trim(&name);
  1871. if(name.len==3 && strncasecmp(name.s, "len", 3)==0)
  1872. {
  1873. t->subtype = TR_S_LEN;
  1874. goto done;
  1875. } else if(name.len==3 && strncasecmp(name.s, "int", 3)==0) {
  1876. t->subtype = TR_S_INT;
  1877. goto done;
  1878. } else if(name.len==3 && strncasecmp(name.s, "md5", 3)==0) {
  1879. t->subtype = TR_S_MD5;
  1880. goto done;
  1881. } else if(name.len==6 && strncasecmp(name.s, "sha256", 6)==0) {
  1882. t->subtype = TR_S_SHA256;
  1883. goto done;
  1884. } else if(name.len==6 && strncasecmp(name.s, "sha384", 6)==0) {
  1885. t->subtype = TR_S_SHA384;
  1886. goto done;
  1887. } else if(name.len==6 && strncasecmp(name.s, "sha512", 6)==0) {
  1888. t->subtype = TR_S_SHA512;
  1889. goto done;
  1890. } else if(name.len==7 && strncasecmp(name.s, "tolower", 7)==0) {
  1891. t->subtype = TR_S_TOLOWER;
  1892. goto done;
  1893. } else if(name.len==7 && strncasecmp(name.s, "toupper", 7)==0) {
  1894. t->subtype = TR_S_TOUPPER;
  1895. goto done;
  1896. } else if(name.len==11 && strncasecmp(name.s, "encode.hexa", 11)==0) {
  1897. t->subtype = TR_S_ENCODEHEXA;
  1898. goto done;
  1899. } else if(name.len==11 && strncasecmp(name.s, "decode.hexa", 11)==0) {
  1900. t->subtype = TR_S_DECODEHEXA;
  1901. goto done;
  1902. } else if(name.len==11 && strncasecmp(name.s, "encode.7bit", 11)==0) {
  1903. t->subtype = TR_S_ENCODE7BIT;
  1904. goto done;
  1905. } else if(name.len==11 && strncasecmp(name.s, "decode.7bit", 11)==0) {
  1906. t->subtype = TR_S_DECODE7BIT;
  1907. goto done;
  1908. } else if(name.len==13 && strncasecmp(name.s, "encode.base64", 13)==0) {
  1909. t->subtype = TR_S_ENCODEBASE64;
  1910. goto done;
  1911. } else if(name.len==13 && strncasecmp(name.s, "decode.base64", 13)==0) {
  1912. t->subtype = TR_S_DECODEBASE64;
  1913. goto done;
  1914. } else if(name.len==13 && strncasecmp(name.s, "escape.common", 13)==0) {
  1915. t->subtype = TR_S_ESCAPECOMMON;
  1916. goto done;
  1917. } else if(name.len==15 && strncasecmp(name.s, "unescape.common", 15)==0) {
  1918. t->subtype = TR_S_UNESCAPECOMMON;
  1919. goto done;
  1920. } else if(name.len==11 && strncasecmp(name.s, "escape.user", 11)==0) {
  1921. t->subtype = TR_S_ESCAPEUSER;
  1922. goto done;
  1923. } else if(name.len==13 && strncasecmp(name.s, "unescape.user", 13)==0) {
  1924. t->subtype = TR_S_UNESCAPEUSER;
  1925. goto done;
  1926. } else if(name.len==12 && strncasecmp(name.s, "escape.param", 12)==0) {
  1927. t->subtype = TR_S_ESCAPEPARAM;
  1928. goto done;
  1929. } else if(name.len==14 && strncasecmp(name.s, "unescape.param", 14)==0) {
  1930. t->subtype = TR_S_UNESCAPEPARAM;
  1931. goto done;
  1932. } else if(name.len==8 && strncasecmp(name.s, "prefixes", 8)==0) {
  1933. t->subtype = TR_S_PREFIXES;
  1934. if(*p!=TR_PARAM_MARKER)
  1935. goto done;
  1936. p++;
  1937. _tr_parse_nparam(p, p0, tp, spec, n, sign, in, s);
  1938. t->params = tp;
  1939. tp = 0;
  1940. while(*p && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  1941. if(*p!=TR_RBRACKET)
  1942. {
  1943. LM_ERR("invalid prefixes transformation: %.*s!!\n",
  1944. in->len, in->s);
  1945. goto error;
  1946. }
  1947. goto done;
  1948. } else if(name.len==15 && strncasecmp(name.s, "prefixes.quoted", 15)==0) {
  1949. t->subtype = TR_S_PREFIXES_QUOT;
  1950. if(*p!=TR_PARAM_MARKER)
  1951. goto done;
  1952. p++;
  1953. _tr_parse_nparam(p, p0, tp, spec, n, sign, in, s);
  1954. t->params = tp;
  1955. tp = 0;
  1956. while(*p && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  1957. if(*p!=TR_RBRACKET)
  1958. {
  1959. LM_ERR("invalid prefixes transformation: %.*s!!\n",
  1960. in->len, in->s);
  1961. goto error;
  1962. }
  1963. goto done;
  1964. } else if(name.len==6 && strncasecmp(name.s, "substr", 6)==0) {
  1965. t->subtype = TR_S_SUBSTR;
  1966. if(*p!=TR_PARAM_MARKER)
  1967. {
  1968. LM_ERR("invalid substr transformation: %.*s!\n", in->len, in->s);
  1969. goto error;
  1970. }
  1971. p++;
  1972. _tr_parse_nparam(p, p0, tp, spec, n, sign, in, s);
  1973. t->params = tp;
  1974. tp = 0;
  1975. while(*p && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  1976. if(*p!=TR_PARAM_MARKER)
  1977. {
  1978. LM_ERR("invalid substr transformation: %.*s!\n",
  1979. in->len, in->s);
  1980. goto error;
  1981. }
  1982. p++;
  1983. _tr_parse_nparam(p, p0, tp, spec, n, sign, in, s);
  1984. if(tp->type==TR_PARAM_NUMBER && tp->v.n<0)
  1985. {
  1986. LM_ERR("substr negative offset\n");
  1987. goto error;
  1988. }
  1989. t->params->next = tp;
  1990. tp = 0;
  1991. while(is_in_str(p, in) && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  1992. if(*p!=TR_RBRACKET)
  1993. {
  1994. LM_ERR("invalid substr transformation: %.*s!!\n",
  1995. in->len, in->s);
  1996. goto error;
  1997. }
  1998. goto done;
  1999. } else if(name.len==6 && strncasecmp(name.s, "select", 6)==0) {
  2000. t->subtype = TR_S_SELECT;
  2001. if(*p!=TR_PARAM_MARKER)
  2002. {
  2003. LM_ERR("invalid select transformation: %.*s!\n",
  2004. in->len, in->s);
  2005. goto error;
  2006. }
  2007. p++;
  2008. _tr_parse_nparam(p, p0, tp, spec, n, sign, in, s);
  2009. t->params = tp;
  2010. tp = 0;
  2011. while(*p && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  2012. if(*p!=TR_PARAM_MARKER || *(p+1)=='\0')
  2013. {
  2014. LM_ERR("invalid select transformation: %.*s!\n", in->len, in->s);
  2015. goto error;
  2016. }
  2017. p++;
  2018. tp = (tr_param_t*)pkg_malloc(sizeof(tr_param_t));
  2019. if(tp==NULL)
  2020. {
  2021. LM_ERR("no more private memory!\n");
  2022. goto error;
  2023. }
  2024. memset(tp, 0, sizeof(tr_param_t));
  2025. tp->type = TR_PARAM_STRING;
  2026. tp->v.s.s = p;
  2027. tp->v.s.len = 1;
  2028. t->params->next = tp;
  2029. tp = 0;
  2030. p++;
  2031. while(*p && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  2032. if(*p!=TR_RBRACKET)
  2033. {
  2034. LM_ERR("invalid select transformation: %.*s!!\n",
  2035. in->len, in->s);
  2036. goto error;
  2037. }
  2038. goto done;
  2039. } else if(name.len==5 && strncasecmp(name.s, "strip", 5)==0) {
  2040. t->subtype = TR_S_STRIP;
  2041. if(*p!=TR_PARAM_MARKER)
  2042. {
  2043. LM_ERR("invalid strip transformation: %.*s!\n",
  2044. in->len, in->s);
  2045. goto error;
  2046. }
  2047. p++;
  2048. _tr_parse_nparam(p, p0, tp, spec, n, sign, in, s);
  2049. t->params = tp;
  2050. tp = 0;
  2051. while(*p && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  2052. if(*p!=TR_RBRACKET)
  2053. {
  2054. LM_ERR("invalid strip transformation: %.*s!!\n",
  2055. in->len, in->s);
  2056. goto error;
  2057. }
  2058. goto done;
  2059. } else if(name.len==9 && strncasecmp(name.s, "striptail", 9)==0) {
  2060. t->subtype = TR_S_STRIPTAIL;
  2061. if(*p!=TR_PARAM_MARKER)
  2062. {
  2063. LM_ERR("invalid striptail transformation: %.*s!\n",
  2064. in->len, in->s);
  2065. goto error;
  2066. }
  2067. p++;
  2068. _tr_parse_nparam(p, p0, tp, spec, n, sign, in, s);
  2069. t->params = tp;
  2070. tp = 0;
  2071. while(*p && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  2072. if(*p!=TR_RBRACKET)
  2073. {
  2074. LM_ERR("invalid striptail transformation: %.*s!!\n",
  2075. in->len, in->s);
  2076. goto error;
  2077. }
  2078. goto done;
  2079. } else if(name.len==7 && strncasecmp(name.s, "stripto", 7)==0) {
  2080. t->subtype = TR_S_STRIPTO;
  2081. if(*p!=TR_PARAM_MARKER)
  2082. {
  2083. LM_ERR("invalid stripto transformation: %.*s!\n",
  2084. in->len, in->s);
  2085. goto error;
  2086. }
  2087. p++;
  2088. _tr_parse_sparam(p, p0, tp, spec, ps, in, s);
  2089. t->params = tp;
  2090. tp = 0;
  2091. while(*p && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  2092. if(*p!=TR_RBRACKET)
  2093. {
  2094. LM_ERR("invalid strip transformation: %.*s!!\n",
  2095. in->len, in->s);
  2096. goto error;
  2097. }
  2098. goto done;
  2099. } else if(name.len==5 && strncasecmp(name.s, "ftime", 5)==0) {
  2100. t->subtype = TR_S_TIMEFORMAT;
  2101. if(*p!=TR_PARAM_MARKER)
  2102. {
  2103. LM_ERR("invalid ftime transformation: %.*s!\n",
  2104. in->len, in->s);
  2105. goto error;
  2106. }
  2107. p++;
  2108. _tr_parse_sparam(p, p0, tp, spec, ps, in, s);
  2109. t->params = tp;
  2110. tp = 0;
  2111. while(*p && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  2112. if(*p!=TR_RBRACKET)
  2113. {
  2114. LM_ERR("invalid ftime transformation: %.*s!!\n",
  2115. in->len, in->s);
  2116. goto error;
  2117. }
  2118. goto done;
  2119. } else if(name.len==7 && strncasecmp(name.s, "replace", 7)==0) {
  2120. t->subtype = TR_S_REPLACE;
  2121. if(*p!=TR_PARAM_MARKER)
  2122. {
  2123. LM_ERR("invalid replace transformation: %.*s!\n", in->len, in->s);
  2124. goto error;
  2125. }
  2126. p++;
  2127. _tr_parse_sparam(p, p0, tp, spec, ps, in, s);
  2128. t->params = tp;
  2129. tp = 0;
  2130. while(*p && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  2131. if(*p!=TR_PARAM_MARKER)
  2132. {
  2133. LM_ERR("invalid replace transformation: %.*s!\n",
  2134. in->len, in->s);
  2135. goto error;
  2136. }
  2137. p++;
  2138. _tr_parse_sparam(p, p0, tp, spec, ps, in, s);
  2139. t->params->next = tp;
  2140. tp = 0;
  2141. while(*p && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  2142. if(*p!=TR_RBRACKET)
  2143. {
  2144. LM_ERR("invalid replace transformation: %.*s!!\n",
  2145. in->len, in->s);
  2146. goto error;
  2147. }
  2148. goto done;
  2149. } else if(name.len==4 && strncasecmp(name.s, "trim", 4)==0) {
  2150. t->subtype = TR_S_TRIM;
  2151. goto done;
  2152. } else if(name.len==5 && strncasecmp(name.s, "rtrim", 5)==0) {
  2153. t->subtype = TR_S_RTRIM;
  2154. goto done;
  2155. } else if(name.len==5 && strncasecmp(name.s, "ltrim", 5)==0) {
  2156. t->subtype = TR_S_LTRIM;
  2157. goto done;
  2158. } else if(name.len==2 && strncasecmp(name.s, "rm", 2)==0) {
  2159. t->subtype = TR_S_RM;
  2160. if(*p!=TR_PARAM_MARKER)
  2161. {
  2162. LM_ERR("invalid ftime transformation: %.*s!\n",
  2163. in->len, in->s);
  2164. goto error;
  2165. }
  2166. p++;
  2167. _tr_parse_sparam(p, p0, tp, spec, ps, in, s);
  2168. t->params = tp;
  2169. tp = 0;
  2170. while(*p && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  2171. if(*p!=TR_RBRACKET)
  2172. {
  2173. LM_ERR("invalid ftime transformation: %.*s!!\n",
  2174. in->len, in->s);
  2175. goto error;
  2176. }
  2177. goto done;
  2178. } else if(name.len==15 && strncasecmp(name.s, "urlencode.param", 15)==0) {
  2179. t->subtype = TR_S_URLENCODEPARAM;
  2180. goto done;
  2181. } else if(name.len==15 && strncasecmp(name.s, "urldecode.param", 15)==0) {
  2182. t->subtype = TR_S_URLDECODEPARAM;
  2183. goto done;
  2184. }
  2185. LM_ERR("unknown transformation: %.*s/%.*s/%d!\n", in->len, in->s,
  2186. name.len, name.s, name.len);
  2187. error:
  2188. if(tp)
  2189. tr_param_free(tp);
  2190. if(spec)
  2191. pv_spec_free(spec);
  2192. return NULL;
  2193. done:
  2194. t->name = name;
  2195. return p;
  2196. }
  2197. /*!
  2198. * \brief Helper fuction to parse a URI transformation
  2199. * \param in parsed string
  2200. * \param t transformation
  2201. * \return pointer to the end of the transformation in the string - '}', null on error
  2202. */
  2203. char* tr_parse_uri(str* in, trans_t *t)
  2204. {
  2205. char *p;
  2206. char *p0;
  2207. char *ps;
  2208. str name;
  2209. str s;
  2210. pv_spec_t *spec = NULL;
  2211. tr_param_t *tp = NULL;
  2212. if(in==NULL || in->s==NULL || t==NULL)
  2213. return NULL;
  2214. p = in->s;
  2215. name.s = in->s;
  2216. t->type = TR_URI;
  2217. t->trf = tr_eval_uri;
  2218. /* find next token */
  2219. while(*p && *p!=TR_PARAM_MARKER && *p!=TR_RBRACKET) p++;
  2220. if(*p=='\0')
  2221. {
  2222. LM_ERR("invalid transformation: %.*s\n", in->len, in->s);
  2223. goto error;
  2224. }
  2225. name.len = p - name.s;
  2226. trim(&name);
  2227. if(name.len==4 && strncasecmp(name.s, "user", 4)==0)
  2228. {
  2229. t->subtype = TR_URI_USER;
  2230. goto done;
  2231. } else if((name.len==4 && strncasecmp(name.s, "host", 4)==0)
  2232. || (name.len==6 && strncasecmp(name.s, "domain", 6)==0)) {
  2233. t->subtype = TR_URI_HOST;
  2234. goto done;
  2235. } else if(name.len==6 && strncasecmp(name.s, "passwd", 6)==0) {
  2236. t->subtype = TR_URI_PASSWD;
  2237. goto done;
  2238. } else if(name.len==4 && strncasecmp(name.s, "port", 4)==0) {
  2239. t->subtype = TR_URI_PORT;
  2240. goto done;
  2241. } else if(name.len==6 && strncasecmp(name.s, "params", 6)==0) {
  2242. t->subtype = TR_URI_PARAMS;
  2243. goto done;
  2244. } else if(name.len==7 && strncasecmp(name.s, "headers", 7)==0) {
  2245. t->subtype = TR_URI_HEADERS;
  2246. goto done;
  2247. } else if(name.len==5 && strncasecmp(name.s, "param", 5)==0) {
  2248. t->subtype = TR_URI_PARAM;
  2249. if(*p!=TR_PARAM_MARKER)
  2250. {
  2251. LM_ERR("invalid param transformation: %.*s\n", in->len, in->s);
  2252. goto error;
  2253. }
  2254. p++;
  2255. _tr_parse_sparam(p, p0, tp, spec, ps, in, s);
  2256. t->params = tp;
  2257. tp = 0;
  2258. while(*p && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  2259. if(*p!=TR_RBRACKET)
  2260. {
  2261. LM_ERR("invalid param transformation: %.*s!\n", in->len, in->s);
  2262. goto error;
  2263. }
  2264. goto done;
  2265. } else if(name.len==9 && strncasecmp(name.s, "transport", 9)==0) {
  2266. t->subtype = TR_URI_TRANSPORT;
  2267. goto done;
  2268. } else if(name.len==3 && strncasecmp(name.s, "ttl", 3)==0) {
  2269. t->subtype = TR_URI_TTL;
  2270. goto done;
  2271. } else if(name.len==6 && strncasecmp(name.s, "uparam", 6)==0) {
  2272. t->subtype = TR_URI_UPARAM;
  2273. goto done;
  2274. } else if(name.len==5 && strncasecmp(name.s, "maddr", 5)==0) {
  2275. t->subtype = TR_URI_MADDR;
  2276. goto done;
  2277. } else if(name.len==6 && strncasecmp(name.s, "method", 6)==0) {
  2278. t->subtype = TR_URI_METHOD;
  2279. goto done;
  2280. } else if(name.len==2 && strncasecmp(name.s, "lr", 2)==0) {
  2281. t->subtype = TR_URI_LR;
  2282. goto done;
  2283. } else if(name.len==2 && strncasecmp(name.s, "r2", 2)==0) {
  2284. t->subtype = TR_URI_R2;
  2285. goto done;
  2286. }
  2287. LM_ERR("unknown transformation: %.*s/%.*s!\n", in->len,
  2288. in->s, name.len, name.s);
  2289. error:
  2290. if(tp)
  2291. tr_param_free(tp);
  2292. if(spec)
  2293. pv_spec_free(spec);
  2294. return NULL;
  2295. done:
  2296. t->name = name;
  2297. return p;
  2298. }
  2299. /*!
  2300. * \brief Helper fuction to parse a parameter transformation
  2301. * \param in parsed string
  2302. * \param t transformation
  2303. * \return pointer to the end of the transformation in the string - '}', null on error
  2304. */
  2305. char* tr_parse_paramlist(str* in, trans_t *t)
  2306. {
  2307. char *p;
  2308. char *p0;
  2309. char *ps;
  2310. char *start_pos;
  2311. str s;
  2312. str name;
  2313. int n;
  2314. int sign;
  2315. pv_spec_t *spec = NULL;
  2316. tr_param_t *tp = NULL;
  2317. if(in==NULL || in->s==NULL || t==NULL)
  2318. return NULL;
  2319. p = in->s;
  2320. name.s = in->s;
  2321. t->type = TR_PARAMLIST;
  2322. t->trf = tr_eval_paramlist;
  2323. /* find next token */
  2324. while(is_in_str(p, in) && *p!=TR_PARAM_MARKER && *p!=TR_RBRACKET) p++;
  2325. if(*p=='\0')
  2326. {
  2327. LM_ERR("invalid transformation: %.*s\n",
  2328. in->len, in->s);
  2329. goto error;
  2330. }
  2331. name.len = p - name.s;
  2332. trim(&name);
  2333. if(name.len==5 && strncasecmp(name.s, "value", 5)==0)
  2334. {
  2335. t->subtype = TR_PL_VALUE;
  2336. if(*p!=TR_PARAM_MARKER)
  2337. {
  2338. LM_ERR("invalid value transformation: %.*s\n",
  2339. in->len, in->s);
  2340. goto error;
  2341. }
  2342. p++;
  2343. _tr_parse_sparam(p, p0, tp, spec, ps, in, s);
  2344. t->params = tp;
  2345. tp = 0;
  2346. while(*p && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  2347. if(*p==TR_PARAM_MARKER)
  2348. {
  2349. start_pos = ++p;
  2350. _tr_parse_sparam(p, p0, tp, spec, ps, in, s);
  2351. t->params->next = tp;
  2352. tp = 0;
  2353. if (p - start_pos != 1)
  2354. {
  2355. LM_ERR("invalid separator in transformation: "
  2356. "%.*s\n", in->len, in->s);
  2357. goto error;
  2358. }
  2359. while(*p && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  2360. }
  2361. if(*p!=TR_RBRACKET)
  2362. {
  2363. LM_ERR("invalid value transformation: %.*s!\n",
  2364. in->len, in->s);
  2365. goto error;
  2366. }
  2367. goto done;
  2368. } else if(name.len==7 && strncasecmp(name.s, "valueat", 7)==0) {
  2369. t->subtype = TR_PL_VALUEAT;
  2370. if(*p!=TR_PARAM_MARKER)
  2371. {
  2372. LM_ERR("invalid name transformation: %.*s\n",
  2373. in->len, in->s);
  2374. goto error;
  2375. }
  2376. p++;
  2377. _tr_parse_nparam(p, p0, tp, spec, n, sign, in, s)
  2378. t->params = tp;
  2379. tp = 0;
  2380. while(is_in_str(p, in) && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  2381. if(*p==TR_PARAM_MARKER)
  2382. {
  2383. start_pos = ++p;
  2384. _tr_parse_sparam(p, p0, tp, spec, ps, in, s);
  2385. t->params->next = tp;
  2386. tp = 0;
  2387. if (p - start_pos != 1)
  2388. {
  2389. LM_ERR("invalid separator in transformation: "
  2390. "%.*s\n", in->len, in->s);
  2391. goto error;
  2392. }
  2393. while(*p && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  2394. }
  2395. if(*p!=TR_RBRACKET)
  2396. {
  2397. LM_ERR("invalid name transformation: %.*s!\n",
  2398. in->len, in->s);
  2399. goto error;
  2400. }
  2401. goto done;
  2402. } else if(name.len==4 && strncasecmp(name.s, "name", 4)==0) {
  2403. t->subtype = TR_PL_NAME;
  2404. if(*p!=TR_PARAM_MARKER)
  2405. {
  2406. LM_ERR("invalid name transformation: %.*s\n",
  2407. in->len, in->s);
  2408. goto error;
  2409. }
  2410. p++;
  2411. _tr_parse_nparam(p, p0, tp, spec, n, sign, in, s)
  2412. t->params = tp;
  2413. tp = 0;
  2414. while(is_in_str(p, in) && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  2415. if(*p==TR_PARAM_MARKER)
  2416. {
  2417. start_pos = ++p;
  2418. _tr_parse_sparam(p, p0, tp, spec, ps, in, s);
  2419. t->params->next = tp;
  2420. tp = 0;
  2421. if (p - start_pos != 1)
  2422. {
  2423. LM_ERR("invalid separator in transformation: "
  2424. "%.*s\n", in->len, in->s);
  2425. goto error;
  2426. }
  2427. while(*p && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  2428. }
  2429. if(*p!=TR_RBRACKET)
  2430. {
  2431. LM_ERR("invalid name transformation: %.*s!\n",
  2432. in->len, in->s);
  2433. goto error;
  2434. }
  2435. goto done;
  2436. } else if(name.len==5 && strncasecmp(name.s, "count", 5)==0) {
  2437. t->subtype = TR_PL_COUNT;
  2438. if(*p==TR_PARAM_MARKER)
  2439. {
  2440. start_pos = ++p;
  2441. _tr_parse_sparam(p, p0, tp, spec, ps, in, s);
  2442. t->params = tp;
  2443. tp = 0;
  2444. if (p - start_pos != 1)
  2445. {
  2446. LM_ERR("invalid separator in transformation: "
  2447. "%.*s\n", in->len, in->s);
  2448. goto error;
  2449. }
  2450. while(*p && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  2451. if(*p!=TR_RBRACKET)
  2452. {
  2453. LM_ERR("invalid name transformation: %.*s!\n",
  2454. in->len, in->s);
  2455. goto error;
  2456. }
  2457. }
  2458. goto done;
  2459. }
  2460. LM_ERR("unknown transformation: %.*s/%.*s!\n",
  2461. in->len, in->s, name.len, name.s);
  2462. error:
  2463. if(tp)
  2464. tr_param_free(tp);
  2465. if(spec)
  2466. pv_spec_free(spec);
  2467. return NULL;
  2468. done:
  2469. t->name = name;
  2470. return p;
  2471. }
  2472. /*!
  2473. * \brief Helper fuction to parse a name-address transformation
  2474. * \param in parsed string
  2475. * \param t transformation
  2476. * \return pointer to the end of the transformation in the string - '}', null on error
  2477. */
  2478. char* tr_parse_nameaddr(str* in, trans_t *t)
  2479. {
  2480. char *p;
  2481. str name;
  2482. if(in==NULL || t==NULL)
  2483. return NULL;
  2484. p = in->s;
  2485. name.s = in->s;
  2486. t->type = TR_NAMEADDR;
  2487. t->trf = tr_eval_nameaddr;
  2488. /* find next token */
  2489. while(is_in_str(p, in) && *p!=TR_PARAM_MARKER && *p!=TR_RBRACKET) p++;
  2490. if(*p=='\0')
  2491. {
  2492. LM_ERR("invalid transformation: %.*s\n",
  2493. in->len, in->s);
  2494. goto error;
  2495. }
  2496. name.len = p - name.s;
  2497. trim(&name);
  2498. if(name.len==3 && strncasecmp(name.s, "uri", 3)==0)
  2499. {
  2500. t->subtype = TR_NA_URI;
  2501. goto done;
  2502. } else if(name.len==3 && strncasecmp(name.s, "len", 3)==0)
  2503. {
  2504. t->subtype = TR_NA_LEN;
  2505. goto done;
  2506. } else if(name.len==4 && strncasecmp(name.s, "name", 4)==0) {
  2507. t->subtype = TR_NA_NAME;
  2508. goto done;
  2509. }
  2510. LM_ERR("unknown transformation: %.*s/%.*s/%d!\n", in->len, in->s,
  2511. name.len, name.s, name.len);
  2512. error:
  2513. return NULL;
  2514. done:
  2515. t->name = name;
  2516. return p;
  2517. }
  2518. /*!
  2519. * \brief Helper fuction to parse a name-address transformation
  2520. * \param in parsed string
  2521. * \param t transformation
  2522. * \return pointer to the end of the transformation in the string - '}', null on error
  2523. */
  2524. char* tr_parse_tobody(str* in, trans_t *t)
  2525. {
  2526. char *p;
  2527. str name;
  2528. if(in==NULL || t==NULL)
  2529. return NULL;
  2530. p = in->s;
  2531. name.s = in->s;
  2532. t->type = TR_TOBODY;
  2533. t->trf = tr_eval_tobody;
  2534. /* find next token */
  2535. while(is_in_str(p, in) && *p!=TR_PARAM_MARKER && *p!=TR_RBRACKET) p++;
  2536. if(*p=='\0')
  2537. {
  2538. LM_ERR("invalid transformation: %.*s\n",
  2539. in->len, in->s);
  2540. goto error;
  2541. }
  2542. name.len = p - name.s;
  2543. trim(&name);
  2544. if(name.len==3 && strncasecmp(name.s, "uri", 3)==0)
  2545. {
  2546. t->subtype = TR_TOBODY_URI;
  2547. goto done;
  2548. } else if(name.len==3 && strncasecmp(name.s, "tag", 3)==0) {
  2549. t->subtype = TR_TOBODY_TAG;
  2550. goto done;
  2551. } else if(name.len==4 && strncasecmp(name.s, "user", 4)==0) {
  2552. t->subtype = TR_TOBODY_URI_USER;
  2553. goto done;
  2554. } else if(name.len==4 && strncasecmp(name.s, "host", 4)==0) {
  2555. t->subtype = TR_TOBODY_URI_HOST;
  2556. goto done;
  2557. } else if(name.len==6 && strncasecmp(name.s, "params", 6)==0) {
  2558. t->subtype = TR_TOBODY_PARAMS;
  2559. goto done;
  2560. } else if(name.len==7 && strncasecmp(name.s, "display", 7)==0) {
  2561. t->subtype = TR_TOBODY_DISPLAY;
  2562. goto done;
  2563. }
  2564. LM_ERR("unknown transformation: %.*s/%.*s/%d!\n", in->len, in->s,
  2565. name.len, name.s, name.len);
  2566. error:
  2567. return NULL;
  2568. done:
  2569. t->name = name;
  2570. return p;
  2571. }
  2572. /*!
  2573. * \brief Helper fuction to parse a line transformation
  2574. * \param in parsed string
  2575. * \param t transformation
  2576. * \return pointer to the end of the transformation in the string - '}', null on error
  2577. */
  2578. char* tr_parse_line(str* in, trans_t *t)
  2579. {
  2580. char *p;
  2581. char *p0;
  2582. char *ps;
  2583. str s;
  2584. str name;
  2585. int n;
  2586. int sign;
  2587. pv_spec_t *spec = NULL;
  2588. tr_param_t *tp = NULL;
  2589. if(in==NULL || t==NULL)
  2590. return NULL;
  2591. p = in->s;
  2592. name.s = in->s;
  2593. t->type = TR_LINE;
  2594. t->trf = tr_eval_line;
  2595. /* find next token */
  2596. while(is_in_str(p, in) && *p!=TR_PARAM_MARKER && *p!=TR_RBRACKET) p++;
  2597. if(*p=='\0')
  2598. {
  2599. LM_ERR("invalid transformation: %.*s\n",
  2600. in->len, in->s);
  2601. goto error;
  2602. }
  2603. name.len = p - name.s;
  2604. trim(&name);
  2605. if(name.len==2 && strncasecmp(name.s, "at", 2)==0)
  2606. {
  2607. t->subtype = TR_LINE_AT;
  2608. if(*p!=TR_PARAM_MARKER)
  2609. {
  2610. LM_ERR("invalid name transformation: %.*s\n",
  2611. in->len, in->s);
  2612. goto error;
  2613. }
  2614. p++;
  2615. _tr_parse_nparam(p, p0, tp, spec, n, sign, in, s)
  2616. t->params = tp;
  2617. tp = 0;
  2618. while(is_in_str(p, in) && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  2619. if(*p!=TR_RBRACKET)
  2620. {
  2621. LM_ERR("invalid name transformation: %.*s!\n",
  2622. in->len, in->s);
  2623. goto error;
  2624. }
  2625. goto done;
  2626. } else if(name.len==2 && strncasecmp(name.s, "sw", 2)==0) {
  2627. t->subtype = TR_LINE_SW;
  2628. if(*p!=TR_PARAM_MARKER)
  2629. {
  2630. LM_ERR("invalid value transformation: %.*s\n",
  2631. in->len, in->s);
  2632. goto error;
  2633. }
  2634. p++;
  2635. _tr_parse_sparam(p, p0, tp, spec, ps, in, s);
  2636. t->params = tp;
  2637. tp = 0;
  2638. while(*p && (*p==' ' || *p=='\t' || *p=='\n')) p++;
  2639. if(*p!=TR_RBRACKET)
  2640. {
  2641. LM_ERR("invalid value transformation: %.*s!\n",
  2642. in->len, in->s);
  2643. goto error;
  2644. }
  2645. goto done;
  2646. } else if(name.len==5 && strncasecmp(name.s, "count", 5)==0) {
  2647. t->subtype = TR_LINE_COUNT;
  2648. goto done;
  2649. }
  2650. LM_ERR("unknown transformation: %.*s/%.*s/%d!\n", in->len, in->s,
  2651. name.len, name.s, name.len);
  2652. error:
  2653. return NULL;
  2654. done:
  2655. t->name = name;
  2656. return p;
  2657. }