1 /*
2 * Copyright (c) 2006
3 * Hartmut Brandt.
4 * All rights reserved.
5 *
6 * Author: Harti Brandt <harti@freebsd.org>
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 *
17 * THIS SOFTWARE IS PROVIDED BY AUTHOR AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 *
29 * $Begemot: bsnmp/snmp_mibII/mibII_begemot.c,v 1.1 2006/02/14 09:04:19 brandt_h Exp $
30 *
31 * Private MIB.
32 */
33 #include "mibII.h"
34 #include "mibII_oid.h"
35
36 /*
37 * Scalars
38 */
39 int
op_begemot_mibII(struct snmp_context * ctx,struct snmp_value * value,u_int sub,u_int idx __unused,enum snmp_op op)40 op_begemot_mibII(struct snmp_context *ctx, struct snmp_value *value,
41 u_int sub, u_int idx __unused, enum snmp_op op)
42 {
43 switch (op) {
44
45 case SNMP_OP_GETNEXT:
46 abort();
47
48 case SNMP_OP_GET:
49 goto get;
50
51 case SNMP_OP_SET:
52 switch (value->var.subs[sub - 1]) {
53
54 case LEAF_begemotIfMaxspeed:
55 case LEAF_begemotIfPoll:
56 return (SNMP_ERR_NOT_WRITEABLE);
57
58 case LEAF_begemotIfForcePoll:
59 ctx->scratch->int1 = mibif_force_hc_update_interval;
60 mibif_force_hc_update_interval = value->v.uint32;
61 return (SNMP_ERR_NOERROR);
62
63 case LEAF_begemotIfDataPoll:
64 ctx->scratch->int1 = mibII_poll_ticks;
65 mibII_poll_ticks = value->v.uint32;
66 return (SNMP_ERR_NOERROR);
67 }
68 abort();
69
70 case SNMP_OP_ROLLBACK:
71 switch (value->var.subs[sub - 1]) {
72
73 case LEAF_begemotIfForcePoll:
74 mibif_force_hc_update_interval = ctx->scratch->int1;
75 return (SNMP_ERR_NOERROR);
76
77 case LEAF_begemotIfDataPoll:
78 mibII_poll_ticks = ctx->scratch->int1;
79 return (SNMP_ERR_NOERROR);
80 }
81 abort();
82
83 case SNMP_OP_COMMIT:
84 switch (value->var.subs[sub - 1]) {
85
86 case LEAF_begemotIfForcePoll:
87 mibif_force_hc_update_interval = ctx->scratch->int1;
88 mibif_reset_hc_timer();
89 return (SNMP_ERR_NOERROR);
90
91 case LEAF_begemotIfDataPoll:
92 mibif_restart_mibII_poll_timer();
93 return (SNMP_ERR_NOERROR);
94 }
95 abort();
96 }
97 abort();
98
99 get:
100
101 switch (value->var.subs[sub - 1]) {
102
103 case LEAF_begemotIfMaxspeed:
104 value->v.counter64 = mibif_maxspeed;
105 return (SNMP_ERR_NOERROR);
106
107 case LEAF_begemotIfPoll:
108 value->v.uint32 = mibif_hc_update_interval;
109 return (SNMP_ERR_NOERROR);
110
111 case LEAF_begemotIfForcePoll:
112 value->v.uint32 = mibif_force_hc_update_interval;
113 return (SNMP_ERR_NOERROR);
114
115 case LEAF_begemotIfDataPoll:
116 value->v.uint32 = mibII_poll_ticks;
117 return (SNMP_ERR_NOERROR);
118 }
119 abort();
120 }
121