]> git.proxmox.com Git - mirror_frr.git/blame - lib/snmp.c
zebra, lib: fix the ZEBRA_INTERFACE_VRF_UPDATE zapi message
[mirror_frr.git] / lib / snmp.c
CommitLineData
3a4c9688
VB
1/* SNMP support
2 * Copyright (C) 1999 Kunihiro Ishiguro <kunihiro@zebra.org>
3 *
4 * This file is part of GNU Zebra.
5 *
6 * GNU Zebra is free software; you can redistribute it and/or modify it
7 * under the terms of the GNU General Public License as published by the
8 * Free Software Foundation; either version 2, or (at your option) any
9 * later version.
10 *
11 * GNU Zebra is distributed in the hope that it will be useful, but
12 * WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * General Public License for more details.
15 *
896014f4
DL
16 * You should have received a copy of the GNU General Public License along
17 * with this program; see the file COPYING; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
3a4c9688
VB
19 */
20
21#include <zebra.h>
22
3a4c9688
VB
23#include <net-snmp/net-snmp-config.h>
24#include <net-snmp/net-snmp-includes.h>
25
26#include "smux.h"
27
28#define min(A,B) ((A) < (B) ? (A) : (B))
29
d62a17ae 30int oid_compare(const oid *o1, int o1_len, const oid *o2, int o2_len)
3a4c9688 31{
d62a17ae 32 int i;
33
34 for (i = 0; i < min(o1_len, o2_len); i++) {
35 if (o1[i] < o2[i])
36 return -1;
37 else if (o1[i] > o2[i])
38 return 1;
39 }
40 if (o1_len < o2_len)
41 return -1;
42 if (o1_len > o2_len)
43 return 1;
44
45 return 0;
3a4c9688
VB
46}
47
d62a17ae 48void *oid_copy(void *dest, const void *src, size_t size)
3a4c9688 49{
d62a17ae 50 return memcpy(dest, src, size * sizeof(oid));
3a4c9688
VB
51}
52
d62a17ae 53void oid2in_addr(oid oid[], int len, struct in_addr *addr)
3a4c9688 54{
d62a17ae 55 int i;
d7c0a89a 56 uint8_t *pnt;
3a4c9688 57
d62a17ae 58 if (len == 0)
59 return;
3a4c9688 60
d7c0a89a 61 pnt = (uint8_t *)addr;
d62a17ae 62
63 for (i = 0; i < len; i++)
64 *pnt++ = oid[i];
3a4c9688
VB
65}
66
d62a17ae 67void oid_copy_addr(oid oid[], struct in_addr *addr, int len)
3a4c9688 68{
d62a17ae 69 int i;
d7c0a89a 70 uint8_t *pnt;
d62a17ae 71
72 if (len == 0)
73 return;
3a4c9688 74
d7c0a89a 75 pnt = (uint8_t *)addr;
3a4c9688 76
d62a17ae 77 for (i = 0; i < len; i++)
78 oid[i] = *pnt++;
3a4c9688
VB
79}
80
d62a17ae 81int smux_header_generic(struct variable *v, oid *name, size_t *length,
82 int exact, size_t *var_len, WriteMethod **write_method)
3a4c9688 83{
d62a17ae 84 oid fulloid[MAX_OID_LEN];
85 int ret;
3a4c9688 86
d62a17ae 87 oid_copy(fulloid, v->name, v->namelen);
88 fulloid[v->namelen] = 0;
89 /* Check against full instance. */
90 ret = oid_compare(name, *length, fulloid, v->namelen + 1);
3a4c9688 91
d62a17ae 92 /* Check single instance. */
93 if ((exact && (ret != 0)) || (!exact && (ret >= 0)))
94 return MATCH_FAILED;
3a4c9688 95
d62a17ae 96 /* In case of getnext, fill in full instance. */
97 memcpy(name, fulloid, (v->namelen + 1) * sizeof(oid));
98 *length = v->namelen + 1;
3a4c9688 99
d62a17ae 100 *write_method = 0;
101 *var_len = sizeof(long); /* default to 'long' results */
3a4c9688 102
d62a17ae 103 return MATCH_SUCCEEDED;
3a4c9688 104}
8046ba6e 105
d62a17ae 106int smux_header_table(struct variable *v, oid *name, size_t *length, int exact,
107 size_t *var_len, WriteMethod **write_method)
8046ba6e 108{
d62a17ae 109 /* If the requested OID name is less than OID prefix we
110 handle, adjust it to our prefix. */
111 if ((oid_compare(name, *length, v->name, v->namelen)) < 0) {
112 if (exact)
113 return MATCH_FAILED;
114 oid_copy(name, v->name, v->namelen);
115 *length = v->namelen;
116 }
117
118 *write_method = 0;
119 *var_len = sizeof(long);
120
121 return MATCH_SUCCEEDED;
8046ba6e 122}