1996-08-19 20:34:12 +00:00
|
|
|
/*
|
1998-09-15 19:36:32 +00:00
|
|
|
* Copyright (c) 1990, 1991, 1993, 1994, 1995, 1996, 1997
|
2002-06-21 00:43:23 +00:00
|
|
|
* 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.
|
1996-08-19 20:34:12 +00:00
|
|
|
*
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
2000-01-30 00:45:58 +00:00
|
|
|
* Support for SNMPv2c/SNMPv3 and the ability to link the module against
|
|
|
|
* the libsmi was added by J. Schoenwaelder, Copyright (c) 1999.
|
|
|
|
*
|
1996-08-19 20:34:12 +00:00
|
|
|
* This started out as a very simple program, but the incremental decoding
|
|
|
|
* (into the BE structure) complicated things.
|
|
|
|
*
|
|
|
|
# Los Alamos National Laboratory
|
|
|
|
#
|
1998-09-15 19:36:32 +00:00
|
|
|
# Copyright (c) 1990, 1991, 1993, 1994, 1995, 1996, 1997
|
1996-08-19 20:34:12 +00:00
|
|
|
# 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
|
|
|
|
*/
|
1997-05-27 02:11:31 +00:00
|
|
|
|
1996-08-19 20:34:12 +00:00
|
|
|
#ifndef lint
|
1997-05-27 02:11:31 +00:00
|
|
|
static const char rcsid[] =
|
2002-06-21 00:43:23 +00:00
|
|
|
"@(#) $Header: /tcpdump/master/tcpdump/print-snmp.c,v 1.50 2001/09/17 22:16:53 fenner Exp $ (LBL)";
|
2000-01-30 00:45:58 +00:00
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
|
|
#include "config.h"
|
1996-08-19 20:34:12 +00:00
|
|
|
#endif
|
|
|
|
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/time.h>
|
|
|
|
|
|
|
|
#include <ctype.h>
|
1998-09-15 19:36:32 +00:00
|
|
|
#include <stdio.h>
|
1996-08-19 20:34:12 +00:00
|
|
|
#include <string.h>
|
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
#ifdef HAVE_SMI_H
|
|
|
|
#include <smi.h>
|
|
|
|
#endif
|
|
|
|
|
1996-08-19 20:34:12 +00:00
|
|
|
#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
|
2000-01-30 00:45:58 +00:00
|
|
|
"Opaque",
|
|
|
|
#define OPAQUE 4
|
|
|
|
"C-5",
|
|
|
|
"Counter64"
|
|
|
|
#define COUNTER64 6
|
1996-08-19 20:34:12 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* 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
|
2000-01-30 00:45:58 +00:00
|
|
|
"Trap",
|
1996-08-19 20:34:12 +00:00
|
|
|
#define TRAP 4
|
2000-01-30 00:45:58 +00:00
|
|
|
"GetBulk",
|
|
|
|
#define GETBULKREQ 5
|
|
|
|
"Inform",
|
|
|
|
#define INFORMREQ 6
|
|
|
|
"V2Trap",
|
|
|
|
#define V2TRAP 7
|
|
|
|
"Report"
|
|
|
|
#define REPORT 8
|
|
|
|
};
|
|
|
|
|
|
|
|
#define NOTIFY_CLASS(x) (x == TRAP || x == V2TRAP || x == INFORMREQ)
|
|
|
|
#define READ_CLASS(x) (x == GETREQ || x == GETNEXTREQ || x == GETBULKREQ)
|
|
|
|
#define WRITE_CLASS(x) (x == SETREQ)
|
|
|
|
#define RESPONSE_CLASS(x) (x == GETRESP)
|
|
|
|
#define INTERNAL_CLASS(x) (x == REPORT)
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Context-specific ASN.1 types for the SNMP Exceptions and their tags
|
|
|
|
*/
|
|
|
|
char *Exceptions[] = {
|
|
|
|
"noSuchObject",
|
|
|
|
#define NOSUCHOBJECT 0
|
|
|
|
"noSuchInstance",
|
|
|
|
#define NOSUCHINSTANCE 1
|
|
|
|
"endOfMibView",
|
|
|
|
#define ENDOFMIBVIEW 2
|
1996-08-19 20:34:12 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* 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",
|
2000-01-30 00:45:58 +00:00
|
|
|
"genErr",
|
|
|
|
"noAccess",
|
|
|
|
"wrongType",
|
|
|
|
"wrongLength",
|
|
|
|
"wrongEncoding",
|
|
|
|
"wrongValue",
|
|
|
|
"noCreation",
|
|
|
|
"inconsistentValue",
|
|
|
|
"resourceUnavailable",
|
|
|
|
"commitFailed",
|
|
|
|
"undoFailed",
|
|
|
|
"authorizationError",
|
|
|
|
"notWritable",
|
|
|
|
"inconsistentName"
|
1996-08-19 20:34:12 +00:00
|
|
|
};
|
|
|
|
#define DECODE_ErrorStatus(e) \
|
2000-01-30 00:45:58 +00:00
|
|
|
( e >= 0 && e < sizeof(ErrorStatus)/sizeof(ErrorStatus[0]) \
|
2001-04-03 07:45:48 +00:00
|
|
|
? ErrorStatus[e] \
|
|
|
|
: (snprintf(errbuf, sizeof(errbuf), "err=%u", e), errbuf))
|
1996-08-19 20:34:12 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* generic-trap values in the SNMP Trap-PDU
|
|
|
|
*/
|
|
|
|
char *GenericTrap[] = {
|
|
|
|
"coldStart",
|
|
|
|
"warmStart",
|
|
|
|
"linkDown",
|
|
|
|
"linkUp",
|
|
|
|
"authenticationFailure",
|
|
|
|
"egpNeighborLoss",
|
|
|
|
"enterpriseSpecific"
|
|
|
|
#define GT_ENTERPRISE 7
|
|
|
|
};
|
|
|
|
#define DECODE_GenericTrap(t) \
|
2000-01-30 00:45:58 +00:00
|
|
|
( t >= 0 && t < sizeof(GenericTrap)/sizeof(GenericTrap[0]) \
|
2001-04-03 07:45:48 +00:00
|
|
|
? GenericTrap[t] \
|
|
|
|
: (snprintf(buf, sizeof(buf), "gt=%d", t), buf))
|
1996-08-19 20:34:12 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* 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
|
2000-01-30 00:45:58 +00:00
|
|
|
defineCLASS(Exceptions),
|
|
|
|
#define EXCEPTIONS 4
|
1996-08-19 20:34:12 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* 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_char 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" },
|
2000-01-30 00:45:58 +00:00
|
|
|
#endif
|
|
|
|
#ifndef NO_ABBREV_SNMPMODS
|
|
|
|
/* .iso.org.dod.internet.snmpV2.snmpModules */
|
|
|
|
{ "S:", &_snmpModules_obj, "\53\6\1\6\3" },
|
1996-08-19 20:34:12 +00:00
|
|
|
#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;
|
|
|
|
const u_char *str;
|
2000-01-30 00:45:58 +00:00
|
|
|
struct {
|
|
|
|
u_int32_t high;
|
|
|
|
u_int32_t low;
|
|
|
|
} uns64;
|
1996-08-19 20:34:12 +00:00
|
|
|
} 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
|
2000-01-30 00:45:58 +00:00
|
|
|
#define BE_UNS64 10
|
|
|
|
#define BE_NOSUCHOBJECT 128
|
|
|
|
#define BE_NOSUCHINST 129
|
|
|
|
#define BE_ENDOFMIBVIEW 130
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* SNMP versions recognized by this module
|
|
|
|
*/
|
|
|
|
char *SnmpVersion[] = {
|
|
|
|
"SNMPv1",
|
|
|
|
#define SNMP_VERSION_1 0
|
|
|
|
"SNMPv2c",
|
|
|
|
#define SNMP_VERSION_2 1
|
|
|
|
"SNMPv2u",
|
|
|
|
#define SNMP_VERSION_2U 2
|
|
|
|
"SNMPv3"
|
|
|
|
#define SNMP_VERSION_3 3
|
1996-08-19 20:34:12 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Defaults for SNMP PDU components
|
|
|
|
*/
|
|
|
|
#define DEF_COMMUNITY "public"
|
|
|
|
|
|
|
|
/*
|
|
|
|
* 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) {
|
2000-01-30 00:45:58 +00:00
|
|
|
ifNotTruncated fputs("[nothing to parse]", stdout);
|
1996-08-19 20:34:12 +00:00
|
|
|
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
|
1997-05-27 02:11:31 +00:00
|
|
|
form = (u_char)(*p & ASN_FORM_BITS) >> ASN_FORM_SHIFT;
|
|
|
|
class = (u_char)(*p & ASN_CLASS_BITS) >> ASN_CLASS_SHIFT;
|
1996-08-19 20:34:12 +00:00
|
|
|
#endif
|
|
|
|
elem->form = form;
|
|
|
|
elem->class = class;
|
|
|
|
elem->id = id;
|
|
|
|
p++; len--; hdr = 1;
|
|
|
|
/* extended tag field */
|
|
|
|
if (id == ASN_ID_EXT) {
|
2002-06-21 00:43:23 +00:00
|
|
|
for (id = 0; *p & ASN_BIT8 && len > 0; len--, hdr++, p++)
|
1996-08-19 20:34:12 +00:00
|
|
|
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;
|
|
|
|
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;
|
|
|
|
}
|
2002-06-21 00:43:23 +00:00
|
|
|
for (; noct-- > 0; len--, hdr++)
|
1996-08-19 20:34:12 +00:00
|
|
|
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;
|
|
|
|
}
|
1997-05-27 02:11:31 +00:00
|
|
|
if ((int)id >= Class[class].numIDs) {
|
1996-08-19 20:34:12 +00:00
|
|
|
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: {
|
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
case COUNTER64: {
|
|
|
|
register u_int32_t high, low;
|
|
|
|
elem->type = BE_UNS64;
|
|
|
|
high = 0, low = 0;
|
|
|
|
for (i = elem->asnlen; i-- > 0; p++) {
|
|
|
|
high = (high << 8) |
|
|
|
|
((low & 0xFF000000) >> 24);
|
|
|
|
low = (low << 8) | *p;
|
|
|
|
}
|
|
|
|
elem->data.uns64.high = high;
|
|
|
|
elem->data.uns64.low = low;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
1996-08-19 20:34:12 +00:00
|
|
|
default:
|
|
|
|
elem->type = BE_OCTET;
|
|
|
|
elem->data.raw = (caddr_t)p;
|
|
|
|
printf("[P/A/%s]",
|
|
|
|
Class[class].Id[id]);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
case CONTEXT:
|
|
|
|
switch (id) {
|
|
|
|
case NOSUCHOBJECT:
|
|
|
|
elem->type = BE_NOSUCHOBJECT;
|
|
|
|
elem->data.raw = NULL;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case NOSUCHINSTANCE:
|
|
|
|
elem->type = BE_NOSUCHINST;
|
|
|
|
elem->data.raw = NULL;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case ENDOFMIBVIEW:
|
|
|
|
elem->type = BE_ENDOFMIBVIEW;
|
|
|
|
elem->data.raw = NULL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
1996-08-19 20:34:12 +00:00
|
|
|
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:
|
2001-04-03 07:45:48 +00:00
|
|
|
for (i = asnlen; i-- > 0; p++)
|
1996-08-19 20:34:12 +00:00
|
|
|
printf("_%.2x", *p);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case BE_NULL:
|
|
|
|
break;
|
|
|
|
|
|
|
|
case BE_OID: {
|
|
|
|
int o = 0, first = -1, i = asnlen;
|
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
if (!sflag && !nflag && asnlen > 2) {
|
1996-08-19 20:34:12 +00:00
|
|
|
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;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2000-01-30 00:45:58 +00:00
|
|
|
|
|
|
|
for (; !sflag && i-- > 0; p++) {
|
1996-08-19 20:34:12 +00:00
|
|
|
o = (o << ASN_SHIFT7) + (*p & ~ASN_BIT8);
|
|
|
|
if (*p & ASN_LONGLEN)
|
2000-01-30 00:45:58 +00:00
|
|
|
continue;
|
|
|
|
|
1996-08-19 20:34:12 +00:00
|
|
|
/*
|
|
|
|
* 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:
|
2000-01-30 00:45:58 +00:00
|
|
|
printf("%u", elem->data.uns);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case BE_UNS64: { /* idea borrowed from by Marshall Rose */
|
|
|
|
double d;
|
|
|
|
int j, carry;
|
|
|
|
char *cpf, *cpl, last[6], first[30];
|
|
|
|
if (elem->data.uns64.high == 0) {
|
|
|
|
printf("%u", elem->data.uns64.low);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
d = elem->data.uns64.high * 4294967296.0; /* 2^32 */
|
|
|
|
if (elem->data.uns64.high <= 0x1fffff) {
|
|
|
|
d += elem->data.uns64.low;
|
2002-06-21 00:43:23 +00:00
|
|
|
#if 0 /*is looks illegal, but what is the intention?*/
|
2000-01-30 00:45:58 +00:00
|
|
|
printf("%.f", d);
|
|
|
|
#else
|
|
|
|
printf("%f", d);
|
|
|
|
#endif
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
d += (elem->data.uns64.low & 0xfffff000);
|
2002-06-21 00:43:23 +00:00
|
|
|
#if 0 /*is looks illegal, but what is the intention?*/
|
2001-04-03 07:45:48 +00:00
|
|
|
snprintf(first, sizeof(first), "%.f", d);
|
2000-01-30 00:45:58 +00:00
|
|
|
#else
|
2001-04-03 07:45:48 +00:00
|
|
|
snprintf(first, sizeof(first), "%f", d);
|
2000-01-30 00:45:58 +00:00
|
|
|
#endif
|
2001-04-03 07:45:48 +00:00
|
|
|
snprintf(last, sizeof(last), "%5.5d",
|
|
|
|
elem->data.uns64.low & 0xfff);
|
2000-01-30 00:45:58 +00:00
|
|
|
for (carry = 0, cpf = first+strlen(first)-1, cpl = last+4;
|
|
|
|
cpl >= last;
|
|
|
|
cpf--, cpl--) {
|
|
|
|
j = carry + (*cpf - '0') + (*cpl - '0');
|
|
|
|
if (j > 9) {
|
|
|
|
j -= 10;
|
|
|
|
carry = 1;
|
|
|
|
} else {
|
|
|
|
carry = 0;
|
|
|
|
}
|
|
|
|
*cpf = j + '0';
|
|
|
|
}
|
|
|
|
fputs(first, stdout);
|
1996-08-19 20:34:12 +00:00
|
|
|
break;
|
2000-01-30 00:45:58 +00:00
|
|
|
}
|
1996-08-19 20:34:12 +00:00
|
|
|
|
|
|
|
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;
|
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
case BE_INETADDR:
|
1996-08-19 20:34:12 +00:00
|
|
|
if (asnlen != ASNLEN_INETADDR)
|
|
|
|
printf("[inetaddr len!=%d]", ASNLEN_INETADDR);
|
|
|
|
for (i = asnlen; i-- > 0; p++) {
|
2000-01-30 00:45:58 +00:00
|
|
|
printf((i == asnlen-1) ? "%u" : ".%u", *p);
|
1996-08-19 20:34:12 +00:00
|
|
|
}
|
|
|
|
break;
|
2000-01-30 00:45:58 +00:00
|
|
|
|
|
|
|
case BE_NOSUCHOBJECT:
|
|
|
|
case BE_NOSUCHINST:
|
|
|
|
case BE_ENDOFMIBVIEW:
|
|
|
|
printf("[%s]", Class[EXCEPTIONS].Id[elem->id]);
|
|
|
|
break;
|
1996-08-19 20:34:12 +00:00
|
|
|
|
|
|
|
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
|
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
#ifdef LIBSMI
|
|
|
|
|
|
|
|
struct smi2be {
|
|
|
|
SmiBasetype basetype;
|
|
|
|
int be;
|
|
|
|
};
|
|
|
|
|
2001-04-03 07:45:48 +00:00
|
|
|
static struct smi2be smi2betab[] = {
|
2000-01-30 00:45:58 +00:00
|
|
|
{ SMI_BASETYPE_INTEGER32, BE_INT },
|
|
|
|
{ SMI_BASETYPE_OCTETSTRING, BE_STR },
|
|
|
|
{ SMI_BASETYPE_OCTETSTRING, BE_INETADDR },
|
|
|
|
{ SMI_BASETYPE_OBJECTIDENTIFIER, BE_OID },
|
|
|
|
{ SMI_BASETYPE_UNSIGNED32, BE_UNS },
|
|
|
|
{ SMI_BASETYPE_INTEGER64, BE_NONE },
|
|
|
|
{ SMI_BASETYPE_UNSIGNED64, BE_UNS64 },
|
|
|
|
{ SMI_BASETYPE_FLOAT32, BE_NONE },
|
|
|
|
{ SMI_BASETYPE_FLOAT64, BE_NONE },
|
|
|
|
{ SMI_BASETYPE_FLOAT128, BE_NONE },
|
|
|
|
{ SMI_BASETYPE_ENUM, BE_INT },
|
|
|
|
{ SMI_BASETYPE_BITS, BE_STR },
|
|
|
|
{ SMI_BASETYPE_UNKNOWN, BE_NONE }
|
|
|
|
};
|
|
|
|
|
|
|
|
static void smi_decode_oid(struct be *elem, unsigned int *oid,
|
2002-06-21 00:43:23 +00:00
|
|
|
unsigned int oidsize, unsigned int *oidlen)
|
2000-01-30 00:45:58 +00:00
|
|
|
{
|
|
|
|
u_char *p = (u_char *)elem->data.raw;
|
|
|
|
u_int32_t asnlen = elem->asnlen;
|
|
|
|
int o = 0, first = -1, i = asnlen;
|
|
|
|
|
|
|
|
for (*oidlen = 0; sflag && 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) {
|
|
|
|
first = 0;
|
2002-06-21 00:43:23 +00:00
|
|
|
if (*oidlen < oidsize) {
|
|
|
|
oid[(*oidlen)++] = o/OIDMUX;
|
|
|
|
}
|
2000-01-30 00:45:58 +00:00
|
|
|
o %= OIDMUX;
|
|
|
|
}
|
2002-06-21 00:43:23 +00:00
|
|
|
if (*oidlen < oidsize) {
|
|
|
|
oid[(*oidlen)++] = o;
|
|
|
|
}
|
2000-01-30 00:45:58 +00:00
|
|
|
o = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static int smi_check_type(SmiBasetype basetype, int be)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; smi2betab[i].basetype != SMI_BASETYPE_UNKNOWN; i++) {
|
|
|
|
if (smi2betab[i].basetype == basetype && smi2betab[i].be == be) {
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int smi_check_a_range(SmiType *smiType, SmiRange *smiRange,
|
|
|
|
struct be *elem)
|
|
|
|
{
|
2001-04-03 07:45:48 +00:00
|
|
|
int ok = 1;
|
2000-01-30 00:45:58 +00:00
|
|
|
|
|
|
|
switch (smiType->basetype) {
|
|
|
|
case SMI_BASETYPE_OBJECTIDENTIFIER:
|
|
|
|
case SMI_BASETYPE_OCTETSTRING:
|
|
|
|
if (smiRange->minValue.value.unsigned32
|
|
|
|
== smiRange->maxValue.value.unsigned32) {
|
|
|
|
ok = (elem->asnlen == smiRange->minValue.value.unsigned32);
|
|
|
|
} else {
|
|
|
|
ok = (elem->asnlen >= smiRange->minValue.value.unsigned32
|
|
|
|
&& elem->asnlen <= smiRange->maxValue.value.unsigned32);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SMI_BASETYPE_INTEGER32:
|
|
|
|
ok = (elem->data.integer >= smiRange->minValue.value.integer32
|
|
|
|
&& elem->data.integer <= smiRange->maxValue.value.integer32);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SMI_BASETYPE_UNSIGNED32:
|
|
|
|
ok = (elem->data.uns >= smiRange->minValue.value.unsigned32
|
|
|
|
&& elem->data.uns <= smiRange->maxValue.value.unsigned32);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SMI_BASETYPE_UNSIGNED64:
|
|
|
|
/* XXX */
|
|
|
|
break;
|
|
|
|
|
|
|
|
/* case SMI_BASETYPE_INTEGER64: SMIng */
|
|
|
|
/* case SMI_BASETYPE_FLOAT32: SMIng */
|
|
|
|
/* case SMI_BASETYPE_FLOAT64: SMIng */
|
|
|
|
/* case SMI_BASETYPE_FLOAT128: SMIng */
|
|
|
|
|
|
|
|
case SMI_BASETYPE_ENUM:
|
|
|
|
case SMI_BASETYPE_BITS:
|
|
|
|
case SMI_BASETYPE_UNKNOWN:
|
|
|
|
ok = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return ok;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int smi_check_range(SmiType *smiType, struct be *elem)
|
|
|
|
{
|
|
|
|
SmiRange *smiRange;
|
|
|
|
int ok = 1;
|
|
|
|
|
2001-04-03 07:45:48 +00:00
|
|
|
for (smiRange = smiGetFirstRange(smiType);
|
2000-01-30 00:45:58 +00:00
|
|
|
smiRange;
|
|
|
|
smiRange = smiGetNextRange(smiRange)) {
|
|
|
|
|
|
|
|
ok = smi_check_a_range(smiType, smiRange, elem);
|
2001-04-03 07:45:48 +00:00
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
if (ok) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-06-21 00:43:23 +00:00
|
|
|
if (ok) {
|
2000-01-30 00:45:58 +00:00
|
|
|
SmiType *parentType;
|
2001-04-03 07:45:48 +00:00
|
|
|
parentType = smiGetParentType(smiType);
|
2000-01-30 00:45:58 +00:00
|
|
|
if (parentType) {
|
|
|
|
ok = smi_check_range(parentType, elem);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return ok;
|
|
|
|
}
|
|
|
|
|
|
|
|
static SmiNode *smi_print_variable(struct be *elem)
|
|
|
|
{
|
|
|
|
unsigned int oid[128], oidlen;
|
|
|
|
SmiNode *smiNode = NULL;
|
|
|
|
int i;
|
|
|
|
|
2002-06-21 00:43:23 +00:00
|
|
|
smi_decode_oid(elem, oid, sizeof(oid)/sizeof(unsigned int), &oidlen);
|
2000-01-30 00:45:58 +00:00
|
|
|
smiNode = smiGetNodeByOID(oidlen, oid);
|
|
|
|
if (! smiNode) {
|
|
|
|
asn1_print(elem);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
if (vflag) {
|
2001-04-03 07:45:48 +00:00
|
|
|
fputs(smiGetNodeModule(smiNode)->name, stdout);
|
2000-01-30 00:45:58 +00:00
|
|
|
fputs("::", stdout);
|
|
|
|
}
|
|
|
|
fputs(smiNode->name, stdout);
|
|
|
|
if (smiNode->oidlen < oidlen) {
|
|
|
|
for (i = smiNode->oidlen; i < oidlen; i++) {
|
|
|
|
printf(".%u", oid[i]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return smiNode;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void smi_print_value(SmiNode *smiNode, u_char pduid, struct be *elem)
|
|
|
|
{
|
|
|
|
unsigned int oid[128], oidlen;
|
|
|
|
SmiType *smiType;
|
|
|
|
SmiNamedNumber *nn;
|
|
|
|
int i, done = 0;
|
|
|
|
|
|
|
|
if (! smiNode || ! (smiNode->nodekind
|
|
|
|
& (SMI_NODEKIND_SCALAR | SMI_NODEKIND_COLUMN))) {
|
|
|
|
asn1_print(elem);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2001-04-03 07:45:48 +00:00
|
|
|
if (elem->type == BE_NOSUCHOBJECT
|
|
|
|
|| elem->type == BE_NOSUCHINST
|
|
|
|
|| elem->type == BE_ENDOFMIBVIEW) {
|
|
|
|
asn1_print(elem);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
if (NOTIFY_CLASS(pduid) && smiNode->access < SMI_ACCESS_NOTIFY) {
|
|
|
|
fputs("[notNotifyable]", stdout);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (READ_CLASS(pduid) && smiNode->access < SMI_ACCESS_READ_ONLY) {
|
|
|
|
fputs("[notReadable]", stdout);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (WRITE_CLASS(pduid) && smiNode->access < SMI_ACCESS_READ_WRITE) {
|
|
|
|
fputs("[notWritable]", stdout);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (RESPONSE_CLASS(pduid)
|
|
|
|
&& smiNode->access == SMI_ACCESS_NOT_ACCESSIBLE) {
|
|
|
|
fputs("[noAccess]", stdout);
|
|
|
|
}
|
|
|
|
|
2001-04-03 07:45:48 +00:00
|
|
|
smiType = smiGetNodeType(smiNode);
|
2000-01-30 00:45:58 +00:00
|
|
|
if (! smiType) {
|
|
|
|
asn1_print(elem);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2001-04-03 07:45:48 +00:00
|
|
|
if (! smi_check_type(smiType->basetype, elem->type)) {
|
|
|
|
fputs("[wrongType]", stdout);
|
|
|
|
}
|
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
if (! smi_check_range(smiType, elem)) {
|
2002-06-21 00:43:23 +00:00
|
|
|
fputs("[outOfRange]", stdout);
|
2000-01-30 00:45:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* resolve bits to named bits */
|
|
|
|
|
|
|
|
/* check whether instance identifier is valid */
|
|
|
|
|
|
|
|
/* apply display hints (integer, octetstring) */
|
|
|
|
|
|
|
|
/* convert instance identifier to index type values */
|
|
|
|
|
|
|
|
switch (elem->type) {
|
|
|
|
case BE_OID:
|
2001-04-03 07:45:48 +00:00
|
|
|
if (smiType->basetype == SMI_BASETYPE_BITS) {
|
2000-01-30 00:45:58 +00:00
|
|
|
/* print bit labels */
|
|
|
|
} else {
|
2002-06-21 00:43:23 +00:00
|
|
|
smi_decode_oid(elem, oid,
|
|
|
|
sizeof(oid)/sizeof(unsigned int),
|
|
|
|
&oidlen);
|
2000-01-30 00:45:58 +00:00
|
|
|
smiNode = smiGetNodeByOID(oidlen, oid);
|
|
|
|
if (smiNode) {
|
|
|
|
if (vflag) {
|
2001-04-03 07:45:48 +00:00
|
|
|
fputs(smiGetNodeModule(smiNode)->name, stdout);
|
2000-01-30 00:45:58 +00:00
|
|
|
fputs("::", stdout);
|
|
|
|
}
|
|
|
|
fputs(smiNode->name, stdout);
|
|
|
|
if (smiNode->oidlen < oidlen) {
|
|
|
|
for (i = smiNode->oidlen;
|
|
|
|
i < oidlen; i++) {
|
|
|
|
printf(".%u", oid[i]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
done++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case BE_INT:
|
2001-04-03 07:45:48 +00:00
|
|
|
if (smiType->basetype == SMI_BASETYPE_ENUM) {
|
|
|
|
for (nn = smiGetFirstNamedNumber(smiType);
|
2000-01-30 00:45:58 +00:00
|
|
|
nn;
|
|
|
|
nn = smiGetNextNamedNumber(nn)) {
|
|
|
|
if (nn->value.value.integer32
|
|
|
|
== elem->data.integer) {
|
|
|
|
fputs(nn->name, stdout);
|
|
|
|
printf("(%d)", elem->data.integer);
|
|
|
|
done++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (! done) {
|
|
|
|
asn1_print(elem);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
1996-08-19 20:34:12 +00:00
|
|
|
/*
|
|
|
|
* 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
|
2000-01-30 00:45:58 +00:00
|
|
|
varbind_print(u_char pduid, const u_char *np, u_int length)
|
1996-08-19 20:34:12 +00:00
|
|
|
{
|
|
|
|
struct be elem;
|
|
|
|
int count = 0, ind;
|
2000-01-30 00:45:58 +00:00
|
|
|
#ifdef LIBSMI
|
|
|
|
SmiNode *smiNode = NULL;
|
|
|
|
#endif
|
1996-08-19 20:34:12 +00:00
|
|
|
|
|
|
|
/* 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;
|
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
fputs(" ", stdout);
|
1996-08-19 20:34:12 +00:00
|
|
|
|
|
|
|
/* 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;
|
|
|
|
}
|
2000-01-30 00:45:58 +00:00
|
|
|
#ifdef LIBSMI
|
|
|
|
smiNode = smi_print_variable(&elem);
|
|
|
|
#else
|
|
|
|
asn1_print(&elem);
|
|
|
|
#endif
|
1996-08-19 20:34:12 +00:00
|
|
|
length -= count;
|
|
|
|
np += count;
|
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
if (pduid != GETREQ && pduid != GETNEXTREQ
|
|
|
|
&& pduid != GETBULKREQ)
|
1996-08-19 20:34:12 +00:00
|
|
|
fputs("=", stdout);
|
|
|
|
|
|
|
|
/* objVal (ANY) */
|
|
|
|
if ((count = asn1_parse(np, length, &elem)) < 0)
|
|
|
|
return;
|
2000-01-30 00:45:58 +00:00
|
|
|
if (pduid == GETREQ || pduid == GETNEXTREQ
|
|
|
|
|| pduid == GETBULKREQ) {
|
1996-08-19 20:34:12 +00:00
|
|
|
if (elem.type != BE_NULL) {
|
|
|
|
fputs("[objVal!=NULL]", stdout);
|
|
|
|
asn1_print(&elem);
|
|
|
|
}
|
2000-01-30 00:45:58 +00:00
|
|
|
} else {
|
|
|
|
if (elem.type != BE_NULL) {
|
|
|
|
#ifdef LIBSMI
|
|
|
|
smi_print_value(smiNode, pduid, &elem);
|
|
|
|
#else
|
1996-08-19 20:34:12 +00:00
|
|
|
asn1_print(&elem);
|
2000-01-30 00:45:58 +00:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
}
|
1996-08-19 20:34:12 +00:00
|
|
|
length = vblength;
|
|
|
|
np = vbend;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2000-01-30 00:45:58 +00:00
|
|
|
* Decode SNMP PDUs: GetRequest, GetNextRequest, GetResponse, SetRequest,
|
|
|
|
* GetBulk, Inform, V2Trap, and Report
|
1996-08-19 20:34:12 +00:00
|
|
|
*/
|
|
|
|
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;
|
|
|
|
}
|
2001-04-03 07:45:48 +00:00
|
|
|
if (vflag)
|
|
|
|
printf("R=%d ", elem.data.integer);
|
1996-08-19 20:34:12 +00:00
|
|
|
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;
|
2000-01-30 00:45:58 +00:00
|
|
|
if ((pduid == GETREQ || pduid == GETNEXTREQ || pduid == SETREQ
|
|
|
|
|| pduid == INFORMREQ || pduid == V2TRAP || pduid == REPORT)
|
1996-08-19 20:34:12 +00:00
|
|
|
&& elem.data.integer != 0) {
|
|
|
|
char errbuf[10];
|
|
|
|
printf("[errorStatus(%s)!=0]",
|
|
|
|
DECODE_ErrorStatus(elem.data.integer));
|
2000-01-30 00:45:58 +00:00
|
|
|
} else if (pduid == GETBULKREQ) {
|
|
|
|
printf(" N=%d", elem.data.integer);
|
1996-08-19 20:34:12 +00:00
|
|
|
} else if (elem.data.integer != 0) {
|
|
|
|
char errbuf[10];
|
|
|
|
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;
|
|
|
|
}
|
2000-01-30 00:45:58 +00:00
|
|
|
if ((pduid == GETREQ || pduid == GETNEXTREQ || pduid == SETREQ
|
|
|
|
|| pduid == INFORMREQ || pduid == V2TRAP || pduid == REPORT)
|
1996-08-19 20:34:12 +00:00
|
|
|
&& elem.data.integer != 0)
|
|
|
|
printf("[errorIndex(%d)!=0]", elem.data.integer);
|
2000-01-30 00:45:58 +00:00
|
|
|
else if (pduid == GETBULKREQ)
|
|
|
|
printf(" M=%d", elem.data.integer);
|
1996-08-19 20:34:12 +00:00
|
|
|
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;
|
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
varbind_print(pduid, np, length);
|
1996-08-19 20:34:12 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Decode SNMP Trap PDU
|
|
|
|
*/
|
|
|
|
static void
|
2000-01-30 00:45:58 +00:00
|
|
|
trappdu_print(const u_char *np, u_int length)
|
1996-08-19 20:34:12 +00:00
|
|
|
{
|
|
|
|
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[10];
|
|
|
|
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;
|
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
varbind_print (TRAP, np, length);
|
1996-08-19 20:34:12 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2000-01-30 00:45:58 +00:00
|
|
|
* Decode arbitrary SNMP PDUs.
|
1996-08-19 20:34:12 +00:00
|
|
|
*/
|
2000-01-30 00:45:58 +00:00
|
|
|
static void
|
|
|
|
pdu_print(const u_char *np, u_int length, int version)
|
1996-08-19 20:34:12 +00:00
|
|
|
{
|
2000-01-30 00:45:58 +00:00
|
|
|
struct be pdu;
|
1996-08-19 20:34:12 +00:00
|
|
|
int count = 0;
|
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
/* 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);
|
2001-04-03 07:45:48 +00:00
|
|
|
if (vflag) {
|
|
|
|
fputs("{ ", stdout);
|
|
|
|
}
|
2000-01-30 00:45:58 +00:00
|
|
|
asn1_print(&pdu);
|
2001-04-03 07:45:48 +00:00
|
|
|
fputs(" ", stdout);
|
2000-01-30 00:45:58 +00:00
|
|
|
/* descend into PDU */
|
|
|
|
length = pdu.asnlen;
|
|
|
|
np = (u_char *)pdu.data.raw;
|
1996-08-19 20:34:12 +00:00
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
if (version == SNMP_VERSION_1 &&
|
|
|
|
(pdu.id == GETBULKREQ || pdu.id == INFORMREQ ||
|
|
|
|
pdu.id == V2TRAP || pdu.id == REPORT)) {
|
|
|
|
printf("[v2 PDU in v1 message]");
|
|
|
|
return;
|
1996-08-19 20:34:12 +00:00
|
|
|
}
|
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
if (version == SNMP_VERSION_2 && pdu.id == TRAP) {
|
|
|
|
printf("[v1 PDU in v2 message]");
|
|
|
|
return;
|
|
|
|
}
|
1996-08-19 20:34:12 +00:00
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
switch (pdu.id) {
|
|
|
|
case TRAP:
|
|
|
|
trappdu_print(np, length);
|
|
|
|
break;
|
|
|
|
case GETREQ:
|
|
|
|
case GETNEXTREQ:
|
|
|
|
case GETRESP:
|
|
|
|
case SETREQ:
|
|
|
|
case GETBULKREQ:
|
|
|
|
case INFORMREQ:
|
|
|
|
case V2TRAP:
|
|
|
|
case REPORT:
|
|
|
|
snmppdu_print(pdu.id, np, length);
|
|
|
|
break;
|
|
|
|
}
|
2001-04-03 07:45:48 +00:00
|
|
|
|
|
|
|
if (vflag) {
|
|
|
|
fputs("} ", stdout);
|
|
|
|
}
|
2000-01-30 00:45:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Decode a scoped SNMP PDU.
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
scopedpdu_print(const u_char *np, u_int length, int version)
|
|
|
|
{
|
|
|
|
struct be elem;
|
|
|
|
int i, count = 0;
|
|
|
|
|
|
|
|
/* Sequence */
|
1996-08-19 20:34:12 +00:00
|
|
|
if ((count = asn1_parse(np, length, &elem)) < 0)
|
|
|
|
return;
|
|
|
|
if (elem.type != BE_SEQ) {
|
2000-01-30 00:45:58 +00:00
|
|
|
fputs("[!scoped PDU]", stdout);
|
1996-08-19 20:34:12 +00:00
|
|
|
asn1_print(&elem);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
length = elem.asnlen;
|
|
|
|
np = (u_char *)elem.data.raw;
|
2000-01-30 00:45:58 +00:00
|
|
|
|
|
|
|
/* contextEngineID (OCTET STRING) */
|
1996-08-19 20:34:12 +00:00
|
|
|
if ((count = asn1_parse(np, length, &elem)) < 0)
|
|
|
|
return;
|
2000-01-30 00:45:58 +00:00
|
|
|
if (elem.type != BE_STR) {
|
|
|
|
fputs("[contextEngineID!=STR]", stdout);
|
1996-08-19 20:34:12 +00:00
|
|
|
asn1_print(&elem);
|
|
|
|
return;
|
|
|
|
}
|
2000-01-30 00:45:58 +00:00
|
|
|
length -= count;
|
|
|
|
np += count;
|
|
|
|
|
|
|
|
fputs("E= ", stdout);
|
|
|
|
for (i = 0; i < (int)elem.asnlen; i++) {
|
|
|
|
printf("0x%02X", elem.data.str[i]);
|
|
|
|
}
|
|
|
|
fputs(" ", stdout);
|
|
|
|
|
|
|
|
/* contextName (OCTET STRING) */
|
|
|
|
if ((count = asn1_parse(np, length, &elem)) < 0)
|
|
|
|
return;
|
|
|
|
if (elem.type != BE_STR) {
|
|
|
|
fputs("[contextName!=STR]", stdout);
|
|
|
|
asn1_print(&elem);
|
1996-08-19 20:34:12 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
length -= count;
|
|
|
|
np += count;
|
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
printf("C=%.*s ", (int)elem.asnlen, elem.data.str);
|
|
|
|
|
|
|
|
pdu_print(np, length, version);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Decode SNMP Community Header (SNMPv1 and SNMPv2c)
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
community_print(const u_char *np, u_int length, int version)
|
|
|
|
{
|
|
|
|
struct be elem;
|
|
|
|
int count = 0;
|
|
|
|
|
1996-08-19 20:34:12 +00:00
|
|
|
/* 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;
|
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
pdu_print(np, length, version);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Decode SNMPv3 User-based Security Message Header (SNMPv3)
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
usm_print(const u_char *np, u_int length)
|
|
|
|
{
|
|
|
|
struct be elem;
|
|
|
|
int count = 0;
|
|
|
|
|
|
|
|
/* Sequence */
|
|
|
|
if ((count = asn1_parse(np, length, &elem)) < 0)
|
1996-08-19 20:34:12 +00:00
|
|
|
return;
|
2000-01-30 00:45:58 +00:00
|
|
|
if (elem.type != BE_SEQ) {
|
|
|
|
fputs("[!usm]", stdout);
|
|
|
|
asn1_print(&elem);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
length = elem.asnlen;
|
|
|
|
np = (u_char *)elem.data.raw;
|
|
|
|
|
|
|
|
/* msgAuthoritativeEngineID (OCTET STRING) */
|
|
|
|
if ((count = asn1_parse(np, length, &elem)) < 0)
|
|
|
|
return;
|
|
|
|
if (elem.type != BE_STR) {
|
|
|
|
fputs("[msgAuthoritativeEngineID!=STR]", stdout);
|
|
|
|
asn1_print(&elem);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
length -= count;
|
|
|
|
np += count;
|
|
|
|
|
|
|
|
/* msgAuthoritativeEngineBoots (INTEGER) */
|
|
|
|
if ((count = asn1_parse(np, length, &elem)) < 0)
|
|
|
|
return;
|
|
|
|
if (elem.type != BE_INT) {
|
|
|
|
fputs("[msgAuthoritativeEngineBoots!=INT]", stdout);
|
|
|
|
asn1_print(&elem);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (vflag)
|
|
|
|
printf("B=%d ", elem.data.integer);
|
|
|
|
length -= count;
|
|
|
|
np += count;
|
|
|
|
|
|
|
|
/* msgAuthoritativeEngineTime (INTEGER) */
|
|
|
|
if ((count = asn1_parse(np, length, &elem)) < 0)
|
|
|
|
return;
|
|
|
|
if (elem.type != BE_INT) {
|
|
|
|
fputs("[msgAuthoritativeEngineTime!=INT]", stdout);
|
|
|
|
asn1_print(&elem);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (vflag)
|
|
|
|
printf("T=%d ", elem.data.integer);
|
|
|
|
length -= count;
|
|
|
|
np += count;
|
|
|
|
|
|
|
|
/* msgUserName (OCTET STRING) */
|
|
|
|
if ((count = asn1_parse(np, length, &elem)) < 0)
|
|
|
|
return;
|
|
|
|
if (elem.type != BE_STR) {
|
|
|
|
fputs("[msgUserName!=STR]", stdout);
|
|
|
|
asn1_print(&elem);
|
1996-08-19 20:34:12 +00:00
|
|
|
return;
|
|
|
|
}
|
2000-01-30 00:45:58 +00:00
|
|
|
length -= count;
|
|
|
|
np += count;
|
|
|
|
|
|
|
|
printf("U=%.*s ", (int)elem.asnlen, elem.data.str);
|
|
|
|
|
|
|
|
/* msgAuthenticationParameters (OCTET STRING) */
|
|
|
|
if ((count = asn1_parse(np, length, &elem)) < 0)
|
|
|
|
return;
|
|
|
|
if (elem.type != BE_STR) {
|
|
|
|
fputs("[msgAuthenticationParameters!=STR]", stdout);
|
|
|
|
asn1_print(&elem);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
length -= count;
|
|
|
|
np += count;
|
|
|
|
|
|
|
|
/* msgPrivacyParameters (OCTET STRING) */
|
|
|
|
if ((count = asn1_parse(np, length, &elem)) < 0)
|
|
|
|
return;
|
|
|
|
if (elem.type != BE_STR) {
|
|
|
|
fputs("[msgPrivacyParameters!=STR]", stdout);
|
|
|
|
asn1_print(&elem);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
length -= count;
|
|
|
|
np += count;
|
|
|
|
|
1996-08-19 20:34:12 +00:00
|
|
|
if (count < length)
|
2000-01-30 00:45:58 +00:00
|
|
|
printf("[%d extra after usm SEQ]", length - count);
|
|
|
|
}
|
1996-08-19 20:34:12 +00:00
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
/*
|
|
|
|
* Decode SNMPv3 Message Header (SNMPv3)
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
v3msg_print(const u_char *np, u_int length)
|
|
|
|
{
|
|
|
|
struct be elem;
|
|
|
|
int count = 0;
|
|
|
|
u_char flags;
|
|
|
|
int model;
|
|
|
|
const u_char *xnp = np;
|
|
|
|
int xlength = length;
|
|
|
|
|
|
|
|
/* Sequence */
|
|
|
|
if ((count = asn1_parse(np, length, &elem)) < 0)
|
|
|
|
return;
|
|
|
|
if (elem.type != BE_SEQ) {
|
|
|
|
fputs("[!message]", stdout);
|
|
|
|
asn1_print(&elem);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
length = elem.asnlen;
|
|
|
|
np = (u_char *)elem.data.raw;
|
|
|
|
|
2001-04-03 07:45:48 +00:00
|
|
|
if (vflag) {
|
|
|
|
fputs("{ ", stdout);
|
|
|
|
}
|
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
/* msgID (INTEGER) */
|
|
|
|
if ((count = asn1_parse(np, length, &elem)) < 0)
|
|
|
|
return;
|
|
|
|
if (elem.type != BE_INT) {
|
|
|
|
fputs("[msgID!=INT]", stdout);
|
|
|
|
asn1_print(&elem);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
length -= count;
|
|
|
|
np += count;
|
|
|
|
|
|
|
|
/* msgMaxSize (INTEGER) */
|
|
|
|
if ((count = asn1_parse(np, length, &elem)) < 0)
|
|
|
|
return;
|
|
|
|
if (elem.type != BE_INT) {
|
|
|
|
fputs("[msgMaxSize!=INT]", stdout);
|
|
|
|
asn1_print(&elem);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
length -= count;
|
|
|
|
np += count;
|
|
|
|
|
|
|
|
/* msgFlags (OCTET STRING) */
|
|
|
|
if ((count = asn1_parse(np, length, &elem)) < 0)
|
|
|
|
return;
|
|
|
|
if (elem.type != BE_STR) {
|
|
|
|
fputs("[msgFlags!=STR]", stdout);
|
|
|
|
asn1_print(&elem);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (elem.asnlen != 1) {
|
|
|
|
printf("[msgFlags size %d]", elem.asnlen);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
flags = elem.data.str[0];
|
|
|
|
if (flags != 0x00 && flags != 0x01 && flags != 0x03
|
|
|
|
&& flags != 0x04 && flags != 0x05 && flags != 0x07) {
|
|
|
|
printf("[msgFlags=0x%02X]", flags);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
length -= count;
|
|
|
|
np += count;
|
|
|
|
|
|
|
|
fputs("F=", stdout);
|
|
|
|
if (flags & 0x01) fputs("a", stdout);
|
|
|
|
if (flags & 0x02) fputs("p", stdout);
|
|
|
|
if (flags & 0x04) fputs("r", stdout);
|
|
|
|
fputs(" ", stdout);
|
|
|
|
|
|
|
|
/* msgSecurityModel (INTEGER) */
|
|
|
|
if ((count = asn1_parse(np, length, &elem)) < 0)
|
|
|
|
return;
|
|
|
|
if (elem.type != BE_INT) {
|
|
|
|
fputs("[msgSecurityModel!=INT]", stdout);
|
|
|
|
asn1_print(&elem);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
model = elem.data.integer;
|
|
|
|
length -= count;
|
|
|
|
np += count;
|
|
|
|
|
|
|
|
if (count < length)
|
|
|
|
printf("[%d extra after message SEQ]", length - count);
|
|
|
|
|
2001-04-03 07:45:48 +00:00
|
|
|
if (vflag) {
|
|
|
|
fputs("} ", stdout);
|
|
|
|
}
|
|
|
|
|
2000-01-30 00:45:58 +00:00
|
|
|
if (model == 3) {
|
|
|
|
if (vflag) {
|
2001-04-03 07:45:48 +00:00
|
|
|
fputs("{ USM ", stdout);
|
2000-01-30 00:45:58 +00:00
|
|
|
}
|
|
|
|
} else {
|
|
|
|
printf("[security model %d]", model);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
np = xnp + (np - xnp);
|
|
|
|
length = xlength - (np - xnp);
|
|
|
|
|
|
|
|
/* msgSecurityParameters (OCTET STRING) */
|
|
|
|
if ((count = asn1_parse(np, length, &elem)) < 0)
|
|
|
|
return;
|
|
|
|
if (elem.type != BE_STR) {
|
|
|
|
fputs("[msgSecurityParameters!=STR]", stdout);
|
|
|
|
asn1_print(&elem);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
length -= count;
|
|
|
|
np += count;
|
|
|
|
|
|
|
|
if (model == 3) {
|
|
|
|
usm_print(elem.data.str, elem.asnlen);
|
2001-04-03 07:45:48 +00:00
|
|
|
if (vflag) {
|
|
|
|
fputs("} ", stdout);
|
|
|
|
}
|
2000-01-30 00:45:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (vflag) {
|
2001-04-03 07:45:48 +00:00
|
|
|
fputs("{ ScopedPDU ", stdout);
|
2000-01-30 00:45:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
scopedpdu_print(np, length, 3);
|
2001-04-03 07:45:48 +00:00
|
|
|
|
|
|
|
if (vflag) {
|
|
|
|
fputs("} ", stdout);
|
|
|
|
}
|
2000-01-30 00:45:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Decode SNMP header and pass on to PDU printing routines
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
snmp_print(const u_char *np, u_int length)
|
|
|
|
{
|
|
|
|
struct be elem;
|
|
|
|
int count = 0;
|
|
|
|
int version = 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;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (elem.data.integer) {
|
|
|
|
case SNMP_VERSION_1:
|
|
|
|
case SNMP_VERSION_2:
|
|
|
|
case SNMP_VERSION_3:
|
|
|
|
if (vflag)
|
2001-04-03 07:45:48 +00:00
|
|
|
printf("{ %s ", SnmpVersion[elem.data.integer]);
|
1996-08-19 20:34:12 +00:00
|
|
|
break;
|
2000-01-30 00:45:58 +00:00
|
|
|
default:
|
|
|
|
printf("[version = %d]", elem.data.integer);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
version = elem.data.integer;
|
|
|
|
length -= count;
|
|
|
|
np += count;
|
|
|
|
|
|
|
|
switch (version) {
|
|
|
|
case SNMP_VERSION_1:
|
|
|
|
case SNMP_VERSION_2:
|
|
|
|
community_print(np, length, version);
|
|
|
|
break;
|
|
|
|
case SNMP_VERSION_3:
|
|
|
|
v3msg_print(np, length);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
printf("[version = %d]", elem.data.integer);
|
1996-08-19 20:34:12 +00:00
|
|
|
break;
|
|
|
|
}
|
2001-04-03 07:45:48 +00:00
|
|
|
|
|
|
|
if (vflag) {
|
|
|
|
fputs("} ", stdout);
|
|
|
|
}
|
1996-08-19 20:34:12 +00:00
|
|
|
}
|