xref: /nrf52832-nimble/rt-thread/components/net/lwip-2.0.2/src/apps/snmp/snmp_scalar.c (revision 104654410c56c573564690304ae786df310c91fc)
1*10465441SEvalZero /**
2*10465441SEvalZero  * @file
3*10465441SEvalZero  * SNMP scalar node support implementation.
4*10465441SEvalZero  */
5*10465441SEvalZero 
6*10465441SEvalZero /*
7*10465441SEvalZero  * Copyright (c) 2001-2004 Swedish Institute of Computer Science.
8*10465441SEvalZero  * All rights reserved.
9*10465441SEvalZero  *
10*10465441SEvalZero  * Redistribution and use in source and binary forms, with or without modification,
11*10465441SEvalZero  * are permitted provided that the following conditions are met:
12*10465441SEvalZero  *
13*10465441SEvalZero  * 1. Redistributions of source code must retain the above copyright notice,
14*10465441SEvalZero  *    this list of conditions and the following disclaimer.
15*10465441SEvalZero  * 2. Redistributions in binary form must reproduce the above copyright notice,
16*10465441SEvalZero  *    this list of conditions and the following disclaimer in the documentation
17*10465441SEvalZero  *    and/or other materials provided with the distribution.
18*10465441SEvalZero  * 3. The name of the author may not be used to endorse or promote products
19*10465441SEvalZero  *    derived from this software without specific prior written permission.
20*10465441SEvalZero  *
21*10465441SEvalZero  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
22*10465441SEvalZero  * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
23*10465441SEvalZero  * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
24*10465441SEvalZero  * SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
25*10465441SEvalZero  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
26*10465441SEvalZero  * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
27*10465441SEvalZero  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28*10465441SEvalZero  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
29*10465441SEvalZero  * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
30*10465441SEvalZero  * OF SUCH DAMAGE.
31*10465441SEvalZero  *
32*10465441SEvalZero  * This file is part of the lwIP TCP/IP stack.
33*10465441SEvalZero  *
34*10465441SEvalZero  * Author: Martin Hentschel <[email protected]>
35*10465441SEvalZero  *
36*10465441SEvalZero  */
37*10465441SEvalZero 
38*10465441SEvalZero #include "lwip/apps/snmp_opts.h"
39*10465441SEvalZero 
40*10465441SEvalZero #if LWIP_SNMP /* don't build if not configured for use in lwipopts.h */
41*10465441SEvalZero 
42*10465441SEvalZero #include "lwip/apps/snmp_scalar.h"
43*10465441SEvalZero #include "lwip/apps/snmp_core.h"
44*10465441SEvalZero 
45*10465441SEvalZero static s16_t snmp_scalar_array_get_value(struct snmp_node_instance* instance, void* value);
46*10465441SEvalZero static snmp_err_t  snmp_scalar_array_set_test(struct snmp_node_instance* instance, u16_t value_len, void* value);
47*10465441SEvalZero static snmp_err_t  snmp_scalar_array_set_value(struct snmp_node_instance* instance, u16_t value_len, void* value);
48*10465441SEvalZero 
49*10465441SEvalZero snmp_err_t
snmp_scalar_get_instance(const u32_t * root_oid,u8_t root_oid_len,struct snmp_node_instance * instance)50*10465441SEvalZero snmp_scalar_get_instance(const u32_t *root_oid, u8_t root_oid_len, struct snmp_node_instance* instance)
51*10465441SEvalZero {
52*10465441SEvalZero   const struct snmp_scalar_node* scalar_node = (const struct snmp_scalar_node*)(const void*)instance->node;
53*10465441SEvalZero 
54*10465441SEvalZero   LWIP_UNUSED_ARG(root_oid);
55*10465441SEvalZero   LWIP_UNUSED_ARG(root_oid_len);
56*10465441SEvalZero 
57*10465441SEvalZero   /* scalar only has one dedicated instance: .0 */
58*10465441SEvalZero   if ((instance->instance_oid.len != 1) || (instance->instance_oid.id[0] != 0)) {
59*10465441SEvalZero     return SNMP_ERR_NOSUCHINSTANCE;
60*10465441SEvalZero   }
61*10465441SEvalZero 
62*10465441SEvalZero   instance->access    = scalar_node->access;
63*10465441SEvalZero   instance->asn1_type = scalar_node->asn1_type;
64*10465441SEvalZero   instance->get_value = scalar_node->get_value;
65*10465441SEvalZero   instance->set_test  = scalar_node->set_test;
66*10465441SEvalZero   instance->set_value = scalar_node->set_value;
67*10465441SEvalZero   return SNMP_ERR_NOERROR;
68*10465441SEvalZero }
69*10465441SEvalZero 
70*10465441SEvalZero snmp_err_t
snmp_scalar_get_next_instance(const u32_t * root_oid,u8_t root_oid_len,struct snmp_node_instance * instance)71*10465441SEvalZero snmp_scalar_get_next_instance(const u32_t *root_oid, u8_t root_oid_len, struct snmp_node_instance* instance)
72*10465441SEvalZero {
73*10465441SEvalZero   /* because our only instance is .0 we can only return a next instance if no instance oid is passed */
74*10465441SEvalZero   if (instance->instance_oid.len == 0) {
75*10465441SEvalZero     instance->instance_oid.len   = 1;
76*10465441SEvalZero     instance->instance_oid.id[0] = 0;
77*10465441SEvalZero 
78*10465441SEvalZero     return snmp_scalar_get_instance(root_oid, root_oid_len, instance);
79*10465441SEvalZero   }
80*10465441SEvalZero 
81*10465441SEvalZero   return SNMP_ERR_NOSUCHINSTANCE;
82*10465441SEvalZero }
83*10465441SEvalZero 
84*10465441SEvalZero 
85*10465441SEvalZero snmp_err_t
snmp_scalar_array_get_instance(const u32_t * root_oid,u8_t root_oid_len,struct snmp_node_instance * instance)86*10465441SEvalZero snmp_scalar_array_get_instance(const u32_t *root_oid, u8_t root_oid_len, struct snmp_node_instance* instance)
87*10465441SEvalZero {
88*10465441SEvalZero   LWIP_UNUSED_ARG(root_oid);
89*10465441SEvalZero   LWIP_UNUSED_ARG(root_oid_len);
90*10465441SEvalZero 
91*10465441SEvalZero   if ((instance->instance_oid.len == 2) && (instance->instance_oid.id[1] == 0)) {
92*10465441SEvalZero     const struct snmp_scalar_array_node* array_node = (const struct snmp_scalar_array_node*)(const void*)instance->node;
93*10465441SEvalZero     const struct snmp_scalar_array_node_def* array_node_def = array_node->array_nodes;
94*10465441SEvalZero     u32_t i = 0;
95*10465441SEvalZero 
96*10465441SEvalZero     while (i < array_node->array_node_count) {
97*10465441SEvalZero       if (array_node_def->oid == instance->instance_oid.id[0]) {
98*10465441SEvalZero         break;
99*10465441SEvalZero       }
100*10465441SEvalZero 
101*10465441SEvalZero       array_node_def++;
102*10465441SEvalZero       i++;
103*10465441SEvalZero     }
104*10465441SEvalZero 
105*10465441SEvalZero     if (i < array_node->array_node_count) {
106*10465441SEvalZero       instance->access              = array_node_def->access;
107*10465441SEvalZero       instance->asn1_type           = array_node_def->asn1_type;
108*10465441SEvalZero       instance->get_value           = snmp_scalar_array_get_value;
109*10465441SEvalZero       instance->set_test            = snmp_scalar_array_set_test;
110*10465441SEvalZero       instance->set_value           = snmp_scalar_array_set_value;
111*10465441SEvalZero       instance->reference.const_ptr = array_node_def;
112*10465441SEvalZero 
113*10465441SEvalZero       return SNMP_ERR_NOERROR;
114*10465441SEvalZero     }
115*10465441SEvalZero   }
116*10465441SEvalZero 
117*10465441SEvalZero   return SNMP_ERR_NOSUCHINSTANCE;
118*10465441SEvalZero }
119*10465441SEvalZero 
120*10465441SEvalZero snmp_err_t
snmp_scalar_array_get_next_instance(const u32_t * root_oid,u8_t root_oid_len,struct snmp_node_instance * instance)121*10465441SEvalZero snmp_scalar_array_get_next_instance(const u32_t *root_oid, u8_t root_oid_len, struct snmp_node_instance* instance)
122*10465441SEvalZero {
123*10465441SEvalZero   const struct snmp_scalar_array_node* array_node = (const struct snmp_scalar_array_node*)(const void*)instance->node;
124*10465441SEvalZero   const struct snmp_scalar_array_node_def* array_node_def = array_node->array_nodes;
125*10465441SEvalZero   const struct snmp_scalar_array_node_def* result = NULL;
126*10465441SEvalZero 
127*10465441SEvalZero   LWIP_UNUSED_ARG(root_oid);
128*10465441SEvalZero   LWIP_UNUSED_ARG(root_oid_len);
129*10465441SEvalZero 
130*10465441SEvalZero   if ((instance->instance_oid.len == 0) && (array_node->array_node_count > 0)) {
131*10465441SEvalZero     /* return node with lowest OID */
132*10465441SEvalZero     u16_t i = 0;
133*10465441SEvalZero 
134*10465441SEvalZero     result = array_node_def;
135*10465441SEvalZero     array_node_def++;
136*10465441SEvalZero 
137*10465441SEvalZero     for (i = 1; i < array_node->array_node_count; i++) {
138*10465441SEvalZero       if (array_node_def->oid < result->oid) {
139*10465441SEvalZero         result = array_node_def;
140*10465441SEvalZero       }
141*10465441SEvalZero       array_node_def++;
142*10465441SEvalZero     }
143*10465441SEvalZero   } else if (instance->instance_oid.len >= 1) {
144*10465441SEvalZero     if (instance->instance_oid.len == 1) {
145*10465441SEvalZero       /* if we have the requested OID we return its instance, otherwise we search for the next available */
146*10465441SEvalZero       u16_t i = 0;
147*10465441SEvalZero       while (i < array_node->array_node_count) {
148*10465441SEvalZero         if (array_node_def->oid == instance->instance_oid.id[0]) {
149*10465441SEvalZero           result = array_node_def;
150*10465441SEvalZero           break;
151*10465441SEvalZero         }
152*10465441SEvalZero 
153*10465441SEvalZero         array_node_def++;
154*10465441SEvalZero         i++;
155*10465441SEvalZero       }
156*10465441SEvalZero     }
157*10465441SEvalZero     if (result == NULL) {
158*10465441SEvalZero       u32_t oid_dist = 0xFFFFFFFFUL;
159*10465441SEvalZero       u16_t i        = 0;
160*10465441SEvalZero       array_node_def = array_node->array_nodes; /* may be already at the end when if case before was executed without result -> reinitialize to start */
161*10465441SEvalZero       while (i < array_node->array_node_count) {
162*10465441SEvalZero         if ((array_node_def->oid > instance->instance_oid.id[0]) &&
163*10465441SEvalZero             ((u32_t)(array_node_def->oid - instance->instance_oid.id[0]) < oid_dist)) {
164*10465441SEvalZero           result   = array_node_def;
165*10465441SEvalZero           oid_dist = array_node_def->oid - instance->instance_oid.id[0];
166*10465441SEvalZero         }
167*10465441SEvalZero 
168*10465441SEvalZero         array_node_def++;
169*10465441SEvalZero         i++;
170*10465441SEvalZero       }
171*10465441SEvalZero     }
172*10465441SEvalZero   }
173*10465441SEvalZero 
174*10465441SEvalZero   if (result == NULL) {
175*10465441SEvalZero     /* nothing to return */
176*10465441SEvalZero     return SNMP_ERR_NOSUCHINSTANCE;
177*10465441SEvalZero   }
178*10465441SEvalZero 
179*10465441SEvalZero   instance->instance_oid.len   = 2;
180*10465441SEvalZero   instance->instance_oid.id[0] = result->oid;
181*10465441SEvalZero   instance->instance_oid.id[1] = 0;
182*10465441SEvalZero 
183*10465441SEvalZero   instance->access              = result->access;
184*10465441SEvalZero   instance->asn1_type           = result->asn1_type;
185*10465441SEvalZero   instance->get_value           = snmp_scalar_array_get_value;
186*10465441SEvalZero   instance->set_test            = snmp_scalar_array_set_test;
187*10465441SEvalZero   instance->set_value           = snmp_scalar_array_set_value;
188*10465441SEvalZero   instance->reference.const_ptr = result;
189*10465441SEvalZero 
190*10465441SEvalZero   return SNMP_ERR_NOERROR;
191*10465441SEvalZero }
192*10465441SEvalZero 
193*10465441SEvalZero static s16_t
snmp_scalar_array_get_value(struct snmp_node_instance * instance,void * value)194*10465441SEvalZero snmp_scalar_array_get_value(struct snmp_node_instance* instance, void* value)
195*10465441SEvalZero {
196*10465441SEvalZero   const struct snmp_scalar_array_node* array_node = (const struct snmp_scalar_array_node*)(const void*)instance->node;
197*10465441SEvalZero   const struct snmp_scalar_array_node_def* array_node_def = (const struct snmp_scalar_array_node_def*)instance->reference.const_ptr;
198*10465441SEvalZero 
199*10465441SEvalZero   return array_node->get_value(array_node_def, value);
200*10465441SEvalZero }
201*10465441SEvalZero 
202*10465441SEvalZero static snmp_err_t
snmp_scalar_array_set_test(struct snmp_node_instance * instance,u16_t value_len,void * value)203*10465441SEvalZero snmp_scalar_array_set_test(struct snmp_node_instance* instance, u16_t value_len, void* value)
204*10465441SEvalZero {
205*10465441SEvalZero   const struct snmp_scalar_array_node* array_node = (const struct snmp_scalar_array_node*)(const void*)instance->node;
206*10465441SEvalZero   const struct snmp_scalar_array_node_def* array_node_def = (const struct snmp_scalar_array_node_def*)instance->reference.const_ptr;
207*10465441SEvalZero 
208*10465441SEvalZero   return array_node->set_test(array_node_def, value_len, value);
209*10465441SEvalZero }
210*10465441SEvalZero 
211*10465441SEvalZero static snmp_err_t
snmp_scalar_array_set_value(struct snmp_node_instance * instance,u16_t value_len,void * value)212*10465441SEvalZero snmp_scalar_array_set_value(struct snmp_node_instance* instance, u16_t value_len, void* value)
213*10465441SEvalZero {
214*10465441SEvalZero   const struct snmp_scalar_array_node* array_node = (const struct snmp_scalar_array_node*)(const void*)instance->node;
215*10465441SEvalZero   const struct snmp_scalar_array_node_def* array_node_def = (const struct snmp_scalar_array_node_def*)instance->reference.const_ptr;
216*10465441SEvalZero 
217*10465441SEvalZero   return array_node->set_value(array_node_def, value_len, value);
218*10465441SEvalZero }
219*10465441SEvalZero 
220*10465441SEvalZero #endif /* LWIP_SNMP */
221