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 *
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
19 */
20
21 #include <zebra.h>
22
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
oid_compare(const oid * o1,int o1_len,const oid * o2,int o2_len)30 int oid_compare(const oid *o1, int o1_len, const oid *o2, int o2_len)
31 {
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;
46 }
47
oid_copy(void * dest,const void * src,size_t size)48 void *oid_copy(void *dest, const void *src, size_t size)
49 {
50 return memcpy(dest, src, size * sizeof(oid));
51 }
52
oid2in_addr(oid oid[],int len,struct in_addr * addr)53 void oid2in_addr(oid oid[], int len, struct in_addr *addr)
54 {
55 int i;
56 uint8_t *pnt;
57
58 if (len == 0)
59 return;
60
61 pnt = (uint8_t *)addr;
62
63 for (i = 0; i < len; i++)
64 *pnt++ = oid[i];
65 }
66
oid_copy_addr(oid oid[],const struct in_addr * addr,int len)67 void oid_copy_addr(oid oid[], const struct in_addr *addr, int len)
68 {
69 int i;
70 const uint8_t *pnt;
71
72 if (len == 0)
73 return;
74
75 pnt = (uint8_t *)addr;
76
77 for (i = 0; i < len; i++)
78 oid[i] = *pnt++;
79 }
80
smux_header_generic(struct variable * v,oid * name,size_t * length,int exact,size_t * var_len,WriteMethod ** write_method)81 int smux_header_generic(struct variable *v, oid *name, size_t *length,
82 int exact, size_t *var_len, WriteMethod **write_method)
83 {
84 oid fulloid[MAX_OID_LEN];
85 int ret;
86
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);
91
92 /* Check single instance. */
93 if ((exact && (ret != 0)) || (!exact && (ret >= 0)))
94 return MATCH_FAILED;
95
96 /* In case of getnext, fill in full instance. */
97 memcpy(name, fulloid, (v->namelen + 1) * sizeof(oid));
98 *length = v->namelen + 1;
99
100 *write_method = 0;
101 *var_len = sizeof(long); /* default to 'long' results */
102
103 return MATCH_SUCCEEDED;
104 }
105
smux_header_table(struct variable * v,oid * name,size_t * length,int exact,size_t * var_len,WriteMethod ** write_method)106 int smux_header_table(struct variable *v, oid *name, size_t *length, int exact,
107 size_t *var_len, WriteMethod **write_method)
108 {
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;
122 }
123