1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
3 *
4 * Copyright (c) 2006 Shteryana Shopova <syrinx@FreeBSD.org>
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26 * SUCH DAMAGE.
27 *
28 * Bridge MIB implementation for SNMPd.
29 * Bridge pfil controls.
30 */
31
32 #include <sys/types.h>
33 #include <sys/sysctl.h>
34 #include <sys/socket.h>
35
36 #include <net/ethernet.h>
37 #include <net/if.h>
38 #include <net/if_mib.h>
39 #include <net/if_types.h>
40
41 #include <errno.h>
42 #include <string.h>
43 #include <stdlib.h>
44 #include <syslog.h>
45
46 #include <bsnmp/snmpmod.h>
47 #include <bsnmp/snmp_mibII.h>
48
49 #define SNMPTREE_TYPES
50 #include "bridge_tree.h"
51 #include "bridge_snmp.h"
52
53 static int
val2snmp_truth(uint8_t val)54 val2snmp_truth(uint8_t val)
55 {
56 if (val == 0)
57 return (2);
58
59 return (1);
60 }
61
62 static int
snmp_truth2val(int32_t truth)63 snmp_truth2val(int32_t truth)
64 {
65 if (truth == 2)
66 return (0);
67 else if (truth == 1)
68 return (1);
69
70 return (-1);
71 }
72
73 int
op_begemot_bridge_pf(struct snmp_context * ctx,struct snmp_value * val,uint sub,uint iidx __unused,enum snmp_op op)74 op_begemot_bridge_pf(struct snmp_context *ctx, struct snmp_value *val,
75 uint sub, uint iidx __unused, enum snmp_op op)
76 {
77 int k_val;
78
79 if (val->var.subs[sub - 1] > LEAF_begemotBridgeLayer2PfStatus)
80 return (SNMP_ERR_NOSUCHNAME);
81
82 switch (op) {
83 case SNMP_OP_GETNEXT:
84 abort();
85 case SNMP_OP_ROLLBACK:
86 bridge_do_pfctl(val->var.subs[sub - 1] - 1,
87 op, &(ctx->scratch->int1));
88 return (SNMP_ERR_NOERROR);
89
90 case SNMP_OP_COMMIT:
91 return (SNMP_ERR_NOERROR);
92
93 case SNMP_OP_SET:
94 ctx->scratch->int1 =
95 bridge_get_pfval(val->var.subs[sub - 1]);
96
97 if ((k_val = snmp_truth2val(val->v.integer)) < 0)
98 return (SNMP_ERR_BADVALUE);
99 return (SNMP_ERR_NOERROR);
100
101 case SNMP_OP_GET:
102 switch (val->var.subs[sub - 1]) {
103 case LEAF_begemotBridgePfilStatus:
104 case LEAF_begemotBridgePfilMembers:
105 case LEAF_begemotBridgePfilIpOnly:
106 case LEAF_begemotBridgeLayer2PfStatus:
107 if (bridge_do_pfctl(val->var.subs[sub - 1] - 1,
108 op, &k_val) < 0)
109 return (SNMP_ERR_GENERR);
110 val->v.integer = val2snmp_truth(k_val);
111 return (SNMP_ERR_NOERROR);
112 }
113 abort();
114 }
115
116 abort();
117 }
118