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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
|
/* $OpenBSD: print-snmp.c,v 1.15 2008/01/17 17:33:15 reyk Exp $ */
/*
* Copyright (c) 1990, 1991, 1993, 1994, 1995, 1996, 1997
* John Robert LoVerso. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
*
* This implementation has been influenced by the CMU SNMP release,
* by Steve Waldbusser. However, this shares no code with that system.
* Additional ASN.1 insight gained from Marshall T. Rose's _The_Open_Book_.
* Earlier forms of this implementation were derived and/or inspired by an
* awk script originally written by C. Philip Wood of LANL (but later
* heavily modified by John Robert LoVerso). The copyright notice for
* that work is preserved below, even though it may not rightly apply
* to this file.
*
* This started out as a very simple program, but the incremental decoding
* (into the BE structure) complicated things.
*
# Los Alamos National Laboratory
#
# Copyright (c) 1990, 1991, 1993, 1994, 1995, 1996, 1997
# This software was produced under a U.S. Government contract
# (W-7405-ENG-36) by Los Alamos National Laboratory, which is
# operated by the University of California for the U.S. Department
# of Energy. The U.S. Government is licensed to use, reproduce,
# and distribute this software. Permission is granted to the
# public to copy and use this software without charge, provided
# that this Notice and any statement of authorship are reproduced
# on all copies. Neither the Government nor the University makes
# any warranty, express or implied, or assumes any liability or
# responsibility for the use of this software.
# @(#)snmp.awk.x 1.1 (LANL) 1/15/90
*/
#ifndef lint
static const char rcsid[] =
"@(#) $Id: print-snmp.c,v 1.15 2008/01/17 17:33:15 reyk Exp $ (LBL)";
#endif
#include <sys/param.h>
#include <sys/time.h>
#include <ctype.h>
#ifdef HAVE_MEMORY_H
#include <memory.h>
#endif
#include <stdio.h>
#include <string.h>
#include "interface.h"
#include "addrtoname.h"
/*
* Universal ASN.1 types
* (we only care about the tag values for those allowed in the Internet SMI)
*/
char *Universal[] = {
"U-0",
"Boolean",
"Integer",
#define INTEGER 2
"Bitstring",
"String",
#define STRING 4
"Null",
#define ASN_NULL 5
"ObjID",
#define OBJECTID 6
"ObjectDes",
"U-8","U-9","U-10","U-11", /* 8-11 */
"U-12","U-13","U-14","U-15", /* 12-15 */
"Sequence",
#define SEQUENCE 16
"Set"
};
/*
* Application-wide ASN.1 types from the Internet SMI and their tags
*/
char *Application[] = {
"IpAddress",
#define IPADDR 0
"Counter",
#define COUNTER 1
"Gauge",
#define GAUGE 2
"TimeTicks",
#define TIMETICKS 3
"Opaque",
#define OPAQUE 4
"NsapAddress",
#define NSAPADDR 5
"Counter64",
#define COUNTER64 6
"UInteger32"
#define UINTEGER32 7
};
/*
* Context-specific ASN.1 types for the SNMP PDUs and their tags
*/
char *Context[] = {
"GetRequest",
#define GETREQ 0
"GetNextRequest",
#define GETNEXTREQ 1
"GetResponse",
#define GETRESP 2
"SetRequest",
#define SETREQ 3
"Trap",
#define TRAP 4
"GetBulkReq",
#define GETBULKREQ 5
"InformReq",
#define INFORMREQ 6
"TrapV2",
#define TRAPV2 7
"Report"
#define REPORT 8
};
/*
* Private ASN.1 types
* The Internet SMI does not specify any
*/
char *Private[] = {
"P-0"
};
/*
* error-status values for any SNMP PDU
*/
char *ErrorStatus[] = {
"noError",
"tooBig",
"noSuchName",
"badValue",
"readOnly",
"genErr",
"noAccess",
"wrongType",
"wrongLength",
"wrongEnc",
"wrongValue",
"noCreation",
"inconValue",
"resUnavail",
"commitFailed",
"undoFailed",
"authError",
"notWritable",
"inconName"
};
#define DECODE_ErrorStatus(e) \
( e >= 0 && e <= sizeof(ErrorStatus)/sizeof(ErrorStatus[0]) \
? ErrorStatus[e] : (snprintf(errbuf, sizeof(errbuf), "err=%u", e), errbuf))
/*
* generic-trap values in the SNMP Trap-PDU
*/
char *GenericTrap[] = {
"coldStart",
"warmStart",
"linkDown",
"linkUp",
"authenticationFailure",
"egpNeighborLoss",
"enterpriseSpecific"
#define GT_ENTERPRISE 6
};
#define DECODE_GenericTrap(t) \
( t >= 0 && t <= sizeof(GenericTrap)/sizeof(GenericTrap[0]) \
? GenericTrap[t] : (snprintf(buf, sizeof(buf), "gt=%d", t), buf))
/*
* ASN.1 type class table
* Ties together the preceding Universal, Application, Context, and Private
* type definitions.
*/
#define defineCLASS(x) { "x", x, sizeof(x)/sizeof(x[0]) } /* not ANSI-C */
struct {
char *name;
char **Id;
int numIDs;
} Class[] = {
defineCLASS(Universal),
#define UNIVERSAL 0
defineCLASS(Application),
#define APPLICATION 1
defineCLASS(Context),
#define CONTEXT 2
defineCLASS(Private),
#define PRIVATE 3
};
/*
* defined forms for ASN.1 types
*/
char *Form[] = {
"Primitive",
#define PRIMITIVE 0
"Constructed",
#define CONSTRUCTED 1
};
/*
* A structure for the OID tree for the compiled-in MIB.
* This is stored as a general-order tree.
*/
struct obj {
char *desc; /* name of object */
u_int oid; /* sub-id following parent */
u_char type; /* object type (unused) */
struct obj *child, *next; /* child and next sibling pointers */
} *objp = NULL;
/*
* Include the compiled in SNMP MIB. "mib.h" is produced by feeding
* RFC-1156 format files into "makemib". "mib.h" MUST define at least
* a value for `mibroot'.
*
* In particular, this is gross, as this is including initialized structures,
* and by right shouldn't be an "include" file.
*/
#include "mib.h"
/*
* This defines a list of OIDs which will be abbreviated on output.
* Currently, this includes the prefixes for the Internet MIB, the
* private enterprises tree, and the experimental tree.
*/
struct obj_abrev {
char *prefix; /* prefix for this abrev */
struct obj *node; /* pointer into object table */
char *oid; /* ASN.1 encoded OID */
} obj_abrev_list[] = {
#ifndef NO_ABREV_MIB
/* .iso.org.dod.internet.mgmt.mib */
{ "", &_mib_obj, "\53\6\1\2\1" },
#endif
#ifndef NO_ABREV_ENTER
/* .iso.org.dod.internet.private.enterprises */
{ "E:", &_enterprises_obj, "\53\6\1\4\1" },
#endif
#ifndef NO_ABREV_EXPERI
/* .iso.org.dod.internet.experimental */
{ "X:", &_experimental_obj, "\53\6\1\3" },
#endif
#ifndef NO_ABREV_SNMPMIBOBJECTS
/* .iso.org.dod.internet.snmpV2.snmpModules.snmpMIB.snmpMIBObjects */
{ "S:", &_snmpmibobjects_obj, "\53\6\1\6\3\1\1" },
#endif
{ 0,0,0 }
};
/*
* This is used in the OID print routine to walk down the object tree
* rooted at `mibroot'.
*/
#define OBJ_PRINT(o, suppressdot) \
{ \
if (objp) { \
do { \
if ((o) == objp->oid) \
break; \
} while ((objp = objp->next) != NULL); \
} \
if (objp) { \
printf(suppressdot?"%s":".%s", objp->desc); \
objp = objp->child; \
} else \
printf(suppressdot?"%u":".%u", (o)); \
}
/*
* This is the definition for the Any-Data-Type storage used purely for
* temporary internal representation while decoding an ASN.1 data stream.
*/
struct be {
u_int32_t asnlen;
union {
caddr_t raw;
int32_t integer;
u_int32_t uns;
u_int64_t uns64;
const u_char *str;
} data;
u_short id;
u_char form, class; /* tag info */
u_char type;
#define BE_ANY 255
#define BE_NONE 0
#define BE_NULL 1
#define BE_OCTET 2
#define BE_OID 3
#define BE_INT 4
#define BE_UNS 5
#define BE_STR 6
#define BE_SEQ 7
#define BE_INETADDR 8
#define BE_PDU 9
#define BE_UNS64 10
};
/*
* Defaults for SNMP PDU components
*/
#define DEF_COMMUNITY "public"
#define DEF_VERSION 1
/*
* constants for ASN.1 decoding
*/
#define OIDMUX 40
#define ASNLEN_INETADDR 4
#define ASN_SHIFT7 7
#define ASN_SHIFT8 8
#define ASN_BIT8 0x80
#define ASN_LONGLEN 0x80
#define ASN_ID_BITS 0x1f
#define ASN_FORM_BITS 0x20
#define ASN_FORM_SHIFT 5
#define ASN_CLASS_BITS 0xc0
#define ASN_CLASS_SHIFT 6
#define ASN_ID_EXT 0x1f /* extension ID in tag field */
/*
* truncated==1 means the packet was complete, but we don't have all of
* it to decode.
*/
static int truncated;
#define ifNotTruncated if (truncated) fputs("[|snmp]", stdout); else
/*
* This decodes the next ASN.1 object in the stream pointed to by "p"
* (and of real-length "len") and stores the intermediate data in the
* provided BE object.
*
* This returns -l if it fails (i.e., the ASN.1 stream is not valid).
* O/w, this returns the number of bytes parsed from "p".
*/
static int
asn1_parse(register const u_char *p, u_int len, struct be *elem)
{
u_char form, class, id;
int i, hdr;
elem->asnlen = 0;
elem->type = BE_ANY;
if (len < 1) {
ifNotTruncated puts("[nothing to parse], stdout");
return -1;
}
/*
* it would be nice to use a bit field, but you can't depend on them.
* +---+---+---+---+---+---+---+---+
* + class |frm| id |
* +---+---+---+---+---+---+---+---+
* 7 6 5 4 3 2 1 0
*/
id = *p & ASN_ID_BITS; /* lower 5 bits, range 00-1f */
#ifdef notdef
form = (*p & 0xe0) >> 5; /* move upper 3 bits to lower 3 */
class = form >> 1; /* bits 7&6 -> bits 1&0, range 0-3 */
form &= 0x1; /* bit 5 -> bit 0, range 0-1 */
#else
form = (u_char)(*p & ASN_FORM_BITS) >> ASN_FORM_SHIFT;
class = (u_char)(*p & ASN_CLASS_BITS) >> ASN_CLASS_SHIFT;
#endif
elem->form = form;
elem->class = class;
elem->id = id;
if (vflag)
printf("|%.2x", *p);
p++; len--; hdr = 1;
/* extended tag field */
if (id == ASN_ID_EXT) {
for (id = 0; *p & ASN_BIT8 && len > 0; len--, hdr++, p++) {
if (vflag)
printf("|%.2x", *p);
id = (id << 7) | (*p & ~ASN_BIT8);
}
if (len == 0 && *p & ASN_BIT8) {
ifNotTruncated fputs("[Xtagfield?]", stdout);
return -1;
}
elem->id = id = (id << 7) | *p;
--len;
++hdr;
++p;
}
if (len < 1) {
ifNotTruncated fputs("[no asnlen]", stdout);
return -1;
}
elem->asnlen = *p;
if (vflag)
printf("|%.2x", *p);
p++; len--; hdr++;
if (elem->asnlen & ASN_BIT8) {
int noct = elem->asnlen % ASN_BIT8;
elem->asnlen = 0;
if (len < noct) {
ifNotTruncated printf("[asnlen? %d<%d]", len, noct);
return -1;
}
for (; noct-- > 0; len--, hdr++) {
if (vflag)
printf("|%.2x", *p);
elem->asnlen = (elem->asnlen << ASN_SHIFT8) | *p++;
}
}
if (len < elem->asnlen) {
if (!truncated) {
printf("[len%d<asnlen%u]", len, elem->asnlen);
return -1;
}
/* maybe should check at least 4? */
elem->asnlen = len;
}
if (form >= sizeof(Form)/sizeof(Form[0])) {
ifNotTruncated printf("[form?%d]", form);
return -1;
}
if (class >= sizeof(Class)/sizeof(Class[0])) {
ifNotTruncated printf("[class?%c/%d]", *Form[form], class);
return -1;
}
if ((int)id >= Class[class].numIDs) {
ifNotTruncated printf("[id?%c/%s/%d]", *Form[form],
Class[class].name, id);
return -1;
}
switch (form) {
case PRIMITIVE:
switch (class) {
case UNIVERSAL:
switch (id) {
case STRING:
elem->type = BE_STR;
elem->data.str = p;
break;
case INTEGER: {
register int32_t data;
elem->type = BE_INT;
data = 0;
if (*p & ASN_BIT8) /* negative */
data = -1;
for (i = elem->asnlen; i-- > 0; p++)
data = (data << ASN_SHIFT8) | *p;
elem->data.integer = data;
break;
}
case OBJECTID:
elem->type = BE_OID;
elem->data.raw = (caddr_t)p;
break;
case ASN_NULL:
elem->type = BE_NULL;
elem->data.raw = NULL;
break;
default:
elem->type = BE_OCTET;
elem->data.raw = (caddr_t)p;
printf("[P/U/%s]",
Class[class].Id[id]);
break;
}
break;
case APPLICATION:
switch (id) {
case IPADDR:
elem->type = BE_INETADDR;
elem->data.raw = (caddr_t)p;
break;
case COUNTER:
case GAUGE:
case TIMETICKS:
case OPAQUE:
case NSAPADDR:
case UINTEGER32: {
register u_int32_t data;
elem->type = BE_UNS;
data = 0;
for (i = elem->asnlen; i-- > 0; p++)
data = (data << 8) + *p;
elem->data.uns = data;
break;
}
case COUNTER64: {
register u_int64_t data;
elem->type = BE_UNS64;
data = 0;
for (i = elem->asnlen; i-- > 0; p++)
data = (data << 8) + *p;
elem->data.uns64 = data;
break;
}
default:
elem->type = BE_OCTET;
elem->data.raw = (caddr_t)p;
printf("[P/A/%s]",
Class[class].Id[id]);
break;
}
break;
default:
elem->type = BE_OCTET;
elem->data.raw = (caddr_t)p;
printf("[P/%s/%s]",
Class[class].name, Class[class].Id[id]);
break;
}
break;
case CONSTRUCTED:
switch (class) {
case UNIVERSAL:
switch (id) {
case SEQUENCE:
elem->type = BE_SEQ;
elem->data.raw = (caddr_t)p;
break;
default:
elem->type = BE_OCTET;
elem->data.raw = (caddr_t)p;
printf("C/U/%s", Class[class].Id[id]);
break;
}
break;
case CONTEXT:
elem->type = BE_PDU;
elem->data.raw = (caddr_t)p;
break;
default:
elem->type = BE_OCTET;
elem->data.raw = (caddr_t)p;
printf("C/%s/%s",
Class[class].name, Class[class].Id[id]);
break;
}
break;
}
p += elem->asnlen;
len -= elem->asnlen;
return elem->asnlen + hdr;
}
/*
* Display the ASN.1 object represented by the BE object.
* This used to be an integral part of asn1_parse() before the intermediate
* BE form was added.
*/
static void
asn1_print(struct be *elem)
{
u_char *p = (u_char *)elem->data.raw;
u_int32_t asnlen = elem->asnlen;
int i;
switch (elem->type) {
case BE_OCTET:
for (i = asnlen; i-- > 0; p++)
printf("_%.2x", *p);
break;
case BE_NULL:
break;
case BE_OID: {
int o = 0, first = -1, i = asnlen;
if (!nflag && asnlen > 2) {
struct obj_abrev *a = &obj_abrev_list[0];
for (; a->node; a++) {
if (!memcmp(a->oid, (char *)p,
strlen(a->oid))) {
objp = a->node->child;
i -= strlen(a->oid);
p += strlen(a->oid);
fputs(a->prefix, stdout);
first = 1;
break;
}
}
}
for (; i-- > 0; p++) {
o = (o << ASN_SHIFT7) + (*p & ~ASN_BIT8);
if (*p & ASN_LONGLEN)
continue;
/*
* first subitem encodes two items with 1st*OIDMUX+2nd
*/
if (first < 0) {
if (!nflag)
objp = mibroot;
first = 0;
OBJ_PRINT(o/OIDMUX, first);
o %= OIDMUX;
}
OBJ_PRINT(o, first);
if (--first < 0)
first = 0;
o = 0;
}
break;
}
case BE_INT:
printf("%d", elem->data.integer);
break;
case BE_UNS:
printf("%d", elem->data.uns);
break;
case BE_UNS64:
printf("%lld", elem->data.uns64);
break;
case BE_STR: {
register int printable = 1, first = 1;
const u_char *p = elem->data.str;
for (i = asnlen; printable && i-- > 0; p++)
printable = isprint(*p) || isspace(*p);
p = elem->data.str;
if (printable) {
putchar('"');
(void)fn_print(p, p + asnlen);
putchar('"');
} else
for (i = asnlen; i-- > 0; p++) {
printf(first ? "%.2x" : "_%.2x", *p);
first = 0;
}
break;
}
case BE_SEQ:
printf("Seq(%u)", elem->asnlen);
break;
case BE_INETADDR: {
char sep;
if (asnlen != ASNLEN_INETADDR)
printf("[inetaddr len!=%d]", ASNLEN_INETADDR);
sep='[';
for (i = asnlen; i-- > 0; p++) {
printf("%c%u", sep, *p);
sep='.';
}
putchar(']');
break;
}
case BE_PDU:
printf("%s(%u)",
Class[CONTEXT].Id[elem->id], elem->asnlen);
break;
case BE_ANY:
fputs("[BE_ANY!?]", stdout);
break;
default:
fputs("[be!?]", stdout);
break;
}
}
#ifdef notdef
/*
* This is a brute force ASN.1 printer: recurses to dump an entire structure.
* This will work for any ASN.1 stream, not just an SNMP PDU.
*
* By adding newlines and spaces at the correct places, this would print in
* Rose-Normal-Form.
*
* This is not currently used.
*/
static void
asn1_decode(u_char *p, u_int length)
{
struct be elem;
int i = 0;
while (i >= 0 && length > 0) {
i = asn1_parse(p, length, &elem);
if (i >= 0) {
fputs(" ", stdout);
asn1_print(&elem);
if (elem.type == BE_SEQ || elem.type == BE_PDU) {
fputs(" {", stdout);
asn1_decode(elem.data.raw, elem.asnlen);
fputs(" }", stdout);
}
length -= i;
p += i;
}
}
}
#endif
/*
* General SNMP header
* SEQUENCE {
* version INTEGER {version-1(0)},
* community OCTET STRING,
* data ANY -- PDUs
* }
* PDUs for all but Trap: (see rfc1157 from page 15 on)
* SEQUENCE {
* request-id INTEGER,
* error-status INTEGER,
* error-index INTEGER,
* varbindlist SEQUENCE OF
* SEQUENCE {
* name ObjectName,
* value ObjectValue
* }
* }
* PDU for Trap:
* SEQUENCE {
* enterprise OBJECT IDENTIFIER,
* agent-addr NetworkAddress,
* generic-trap INTEGER,
* specific-trap INTEGER,
* time-stamp TimeTicks,
* varbindlist SEQUENCE OF
* SEQUENCE {
* name ObjectName,
* value ObjectValue
* }
* }
*/
/*
* Decode SNMP varBind
*/
static void
varbind_print(u_char pduid, const u_char *np, u_int length, int error)
{
struct be elem;
int count = 0, ind;
/* Sequence of varBind */
if ((count = asn1_parse(np, length, &elem)) < 0)
return;
if (elem.type != BE_SEQ) {
fputs("[!SEQ of varbind]", stdout);
asn1_print(&elem);
return;
}
if (count < length)
printf("[%d extra after SEQ of varbind]", length - count);
/* descend */
length = elem.asnlen;
np = (u_char *)elem.data.raw;
for (ind = 1; length > 0; ind++) {
const u_char *vbend;
u_int vblength;
if (!error || ind == error)
fputs(" ", stdout);
/* Sequence */
if ((count = asn1_parse(np, length, &elem)) < 0)
return;
if (elem.type != BE_SEQ) {
fputs("[!varbind]", stdout);
asn1_print(&elem);
return;
}
vbend = np + count;
vblength = length - count;
/* descend */
length = elem.asnlen;
np = (u_char *)elem.data.raw;
/* objName (OID) */
if ((count = asn1_parse(np, length, &elem)) < 0)
return;
if (elem.type != BE_OID) {
fputs("[objName!=OID]", stdout);
asn1_print(&elem);
return;
}
if (!error || ind == error)
asn1_print(&elem);
length -= count;
np += count;
if (pduid != GETREQ && pduid != GETNEXTREQ && !error)
fputs("=", stdout);
/* objVal (ANY) */
if ((count = asn1_parse(np, length, &elem)) < 0)
return;
if (pduid == GETREQ || pduid == GETNEXTREQ || pduid == GETBULKREQ) {
if (elem.type != BE_NULL) {
fputs("[objVal!=NULL]", stdout);
asn1_print(&elem);
}
} else
if (error && ind == error && elem.type != BE_NULL)
fputs("[err objVal!=NULL]", stdout);
if (!error || ind == error)
asn1_print(&elem);
length = vblength;
np = vbend;
}
}
/*
* Decode SNMP PDUs: GetRequest, GetNextRequest, GetResponse, and SetRequest
*/
static void
snmppdu_print(u_char pduid, const u_char *np, u_int length)
{
struct be elem;
int count = 0, error;
/* reqId (Integer) */
if ((count = asn1_parse(np, length, &elem)) < 0)
return;
if (elem.type != BE_INT) {
fputs("[reqId!=INT]", stdout);
asn1_print(&elem);
return;
}
/* ignore the reqId */
length -= count;
np += count;
/* errorStatus (Integer) */
if ((count = asn1_parse(np, length, &elem)) < 0)
return;
if (elem.type != BE_INT) {
fputs("[errorStatus!=INT]", stdout);
asn1_print(&elem);
return;
}
error = 0;
if ((pduid == GETREQ || pduid == GETNEXTREQ)
&& elem.data.integer != 0) {
char errbuf[20];
printf("[errorStatus(%s)!=0]",
DECODE_ErrorStatus(elem.data.integer));
} else if (pduid == GETBULKREQ)
printf(" non-repeaters=%d", elem.data.integer);
else if (elem.data.integer != 0) {
char errbuf[20];
printf(" %s", DECODE_ErrorStatus(elem.data.integer));
error = elem.data.integer;
}
length -= count;
np += count;
/* errorIndex (Integer) */
if ((count = asn1_parse(np, length, &elem)) < 0)
return;
if (elem.type != BE_INT) {
fputs("[errorIndex!=INT]", stdout);
asn1_print(&elem);
return;
}
if ((pduid == GETREQ || pduid == GETNEXTREQ)
&& elem.data.integer != 0)
printf("[errorIndex(%d)!=0]", elem.data.integer);
else if (pduid == GETBULKREQ)
printf(" max-repetitions=%d", elem.data.integer);
else if (elem.data.integer != 0) {
if (!error)
printf("[errorIndex(%d) w/o errorStatus]",
elem.data.integer);
else {
printf("@%d", elem.data.integer);
error = elem.data.integer;
}
} else if (error) {
fputs("[errorIndex==0]", stdout);
error = 0;
}
length -= count;
np += count;
varbind_print(pduid, np, length, error);
return;
}
/*
* Decode SNMP Trap PDU
*/
static void
trap_print(const u_char *np, u_int length)
{
struct be elem;
int count = 0, generic;
putchar(' ');
/* enterprise (oid) */
if ((count = asn1_parse(np, length, &elem)) < 0)
return;
if (elem.type != BE_OID) {
fputs("[enterprise!=OID]", stdout);
asn1_print(&elem);
return;
}
asn1_print(&elem);
length -= count;
np += count;
putchar(' ');
/* agent-addr (inetaddr) */
if ((count = asn1_parse(np, length, &elem)) < 0)
return;
if (elem.type != BE_INETADDR) {
fputs("[agent-addr!=INETADDR]", stdout);
asn1_print(&elem);
return;
}
asn1_print(&elem);
length -= count;
np += count;
/* generic-trap (Integer) */
if ((count = asn1_parse(np, length, &elem)) < 0)
return;
if (elem.type != BE_INT) {
fputs("[generic-trap!=INT]", stdout);
asn1_print(&elem);
return;
}
generic = elem.data.integer;
{
char buf[20];
printf(" %s", DECODE_GenericTrap(generic));
}
length -= count;
np += count;
/* specific-trap (Integer) */
if ((count = asn1_parse(np, length, &elem)) < 0)
return;
if (elem.type != BE_INT) {
fputs("[specific-trap!=INT]", stdout);
asn1_print(&elem);
return;
}
if (generic != GT_ENTERPRISE) {
if (elem.data.integer != 0)
printf("[specific-trap(%d)!=0]", elem.data.integer);
} else
printf(" s=%d", elem.data.integer);
length -= count;
np += count;
putchar(' ');
/* time-stamp (TimeTicks) */
if ((count = asn1_parse(np, length, &elem)) < 0)
return;
if (elem.type != BE_UNS) { /* XXX */
fputs("[time-stamp!=TIMETICKS]", stdout);
asn1_print(&elem);
return;
}
asn1_print(&elem);
length -= count;
np += count;
varbind_print (TRAP, np, length, 0);
return;
}
/*
* Decode SNMP header and pass on to PDU printing routines
*/
void
snmp_print(const u_char *np, u_int length)
{
struct be elem, pdu;
int count = 0;
truncated = 0;
/* truncated packet? */
if (np + length > snapend) {
truncated = 1;
length = snapend - np;
}
putchar(' ');
/* initial Sequence */
if ((count = asn1_parse(np, length, &elem)) < 0)
return;
if (elem.type != BE_SEQ) {
fputs("[!init SEQ]", stdout);
asn1_print(&elem);
return;
}
if (count < length)
printf("[%d extra after iSEQ]", length - count);
/* descend */
length = elem.asnlen;
np = (u_char *)elem.data.raw;
/* Version (Integer) */
if ((count = asn1_parse(np, length, &elem)) < 0)
return;
if (elem.type != BE_INT) {
fputs("[version!=INT]", stdout);
asn1_print(&elem);
return;
}
/* only handle version 1 and 2 */
if (elem.data.integer > DEF_VERSION) {
printf("[version(%d)>%d]", elem.data.integer, DEF_VERSION);
return;
}
length -= count;
np += count;
/* Community (String) */
if ((count = asn1_parse(np, length, &elem)) < 0)
return;
if (elem.type != BE_STR) {
fputs("[comm!=STR]", stdout);
asn1_print(&elem);
return;
}
/* default community */
if (strncmp((char *)elem.data.str, DEF_COMMUNITY,
sizeof(DEF_COMMUNITY) - 1))
/* ! "public" */
printf("C=%.*s ", (int)elem.asnlen, elem.data.str);
length -= count;
np += count;
/* PDU (Context) */
if ((count = asn1_parse(np, length, &pdu)) < 0)
return;
if (pdu.type != BE_PDU) {
fputs("[no PDU]", stdout);
return;
}
if (count < length)
printf("[%d extra after PDU]", length - count);
asn1_print(&pdu);
/* descend into PDU */
length = pdu.asnlen;
np = (u_char *)pdu.data.raw;
switch (pdu.id) {
case TRAP:
trap_print(np, length);
break;
case GETREQ:
case GETNEXTREQ:
case GETRESP:
case SETREQ:
case GETBULKREQ:
case INFORMREQ:
case TRAPV2:
case REPORT:
snmppdu_print(pdu.id, np, length);
break;
}
return;
}
|