forked from paivaspol/tcptrace
-
Notifications
You must be signed in to change notification settings - Fork 0
/
filter.c
1820 lines (1514 loc) · 44.7 KB
/
filter.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 (c) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001,
* 2002, 2003, 2004
* Ohio University.
*
* ---
*
* Starting with the release of tcptrace version 6 in 2001, tcptrace
* is licensed under the GNU General Public License (GPL). We believe
* that, among the available licenses, the GPL will do the best job of
* allowing tcptrace to continue to be a valuable, freely-available
* and well-maintained tool for the networking community.
*
* Previous versions of tcptrace were released under a license that
* was much less restrictive with respect to how tcptrace could be
* used in commercial products. Because of this, I am willing to
* consider alternate license arrangements as allowed in Section 10 of
* the GNU GPL. Before I would consider licensing tcptrace under an
* alternate agreement with a particular individual or company,
* however, I would have to be convinced that such an alternative
* would be to the greater benefit of the networking community.
*
* ---
*
* This file is part of Tcptrace.
*
* Tcptrace was originally written and continues to be maintained by
* Shawn Ostermann with the help of a group of devoted students and
* users (see the file 'THANKS'). The work on tcptrace has been made
* possible over the years through the generous support of NASA GRC,
* the National Science Foundation, and Sun Microsystems.
*
* Tcptrace 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.
*
* Tcptrace 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 Tcptrace (in the file 'COPYING'); if not, write to the
* Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
* Author: Shawn Ostermann
* School of Electrical Engineering and Computer Science
* Ohio University
* Athens, OH
* ostermann@cs.ohiou.edu
* http://www.tcptrace.org/
*/
#include "tcptrace.h"
static char const GCC_UNUSED copyright[] =
"@(#)Copyright (c) 2004 -- Ohio University.\n";
static char const GCC_UNUSED rcsid[] =
"@(#)$Header: /usr/local/cvs/tcptrace/filter.c,v 5.20 2003/11/19 14:38:02 sdo Exp $";
#include <stdio.h>
#include <stdarg.h>
#include "filter.h"
#include "filter_vars.h"
/* local routines */
static char *PrintConst(struct filter_node *pf);
static char *PrintVar(struct filter_node *pf);
static void EvalRelopUnsigned(tcp_pair *ptp, struct filter_res *pres, struct filter_node *pf);
static void EvalRelopSigned(tcp_pair *ptp, struct filter_res *pres, struct filter_node *pf);
static void EvalRelopIpaddr(tcp_pair *ptp, struct filter_res *pres, struct filter_node *pf);
static void EvalFilter(tcp_pair *ptp, struct filter_res *pres, struct filter_node *pf);
static void EvalRelopString(tcp_pair *ptp, struct filter_res *pres, struct filter_node *pf);
static void EvalVariable(tcp_pair *ptp, struct filter_res *pres, struct filter_node *pf);
static void EvalConstant(tcp_pair *ptp, struct filter_res *pres, struct filter_node *pf);
static char *PrintFilterInternal(struct filter_node *pf);
static char *Res2Str(struct filter_res *pres);
static struct filter_node *MustBeType(enum vartype var_needed, struct filter_node *pf);
static struct filter_node *LookupVar(char *varname, Bool fclient);
static void HelpFilterVariables(void);
/* local globals */
static char *exprstr = NULL;
static struct filter_node *filter_root = NULL;
char*
Op2Str(
enum optype op)
{
switch (op) {
case OP_AND: return("AND");
case OP_OR: return("OR");
case OP_GREATER: return(">");
case OP_GREATER_EQ: return(">=");
case OP_LESS: return("<");
case OP_LESS_EQ: return("<=");
case OP_EQUAL: return("==");
case OP_NEQUAL: return("!=");
case OP_PLUS: return("+");
case OP_MINUS: return("-");
case OP_TIMES: return("*");
case OP_DIVIDE: return("/");
case OP_MOD: return("%");
case OP_BAND: return("&");
case OP_BOR: return("|");
default: return("??");
}
}
char*
Vartype2BStr(
enum vartype vartype)
{
switch (vartype) {
case V_BOOL: return("BOOL");
case V_STRING: return("STRING");
case V_CHAR:
case V_FUNC:
case V_INT:
case V_LLONG:
case V_LONG:
case V_SHORT: return("SIGNED");
case V_UCHAR:
case V_UFUNC:
case V_UINT:
case V_ULLONG:
case V_ULONG:
case V_USHORT: return("UNSIGNED");
case V_IPADDR: return("IPADDR");
}
fprintf(stderr,"Vartype2BStr: Internal error, unknown type %d\n",
vartype);
exit(-1);
}
char*
Vartype2Str(
enum vartype vartype)
{
switch (vartype) {
case V_BOOL: return("BOOL");
case V_CHAR: return("CHAR");
case V_INT: return("INT");
case V_LONG: return("LONG");
case V_SHORT: return("SHORT");
case V_STRING: return("STRING");
case V_UCHAR: return("UCHAR");
case V_UINT: return("UINT");
case V_ULONG: return("ULONG");
case V_USHORT: return("USHORT");
case V_LLONG: return("LLONG");
case V_ULLONG: return("ULLONG");
case V_FUNC: return("FUNC");
case V_UFUNC: return("UFUNC");
case V_IPADDR: return("IPADDR");
}
fprintf(stderr,"Vartype2Str: Internal error, unknown type %d\n",
vartype);
exit(-1);
}
/**************************************************************/
/**************************************************************/
/** **/
/** The following routines are all for Making filter trees **/
/** **/
/**************************************************************/
/**************************************************************/
static struct filter_node *
MustBeType(
enum vartype var_needed,
struct filter_node *pf)
{
/* if they match, we're done */
if (pf->vartype == var_needed)
return(pf);
/* the only conversion we can do is unsigned to signed */
if ((pf->vartype == V_ULLONG) && (var_needed == V_LLONG)) {
struct filter_node *pf_new;
pf_new = MakeUnaryNode(OP_SIGNED,pf);
return(pf_new);
}
/* else it's an error */
fprintf(stderr,"Filter expression should be type %s, but isn't: ",
Vartype2Str(var_needed));
PrintFilter(pf);
exit(-1);
}
struct filter_node *
MakeUnaryNode(
enum optype op,
struct filter_node *pf_in)
{
struct filter_node *pf_ret = NULL;
struct filter_node *pf1;
/* walk everybody on the list and copy */
for (pf1 = pf_in; pf1; pf1=pf1->next_var) {
struct filter_node *pf_new;
/* type checking */
if (op == OP_NOT)
pf_in = MustBeType(V_BOOL,pf_in);
pf_new = MallocZ(sizeof(struct filter_node));
pf_new->op = op;
pf_new->vartype = pf1->vartype;
pf_new->un.unary.pf = pf1;
/* add to the linked list of unaries */
if (pf_ret == NULL) {
pf_ret = pf_new;
} else {
pf_new->next_var = pf_ret;
pf_ret = pf_new;
}
}
return(pf_ret);
}
static struct filter_node *
MakeDisjunction(
struct filter_node *left,
struct filter_node *right)
{
struct filter_node *pf;
/* construct a high-level OR to hook them together */
pf = MallocZ(sizeof(struct filter_node));
pf->op = OP_OR;
pf->vartype = V_BOOL;
/* hook the two opnodes together */
pf->un.binary.left = left;
pf->un.binary.right = right;
/* return the OR node */
return(pf);
}
static struct filter_node *
MakeConjunction(
struct filter_node *left,
struct filter_node *right)
{
struct filter_node *pf;
/* construct a high-level AND to hook them together */
pf = MallocZ(sizeof(struct filter_node));
pf->op = OP_AND;
pf->vartype = V_BOOL;
/* hook the two opnodes together */
pf->un.binary.left = left;
pf->un.binary.right = right;
/* return the OR node */
return(pf);
}
static struct filter_node *
MakeOneBinaryNode(
enum optype op,
struct filter_node *pf_left,
struct filter_node *pf_right)
{
struct filter_node *pf;
pf = MallocZ(sizeof(struct filter_node));
pf->op = op;
/* type checking */
switch (op) {
case OP_AND:
case OP_OR:
pf_left = MustBeType(V_BOOL,pf_left);
pf_right = MustBeType(V_BOOL,pf_right);
pf->vartype = V_BOOL;
break;
case OP_PLUS:
case OP_MINUS:
case OP_TIMES:
case OP_DIVIDE:
case OP_MOD:
case OP_BAND:
case OP_BOR:
if ((pf_left->vartype != V_LLONG) && (pf_left->vartype != V_ULLONG)) {
fprintf(stderr,"Arithmetic operator applied to non-number: ");
PrintFilter(pf_left);
exit(-1);
}
if ((pf_right->vartype != V_LLONG) && (pf_right->vartype != V_ULLONG)) {
fprintf(stderr,"Arithmetic operator applied to non-number: ");
PrintFilter(pf_right);
exit(-1);
}
/* else, they's both either signed or unsigned */
if ((pf_left->vartype == V_LLONG) && (pf_right->vartype == V_ULLONG)) {
/* convert right to signed */
pf_right = MustBeType(V_LLONG,pf_right);
} else if ((pf_left->vartype == V_ULLONG) && (pf_right->vartype == V_LLONG)) {
/* convert left to signed */
pf_left = MustBeType(V_LLONG,pf_left);
}
pf->vartype = pf_left->vartype;
break;
case OP_EQUAL:
case OP_NEQUAL:
case OP_GREATER:
case OP_GREATER_EQ:
case OP_LESS:
case OP_LESS_EQ:
/* IP addresses are special case */
if ((pf_left->vartype == V_IPADDR) ||
(pf_right->vartype == V_IPADDR)) {
/* must BOTH be addresses */
if ((pf_left->vartype != V_IPADDR) ||
(pf_right->vartype != V_IPADDR)) {
fprintf(stderr,
"IPaddreses can only be compared with each other: ");
PrintFilter(pf);
exit(-1);
}
pf->vartype = V_BOOL;
break;
}
/* Allow STRING variables like hostname, portname to be used as in
* -f'hostname=="masaka.cs.ohiou.edu"'
*/
if ((pf_left->vartype == V_STRING) && (pf_right->vartype == V_STRING)){
pf->vartype = V_BOOL;
break;
}
/* ... else, normal numeric stuff */
if ((pf_left->vartype != V_LLONG) && (pf_left->vartype != V_ULLONG)) {
fprintf(stderr,"Relational operator applied to non-number: ");
PrintFilter(pf_left);
exit(-1);
}
if ((pf_right->vartype != V_LLONG) && (pf_right->vartype != V_ULLONG)) {
fprintf(stderr,"Relational operator applied to non-number: ");
PrintFilter(pf_right);
exit(-1);
}
/* else, they's both either signed or unsigned */
if ((pf_left->vartype == V_LLONG) && (pf_right->vartype == V_ULLONG)) {
/* convert right to signed */
pf_right = MustBeType(V_LLONG,pf_right);
} else if ((pf_left->vartype == V_ULLONG) && (pf_right->vartype == V_LLONG)) {
/* convert left to signed */
pf_left = MustBeType(V_LLONG,pf_left);
}
pf->vartype = V_BOOL;
break;
default:
fprintf(stderr,"MakeBinaryNode: invalid binary operand type %d (%s)\n",
op, Op2Str(op));
exit(-1);
}
/* attach the children */
pf->un.binary.left = pf_left;
pf->un.binary.right = pf_right;
return(pf);
}
struct filter_node *
MakeBinaryNode(
enum optype op,
struct filter_node *pf_left,
struct filter_node *pf_right)
{
struct filter_node *pf_ret = NULL;
struct filter_node *pf1;
struct filter_node *pf2;
for (pf1 = pf_left; pf1; pf1=pf1->next_var) {
for (pf2 = pf_right; pf2; pf2=pf2->next_var) {
struct filter_node *pf_new;
/* make one copy */
pf_new = MakeOneBinaryNode(op,pf1,pf2);
if ((pf1->conjunction) || (pf2->conjunction))
pf_new->conjunction = TRUE;
if (debug>1)
printf("MakeBinaryNode: made %s (%c)\n",
Filter2Str(pf_new),
pf_new->conjunction?'c':'d');
/* hook together as appropriate */
switch (op) {
case OP_PLUS:
case OP_MINUS:
case OP_TIMES:
case OP_DIVIDE:
case OP_MOD:
case OP_BAND:
case OP_BOR:
/* just keep a list */
if (pf_ret == NULL) {
pf_ret = pf_new;
} else {
pf_new->next_var = pf_ret;
pf_ret = pf_new;
}
break;
case OP_AND:
case OP_OR:
case OP_EQUAL:
case OP_NEQUAL:
case OP_GREATER:
case OP_GREATER_EQ:
case OP_LESS:
case OP_LESS_EQ:
/* terminate the wildcard list by making OR nodes or AND nodes*/
if (pf_ret == NULL)
pf_ret = pf_new;
else {
if ((pf1->conjunction) || (pf2->conjunction))
pf_ret = MakeConjunction(pf_ret,pf_new);
else
pf_ret = MakeDisjunction(pf_ret,pf_new);
}
break;
default:
fprintf(stderr,"MakeBinaryNode: invalid binary operand type %d (%s)\n",
op, Op2Str(op));
exit(-1);
}
}
}
return(pf_ret);
}
struct filter_node *
MakeVarNode(
char *varname)
{
struct filter_node *pf;
if (strncasecmp(varname,"c_",2) == 0) {
/* just client */
pf = LookupVar(varname+2,TRUE);
} else if (strncasecmp(varname,"s_",2) == 0) {
/* just server */
pf = LookupVar(varname+2,FALSE);
} else if (strncasecmp(varname,"b_",2) == 0) {
/* they want a CONjunction, look up BOTH and return a list */
pf = LookupVar(varname+2,TRUE);/* client */
pf->next_var = LookupVar(varname+2,FALSE); /* server */
pf->conjunction = pf->next_var->conjunction = TRUE;
} else if (strncasecmp(varname,"e_",2) == 0) {
/* they want a DISjunction, look up BOTH and return a list */
pf = LookupVar(varname+2,TRUE);/* client */
pf->next_var = LookupVar(varname+2,FALSE); /* server */
} else {
/* look up BOTH and return a list (same as e_) */
pf = LookupVar(varname,TRUE);/* client */
pf->next_var = LookupVar(varname,FALSE); /* server */
}
return(pf);
}
struct filter_node *
MakeStringConstNode(
char *val)
{
struct filter_node *pf;
pf = MallocZ(sizeof(struct filter_node));
pf->op = OP_CONSTANT;
pf->vartype = V_STRING;
pf->un.constant.string = val;
return(pf);
}
struct filter_node *
MakeBoolConstNode(
Bool val)
{
struct filter_node *pf;
pf = MallocZ(sizeof(struct filter_node));
pf->vartype = V_BOOL;
pf->un.constant.bool = val;
return(pf);
}
struct filter_node *
MakeSignedConstNode(
llong val)
{
struct filter_node *pf;
pf = MallocZ(sizeof(struct filter_node));
pf->op = OP_CONSTANT;
pf->vartype = V_LLONG;
pf->un.constant.longint = val;
return(pf);
}
struct filter_node *
MakeUnsignedConstNode(
u_llong val)
{
struct filter_node *pf;
pf = MallocZ(sizeof(struct filter_node));
pf->op = OP_CONSTANT;
pf->vartype = V_ULLONG;
pf->un.constant.u_longint = val;
return(pf);
}
struct filter_node *
MakeIPaddrConstNode(
ipaddr *pipaddr)
{
struct filter_node *pf;
pf = MallocZ(sizeof(struct filter_node));
pf->op = OP_CONSTANT;
pf->vartype = V_IPADDR;
pf->un.constant.pipaddr = pipaddr;
return(pf);
}
/**************************************************************/
/**************************************************************/
/** **/
/** The folloing routines are all for PRINTING filter trees **/
/** **/
/**************************************************************/
/**************************************************************/
static char *
PrintConst(
struct filter_node *pf)
{
char buf[100];
/* for constants */
switch (pf->vartype) {
case V_ULLONG:
if (debug)
snprintf(buf,sizeof(buf),"ULLONG(%" FS_ULL ")",
pf->un.constant.u_longint);
else
snprintf(buf,sizeof(buf),"%" FS_ULL,pf->un.constant.u_longint);
break;
case V_LLONG:
if (debug)
snprintf(buf,sizeof(buf),"LLONG(%" FS_LL ")", pf->un.constant.longint);
else
snprintf(buf,sizeof(buf),"%" FS_LL, pf->un.constant.longint);
break;
case V_STRING:
if (debug)
snprintf(buf,sizeof(buf),"STRING(%s)",pf->un.constant.string);
else
snprintf(buf,sizeof(buf),"%s",pf->un.constant.string);
break;
case V_BOOL:
if (debug)
snprintf(buf,sizeof(buf),"BOOL(%s)", BOOL2STR(pf->un.constant.bool));
else
snprintf(buf,sizeof(buf),"%s", BOOL2STR(pf->un.constant.bool));
break;
case V_IPADDR:
if (debug)
snprintf(buf,sizeof(buf),"IPADDR(%s)", HostAddr(*pf->un.constant.pipaddr));
else
snprintf(buf,sizeof(buf),"%s", HostAddr(*pf->un.constant.pipaddr));
break;
default: {
fprintf(stderr,"PrintConst: unknown constant type %d (%s)\n",
pf->vartype, Vartype2Str(pf->vartype));
exit(-1);
}
}
/* small memory leak, but it's just done once for debugging... */
return(strdup(buf));
}
static char *
PrintVar(
struct filter_node *pf)
{
char buf[100];
if (debug)
snprintf(buf,sizeof(buf),"VAR(%s,'%s%s',%lu,%c)",
Vartype2Str(pf->vartype),
pf->un.variable.fclient?"c_":"s_",
pf->un.variable.name,
pf->un.variable.offset,
pf->conjunction?'c':'d');
else
snprintf(buf,sizeof(buf),"%s%s",
pf->un.variable.fclient?"c_":"s_",
pf->un.variable.name);
/* small memory leak, but it's just done once for debugging... */
return(strdup(buf));
}
/**************************************************************/
/**************************************************************/
/** **/
/** The folloing routines are all for access from tcptrace **/
/** **/
/**************************************************************/
/**************************************************************/
void
ParseFilter(
char *expr)
{
exprstr = strdup(expr);
if (debug)
printf("Parsefilter('%s') called\n", expr);
if (debug > 1)
filtyydebug = 1;
if (filtyyparse() == 0) {
/* it worked */
printf("Output filter: %s\n", Filter2Str(filter_root));
} else {
/* parsing failed */
fprintf(stderr,"Filter parsing failed\n");
exit(-1);
}
return;
}
static char *
Res2Str(
struct filter_res *pres)
{
char buf[100];
/* for constants */
switch (pres->vartype) {
case V_ULLONG: snprintf(buf,sizeof(buf),"ULLONG(%" FS_ULL ")",pres->val.u_longint); break;
case V_LLONG: snprintf(buf,sizeof(buf),"LLONG(%" FS_LL ")",pres->val.longint); break;
case V_STRING: snprintf(buf,sizeof(buf),"STRING(%s)",pres->val.string); break;
case V_BOOL: snprintf(buf,sizeof(buf),"BOOL(%s)", BOOL2STR(pres->val.bool)); break;
default: {
fprintf(stderr,"Res2Str: unknown constant type %d (%s)\n",
pres->vartype, Vartype2Str(pres->vartype));
exit(-1);
}
}
/* small memory leak, but it's just done once for debugging... */
return(strdup(buf));
}
void
PrintFilter(
struct filter_node *pf)
{
printf("%s\n", PrintFilterInternal(pf));
}
char *
Filter2Str(
struct filter_node *pf)
{
return(PrintFilterInternal(pf));
}
static char *
PrintFilterInternal(
struct filter_node *pf)
{
/* I'm tolerating a memory leak here because it's mostly just for debugging */
char buf[1024];
if (!pf)
return("");
switch(pf->op) {
case OP_CONSTANT:
snprintf(buf,sizeof(buf),"%s", PrintConst(pf));
return(strdup(buf));
case OP_VARIABLE:
snprintf(buf,sizeof(buf),"%s", PrintVar(pf));
return(strdup(buf));
case OP_AND:
case OP_OR:
case OP_EQUAL:
case OP_NEQUAL:
case OP_GREATER:
case OP_GREATER_EQ:
case OP_LESS:
case OP_LESS_EQ:
case OP_PLUS:
case OP_MINUS:
case OP_TIMES:
case OP_DIVIDE:
case OP_MOD:
case OP_BAND:
case OP_BOR:
snprintf(buf,sizeof(buf),"(%s%s%s)",
PrintFilterInternal(pf->un.binary.left),
Op2Str(pf->op),
PrintFilterInternal(pf->un.binary.right));
return(strdup(buf));
case OP_NOT:
snprintf(buf,sizeof(buf)," NOT(%s)",
PrintFilterInternal(pf->un.unary.pf));
return(strdup(buf));
case OP_SIGNED:
snprintf(buf,sizeof(buf)," SIGNED(%s)",
PrintFilterInternal(pf->un.unary.pf));
return(strdup(buf));
default:
fprintf(stderr,"PrintFilter: unknown op %d (%s)\n",
pf->op, Op2Str(pf->op));
exit(-1);
}
}
static struct filter_node *
LookupVar(
char *varname,
Bool fclient)
{
int i;
struct filter_node *pf;
void *ptr;
for (i=0; i < NUM_FILTERS; ++i) {
struct filter_line *pfl = &filters[i];
if (strcasecmp(varname,pfl->varname) == 0) {
/* we found it */
pf = MallocZ(sizeof(struct filter_node));
pf->op = OP_VARIABLE;
switch (pfl->vartype) {
case V_CHAR:
case V_INT:
case V_LLONG:
case V_LONG:
case V_SHORT:
case V_FUNC:
pf->vartype = V_LLONG; /* we'll promote on the fly */
break;
case V_UCHAR:
case V_UINT:
case V_ULLONG:
case V_ULONG:
case V_USHORT:
case V_UFUNC:
pf->vartype = V_ULLONG; /* we'll promote on the fly */
break;
case V_BOOL:
pf->vartype = V_BOOL;
break;
case V_IPADDR:
pf->vartype = V_IPADDR;
break;
case V_STRING:
pf->vartype = V_STRING;
break;
default:
pf->vartype = pf->vartype;
}
pf->un.variable.realtype = pfl->vartype;
pf->un.variable.name = strdup(varname);
if (fclient)
ptr = (void *)pfl->cl_addr;
else
ptr = (void *)pfl->sv_addr;
if ((pfl->vartype == V_FUNC) || (pfl->vartype == V_UFUNC))
pf->un.variable.offset = (u_long)ptr; /* FIXME? could still be a pointer bug here! */
else
pf->un.variable.offset = (char *)ptr - (char *)&ptp_dummy;
pf->un.variable.fclient = fclient;
return(pf);
}
}
/* not found */
fprintf(stderr,"Variable \"%s\" not found\n", varname);
HelpFilterVariables();
exit(-1);
}
static u_llong
Ptr2Signed(
tcp_pair *ptp,
enum vartype vartype,
void *ptr)
{
u_llong val;
switch (vartype) {
case V_LLONG: val = *((llong *) ptr); break;
case V_LONG: val = *((long *) ptr); break;
case V_INT: val = *((int *) ptr); break;
case V_SHORT: val = *((short *) ptr); break;
case V_CHAR: val = *((char *) ptr); break;
default: {
fprintf(stderr,
"Ptr2Signed: can't convert type %s to signed\n",
Vartype2Str(vartype));
exit(-1);
}
}
return(val);
}
static u_llong
Ptr2Unsigned(
tcp_pair *ptp,
enum vartype vartype,
void *ptr)
{
u_llong val;
switch (vartype) {
case V_ULLONG: val = *((u_llong *) ptr); break;
case V_ULONG: val = *((u_long *) ptr); break;
case V_UINT: val = *((u_int *) ptr); break;
case V_USHORT: val = *((u_short *) ptr); break;
case V_UCHAR: val = *((u_char *) ptr); break;
case V_BOOL: val = *((Bool *) ptr)==TRUE; break;
default: {
fprintf(stderr,
"Ptr2Unsigned: can't convert variable type %s to unsigned\n",
Vartype2Str(vartype));
exit(-1);
}
}
return(val);
}
static char *
Var2String(
tcp_pair *ptp,
struct filter_node *pf)
{
void *ptr;
char *str;
ptr = (char *)ptp + pf->un.variable.offset;
str = *((char **)ptr);
if (str == NULL)
str = "<NULL>";
if (debug)
printf("Var2String returns 0x%p (%s)\n",
str, str);
return(str);
}
static u_long
Var2Signed(
tcp_pair *ptp,
struct filter_node *pf)
{
void *ptr;
ptr = (char *)ptp + pf->un.variable.offset;
switch (pf->un.variable.realtype) {
case V_LLONG: return(Ptr2Signed(ptp,V_LLONG,ptr));
case V_LONG: return(Ptr2Signed(ptp,V_LONG,ptr));
case V_INT: return(Ptr2Signed(ptp,V_INT,ptr));
case V_SHORT: return(Ptr2Signed(ptp,V_SHORT,ptr));
case V_CHAR: return(Ptr2Signed(ptp,V_CHAR,ptr));
case V_FUNC:
{ /* call the function */
llong (*pfunc)(tcp_pair *ptp);
pfunc = (llong (*)(tcp_pair *))(pf->un.variable.offset);
return((*pfunc)(ptp));
}
default: {
fprintf(stderr,
"Filter eval error, can't convert variable type %s to signed\n",
Vartype2Str(pf->un.variable.realtype));
exit(-1);
}
}
}
static ipaddr *
Var2Ipaddr(
tcp_pair *ptp,
struct filter_node *pf)
{
void *ptr;
ptr = (char *)ptp + pf->un.variable.offset;
switch (pf->un.variable.realtype) {
case V_IPADDR: return(ptr);
default: {
fprintf(stderr,
"Filter eval error, can't convert variable type %s to ipaddr\n",
Vartype2Str(pf->un.variable.realtype));
exit(-1);
}
}
}