/* $OpenBSD: mps.c,v 1.30 2022/10/06 14:41:08 martijn Exp $ */ /* * Copyright (c) 2007, 2008, 2012 Reyk Floeter * * Permission to use, copy, modify, and distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. * * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "snmpd.h" #include "mib.h" struct ber_oid * mps_table(struct oid *, struct ber_oid *, struct ber_oid *); int mps_getstr(struct oid *oid, struct ber_oid *o, struct ber_element **elm) { char *s = oid->o_data; if (s == NULL) return (-1); *elm = ober_add_string(*elm, s); return (0); } int mps_getint(struct oid *oid, struct ber_oid *o, struct ber_element **elm) { *elm = ober_add_integer(*elm, oid->o_val); return (0); } int mps_getts(struct oid *oid, struct ber_oid *o, struct ber_element **elm) { *elm = ober_add_integer(*elm, oid->o_val); ober_set_header(*elm, BER_CLASS_APPLICATION, SNMP_T_TIMETICKS); return (0); } int mps_getreq(struct snmp_message *msg, struct ber_element *root, struct ber_oid *o, u_int sm_version) { struct ber_element *elm = root; struct oid key, *value; unsigned long error_type = 0; /* noSuchObject */ if (o->bo_n > BER_MAX_OID_LEN) return (-1); bzero(&key, sizeof(key)); bcopy(o, &key.o_id, sizeof(struct ber_oid)); smi_oidlen(&key.o_id); /* Strip off any trailing .0. */ value = smi_find(&key); if (value == NULL) goto fail; if (OID_NOTSET(value)) goto fail; if (value->o_get == NULL) goto fail; if (value->o_oidlen == o->bo_n) { /* No instance identifier specified. */ error_type = 1; /* noSuchInstance */ goto fail; } if ((value->o_flags & OID_TABLE) == 0) elm = ober_add_oid(elm, o); if (value->o_get(value, o, &elm) != 0) goto fail; return (0); fail: if (sm_version == 0) return (-1); /* Set SNMPv2 extended error response. */ elm = ober_add_oid(elm, o); elm = ober_add_null(elm); ober_set_header(elm, BER_CLASS_CONTEXT, error_type); return (0); } int mps_getnextreq(struct snmp_message *msg, struct ber_element *root, struct ber_oid *o) { struct oid *next = NULL; struct ber_element *ber = root; struct oid key, *value; int ret; struct ber_oid no; unsigned long error_type = 0; /* noSuchObject */ if (o->bo_n > BER_MAX_OID_LEN) return (-1); bzero(&key, sizeof(key)); bcopy(o, &key.o_id, sizeof(struct ber_oid)); smi_oidlen(&key.o_id); /* Strip off any trailing .0. */ value = smi_nfind(&key); if (value == NULL) goto fail; if (value->o_flags & OID_TABLE) { /* Get the next table row for this column */ if (mps_table(value, o, &no) != NULL) { bcopy(&no, o, sizeof(*o)); ret = value->o_get(value, o, &ber); } else ret = 1; switch (ret) { case 0: return (0); case -1: goto fail; case 1: /* end-of-rows */ break; } } else if (o->bo_n == value->o_oidlen && value->o_get != NULL) { next = value; goto appendzero; } getnext: for (next = value; next != NULL;) { next = smi_next(next); if (next == NULL) break; if (!OID_NOTSET(next) && next->o_get != NULL) break; } if (next == NULL || next->o_get == NULL) goto fail; if (next->o_flags & OID_TABLE) { /* Get the next table row for this column */ if (mps_table(next, o, &no) == NULL) { value = next; goto getnext; } bcopy(&no, o, sizeof(*o)); if ((ret = next->o_get(next, o, &ber)) != 0) { if (ret == 1) { value = next; goto getnext; } goto fail; } } else { bcopy(&next->o_id, o, sizeof(*o)); appendzero: /* No instance identifier specified. Append .0. */ if (o->bo_n + 1 > BER_MAX_OID_LEN) goto fail; ber = ober_add_noid(ber, o, ++o->bo_n); if ((ret = next->o_get(next, o, &ber)) != 0) goto fail; } return (0); fail: if (msg->sm_version == 0) return (-1); /* Set SNMPv2 extended error response. */ ber = ober_add_oid(ber, o); ber = ober_add_null(ber); ober_set_header(ber, BER_CLASS_CONTEXT, error_type); return (0); } int mps_getbulkreq(struct snmp_message *msg, struct ber_element **root, struct ber_element **end, struct ber_oid *o, int max) { struct ber_element *c, *d, *e; size_t len; int j, ret; j = max; c = *root; *end = NULL; for (d = NULL, len = 0; j > 0; j--) { e = ober_add_sequence(NULL); if (c == NULL) c = e; ret = mps_getnextreq(msg, e, o); if (ret == 1) { *root = c; return (1); } if (ret == -1) { ober_free_elements(e); if (d == NULL) return (-1); break; } len += ober_calc_len(e); if (len > SNMPD_MAXVARBINDLEN) { ober_free_elements(e); break; } if (d != NULL) ober_link_elements(d, e); d = e; *end = d; } *root = c; return (0); } int mps_set(struct ber_oid *o, void *p, long long len) { struct oid key, *value; smi_oidlen(o); if (o->bo_n > BER_MAX_OID_LEN) return (-1); bzero(&key, sizeof(key)); bcopy(o, &key.o_id, sizeof(struct ber_oid)); value = smi_find(&key); if (value == NULL) return (-1); free(value->o_data); value->o_data = p; value->o_val = len; return (0); } struct ber_oid * mps_table(struct oid *oid, struct ber_oid *o, struct ber_oid *no) { u_int32_t col, idx = 1, id, subid; struct oid a, b; /* * This function is being used to iterate through elements * in a SMI "table". It is called by the mps_getnext() handler. * For example, if the input is sysORIndex, it will return * sysORIndex.1. If the input is sysORIndex.2, it will return * sysORIndex.3 etc.. The MIB code has to verify the index, * see mib_sysor() as an example. */ if (oid->o_table != NULL) return (oid->o_table(oid, o, no)); bcopy(&oid->o_id, no, sizeof(*no)); id = oid->o_oidlen - 1; subid = oid->o_oidlen; if (o->bo_n >= oid->o_oidlen) { /* * Compare the requested and the matched OID to see * if we have to iterate to the next element. */ bzero(&a, sizeof(a)); bcopy(o, &a.o_id, sizeof(struct ber_oid)); bzero(&b, sizeof(b)); bcopy(&oid->o_id, &b.o_id, sizeof(struct ber_oid)); b.o_oidlen--; b.o_flags |= OID_TABLE; if (smi_oid_cmp(&a, &b) == 0) { col = oid->o_oid[id]; if (col > o->bo_id[id]) idx = 1; else idx = o->bo_id[subid] + 1; o->bo_id[subid] = idx; o->bo_id[id] = col; bcopy(o, no, sizeof(*no)); } } /* The root element ends with a 0, iterate to the first element */ if (!no->bo_id[subid]) no->bo_id[subid]++; smi_oidlen(no); return (no); }