action.c 44 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637
  1. /*
  2. *
  3. * Copyright (C) 2001-2003 FhG Fokus
  4. *
  5. * This file is part of Kamailio, a free SIP server.
  6. *
  7. * Kamailio is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License as published by
  9. * the Free Software Foundation; either version 2 of the License, or
  10. * (at your option) any later version
  11. *
  12. * Kamailio is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. * GNU General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License
  18. * along with this program; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. *
  21. */
  22. /*!
  23. * \file
  24. * \brief Kamailio core :: Config file actions
  25. * \ingroup core
  26. * Module: \ref core
  27. */
  28. #include "comp_defs.h"
  29. #include "action.h"
  30. #include "config.h"
  31. #include "error.h"
  32. #include "dprint.h"
  33. #include "proxy.h"
  34. #include "forward.h"
  35. #include "udp_server.h"
  36. #include "route.h"
  37. #include "parser/msg_parser.h"
  38. #include "parser/parse_uri.h"
  39. #include "ut.h"
  40. #include "lvalue.h"
  41. #include "sr_module.h"
  42. #include "select_buf.h"
  43. #include "mem/mem.h"
  44. #include "globals.h"
  45. #include "dset.h"
  46. #include "onsend.h"
  47. #include "resolve.h"
  48. #ifdef USE_TCP
  49. #include "tcp_server.h"
  50. #endif
  51. #ifdef USE_SCTP
  52. #include "sctp_core.h"
  53. #endif
  54. #include "switch.h"
  55. #include "events.h"
  56. #include "cfg/cfg_struct.h"
  57. #include <sys/types.h>
  58. #include <sys/socket.h>
  59. #include <netdb.h>
  60. #include <stdlib.h>
  61. #include <netinet/in.h>
  62. #include <arpa/inet.h>
  63. #include <string.h>
  64. #ifdef DEBUG_DMALLOC
  65. #include <dmalloc.h>
  66. #endif
  67. int _last_returned_code = 0;
  68. struct onsend_info* p_onsend=0; /* onsend route send info */
  69. /* current action executed from config file */
  70. static cfg_action_t *_cfg_crt_action = 0;
  71. /*!< maximum number of recursive calls for blocks of actions */
  72. static unsigned int max_recursive_level = 256;
  73. void set_max_recursive_level(unsigned int lev)
  74. {
  75. max_recursive_level = lev;
  76. }
  77. /* return current action executed from config file */
  78. cfg_action_t *get_cfg_crt_action(void)
  79. {
  80. return _cfg_crt_action;
  81. }
  82. /* return line in config for current executed action */
  83. int get_cfg_crt_line(void)
  84. {
  85. if(_cfg_crt_action==0)
  86. return 0;
  87. return _cfg_crt_action->cline;
  88. }
  89. /* return name of config for current executed action */
  90. char *get_cfg_crt_name(void)
  91. {
  92. if(_cfg_crt_action==0)
  93. return 0;
  94. return _cfg_crt_action->cfile;
  95. }
  96. /* handle the exit code of a module function call.
  97. * (used internally in do_action())
  98. * @param h - script handle (h->last_retcode and h->run_flags will be set).
  99. * @param ret - module function (v0 or v2) retcode
  100. * Side-effects: sets _last_returned_code
  101. */
  102. #define MODF_HANDLE_RETCODE(h, ret) \
  103. do { \
  104. /* if (unlikely((ret)==0)) (h)->run_flags|=EXIT_R_F; */ \
  105. (h)->run_flags |= EXIT_R_F & (((ret) != 0) -1); \
  106. (h)->last_retcode=(ret); \
  107. _last_returned_code = (h)->last_retcode; \
  108. } while(0)
  109. /* frees parameters converted using MODF_RVE_PARAM_CONVERT() from dst.
  110. * (used internally in do_action())
  111. * Assumes src is unchanged.
  112. * Side-effects: clobbers i (int).
  113. */
  114. #define MODF_RVE_PARAM_FREE(cmd, src, dst) \
  115. for (i=0; i < (dst)[1].u.number; i++) { \
  116. if ((src)[i+2].type == RVE_ST && (dst)[i+2].u.data) { \
  117. if ((dst)[i+2].type == RVE_FREE_FIXUP_ST) {\
  118. /* call free_fixup (which should restore the original
  119. string) */ \
  120. (void)call_fixup((cmd)->free_fixup, &(dst)[i+2].u.data, i+1); \
  121. } else if ((dst)[i+2].type == FPARAM_DYN_ST) {\
  122. /* completely frees fparam and restore original string */\
  123. fparam_free_restore(&(dst)[i+2].u.data); \
  124. } \
  125. /* free allocated string */ \
  126. pkg_free((dst)[i+2].u.data); \
  127. (dst)[i+2].u.data = 0; \
  128. } \
  129. }
  130. /* fills dst from src, converting RVE_ST params to STRING_ST.
  131. * (used internally in do_action())
  132. * @param src - source action_u_t array, as in the action structure
  133. * @param dst - destination action_u_t array, will be filled from src.
  134. * WARNING: dst must be cleaned when done, use MODULE_RVE_PARAM_FREE()
  135. * Side-effects: clobbers i (int), s (str), rv (rvalue*), might jump to error.
  136. */
  137. #define MODF_RVE_PARAM_CONVERT(h, msg, cmd, src, dst) \
  138. do { \
  139. (dst)[1]=(src)[1]; \
  140. for (i=0; i < (src)[1].u.number; i++) { \
  141. if ((src)[2+i].type == RVE_ST) { \
  142. rv=rval_expr_eval((h), (msg), (src)[i+2].u.data); \
  143. if (unlikely(rv == 0 || \
  144. rval_get_str((h), (msg), &s, rv, 0) < 0)) { \
  145. rval_destroy(rv); \
  146. ERR("failed to convert RVE to string\n"); \
  147. (dst)[1].u.number = i; \
  148. MODF_RVE_PARAM_FREE(cmd, src, dst); \
  149. goto error; \
  150. } \
  151. (dst)[i+2].type = STRING_RVE_ST; \
  152. (dst)[i+2].u.string = s.s; \
  153. (dst)[i+2].u.str.len = s.len; \
  154. rval_destroy(rv); \
  155. if ((cmd)->fixup) {\
  156. if ((cmd)->free_fixup) {\
  157. if (likely( call_fixup((cmd)->fixup, \
  158. &(dst)[i+2].u.data, i+1) >= 0) ) { \
  159. /* success => mark it for calling free fixup */ \
  160. if (likely((dst)[i+2].u.data != s.s)) \
  161. (dst)[i+2].type = RVE_FREE_FIXUP_ST; \
  162. } else { \
  163. /* error calling fixup => mark conv. parameter \
  164. and return error */ \
  165. (dst)[1].u.number = i; \
  166. ERR("runtime fixup failed for %s param %d\n", \
  167. (cmd)->name, i+1); \
  168. MODF_RVE_PARAM_FREE(cmd, src, dst); \
  169. goto error; \
  170. } \
  171. } else if ((cmd)->fixup_flags & FIXUP_F_FPARAM_RVE) { \
  172. if (likely( call_fixup((cmd)->fixup, \
  173. &(dst)[i+2].u.data, i+1) >= 0)) { \
  174. if ((dst)[i+2].u.data != s.s) \
  175. (dst)[i+2].type = FPARAM_DYN_ST; \
  176. } else { \
  177. /* error calling fixup => mark conv. parameter \
  178. and return error */ \
  179. (dst)[1].u.number = i; \
  180. ERR("runtime fixup failed for %s param %d\n", \
  181. (cmd)->name, i+1); \
  182. MODF_RVE_PARAM_FREE(cmd, src, dst); \
  183. goto error; \
  184. }\
  185. } \
  186. } \
  187. } else \
  188. (dst)[i+2]=(src)[i+2]; \
  189. } \
  190. } while(0)
  191. /* call a module function with normal STRING_ST params.
  192. * (used internally in do_action())
  193. * @param f_type - cmd_function type
  194. * @param h
  195. * @param msg
  196. * @param src - source action_u_t array (e.g. action->val)
  197. * @param params... - variable list of parameters, passed to the module
  198. * function
  199. * Side-effects: sets ret, clobbers i (int), s (str), rv (rvalue*), cmd,
  200. * might jump to error.
  201. *
  202. */
  203. #ifdef __SUNPRO_C
  204. #define MODF_CALL(f_type, h, msg, src, ...) \
  205. do { \
  206. cmd=(src)[0].u.data; \
  207. ret=((f_type)cmd->function)((msg), __VAR_ARGS__); \
  208. MODF_HANDLE_RETCODE(h, ret); \
  209. } while (0)
  210. #else /* ! __SUNPRO_C (gcc, icc a.s.o) */
  211. #define MODF_CALL(f_type, h, msg, src, params...) \
  212. do { \
  213. cmd=(src)[0].u.data; \
  214. ret=((f_type)cmd->function)((msg), ## params ); \
  215. MODF_HANDLE_RETCODE(h, ret); \
  216. } while (0)
  217. #endif /* __SUNPRO_C */
  218. /* call a module function with possible RVE params.
  219. * (used internally in do_action())
  220. * @param f_type - cmd_function type
  221. * @param h
  222. * @param msg
  223. * @param src - source action_u_t array (e.g. action->val)
  224. * @param dst - temporary action_u_t array used for conversions. It can be
  225. * used for the function parameters. It's contents it's not
  226. * valid after the call.
  227. * @param params... - variable list of parameters, passed to the module
  228. * function
  229. * Side-effects: sets ret, clobbers i (int), s (str), rv (rvalue*), f, dst,
  230. * might jump to error.
  231. *
  232. */
  233. #ifdef __SUNPRO_C
  234. #define MODF_RVE_CALL(f_type, h, msg, src, dst, ...) \
  235. do { \
  236. cmd=(src)[0].u.data; \
  237. MODF_RVE_PARAM_CONVERT(h, msg, cmd, src, dst); \
  238. ret=((f_type)cmd->function)((msg), __VAR_ARGS__); \
  239. MODF_HANDLE_RETCODE(h, ret); \
  240. /* free strings allocated by us or fixups */ \
  241. MODF_RVE_PARAM_FREE(cmd, src, dst); \
  242. } while (0)
  243. #else /* ! __SUNPRO_C (gcc, icc a.s.o) */
  244. #define MODF_RVE_CALL(f_type, h, msg, src, dst, params...) \
  245. do { \
  246. cmd=(src)[0].u.data; \
  247. MODF_RVE_PARAM_CONVERT(h, msg, cmd, src, dst); \
  248. ret=((f_type)cmd->function)((msg), ## params ); \
  249. MODF_HANDLE_RETCODE(h, ret); \
  250. /* free strings allocated by us or fixups */ \
  251. MODF_RVE_PARAM_FREE(cmd, src, dst); \
  252. } while (0)
  253. #endif /* __SUNPRO_C */
  254. /* ret= 0! if action -> end of list(e.g DROP),
  255. > 0 to continue processing next actions
  256. and <0 on error */
  257. int do_action(struct run_act_ctx* h, struct action* a, struct sip_msg* msg)
  258. {
  259. int ret;
  260. int v;
  261. struct dest_info dst;
  262. char* tmp;
  263. char *new_uri, *end, *crt;
  264. sr31_cmd_export_t* cmd;
  265. int len;
  266. int user;
  267. struct sip_uri uri, next_hop;
  268. struct sip_uri *u;
  269. unsigned short port;
  270. str* dst_host;
  271. int i, flags;
  272. avp_t* avp;
  273. struct search_state st;
  274. struct switch_cond_table* sct;
  275. struct switch_jmp_table* sjt;
  276. struct rval_expr* rve;
  277. struct match_cond_table* mct;
  278. struct rvalue* rv;
  279. struct rvalue* rv1;
  280. struct rval_cache c1;
  281. str s;
  282. void *srevp[2];
  283. /* temporary storage space for a struct action.val[] working copy
  284. (needed to transform RVE intro STRING before calling module
  285. functions). [0] is not used (corresp. to the module export pointer),
  286. [1] contains the number of params, and [2..] the param values.
  287. We need [1], because some fixup function use it
  288. (see fixup_get_param_count()). */
  289. static action_u_t mod_f_params[MAX_ACTIONS];
  290. /* reset the value of error to E_UNSPEC so avoid unknowledgable
  291. functions to return with error (status<0) and not setting it
  292. leaving there previous error; cache the previous value though
  293. for functions which want to process it */
  294. prev_ser_error=ser_error;
  295. ser_error=E_UNSPEC;
  296. /* hook for every executed action (in use by cfg debugger) */
  297. if(unlikely(sr_event_enabled(SREV_CFG_RUN_ACTION)))
  298. {
  299. srevp[0] = (void*)a;
  300. srevp[1] = (void*)msg;
  301. sr_event_exec(SREV_CFG_RUN_ACTION, (void*)srevp);
  302. }
  303. ret=E_BUG;
  304. switch ((unsigned char)a->type){
  305. case DROP_T:
  306. switch(a->val[0].type){
  307. case NUMBER_ST:
  308. ret=(int) a->val[0].u.number;
  309. break;
  310. case RVE_ST:
  311. rve=(struct rval_expr*)a->val[0].u.data;
  312. rval_expr_eval_int(h, msg, &ret, rve);
  313. break;
  314. case RETCODE_ST:
  315. ret=h->last_retcode;
  316. break;
  317. default:
  318. BUG("unexpected subtype %d in DROP_T\n",
  319. a->val[0].type);
  320. ret=0;
  321. goto error;
  322. }
  323. h->run_flags|=(unsigned int)a->val[1].u.number;
  324. break;
  325. case FORWARD_T:
  326. #ifdef USE_TCP
  327. case FORWARD_TCP_T:
  328. #endif
  329. #ifdef USE_TLS
  330. case FORWARD_TLS_T:
  331. #endif
  332. #ifdef USE_SCTP
  333. case FORWARD_SCTP_T:
  334. #endif
  335. case FORWARD_UDP_T:
  336. /* init dst */
  337. init_dest_info(&dst);
  338. if (a->type==FORWARD_UDP_T) dst.proto=PROTO_UDP;
  339. #ifdef USE_TCP
  340. else if (a->type==FORWARD_TCP_T) dst.proto= PROTO_TCP;
  341. #endif
  342. #ifdef USE_TLS
  343. else if (a->type==FORWARD_TLS_T) dst.proto= PROTO_TLS;
  344. #endif
  345. #ifdef USE_SCTP
  346. else if (a->type==FORWARD_SCTP_T) dst.proto=PROTO_SCTP;
  347. #endif
  348. else dst.proto=PROTO_NONE;
  349. if (a->val[0].type==URIHOST_ST){
  350. /*parse uri*/
  351. if (msg->dst_uri.len) {
  352. ret = parse_uri(msg->dst_uri.s, msg->dst_uri.len,
  353. &next_hop);
  354. u = &next_hop;
  355. } else {
  356. ret = parse_sip_msg_uri(msg);
  357. u = &msg->parsed_uri;
  358. }
  359. if (ret<0) {
  360. LM_ERR("forward: bad_uri dropping packet\n");
  361. goto error;
  362. }
  363. switch (a->val[1].type){
  364. case URIPORT_ST:
  365. port=u->port_no;
  366. break;
  367. case NUMBER_ST:
  368. port=a->val[1].u.number;
  369. break;
  370. default:
  371. LM_CRIT("bad forward 2nd param type (%d)\n", a->val[1].type);
  372. ret=E_UNSPEC;
  373. goto error_fwd_uri;
  374. }
  375. if (dst.proto == PROTO_NONE){ /* only if proto not set get it
  376. from the uri */
  377. switch(u->proto){
  378. case PROTO_NONE:
  379. /*dst.proto=PROTO_UDP; */
  380. /* no proto, try to get it from the dns */
  381. break;
  382. case PROTO_UDP:
  383. #ifdef USE_TCP
  384. case PROTO_TCP:
  385. case PROTO_WS:
  386. #endif
  387. #ifdef USE_TLS
  388. case PROTO_TLS:
  389. case PROTO_WSS:
  390. #endif
  391. #ifdef USE_SCTP
  392. case PROTO_SCTP:
  393. #endif
  394. dst.proto=u->proto;
  395. break;
  396. default:
  397. LM_ERR("forward: bad uri transport %d\n", u->proto);
  398. ret=E_BAD_PROTO;
  399. goto error_fwd_uri;
  400. }
  401. #ifdef USE_TLS
  402. if (u->type==SIPS_URI_T){
  403. if (u->proto==PROTO_UDP){
  404. LM_ERR("forward: secure uri incompatible with transport %d\n",
  405. u->proto);
  406. ret=E_BAD_PROTO;
  407. goto error_fwd_uri;
  408. } else if (u->proto!=PROTO_WSS)
  409. dst.proto=PROTO_TLS;
  410. else
  411. dst.proto=PROTO_WSS;
  412. }
  413. #endif
  414. }
  415. #ifdef HONOR_MADDR
  416. if (u->maddr_val.s && u->maddr_val.len)
  417. dst_host=&u->maddr_val;
  418. else
  419. #endif
  420. dst_host=&u->host;
  421. #ifdef USE_COMP
  422. dst.comp=u->comp;
  423. #endif
  424. ret=forward_request(msg, dst_host, port, &dst);
  425. if (ret>=0){
  426. ret=1;
  427. }
  428. }else if ((a->val[0].type==PROXY_ST) && (a->val[1].type==NUMBER_ST)){
  429. if (dst.proto==PROTO_NONE)
  430. dst.proto=msg->rcv.proto;
  431. proxy2su(&dst.to, (struct proxy_l*)a->val[0].u.data);
  432. ret=forward_request(msg, 0, 0, &dst);
  433. if (ret>=0){
  434. ret=1;
  435. proxy_mark((struct proxy_l*)a->val[0].u.data, ret);
  436. }else if (ser_error!=E_OK){
  437. proxy_mark((struct proxy_l*)a->val[0].u.data, ret);
  438. }
  439. }else{
  440. LM_CRIT("bad forward() types %d, %d\n",
  441. a->val[0].type, a->val[1].type);
  442. ret=E_BUG;
  443. goto error;
  444. }
  445. break;
  446. case LOG_T:
  447. if ((a->val[0].type!=NUMBER_ST)|(a->val[1].type!=STRING_ST)){
  448. LM_CRIT("bad log() types %d, %d\n",
  449. a->val[0].type, a->val[1].type);
  450. ret=E_BUG;
  451. goto error;
  452. }
  453. LOG_(DEFAULT_FACILITY, a->val[0].u.number, "<script>: ", "%s",
  454. a->val[1].u.string);
  455. ret=1;
  456. break;
  457. /* jku -- introduce a new branch */
  458. case APPEND_BRANCH_T:
  459. if (unlikely(a->val[0].type!=STR_ST)) {
  460. LM_CRIT("bad append_branch_t %d\n", a->val[0].type );
  461. ret=E_BUG;
  462. goto error;
  463. }
  464. getbflagsval(0, (flag_t*)&flags);
  465. ret=append_branch(msg, &a->val[0].u.str, &msg->dst_uri,
  466. &msg->path_vec, a->val[1].u.number,
  467. (flag_t)flags, msg->force_send_socket,
  468. 0, 0, 0, 0);
  469. /* if the uri is the ruri and q was also not changed, mark
  470. ruri as consumed, to avoid having an identical branch */
  471. if ((a->val[0].u.str.s == 0 || a->val[0].u.str.len == 0) &&
  472. a->val[1].u.number == Q_UNSPECIFIED)
  473. ruri_mark_consumed();
  474. break;
  475. /* remove last branch */
  476. case REMOVE_BRANCH_T:
  477. if (a->val[0].type!=NUMBER_ST) {
  478. ret=drop_sip_branch(0) ? -1 : 1;
  479. } else {
  480. ret=drop_sip_branch(a->val[0].u.number) ? -1 : 1;
  481. }
  482. break;
  483. /* remove all branches */
  484. case CLEAR_BRANCHES_T:
  485. clear_branches();
  486. ret=1;
  487. break;
  488. /* jku begin: is_length_greater_than */
  489. case LEN_GT_T:
  490. if (a->val[0].type!=NUMBER_ST) {
  491. LM_CRIT("bad len_gt type %d\n", a->val[0].type );
  492. ret=E_BUG;
  493. goto error;
  494. }
  495. /* LM_DBG("message length %d, max %d\n",
  496. msg->len, a->val[0].u.number ); */
  497. ret = msg->len >= a->val[0].u.number ? 1 : -1;
  498. break;
  499. /* jku end: is_length_greater_than */
  500. /* jku - begin : flag processing */
  501. case SETFLAG_T:
  502. if (a->val[0].type!=NUMBER_ST) {
  503. LM_CRIT("bad setflag() type %d\n", a->val[0].type );
  504. ret=E_BUG;
  505. goto error;
  506. }
  507. if (!flag_in_range( a->val[0].u.number )) {
  508. ret=E_CFG;
  509. goto error;
  510. }
  511. setflag( msg, a->val[0].u.number );
  512. ret=1;
  513. break;
  514. case RESETFLAG_T:
  515. if (a->val[0].type!=NUMBER_ST) {
  516. LM_CRIT("bad resetflag() type %d\n", a->val[0].type );
  517. ret=E_BUG;
  518. goto error;
  519. }
  520. if (!flag_in_range( a->val[0].u.number )) {
  521. ret=E_CFG;
  522. goto error;
  523. }
  524. resetflag( msg, a->val[0].u.number );
  525. ret=1;
  526. break;
  527. case ISFLAGSET_T:
  528. if (a->val[0].type!=NUMBER_ST) {
  529. LM_CRIT("bad isflagset() type %d\n", a->val[0].type );
  530. ret=E_BUG;
  531. goto error;
  532. }
  533. if (!flag_in_range( a->val[0].u.number )) {
  534. ret=E_CFG;
  535. goto error;
  536. }
  537. ret=isflagset( msg, a->val[0].u.number );
  538. break;
  539. /* jku - end : flag processing */
  540. case AVPFLAG_OPER_T:
  541. ret = 0;
  542. if ((a->val[0].u.attr->type & AVP_INDEX_ALL) == AVP_INDEX_ALL ||
  543. (a->val[0].u.attr->type & AVP_NAME_RE)!=0) {
  544. for (avp=search_first_avp(a->val[0].u.attr->type,
  545. a->val[0].u.attr->name, NULL, &st);
  546. avp;
  547. avp = search_next_avp(&st, NULL)) {
  548. switch (a->val[2].u.number) {
  549. /* oper: 0..reset, 1..set, -1..no change */
  550. case 0:
  551. avp->flags &= ~(avp_flags_t)a->val[1].u.number;
  552. break;
  553. case 1:
  554. avp->flags |= (avp_flags_t)a->val[1].u.number;
  555. break;
  556. default:;
  557. }
  558. ret = ret ||
  559. ((avp->flags & (avp_flags_t)a->val[1].u.number) != 0);
  560. }
  561. } else {
  562. avp = search_avp_by_index(a->val[0].u.attr->type,
  563. a->val[0].u.attr->name, NULL,
  564. a->val[0].u.attr->index);
  565. if (avp) {
  566. switch (a->val[2].u.number) {
  567. /* oper: 0..reset, 1..set, -1..no change */
  568. case 0:
  569. avp->flags &= ~(avp_flags_t)a->val[1].u.number;
  570. break;
  571. case 1:
  572. avp->flags |= (avp_flags_t)a->val[1].u.number;
  573. break;
  574. default:;
  575. }
  576. ret = (avp->flags & (avp_flags_t)a->val[1].u.number) != 0;
  577. }
  578. }
  579. if (ret==0)
  580. ret = -1;
  581. break;
  582. case ERROR_T:
  583. if ((a->val[0].type!=STRING_ST)|(a->val[1].type!=STRING_ST)){
  584. LM_CRIT("bad error() types %d, %d\n", a->val[0].type, a->val[1].type);
  585. ret=E_BUG;
  586. goto error;
  587. }
  588. LM_NOTICE("error(\"%s\", \"%s\") "
  589. "not implemented yet\n", a->val[0].u.string, a->val[1].u.string);
  590. ret=1;
  591. break;
  592. case ROUTE_T:
  593. if (likely(a->val[0].type == NUMBER_ST))
  594. i = a->val[0].u.number;
  595. else if (a->val[0].type == RVE_ST) {
  596. rv = rval_expr_eval(h, msg, a->val[0].u.data);
  597. rval_cache_init(&c1);
  598. if (unlikely(rv == 0 ||
  599. rval_get_tmp_str(h, msg, &s, rv, 0, &c1) < 0)) {
  600. rval_destroy(rv);
  601. rval_cache_clean(&c1);
  602. ERR("failed to convert RVE to string\n");
  603. ret = E_UNSPEC;
  604. goto error;
  605. }
  606. i = route_lookup(&main_rt, s.s);
  607. if (unlikely(i < 0)) {
  608. ERR("route \"%s\" not found at %s:%d\n",
  609. s.s, (a->cfile)?a->cfile:"line", a->cline);
  610. rval_destroy(rv);
  611. rval_cache_clean(&c1);
  612. s.s = 0;
  613. ret = E_SCRIPT;
  614. goto error;
  615. }
  616. rval_destroy(rv);
  617. rval_cache_clean(&c1);
  618. s.s = 0;
  619. } else {
  620. LM_CRIT("bad route() type %d\n", a->val[0].type);
  621. ret=E_BUG;
  622. goto error;
  623. }
  624. if (unlikely((i>=main_rt.idx)||(i<0))){
  625. LM_ERR("invalid routing table number in"
  626. "route(%lu) at %s:%d\n", a->val[0].u.number,
  627. (a->cfile)?a->cfile:"line", a->cline);
  628. ret=E_CFG;
  629. goto error;
  630. }
  631. /*ret=((ret=run_actions(rlist[a->val[0].u.number],msg))<0)?ret:1;*/
  632. ret=run_actions(h, main_rt.rlist[i], msg);
  633. h->last_retcode=ret;
  634. _last_returned_code = h->last_retcode;
  635. h->run_flags&=~(RETURN_R_F|BREAK_R_F); /* absorb return & break */
  636. break;
  637. case EXEC_T:
  638. if (a->val[0].type!=STRING_ST){
  639. LM_CRIT("bad exec() type %d\n", a->val[0].type);
  640. ret=E_BUG;
  641. goto error;
  642. }
  643. LM_NOTICE("exec(\"%s\") not fully implemented,"
  644. " using dumb version...\n", a->val[0].u.string);
  645. ret=system(a->val[0].u.string);
  646. if (ret!=0){
  647. LM_NOTICE("exec() returned %d\n", ret);
  648. }
  649. ret=1;
  650. break;
  651. case REVERT_URI_T:
  652. if (msg->new_uri.s) {
  653. pkg_free(msg->new_uri.s);
  654. msg->new_uri.len=0;
  655. msg->new_uri.s=0;
  656. msg->parsed_uri_ok=0; /* invalidate current parsed uri*/
  657. ruri_mark_new(); /* available for forking */
  658. };
  659. ret=1;
  660. break;
  661. case SET_HOST_T:
  662. case SET_HOSTPORT_T:
  663. case SET_HOSTPORTTRANS_T:
  664. case SET_HOSTALL_T:
  665. case SET_USER_T:
  666. case SET_USERPASS_T:
  667. case SET_PORT_T:
  668. case SET_URI_T:
  669. case PREFIX_T:
  670. case STRIP_T:
  671. case STRIP_TAIL_T:
  672. case SET_USERPHONE_T:
  673. user=0;
  674. if (a->type==STRIP_T || a->type==STRIP_TAIL_T) {
  675. if (a->val[0].type!=NUMBER_ST) {
  676. LM_CRIT("bad set*() type %d\n", a->val[0].type);
  677. ret=E_BUG;
  678. goto error;
  679. }
  680. } else if (a->type!=SET_USERPHONE_T) {
  681. if (a->val[0].type!=STRING_ST) {
  682. LM_CRIT("bad set*() type %d\n", a->val[0].type);
  683. ret=E_BUG;
  684. goto error;
  685. }
  686. }
  687. if (a->type==SET_URI_T){
  688. if (msg->new_uri.s) {
  689. pkg_free(msg->new_uri.s);
  690. msg->new_uri.len=0;
  691. }
  692. msg->parsed_uri_ok=0;
  693. len=strlen(a->val[0].u.string);
  694. msg->new_uri.s=pkg_malloc(len+1);
  695. if (msg->new_uri.s==0){
  696. LM_ERR("memory allocation failure\n");
  697. ret=E_OUT_OF_MEM;
  698. goto error;
  699. }
  700. memcpy(msg->new_uri.s, a->val[0].u.string, len);
  701. msg->new_uri.s[len]=0;
  702. msg->new_uri.len=len;
  703. ruri_mark_new(); /* available for forking */
  704. ret=1;
  705. break;
  706. }
  707. if (msg->parsed_uri_ok==0) {
  708. if (msg->new_uri.s) {
  709. tmp=msg->new_uri.s;
  710. len=msg->new_uri.len;
  711. }else{
  712. tmp=msg->first_line.u.request.uri.s;
  713. len=msg->first_line.u.request.uri.len;
  714. }
  715. if (parse_uri(tmp, len, &uri)<0){
  716. LM_ERR("bad uri <%s>, dropping packet\n", tmp);
  717. ret=E_UNSPEC;
  718. goto error;
  719. }
  720. } else {
  721. uri=msg->parsed_uri;
  722. }
  723. /* skip SET_USERPHONE_T action if the URI is already
  724. * a tel: or tels: URI, or contains the user=phone param */
  725. if ((a->type==SET_USERPHONE_T)
  726. && ((uri.type==TEL_URI_T) || (uri.type==TELS_URI_T)
  727. || ((uri.user_param_val.len==5) && (memcmp(uri.user_param_val.s, "phone", 5)==0)))
  728. ) {
  729. ret=1;
  730. break;
  731. }
  732. /* SET_PORT_T does not work with tel: URIs */
  733. if ((a->type==SET_PORT_T)
  734. && ((uri.type==TEL_URI_T) || (uri.type==TELS_URI_T))
  735. && ((uri.flags & URI_SIP_USER_PHONE)==0)
  736. ) {
  737. LM_ERR("port number of a tel: URI cannot be set\n");
  738. ret=E_UNSPEC;
  739. goto error;
  740. }
  741. new_uri=pkg_malloc(MAX_URI_SIZE);
  742. if (new_uri==0){
  743. LM_ERR("memory allocation failure\n");
  744. ret=E_OUT_OF_MEM;
  745. goto error;
  746. }
  747. end=new_uri+MAX_URI_SIZE;
  748. crt=new_uri;
  749. /* begin copying */
  750. /* Preserve the URI scheme unless the host part needs
  751. * to be rewritten, and the shceme is tel: or tels: */
  752. switch (uri.type) {
  753. case SIP_URI_T:
  754. len=s_sip.len;
  755. tmp=s_sip.s;
  756. break;
  757. case SIPS_URI_T:
  758. len=s_sips.len;
  759. tmp=s_sips.s;
  760. break;
  761. case TEL_URI_T:
  762. if ((uri.flags & URI_SIP_USER_PHONE)
  763. || (a->type==SET_HOST_T)
  764. || (a->type==SET_HOSTPORT_T)
  765. || (a->type==SET_HOSTPORTTRANS_T)
  766. ) {
  767. len=s_sip.len;
  768. tmp=s_sip.s;
  769. break;
  770. }
  771. len=s_tel.len;
  772. tmp=s_tel.s;
  773. break;
  774. case TELS_URI_T:
  775. if ((uri.flags & URI_SIP_USER_PHONE)
  776. || (a->type==SET_HOST_T)
  777. || (a->type==SET_HOSTPORT_T)
  778. || (a->type==SET_HOSTPORTTRANS_T)
  779. ) {
  780. len=s_sips.len;
  781. tmp=s_sips.s;
  782. break;
  783. }
  784. len=s_tels.len;
  785. tmp=s_tels.s;
  786. break;
  787. default:
  788. LM_ERR("Unsupported URI scheme (%d), reverted to sip:\n",
  789. uri.type);
  790. len=s_sip.len;
  791. tmp=s_sip.s;
  792. }
  793. if(crt+len+1 /* colon */ >end) goto error_uri;
  794. memcpy(crt,tmp,len);crt+=len;
  795. *crt=':'; crt++;
  796. /* user */
  797. /* prefix (-jiri) */
  798. if (a->type==PREFIX_T) {
  799. tmp=a->val[0].u.string;
  800. len=strlen(tmp); if(crt+len>end) goto error_uri;
  801. memcpy(crt,tmp,len);crt+=len;
  802. /* whatever we had before, with prefix we have username
  803. now */
  804. user=1;
  805. }
  806. if ((a->type==SET_USER_T)||(a->type==SET_USERPASS_T)) {
  807. tmp=a->val[0].u.string;
  808. len=strlen(tmp);
  809. } else if (a->type==STRIP_T) {
  810. if (a->val[0].u.number>uri.user.len) {
  811. LM_WARN("too long strip asked; deleting username: %lu of <%.*s>\n",
  812. a->val[0].u.number, uri.user.len, uri.user.s );
  813. len=0;
  814. } else if (a->val[0].u.number==uri.user.len) {
  815. len=0;
  816. } else {
  817. tmp=uri.user.s + a->val[0].u.number;
  818. len=uri.user.len - a->val[0].u.number;
  819. }
  820. } else if (a->type==STRIP_TAIL_T) {
  821. if (a->val[0].u.number>uri.user.len) {
  822. LM_WARN("too long strip_tail asked; "
  823. " deleting username: %lu of <%.*s>\n",
  824. a->val[0].u.number, uri.user.len, uri.user.s );
  825. len=0;
  826. } else if (a->val[0].u.number==uri.user.len) {
  827. len=0;
  828. } else {
  829. tmp=uri.user.s;
  830. len=uri.user.len - a->val[0].u.number;
  831. }
  832. } else {
  833. tmp=uri.user.s;
  834. len=uri.user.len;
  835. }
  836. if (len){
  837. if(crt+len>end) goto error_uri;
  838. memcpy(crt,tmp,len);crt+=len;
  839. user=1; /* we have an user field so mark it */
  840. }
  841. if (a->type==SET_USERPASS_T) tmp=0;
  842. else tmp=uri.passwd.s;
  843. /* passwd - keep it only if user is set */
  844. if (user && tmp){
  845. len=uri.passwd.len; if(crt+len+1>end) goto error_uri;
  846. *crt=':'; crt++;
  847. memcpy(crt,tmp,len);crt+=len;
  848. }
  849. /* tel: URI parameters */
  850. if ((uri.type==TEL_URI_T)
  851. || (uri.type==TELS_URI_T)
  852. ) {
  853. tmp=uri.params.s;
  854. if (tmp){
  855. len=uri.params.len; if(crt+len+1>end) goto error_uri;
  856. *crt=';'; crt++;
  857. memcpy(crt,tmp,len);crt+=len;
  858. }
  859. }
  860. /* host */
  861. if ((a->type==SET_HOST_T)
  862. || (a->type==SET_HOSTPORT_T)
  863. || (a->type==SET_HOSTALL_T)
  864. || (a->type==SET_HOSTPORTTRANS_T)
  865. ) {
  866. tmp=a->val[0].u.string;
  867. if (tmp) len = strlen(tmp);
  868. else len=0;
  869. } else if ((uri.type==SIP_URI_T)
  870. || (uri.type==SIPS_URI_T)
  871. || (uri.flags & URI_SIP_USER_PHONE)
  872. ) {
  873. tmp=uri.host.s;
  874. len=uri.host.len;
  875. } else {
  876. tmp=0;
  877. }
  878. if (tmp){
  879. if (user) { /* add @ */
  880. if(crt+1>end) goto error_uri;
  881. *crt='@'; crt++;
  882. }
  883. if(crt+len>end) goto error_uri;
  884. memcpy(crt,tmp,len);crt+=len;
  885. }
  886. if(a->type==SET_HOSTALL_T)
  887. goto done_seturi;
  888. /* port */
  889. if ((a->type==SET_HOSTPORT_T)
  890. || (a->type==SET_HOSTPORTTRANS_T))
  891. tmp=0;
  892. else if (a->type==SET_PORT_T) {
  893. tmp=a->val[0].u.string;
  894. if (tmp) {
  895. len = strlen(tmp);
  896. if(len==0) tmp = 0;
  897. } else len = 0;
  898. } else {
  899. tmp=uri.port.s;
  900. len = uri.port.len;
  901. }
  902. if (tmp){
  903. if(crt+len+1>end) goto error_uri;
  904. *crt=':'; crt++;
  905. memcpy(crt,tmp,len);crt+=len;
  906. }
  907. /* params */
  908. if ((a->type==SET_HOSTPORTTRANS_T)
  909. && uri.sip_params.s
  910. && uri.transport.s
  911. ) {
  912. /* bypass the transport parameter */
  913. if (uri.sip_params.s < uri.transport.s) {
  914. /* there are parameters before transport */
  915. len = uri.transport.s - uri.sip_params.s - 1;
  916. /* ignore the ';' at the end */
  917. if (crt+len+1>end) goto error_uri;
  918. *crt=';'; crt++;
  919. memcpy(crt,uri.sip_params.s,len);crt+=len;
  920. }
  921. len = (uri.sip_params.s + uri.sip_params.len) -
  922. (uri.transport.s + uri.transport.len);
  923. if (len > 0) {
  924. /* there are parameters after transport */
  925. if (crt+len>end) goto error_uri;
  926. tmp = uri.transport.s + uri.transport.len;
  927. memcpy(crt,tmp,len);crt+=len;
  928. }
  929. } else {
  930. tmp=uri.sip_params.s;
  931. if (tmp){
  932. len=uri.sip_params.len; if(crt+len+1>end) goto error_uri;
  933. *crt=';'; crt++;
  934. memcpy(crt,tmp,len);crt+=len;
  935. }
  936. }
  937. /* Add the user=phone param if a tel: or tels:
  938. * URI was converted to sip: or sips:.
  939. * (host part of a tel/tels URI was set.)
  940. * Or in case of sip: URI and SET_USERPHONE_T action */
  941. if (((((uri.type==TEL_URI_T) || (uri.type==TELS_URI_T))
  942. && ((uri.flags & URI_SIP_USER_PHONE)==0))
  943. && ((a->type==SET_HOST_T)
  944. || (a->type==SET_HOSTPORT_T)
  945. || (a->type==SET_HOSTPORTTRANS_T)))
  946. || (a->type==SET_USERPHONE_T)
  947. ) {
  948. tmp=";user=phone";
  949. len=strlen(tmp);
  950. if(crt+len>end) goto error_uri;
  951. memcpy(crt,tmp,len);crt+=len;
  952. }
  953. /* headers */
  954. tmp=uri.headers.s;
  955. if (tmp){
  956. len=uri.headers.len; if(crt+len+1>end) goto error_uri;
  957. *crt='?'; crt++;
  958. memcpy(crt,tmp,len);crt+=len;
  959. }
  960. done_seturi:
  961. *crt=0; /* null terminate the thing */
  962. /* copy it to the msg */
  963. if (msg->new_uri.s) pkg_free(msg->new_uri.s);
  964. msg->new_uri.s=new_uri;
  965. msg->new_uri.len=crt-new_uri;
  966. msg->parsed_uri_ok=0;
  967. ruri_mark_new(); /* available for forking */
  968. ret=1;
  969. break;
  970. case IF_T:
  971. rve=(struct rval_expr*)a->val[0].u.data;
  972. if (unlikely(rval_expr_eval_int(h, msg, &v, rve) != 0)){
  973. ERR("if expression evaluation failed (%d,%d-%d,%d)\n",
  974. rve->fpos.s_line, rve->fpos.s_col,
  975. rve->fpos.e_line, rve->fpos.e_col);
  976. v=0; /* false */
  977. }
  978. if (unlikely(h->run_flags & EXIT_R_F)){
  979. ret=0;
  980. break;
  981. }
  982. h->run_flags &= ~(RETURN_R_F|BREAK_R_F); /* catch return &
  983. break in expr*/
  984. ret=1; /*default is continue */
  985. if (v>0) {
  986. if ((a->val[1].type==ACTIONS_ST)&&a->val[1].u.data){
  987. ret=run_actions(h,
  988. (struct action*)a->val[1].u.data, msg);
  989. }
  990. }else if ((a->val[2].type==ACTIONS_ST)&&a->val[2].u.data){
  991. ret=run_actions(h,
  992. (struct action*)a->val[2].u.data, msg);
  993. }
  994. break;
  995. case MODULE0_T:
  996. MODF_CALL(cmd_function, h, msg, a->val, 0, 0);
  997. break;
  998. /* instead of using the parameter number, we use different names
  999. * for calls to functions with 3, 4, 5, 6 or variable number of
  1000. * parameters due to performance reasons */
  1001. case MODULE1_T:
  1002. MODF_CALL(cmd_function, h, msg, a->val,
  1003. (char*)a->val[2].u.data,
  1004. 0
  1005. );
  1006. break;
  1007. case MODULE2_T:
  1008. MODF_CALL(cmd_function, h, msg, a->val,
  1009. (char*)a->val[2].u.data,
  1010. (char*)a->val[3].u.data
  1011. );
  1012. break;
  1013. case MODULE3_T:
  1014. MODF_CALL(cmd_function3, h, msg, a->val,
  1015. (char*)a->val[2].u.data,
  1016. (char*)a->val[3].u.data,
  1017. (char*)a->val[4].u.data
  1018. );
  1019. break;
  1020. case MODULE4_T:
  1021. MODF_CALL(cmd_function4, h, msg, a->val,
  1022. (char*)a->val[2].u.data,
  1023. (char*)a->val[3].u.data,
  1024. (char*)a->val[4].u.data,
  1025. (char*)a->val[5].u.data
  1026. );
  1027. break;
  1028. case MODULE5_T:
  1029. MODF_CALL(cmd_function5, h, msg, a->val,
  1030. (char*)a->val[2].u.data,
  1031. (char*)a->val[3].u.data,
  1032. (char*)a->val[4].u.data,
  1033. (char*)a->val[5].u.data,
  1034. (char*)a->val[6].u.data
  1035. );
  1036. break;
  1037. case MODULE6_T:
  1038. MODF_CALL(cmd_function6, h, msg, a->val,
  1039. (char*)a->val[2].u.data,
  1040. (char*)a->val[3].u.data,
  1041. (char*)a->val[4].u.data,
  1042. (char*)a->val[5].u.data,
  1043. (char*)a->val[6].u.data,
  1044. (char*)a->val[7].u.data
  1045. );
  1046. break;
  1047. case MODULEX_T:
  1048. MODF_CALL(cmd_function_var, h, msg, a->val,
  1049. a->val[1].u.number, &a->val[2]);
  1050. break;
  1051. case MODULE1_RVE_T:
  1052. MODF_RVE_CALL(cmd_function, h, msg, a->val, mod_f_params,
  1053. (char*)mod_f_params[2].u.data,
  1054. 0
  1055. );
  1056. break;
  1057. case MODULE2_RVE_T:
  1058. MODF_RVE_CALL(cmd_function, h, msg, a->val, mod_f_params,
  1059. (char*)mod_f_params[2].u.data,
  1060. (char*)mod_f_params[3].u.data
  1061. );
  1062. break;
  1063. case MODULE3_RVE_T:
  1064. MODF_RVE_CALL(cmd_function3, h, msg, a->val, mod_f_params,
  1065. (char*)mod_f_params[2].u.data,
  1066. (char*)mod_f_params[3].u.data,
  1067. (char*)mod_f_params[4].u.data
  1068. );
  1069. break;
  1070. case MODULE4_RVE_T:
  1071. MODF_RVE_CALL(cmd_function4, h, msg, a->val, mod_f_params,
  1072. (char*)mod_f_params[2].u.data,
  1073. (char*)mod_f_params[3].u.data,
  1074. (char*)mod_f_params[4].u.data,
  1075. (char*)mod_f_params[5].u.data
  1076. );
  1077. break;
  1078. case MODULE5_RVE_T:
  1079. MODF_RVE_CALL(cmd_function5, h, msg, a->val, mod_f_params,
  1080. (char*)mod_f_params[2].u.data,
  1081. (char*)mod_f_params[3].u.data,
  1082. (char*)mod_f_params[4].u.data,
  1083. (char*)mod_f_params[5].u.data,
  1084. (char*)mod_f_params[6].u.data
  1085. );
  1086. break;
  1087. case MODULE6_RVE_T:
  1088. MODF_RVE_CALL(cmd_function6, h, msg, a->val, mod_f_params,
  1089. (char*)mod_f_params[2].u.data,
  1090. (char*)mod_f_params[3].u.data,
  1091. (char*)mod_f_params[4].u.data,
  1092. (char*)mod_f_params[5].u.data,
  1093. (char*)mod_f_params[6].u.data,
  1094. (char*)mod_f_params[7].u.data
  1095. );
  1096. break;
  1097. case MODULEX_RVE_T:
  1098. MODF_RVE_CALL(cmd_function_var, h, msg, a->val, mod_f_params,
  1099. a->val[1].u.number, &mod_f_params[2]);
  1100. break;
  1101. case EVAL_T:
  1102. /* only eval the expression to account for possible
  1103. side-effect */
  1104. rval_expr_eval_int(h, msg, &v,
  1105. (struct rval_expr*)a->val[0].u.data);
  1106. if (h->run_flags & EXIT_R_F){
  1107. ret=0;
  1108. break;
  1109. }
  1110. h->run_flags &= ~RETURN_R_F|BREAK_R_F; /* catch return & break in
  1111. expr */
  1112. ret=1; /* default is continue */
  1113. break;
  1114. case SWITCH_COND_T:
  1115. sct=(struct switch_cond_table*)a->val[1].u.data;
  1116. if (unlikely( rval_expr_eval_int(h, msg, &v,
  1117. (struct rval_expr*)a->val[0].u.data) <0)){
  1118. /* handle error in expression => use default */
  1119. ret=-1;
  1120. goto sw_cond_def;
  1121. }
  1122. if (h->run_flags & EXIT_R_F){
  1123. ret=0;
  1124. break;
  1125. }
  1126. h->run_flags &= ~(RETURN_R_F|BREAK_R_F); /* catch return & break
  1127. in expr */
  1128. ret=1; /* default is continue */
  1129. for(i=0; i<sct->n; i++)
  1130. if (sct->cond[i]==v){
  1131. if (likely(sct->jump[i])){
  1132. ret=run_actions(h, sct->jump[i], msg);
  1133. h->run_flags &= ~BREAK_R_F; /* catch breaks, but let
  1134. returns passthrough */
  1135. }
  1136. goto skip;
  1137. }
  1138. sw_cond_def:
  1139. if (sct->def){
  1140. ret=run_actions(h, sct->def, msg);
  1141. h->run_flags &= ~BREAK_R_F; /* catch breaks, but let
  1142. returns passthrough */
  1143. }
  1144. break;
  1145. case SWITCH_JT_T:
  1146. sjt=(struct switch_jmp_table*)a->val[1].u.data;
  1147. if (unlikely( rval_expr_eval_int(h, msg, &v,
  1148. (struct rval_expr*)a->val[0].u.data) <0)){
  1149. /* handle error in expression => use default */
  1150. ret=-1;
  1151. goto sw_jt_def;
  1152. }
  1153. if (h->run_flags & EXIT_R_F){
  1154. ret=0;
  1155. break;
  1156. }
  1157. h->run_flags &= ~(RETURN_R_F|BREAK_R_F); /* catch return & break
  1158. in expr */
  1159. ret=1; /* default is continue */
  1160. if (likely(v >= sjt->first && v <= sjt->last)){
  1161. if (likely(sjt->tbl[v - sjt->first])){
  1162. ret=run_actions(h, sjt->tbl[v - sjt->first], msg);
  1163. h->run_flags &= ~BREAK_R_F; /* catch breaks, but let
  1164. returns passthrough */
  1165. }
  1166. break;
  1167. }else{
  1168. for(i=0; i<sjt->rest.n; i++)
  1169. if (sjt->rest.cond[i]==v){
  1170. if (likely(sjt->rest.jump[i])){
  1171. ret=run_actions(h, sjt->rest.jump[i], msg);
  1172. h->run_flags &= ~BREAK_R_F; /* catch breaks, but
  1173. let returns pass */
  1174. }
  1175. goto skip;
  1176. }
  1177. }
  1178. /* not found => try default */
  1179. sw_jt_def:
  1180. if (sjt->rest.def){
  1181. ret=run_actions(h, sjt->rest.def, msg);
  1182. h->run_flags &= ~BREAK_R_F; /* catch breaks, but let
  1183. returns passthrough */
  1184. }
  1185. break;
  1186. case BLOCK_T:
  1187. if (likely(a->val[0].u.data)){
  1188. ret=run_actions(h, (struct action*)a->val[0].u.data, msg);
  1189. h->run_flags &= ~BREAK_R_F; /* catch breaks, but let
  1190. returns passthrough */
  1191. }
  1192. break;
  1193. case MATCH_COND_T:
  1194. mct=(struct match_cond_table*)a->val[1].u.data;
  1195. rval_cache_init(&c1);
  1196. rv=0;
  1197. rv1=0;
  1198. ret=rval_expr_eval_rvint(h, msg, &rv, &v,
  1199. (struct rval_expr*)a->val[0].u.data, &c1);
  1200. if (unlikely( ret<0)){
  1201. /* handle error in expression => use default */
  1202. ret=-1;
  1203. goto match_cond_def;
  1204. }
  1205. if (h->run_flags & EXIT_R_F){
  1206. ret=0;
  1207. break;
  1208. }
  1209. h->run_flags &= ~(RETURN_R_F|BREAK_R_F); /* catch return & break
  1210. in expr */
  1211. if (likely(rv)){
  1212. rv1=rval_convert(h, msg, RV_STR, rv, &c1);
  1213. if (unlikely(rv1==0)){
  1214. ret=-1;
  1215. goto match_cond_def;
  1216. }
  1217. s=rv1->v.s;
  1218. }else{
  1219. /* int result in v */
  1220. rval_cache_clean(&c1);
  1221. s.s=sint2str(v, &s.len);
  1222. }
  1223. ret=1; /* default is continue */
  1224. for(i=0; i<mct->n; i++)
  1225. if (( mct->match[i].type==MATCH_STR &&
  1226. mct->match[i].l.s.len==s.len &&
  1227. memcmp(mct->match[i].l.s.s, s.s, s.len) == 0 ) ||
  1228. ( mct->match[i].type==MATCH_RE &&
  1229. regexec(mct->match[i].l.regex, s.s, 0, 0, 0) == 0)
  1230. ){
  1231. if (likely(mct->jump[i])){
  1232. /* make sure we cleanup first, in case run_actions()
  1233. exits the script directly via longjmp() */
  1234. if (rv1){
  1235. rval_destroy(rv1);
  1236. rval_destroy(rv);
  1237. rval_cache_clean(&c1);
  1238. }else if (rv){
  1239. rval_destroy(rv);
  1240. rval_cache_clean(&c1);
  1241. }
  1242. ret=run_actions(h, mct->jump[i], msg);
  1243. h->run_flags &= ~BREAK_R_F; /* catch breaks, but let
  1244. returns passthrough */
  1245. goto skip;
  1246. }
  1247. goto match_cleanup;
  1248. }
  1249. match_cond_def:
  1250. if (mct->def){
  1251. /* make sure we cleanup first, in case run_actions()
  1252. exits the script directly via longjmp() */
  1253. if (rv1){
  1254. rval_destroy(rv1);
  1255. rval_destroy(rv);
  1256. rval_cache_clean(&c1);
  1257. }else if (rv){
  1258. rval_destroy(rv);
  1259. rval_cache_clean(&c1);
  1260. }
  1261. ret=run_actions(h, mct->def, msg);
  1262. h->run_flags &= ~BREAK_R_F; /* catch breaks, but let
  1263. returns passthrough */
  1264. break;
  1265. }
  1266. match_cleanup:
  1267. if (rv1){
  1268. rval_destroy(rv1);
  1269. rval_destroy(rv);
  1270. rval_cache_clean(&c1);
  1271. }else if (rv){
  1272. rval_destroy(rv);
  1273. rval_cache_clean(&c1);
  1274. }
  1275. break;
  1276. case WHILE_T:
  1277. i=0;
  1278. flags=0;
  1279. rve=(struct rval_expr*)a->val[0].u.data;
  1280. ret=1;
  1281. while(!(flags & (BREAK_R_F|RETURN_R_F|EXIT_R_F)) &&
  1282. (rval_expr_eval_int(h, msg, &v, rve) == 0) && v){
  1283. if (cfg_get(core, core_cfg, max_while_loops) > 0)
  1284. i++;
  1285. if (unlikely(i > cfg_get(core, core_cfg, max_while_loops))){
  1286. LM_ERR("runaway while (%d, %d): more then %d loops\n",
  1287. rve->fpos.s_line, rve->fpos.s_col,
  1288. cfg_get(core, core_cfg, max_while_loops));
  1289. ret=-1;
  1290. goto error;
  1291. }
  1292. if (likely(a->val[1].u.data)){
  1293. ret=run_actions(h, (struct action*)a->val[1].u.data, msg);
  1294. flags|=h->run_flags;
  1295. h->run_flags &= ~BREAK_R_F; /* catch breaks, but let
  1296. returns pass-through */
  1297. }
  1298. }
  1299. break;
  1300. case FORCE_RPORT_T:
  1301. msg->msg_flags|=FL_FORCE_RPORT;
  1302. ret=1; /* continue processing */
  1303. break;
  1304. case ADD_LOCAL_RPORT_T:
  1305. msg->msg_flags|=FL_ADD_LOCAL_RPORT;
  1306. ret=1; /* continue processing */
  1307. break;
  1308. case UDP_MTU_TRY_PROTO_T:
  1309. msg->msg_flags|= (unsigned int)a->val[0].u.number & FL_MTU_FB_MASK;
  1310. ret=1; /* continue processing */
  1311. break;
  1312. case SET_ADV_ADDR_T:
  1313. if (a->val[0].type!=STR_ST){
  1314. LM_CRIT("bad set_advertised_address() type %d\n", a->val[0].type);
  1315. ret=E_BUG;
  1316. goto error;
  1317. }
  1318. msg->set_global_address=*((str*)a->val[0].u.data);
  1319. ret=1; /* continue processing */
  1320. break;
  1321. case SET_ADV_PORT_T:
  1322. if (a->val[0].type!=STR_ST){
  1323. LM_CRIT("bad set_advertised_port() type %d\n", a->val[0].type);
  1324. ret=E_BUG;
  1325. goto error;
  1326. }
  1327. msg->set_global_port=*((str*)a->val[0].u.data);
  1328. ret=1; /* continue processing */
  1329. break;
  1330. #ifdef USE_TCP
  1331. case FORCE_TCP_ALIAS_T:
  1332. if ( msg->rcv.proto==PROTO_TCP
  1333. #ifdef USE_TLS
  1334. || msg->rcv.proto==PROTO_TLS
  1335. #endif
  1336. ){
  1337. if (a->val[0].type==NOSUBTYPE) port=msg->via1->port;
  1338. else if (a->val[0].type==NUMBER_ST) port=(int)a->val[0].u.number;
  1339. else{
  1340. LM_CRIT("bad force_tcp_alias"
  1341. " port type %d\n", a->val[0].type);
  1342. ret=E_BUG;
  1343. goto error;
  1344. }
  1345. if (tcpconn_add_alias(msg->rcv.proto_reserved1, port,
  1346. msg->rcv.proto)!=0){
  1347. LM_ERR("receive_msg: tcp alias failed\n");
  1348. ret=E_UNSPEC;
  1349. goto error;
  1350. }
  1351. }
  1352. #endif
  1353. ret=1; /* continue processing */
  1354. break;
  1355. case FORCE_SEND_SOCKET_T:
  1356. if (a->val[0].type!=SOCKETINFO_ST){
  1357. LM_CRIT("bad force_send_socket argument"
  1358. " type: %d\n", a->val[0].type);
  1359. ret=E_BUG;
  1360. goto error;
  1361. }
  1362. set_force_socket(msg, (struct socket_info*)a->val[0].u.data);
  1363. ret=1; /* continue processing */
  1364. break;
  1365. case ADD_T:
  1366. case ASSIGN_T:
  1367. v=lval_assign(h, msg, (struct lvalue*)a->val[0].u.data,
  1368. (struct rval_expr*)a->val[1].u.data);
  1369. if (likely(v>=0))
  1370. ret = 1;
  1371. else if (unlikely (v == EXPR_DROP)) /* hack to quit on DROP*/
  1372. ret=0;
  1373. else
  1374. ret=v;
  1375. break;
  1376. case SET_FWD_NO_CONNECT_T:
  1377. msg->fwd_send_flags.f|= SND_F_FORCE_CON_REUSE;
  1378. ret=1; /* continue processing */
  1379. break;
  1380. case SET_RPL_NO_CONNECT_T:
  1381. msg->rpl_send_flags.f|= SND_F_FORCE_CON_REUSE;
  1382. ret=1; /* continue processing */
  1383. break;
  1384. case SET_FWD_CLOSE_T:
  1385. msg->fwd_send_flags.f|= SND_F_CON_CLOSE;
  1386. ret=1; /* continue processing */
  1387. break;
  1388. case SET_RPL_CLOSE_T:
  1389. msg->rpl_send_flags.f|= SND_F_CON_CLOSE;
  1390. ret=1; /* continue processing */
  1391. break;
  1392. case CFG_SELECT_T:
  1393. if (a->val[0].type != CFG_GROUP_ST) {
  1394. BUG("unsupported parameter in CFG_SELECT_T: %d\n",
  1395. a->val[0].type);
  1396. ret=-1;
  1397. goto error;
  1398. }
  1399. switch(a->val[1].type) {
  1400. case NUMBER_ST:
  1401. v=(int)a->val[1].u.number;
  1402. break;
  1403. case RVE_ST:
  1404. if (rval_expr_eval_int(h, msg, &v, (struct rval_expr*)a->val[1].u.data) < 0) {
  1405. ret=-1;
  1406. goto error;
  1407. }
  1408. break;
  1409. default:
  1410. BUG("unsupported group id type in CFG_SELECT_T: %d\n",
  1411. a->val[1].type);
  1412. ret=-1;
  1413. goto error;
  1414. }
  1415. ret=(cfg_select((cfg_group_t*)a->val[0].u.data, v) == 0) ? 1 : -1;
  1416. break;
  1417. case CFG_RESET_T:
  1418. if (a->val[0].type != CFG_GROUP_ST) {
  1419. BUG("unsupported parameter in CFG_RESET_T: %d\n",
  1420. a->val[0].type);
  1421. ret=-1;
  1422. goto error;
  1423. }
  1424. ret=(cfg_reset((cfg_group_t*)a->val[0].u.data) == 0) ? 1 : -1;
  1425. break;
  1426. /*
  1427. default:
  1428. LM_CRIT("unknown type %d\n", a->type);
  1429. */
  1430. }
  1431. skip:
  1432. return ret;
  1433. error_uri:
  1434. LM_ERR("set*: uri too long\n");
  1435. if (new_uri) pkg_free(new_uri);
  1436. LM_ERR("run action error at: %s:%d\n", (a->cfile)?a->cfile:"", a->cline);
  1437. return E_UNSPEC;
  1438. error_fwd_uri:
  1439. /*free_uri(&uri); -- not needed anymore, using msg->parsed_uri*/
  1440. error:
  1441. LM_ERR("run action error at: %s:%d\n", (a->cfile)?a->cfile:"", a->cline);
  1442. return ret;
  1443. }
  1444. /* returns: 0, or 1 on success, <0 on error */
  1445. /* (0 if drop or break encountered, 1 if not ) */
  1446. int run_actions(struct run_act_ctx* h, struct action* a, struct sip_msg* msg)
  1447. {
  1448. struct action* t;
  1449. int ret;
  1450. struct sr_module *mod;
  1451. unsigned int ms = 0;
  1452. ret=E_UNSPEC;
  1453. h->rec_lev++;
  1454. if (unlikely(h->rec_lev>max_recursive_level)){
  1455. LM_ERR("too many recursive routing table lookups (%d) giving up!\n", h->rec_lev);
  1456. ret=E_UNSPEC;
  1457. goto error;
  1458. }
  1459. if (unlikely(h->rec_lev==1)){
  1460. h->run_flags=0;
  1461. h->last_retcode=0;
  1462. _last_returned_code = h->last_retcode;
  1463. #ifdef USE_LONGJMP
  1464. if (unlikely(setjmp(h->jmp_env))){
  1465. h->rec_lev=0;
  1466. ret=h->last_retcode;
  1467. goto end;
  1468. }
  1469. #endif
  1470. }
  1471. if (unlikely(a==0)){
  1472. LM_DBG("null action list (rec_level=%d)\n", h->rec_lev);
  1473. ret=1;
  1474. }
  1475. for (t=a; t!=0; t=t->next){
  1476. if(unlikely(cfg_get(core, core_cfg, latency_limit_action)>0))
  1477. ms = TICKS_TO_MS(get_ticks_raw());
  1478. _cfg_crt_action = t;
  1479. ret=do_action(h, t, msg);
  1480. _cfg_crt_action = 0;
  1481. if(unlikely(cfg_get(core, core_cfg, latency_limit_action)>0)) {
  1482. ms = TICKS_TO_MS(get_ticks_raw()) - ms;
  1483. if(ms >= cfg_get(core, core_cfg, latency_limit_action)) {
  1484. LOG(cfg_get(core, core_cfg, latency_log),
  1485. "alert - action [%s (%d)]"
  1486. " cfg [%s:%d] took too long [%u ms]\n",
  1487. is_mod_func(t) ?
  1488. ((cmd_export_common_t*)(t->val[0].u.data))->name
  1489. : "corefunc",
  1490. t->type, (t->cfile)?t->cfile:"", t->cline, ms);
  1491. }
  1492. }
  1493. /* break, return or drop/exit stop execution of the current
  1494. block */
  1495. if (unlikely(h->run_flags & (BREAK_R_F|RETURN_R_F|EXIT_R_F))){
  1496. if (unlikely(h->run_flags & EXIT_R_F)) {
  1497. h->last_retcode=ret;
  1498. _last_returned_code = h->last_retcode;
  1499. #ifdef USE_LONGJMP
  1500. longjmp(h->jmp_env, ret);
  1501. #endif
  1502. }
  1503. break;
  1504. }
  1505. /* ignore error returns */
  1506. }
  1507. h->rec_lev--;
  1508. end:
  1509. /* process module onbreak handlers if present */
  1510. if (unlikely(h->rec_lev==0 && ret==0 &&
  1511. !(h->run_flags & IGNORE_ON_BREAK_R_F)))
  1512. for (mod=modules;mod;mod=mod->next)
  1513. if (unlikely(mod->exports.onbreak_f)) {
  1514. mod->exports.onbreak_f( msg );
  1515. }
  1516. return ret;
  1517. error:
  1518. h->rec_lev--;
  1519. return ret;
  1520. }
  1521. #ifdef USE_LONGJMP
  1522. /** safe version of run_actions().
  1523. * It always return (it doesn't longjmp on forced script end).
  1524. * @returns 0, or 1 on success, <0 on error
  1525. * (0 if drop or break encountered, 1 if not ) */
  1526. int run_actions_safe(struct run_act_ctx* h, struct action* a,
  1527. struct sip_msg* msg)
  1528. {
  1529. struct run_act_ctx ctx;
  1530. int ret;
  1531. int ign_on_break;
  1532. /* start with a fresh action context */
  1533. init_run_actions_ctx(&ctx);
  1534. ctx.last_retcode = h->last_retcode;
  1535. ign_on_break = h->run_flags & IGNORE_ON_BREAK_R_F;
  1536. ctx.run_flags = h->run_flags | IGNORE_ON_BREAK_R_F;
  1537. ret = run_actions(&ctx, a, msg);
  1538. h->last_retcode = ctx.last_retcode;
  1539. h->run_flags = (ctx.run_flags & ~IGNORE_ON_BREAK_R_F) | ign_on_break;
  1540. return ret;
  1541. }
  1542. #endif /* USE_LONGJMP */
  1543. int run_top_route(struct action* a, sip_msg_t* msg, struct run_act_ctx *c)
  1544. {
  1545. struct run_act_ctx ctx;
  1546. struct run_act_ctx *p;
  1547. int ret;
  1548. flag_t sfbk;
  1549. p = (c)?c:&ctx;
  1550. sfbk = getsflags();
  1551. setsflagsval(0);
  1552. reset_static_buffer();
  1553. init_run_actions_ctx(p);
  1554. ret = run_actions(p, a, msg);
  1555. setsflagsval(sfbk);
  1556. return ret;
  1557. }