-
Notifications
You must be signed in to change notification settings - Fork 1
/
action.c
1389 lines (1245 loc) 路 36.8 KB
/
action.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* Copyright 漏 Need help? 馃 Email us! 馃憞 A Dmitry Sorokin production. All rights reserved. Powered by REChain. 馃獝 Copyright 漏 2023 REChain, Inc REChain 庐 is a registered trademark hr@rechain.email p2p@rechain.email pr@rechain.email sorydima@rechain.email support@rechain.email sip@rechain.email music@rechain.email Please allow anywhere from 1 to 5 business days for E-mail responses! 馃拰 (C) 2010-2014 Marina.Rodeo Solutions
* Copyright 漏 Need help? 馃 Email us! 馃憞 A Dmitry Sorokin production. All rights reserved. Powered by REChain. 馃獝 Copyright 漏 2023 REChain, Inc REChain 庐 is a registered trademark hr@rechain.email p2p@rechain.email pr@rechain.email sorydima@rechain.email support@rechain.email sip@rechain.email music@rechain.email Please allow anywhere from 1 to 5 business days for E-mail responses! 馃拰 (C) 2005-2006 Voice Sistem S.R.L.
* Copyright 漏 Need help? 馃 Email us! 馃憞 A Dmitry Sorokin production. All rights reserved. Powered by REChain. 馃獝 Copyright 漏 2023 REChain, Inc REChain 庐 is a registered trademark hr@rechain.email p2p@rechain.email pr@rechain.email sorydima@rechain.email support@rechain.email sip@rechain.email music@rechain.email Please allow anywhere from 1 to 5 business days for E-mail responses! 馃拰 (C) 2001-2003 FhG Fokus
*
* This file is part of Marina.Rodeo, a free SIP server.
*
* Marina.Rodeo is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version
*
* Marina.Rodeo is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
* History:
* ---------
* 2003-02-28 scratchpad compatibility abandoned (jiri)
* 2003-01-29 removed scratchpad (jiri)
* 2003-03-19 fixed set* len calculation bug & simplified a little the code
* (should be a little faster now) (andrei)
* replaced all mallocs/frees w/ pkg_malloc/pkg_free (andrei)
* 2003-04-01 Added support for loose routing in forward (janakj)
* 2003-04-12 FORCE_RPORT_T added (andrei)
* 2003-04-22 strip_tail added (jiri)
* 2003-10-02 added SET_ADV_ADDR_T & SET_ADV_PORT_T (andrei)
* 2003-10-29 added FORCE_TCP_ALIAS_T (andrei)
* 2004-11-30 added FORCE_SEND_SOCKET_T (andrei)
* 2005-11-29 added serialize_branches and next_branches (bogdan)
* 2006-03-02 MODULE_T action points to a cmd_export_t struct instead to
* a function address - more info is accessible (bogdan)
* 2006-05-22 forward(_udp,_tcp,_tls) and send(_tcp) merged in forward() and
* send() (bogdan)
* 2006-12-22 functions for script and branch flags added (bogdan)
*/
/*!
* \file
* \brief Marina.Rodeo Generic functions
*/
#include "action.h"
#include "config.h"
#include "error.h"
#include "dprint.h"
#include "route.h"
#include "parser/msg_parser.h"
#include "ut.h"
#include "sr_module.h"
#include "mem/mem.h"
#include "errinfo.h"
#include "msg_translator.h"
#include "mod_fix.h"
#include "script_var.h"
#include "xlog.h"
#include "cfg_pp.h"
#include <string.h>
#ifdef DEBUG_DMALLOC
#include <dmalloc.h>
#endif
int action_flags = 0;
int return_code = 0;
int max_while_loops = 10000;
/* script tracing options */
int use_script_trace = 0;
int script_trace_log_level = L_ALERT;
char *script_trace_info = NULL;
pv_elem_t script_trace_elem;
extern err_info_t _oser_err_info;
action_time longest_action[LONGEST_ACTION_SIZE];
int min_action_time=0;
struct route_params_level {
void *params;
void *extra; /* extra params used */
param_getf_t get_param;
};
static struct route_params_level route_params[ROUTE_MAX_REC_LEV];
static int route_rec_level = -1;
/* the current stack of route names (first route name is at index 0) */
char *route_stack[ROUTE_MAX_REC_LEV + 1];
/* the virtual start of the stack; typically 0, but may get temporarily bumped
* with each added nesting level of script route callback execution
* (e.g. due to logic similar to dlg_on_hangup(), followed by a SIP BYE) */
int route_stack_start;
/* the total size of the stack, counting from index 0 */
int route_stack_size;
int curr_action_line;
char *curr_action_file;
static int for_each_handler(struct sip_msg *msg, struct action *a);
static int route_param_get(struct sip_msg *msg, pv_param_t *ip,
pv_value_t *res, void *params, void *extra);
/* run actions from a route */
/* returns: 0, or 1 on success, <0 on error */
/* (0 if drop or break encountered, 1 if not ) */
static inline int run_actions(struct action* a, struct sip_msg* msg)
{
int ret, _;
str top_route;
if (route_stack_size > ROUTE_MAX_REC_LEV) {
get_top_route_type(&top_route, &_);
LM_ERR("route recursion limit reached, giving up! (nested routes: %d, "
"first: '%.*s', last: '%s')!\n", route_stack_size,
top_route.len, top_route.s, route_stack[ROUTE_MAX_REC_LEV]);
ret=E_UNSPEC;
goto error;
}
if (a==0){
LM_WARN("null action list (route stack size: %d)\n",
route_stack_size);
ret=1;
goto error;
}
ret=run_action_list(a, msg);
/* if 'return', reset the flag */
if(action_flags&ACT_FL_RETURN)
action_flags &= ~ACT_FL_RETURN;
return ret;
error:
return ret;
}
int _run_actions(struct action *a, struct sip_msg *msg)
{
return run_actions(a, msg);
}
int inside_error_route;
void run_error_route(struct sip_msg* msg, int init_route_stack)
{
int old_route;
LM_DBG("triggering\n");
inside_error_route = 1;
if (init_route_stack) {
swap_route_type(old_route, ERROR_ROUTE);
route_stack[0] = NULL;
route_stack_start = 0;
route_stack_size = 1;
run_actions(sroutes->error.a, msg);
set_route_type(old_route);
} else {
route_params_push_level("!error_route", NULL, 0, route_param_get);
run_actions(sroutes->error.a, msg);
route_params_pop_level();
}
/* reset error info */
init_err_info();
inside_error_route = 0;
}
/* run a list of actions */
int run_action_list(struct action* a, struct sip_msg* msg)
{
int ret=E_UNSPEC;
struct action* t;
for (t=a; t!=0; t=t->next){
ret=do_action(t, msg);
/* if action returns 0, then stop processing the script */
if(ret==0)
action_flags |= ACT_FL_EXIT;
/* check for errors */
if (_oser_err_info.eclass!=0 && sroutes->error.a!=NULL &&
(route_type&(ONREPLY_ROUTE|LOCAL_ROUTE))==0 && !inside_error_route)
run_error_route(msg, 0);
/* continue or not ? */
if (action_flags & (ACT_FL_RETURN | ACT_FL_EXIT | ACT_FL_BREAK))
break;
}
return ret;
}
int run_top_route(struct script_route sr, struct sip_msg* msg)
{
static int recursing;
int bk_action_flags, route_stack_start_bkp = -1, route_stack_size_bkp;
int ret;
context_p ctx = NULL;
bk_action_flags = action_flags;
action_flags = 0;
init_err_info();
if (current_processing_ctx==NULL) {
if ( (ctx=context_alloc(CONTEXT_GLOBAL))==NULL) {
LM_ERR("failed to allocated new global context\n");
return -1;
}
memset( ctx, 0, context_size(CONTEXT_GLOBAL));
set_global_context(ctx);
}
/* the recursion support allows run_top_route() to be freely called from
* other modules (e.g. dialog) in order to provide contextless script
* callbacks using routes, without losing the original route stack */
if (recursing) {
route_stack_start_bkp = route_stack_start;
route_stack_size_bkp = route_stack_size;
route_stack_start = route_stack_size;
route_stack_size += 1;
} else {
route_stack_start = 0;
route_stack_size = 1;
recursing = 1;
}
if (route_type & (ERROR_ROUTE|LOCAL_ROUTE|STARTUP_ROUTE) ||
(route_type &
(REQUEST_ROUTE|ONREPLY_ROUTE) && !strcmp(sr.name, "0")))
route_stack[route_stack_start] = NULL;
else
route_stack[route_stack_start] = sr.name;
run_actions(sr.a, msg);
ret = action_flags;
if (route_stack_start_bkp != -1) {
route_stack_size = route_stack_size_bkp;
route_stack_start = route_stack_start_bkp;
} else {
recursing = 0;
}
action_flags = bk_action_flags;
/* reset script tracing */
use_script_trace = 0;
if (ctx && current_processing_ctx) {
context_destroy(CONTEXT_GLOBAL, ctx);
context_free(ctx);
set_global_context(NULL);
}
return ret;
}
/* execute assignment operation */
int do_assign(struct sip_msg* msg, struct action* a)
{
str st;
int ret;
pv_value_t lval, val;
pv_spec_p dspec;
dspec = (pv_spec_p)a->elem[0].u.data;
if(!pv_is_w(dspec))
{
LM_ERR("read only PV in left expression\n");
goto error;
}
memset(&val, 0, sizeof(pv_value_t));
if(a->elem[1].type != NULLV_ST)
{
ret = eval_expr((struct expr*)a->elem[1].u.data, msg, &val);
if(ret < 0 || !(val.flags & (PV_VAL_STR | PV_VAL_INT | PV_VAL_NULL)))
{
LM_WARN("no value in right expression at %s:%d\n",
a->file, a->line);
goto error2;
}
}
switch (a->type) {
case EQ_T:
case COLONEQ_T:
break;
case PLUSEQ_T:
case MINUSEQ_T:
case DIVEQ_T:
case MULTEQ_T:
case MODULOEQ_T:
case BANDEQ_T:
case BOREQ_T:
case BXOREQ_T:
if (pv_get_spec_value(msg, dspec, &lval) != 0) {
LM_ERR("failed to get left-hand side value\n");
goto error;
}
if (lval.flags & PV_VAL_NULL || val.flags & PV_VAL_NULL) {
LM_ERR("NULL value(s) in complex assignment expressions "
"(+=, -=, etc.)\n");
goto error;
}
/* both include STR versions and neither is primarily an INT */
if ((lval.flags & PV_VAL_STR) && (val.flags & PV_VAL_STR) &&
!(lval.flags & PV_TYPE_INT) && !(val.flags & PV_TYPE_INT)) {
val.ri = 0;
if (a->type != PLUSEQ_T)
goto bad_operands;
if (!(val.flags & PV_VAL_PKG)) {
st = val.rs;
val.rs.s = pkg_malloc(val.rs.len + lval.rs.len + 1);
if (!val.rs.s) {
val.rs.s = st.s;
LM_ERR("oom 1\n");
goto error;
}
memcpy(val.rs.s, lval.rs.s, lval.rs.len);
memcpy(val.rs.s + lval.rs.len, st.s, st.len);
val.rs.len += lval.rs.len;
val.rs.s[val.rs.len] = '\0';
val.flags |= PV_VAL_PKG;
if (val.flags & PV_VAL_SHM) {
val.flags &= ~PV_VAL_SHM;
shm_free(st.s);
}
} else {
st.len = val.rs.len;
if (pkg_str_extend(&val.rs, val.rs.len + lval.rs.len + 1) != 0) {
LM_ERR("oom 2\n");
goto error;
}
val.rs.len--;
memmove(val.rs.s + lval.rs.len, val.rs.s, st.len);
memcpy(val.rs.s, lval.rs.s, lval.rs.len);
val.rs.s[val.rs.len] = '\0';
}
} else if ((lval.flags & PV_VAL_INT) && (val.flags & PV_VAL_INT)) {
if (val.flags & PV_VAL_STR)
val.flags &= ~PV_VAL_STR;
switch (a->type) {
case PLUSEQ_T:
val.ri = lval.ri + val.ri;
break;
case MINUSEQ_T:
val.ri = lval.ri - val.ri;
break;
case DIVEQ_T:
val.ri = lval.ri / val.ri;
break;
case MULTEQ_T:
val.ri = lval.ri * val.ri;
break;
case MODULOEQ_T:
val.ri = lval.ri % val.ri;
break;
case BANDEQ_T:
val.ri = lval.ri & val.ri;
break;
case BOREQ_T:
val.ri = lval.ri | val.ri;
break;
case BXOREQ_T:
val.ri = lval.ri ^ val.ri;
break;
}
} else {
goto bad_operands;
}
break;
default:
LM_ALERT("BUG -> unknown op type %d\n", a->type);
goto error;
}
script_trace("assign",
(unsigned char)a->type == EQ_T ? "equal" :
(unsigned char)a->type == COLONEQ_T ? "colon-eq" :
(unsigned char)a->type == PLUSEQ_T ? "plus-eq" :
(unsigned char)a->type == MINUSEQ_T ? "minus-eq" :
(unsigned char)a->type == DIVEQ_T ? "div-eq" :
(unsigned char)a->type == MULTEQ_T ? "mult-eq" :
(unsigned char)a->type == MODULOEQ_T? "modulo-eq" :
(unsigned char)a->type == BANDEQ_T ? "b-and-eq" :
(unsigned char)a->type == BOREQ_T ? "b-or-eq":"b-xor-eq",
msg, a->file, a->line);
if(a->elem[1].type == NULLV_ST || (val.flags & PV_VAL_NULL))
{
if(pv_set_value(msg, dspec, (int)a->type, 0)<0)
{
LM_ERR("setting PV failed\n");
goto error;
}
} else {
if(pv_set_value(msg, dspec, (int)a->type, &val)<0)
{
LM_ERR("setting PV failed\n");
goto error;
}
}
pv_value_destroy(&val);
return 1;
bad_operands:
LM_ERR("unsupported operand type(s) for %s: %s and %s\n",
assignop_str(a->type),
lval.flags & PV_VAL_STR ? "string" : "int",
val.flags & PV_VAL_STR ? "string" : "int");
pv_value_destroy(&val);
return -1;
error:
LM_ERR("error at %s:%d\n", a->file, a->line);
error2:
pv_value_destroy(&val);
return -1;
}
static pv_value_t *route_params_expand(struct sip_msg *msg,
void *params, int params_no)
{
str tmp;
int index;
pv_value_t *route_vals, *res;
action_elem_p actions = (action_elem_p)params;
route_vals = pkg_malloc(params_no * sizeof(*route_vals));
if (!route_vals) {
LM_ERR("oom\n");
return NULL;
}
memset(route_vals, 0, params_no * sizeof(*route_vals));
for (index = 0; index < params_no; index++) {
res = &route_vals[index];
switch (actions[index].type)
{
case STRING_ST:
res->rs.s = actions[index].u.string;
res->rs.len = strlen(res->rs.s);
res->flags = PV_VAL_STR;
break;
case NUMBER_ST:
res->ri = actions[index].u.number;
res->flags = PV_VAL_INT|PV_TYPE_INT;
tmp.s = sint2str(res->ri, &tmp.len);
if (pkg_str_dup(&res->rs, &tmp) == 0)
res->flags |= PV_VAL_STR|PV_VAL_PKG;
else
LM_ERR("cannot duplicate param value\n");
break;
case SCRIPTVAR_ST:
if(pv_get_spec_value(msg, (pv_spec_p)actions[index].u.data, res)==0)
{
if (pvv_is_str(res)) {
/* but we need to duplicate the string */
if (pkg_str_dup(&tmp, &res->rs) == 0) {
res->rs.s = tmp.s;
res->flags |= PV_VAL_PKG;
break;
} else {
LM_ERR("cannot duplicate param value\n");
}
} else {
break;
}
} else {
LM_ERR("cannot get spec value\n");
}
/* fallback */
default:
LM_ALERT("BUG: invalid parameter type %d\n",
actions[index].type);
/* fallback */
case NULLV_ST:
res->rs.s = NULL;
res->rs.len = res->ri = 0;
res->flags = PV_VAL_NULL;
break;
}
}
return route_vals;
}
static void route_params_release(pv_value_t *params, int params_no)
{
int p;
for (p = 0; p < params_no; p++) {
if (params[p].flags & PV_VAL_PKG)
pkg_free(params[p].rs.s);
}
pkg_free(params);
}
/* function used to get parameter from a route scope */
static int route_param_get(struct sip_msg *msg, pv_param_t *ip,
pv_value_t *res, void *_params, void *_extra)
{
int index;
pv_value_t tv;
pv_value_t *params = (pv_value_t *)_params;
int params_no = (int)(unsigned long)_extra;
if (params_no <= 0) {
LM_DBG("route without parameters\n");
return pv_get_null(msg, ip, res);
}
if(ip->pvn.type==PV_NAME_INTSTR)
{
if (ip->pvn.u.isname.type != 0)
{
LM_ERR("route $param variable accepts only integer indexes\n");
return -1;
}
index = ip->pvn.u.isname.name.n;
} else
{
/* pvar -> it might be another $param variable! */
route_rec_level--;
if(pv_get_spec_value(msg, (pv_spec_p)(ip->pvn.u.dname), &tv)!=0)
{
LM_ERR("cannot get spec value\n");
route_rec_level++;
return -1;
}
route_rec_level++;
if(tv.flags&PV_VAL_NULL || tv.flags&PV_VAL_EMPTY)
{
LM_ERR("null or empty name\n");
return -1;
}
if (!(tv.flags&PV_VAL_INT) || str2int(&tv.rs,(unsigned int*)&index) < 0)
{
LM_ERR("invalid index <%.*s>\n", tv.rs.len, tv.rs.s);
return -1;
}
}
if (!params)
{
LM_DBG("no parameter specified for this route\n");
return pv_get_null(msg, ip, res);
}
if (index < 1 || index > params_no)
{
LM_DBG("no such parameter index %d\n", index);
return pv_get_null(msg, ip, res);
}
/* the parameters start at 0, whereas the index starts from 1 */
index--;
*res = params[index];
res->flags &= ~PV_VAL_PKG; /* not interested in this flag */
return 0;
}
#define should_skip_updating(action_type) \
(action_type == IF_T || action_type == ROUTE_T || \
action_type == WHILE_T || action_type == FOR_EACH_T)
#define update_longest_action(a) do { \
if (execmsgthreshold && !should_skip_updating((unsigned char)(a)->type)) { \
end_time = get_time_diff(&start); \
if (end_time > min_action_time) { \
for (i=0;i<LONGEST_ACTION_SIZE;i++) { \
if (longest_action[i].a_time < end_time) { \
memmove(longest_action+i+1,longest_action+i, \
(LONGEST_ACTION_SIZE-i-1)*sizeof(action_time)); \
longest_action[i].a_time=end_time; \
longest_action[i].a = a; \
min_action_time = longest_action[LONGEST_ACTION_SIZE-1].a_time; \
break; \
} \
} \
} \
} \
} while(0)
/* ret= 0! if action -> end of list(e.g DROP),
> 0 to continue processing next actions
and <0 on error */
int do_action(struct action* a, struct sip_msg* msg)
{
int ret;
int v;
int i;
int len;
int cmatch;
struct action *aitem;
struct action *adefault;
pv_spec_t *spec;
pv_value_t val;
struct timeval start;
int end_time;
const cmd_export_t *cmd = NULL;
const acmd_export_t *acmd;
void* cmdp[MAX_CMD_PARAMS];
pv_value_t tmp_vals[MAX_CMD_PARAMS];
pv_value_t *route_p;
str sval;
/* reset the value of error to E_UNSPEC so avoid unknowledgable
functions to return with error (status<0) and not setting it
leaving there previous error; cache the previous value though
for functions which want to process it */
prev_ser_error=ser_error;
ser_error=E_UNSPEC;
start_expire_timer(start,execmsgthreshold);
curr_action_line = a->line;
curr_action_file = a->file;
ret=E_BUG;
switch ((unsigned char)a->type){
case ASSERT_T:
if (enable_asserts) {
/* if null expr => ignore if? */
if ((a->elem[0].type==EXPR_ST)&&a->elem[0].u.data){
v=eval_expr((struct expr*)a->elem[0].u.data, msg, 0);
ret=1; /*default is continue */
if (v<=0) {
ret=0;
LM_CRIT("ASSERTION FAILED - %s\n", a->elem[1].u.string);
if (abort_on_assert) {
abort();
} else {
set_err_info(OSER_EC_ASSERT, OSER_EL_CRITIC, "assertion failed");
set_err_reply(500, "server error");
run_error_route(msg, 0);
}
}
}
}
break;
case DROP_T:
script_trace("core", "drop", msg, a->file, a->line) ;
action_flags |= ACT_FL_DROP|ACT_FL_EXIT;
break;
case EXIT_T:
script_trace("core", "exit", msg, a->file, a->line) ;
ret=0;
action_flags |= ACT_FL_EXIT;
break;
case RETURN_T:
script_trace("core", "return", msg, a->file, a->line) ;
if (a->elem[0].type == SCRIPTVAR_ST)
{
spec = (pv_spec_t*)a->elem[0].u.data;
if(pv_get_spec_value(msg, spec, &val)!=0
|| (val.flags&PV_VAL_NULL))
{
ret=-1;
} else {
if(!(val.flags&PV_VAL_INT))
ret = 1;
else
ret = val.ri;
}
pv_value_destroy(&val);
} else {
ret=a->elem[0].u.number;
}
action_flags |= ACT_FL_RETURN;
break;
case LOG_T:
script_trace("core", "log", msg, a->file, a->line) ;
if ((a->elem[0].type!=NUMBER_ST)|(a->elem[1].type!=STRING_ST)){
LM_ALERT("BUG in log() types %d, %d\n",
a->elem[0].type, a->elem[1].type);
ret=E_BUG;
break;
}
LM_GEN1(a->elem[0].u.number, "%s", a->elem[1].u.string);
ret=1;
break;
case LEN_GT_T:
script_trace("core", "len_gt", msg, a->file, a->line) ;
if (a->elem[0].type!=NUMBER_ST) {
LM_ALERT("BUG in len_gt type %d\n",
a->elem[0].type );
ret=E_BUG;
break;
}
ret = (msg->len >= (unsigned int)a->elem[0].u.number) ? 1 : -1;
break;
case ERROR_T:
script_trace("core", "error", msg, a->file, a->line) ;
if ((a->elem[0].type!=STRING_ST)|(a->elem[1].type!=STRING_ST)){
LM_ALERT("BUG in error() types %d, %d\n",
a->elem[0].type, a->elem[1].type);
ret=E_BUG;
break;
}
LM_ERR("error(\"%s\", \"%s\") not implemented yet\n",
a->elem[0].u.string, a->elem[1].u.string);
ret=1;
break;
case ROUTE_T:
init_str(&sval, "unknown");
switch (a->elem[0].type) {
case NUMBER_ST:
i = a->elem[0].u.number;
break;
case SCRIPTVAR_ST:
if (pv_get_spec_value(msg, a->elem[0].u.item, &val) < 0) {
LM_ERR("cannot print route name!\n");
i = -1;
break;
}
if (val.flags & PV_VAL_INT)
sval.s = int2str(val.ri, &sval.len);
else
sval = val.rs;
i = get_script_route_ID_by_name_str(&sval, sroutes->request, RT_NO);
break;
case SCRIPTVAR_ELEM_ST:
if (pv_printf_s(msg, a->elem[0].u.data, &sval) < 0) {
LM_ERR("cannot print route name!\n");
i = -1;
break;
}
i = get_script_route_ID_by_name_str(&sval, sroutes->request, RT_NO);
break;
default:
i = -1;
break;
}
if (i == -1) {
LM_ALERT("unknown route(%.*s) (type %d)\n", sval.len, sval.s,
a->elem[0].type);
ret=E_BUG;
break;
}
if ((i>=RT_NO)||(i<0)){
LM_BUG("invalid routing table number in route(%u)\n", i);
ret=E_CFG;
break;
}
script_trace("route", sroutes->request[i].name,
msg, a->file, a->line) ;
/* check if the route has parameters */
if (a->elem[1].type != 0) {
if (a->elem[1].type != NUMBER_ST || a->elem[2].type != SCRIPTVAR_ST) {
LM_ALERT("BUG in route() type %d/%d\n",
a->elem[1].type, a->elem[2].type);
ret=E_BUG;
break;
}
len = a->elem[1].u.number;
route_p = route_params_expand(msg, a->elem[2].u.data, len);
if (!route_p) {
LM_ERR("could not expand route params!\n");
ret=E_OUT_OF_MEM;
break;
}
route_params_push_level(sroutes->request[i].name,
route_p, (void *)(unsigned long)len, route_param_get);
return_code=run_actions(sroutes->request[i].a, msg);
route_params_release(route_p, len);
route_params_pop_level();
} else {
route_params_push_level(sroutes->request[i].name, NULL, 0, route_param_get);
return_code=run_actions(sroutes->request[i].a, msg);
route_params_pop_level();
}
ret=return_code;
break;
case IF_T:
script_trace("core", "if", msg, a->file, a->line) ;
/* if null expr => ignore if? */
if ((a->elem[0].type==EXPR_ST)&&a->elem[0].u.data){
v=eval_expr((struct expr*)a->elem[0].u.data, msg, 0);
/* set return code to expr value */
if (v<0 || (action_flags&ACT_FL_RETURN)
|| (action_flags&ACT_FL_EXIT) ){
if (v==EXPR_DROP || (action_flags&ACT_FL_RETURN)
|| (action_flags&ACT_FL_EXIT) ){ /* hack to quit on DROP*/
ret=0;
return_code = 0;
break;
}else{
LM_WARN("error in expression at %s:%d\n",
a->file, a->line);
}
}
ret=1; /*default is continue */
if (v>0) {
if ((a->elem[1].type==ACTIONS_ST)&&a->elem[1].u.data){
ret=run_action_list(
(struct action*)a->elem[1].u.data,msg );
return_code = ret;
} else return_code = v;
}else{
if ((a->elem[2].type==ACTIONS_ST)&&a->elem[2].u.data){
ret=run_action_list(
(struct action*)a->elem[2].u.data,msg);
return_code = ret;
} else return_code = v;
}
}
break;
case WHILE_T:
script_trace("core", "while", msg, a->file, a->line) ;
/* if null expr => ignore if? */
if ((a->elem[0].type==EXPR_ST)&&a->elem[0].u.data){
len = 0;
while(1)
{
if(len++ >= max_while_loops)
{
LM_ERR("max while loops reached (%d), increase the "
"'max_while_loops' global!\n", max_while_loops);
break;
}
v=eval_expr((struct expr*)a->elem[0].u.data, msg, 0);
/* set return code to expr value */
if (v<0 || (action_flags&ACT_FL_RETURN)
|| (action_flags&ACT_FL_EXIT) ){
if (v==EXPR_DROP || (action_flags&ACT_FL_RETURN)
|| (action_flags&ACT_FL_EXIT) ){
ret=0;
return_code = 0;
break;
}else{
LM_WARN("error in expression at %s:%d\n",
a->file, a->line);
}
}
ret=1; /*default is continue */
if (v>0) {
if ((a->elem[1].type==ACTIONS_ST)
&&a->elem[1].u.data){
ret=run_action_list(
(struct action*)a->elem[1].u.data,msg );
/* check if return was done */
if (action_flags &
(ACT_FL_RETURN|ACT_FL_EXIT|ACT_FL_BREAK)) {
action_flags &= ~ACT_FL_BREAK;
break;
}
return_code = ret;
} else {
/* we should not get here */
return_code = v;
break;
}
} else {
/* condition was false */
return_code = v;
break;
}
}
}
break;
case BREAK_T:
script_trace("core", "break", msg, a->file, a->line) ;
action_flags |= ACT_FL_BREAK;
break;
case FOR_EACH_T:
script_trace("core", "for-each", msg, a->file, a->line) ;
ret = for_each_handler(msg, a);
break;
case XDBG_T:
script_trace("core", "xdbg", msg, a->file, a->line) ;
if (a->elem[0].type == SCRIPTVAR_ELEM_ST)
{
ret = xdbg(msg, a->elem[0].u.data);
if (ret < 0)
{
LM_ERR("error while printing xdbg message\n");
break;
}
}
else
{
LM_ALERT("BUG in xdbg() type %d\n", a->elem[0].type);
ret=E_BUG;
}
break;
case XLOG_T:
script_trace("core", "xlog", msg, a->file, a->line) ;
if (a->elem[1].u.data != NULL)
{
if (a->elem[1].type != SCRIPTVAR_ELEM_ST)
{
LM_ALERT("BUG in xlog() type %d\n", a->elem[1].type);
ret=E_BUG;
break;
}
if (a->elem[0].type != STR_ST)
{
LM_ALERT("BUG in xlog() type %d\n", a->elem[0].type);
ret=E_BUG;
break;
}
ret = xlog_2(msg,a->elem[0].u.data, a->elem[1].u.data);
if (ret < 0)
{
LM_ERR("error while printing xlog message\n");
break;
}
}
else
{
if (a->elem[0].type != SCRIPTVAR_ELEM_ST)
{
LM_ALERT("BUG in xlog() type %d\n", a->elem[0].type);
ret=E_BUG;
break;
}
ret = xlog_1(msg,a->elem[0].u.data);
if (ret < 0)
{
LM_ERR("error while printing xlog message\n");
break;
}
}
break;
case SWITCH_T:
script_trace("core", "switch", msg, a->file, a->line) ;
#ifdef EXTRA_DEBUG
if (a->elem[0].type!=SCRIPTVAR_ST || a->elem[1].type!=ACTIONS_ST) {
LM_ALERT("BUG in switch() type %d\n",
a->elem[0].type);
ret=E_BUG;
break;
}
#endif
spec = (pv_spec_t*)a->elem[0].u.data;
if(pv_get_spec_value(msg, spec, &val)!=0)
{
LM_ALERT("BUG - no value in switch()\n");
ret=E_BUG;
break;
}
return_code=1;
adefault = NULL;
aitem = (struct action*)a->elem[1].u.data;
cmatch=0;
while(aitem)
{
if((unsigned char)aitem->type==DEFAULT_T)
adefault=aitem;
if(cmatch==0)
{
if(aitem->elem[0].type==STR_ST)
{
if(val.flags&PV_VAL_STR
&& val.rs.len==aitem->elem[0].u.s.len
&& strncasecmp(val.rs.s, aitem->elem[0].u.s.s,
val.rs.len)==0)
cmatch = 1;
} else { /* number */
if(val.flags&PV_VAL_INT &&
val.ri==aitem->elem[0].u.number)
cmatch = 1;