Adam Green / EthernetInterface
Committer:
AdamGreen
Date:
Sat Sep 07 21:38:42 2013 +0000
Revision:
0:3b00827bb0b7
Sync to latest network stack source from github.

Who changed what in which revision?

UserRevisionLine numberNew contents of line
AdamGreen 0:3b00827bb0b7 1 /**
AdamGreen 0:3b00827bb0b7 2 * @file
AdamGreen 0:3b00827bb0b7 3 * Generic MIB tree structures.
AdamGreen 0:3b00827bb0b7 4 *
AdamGreen 0:3b00827bb0b7 5 * @todo namespace prefixes
AdamGreen 0:3b00827bb0b7 6 */
AdamGreen 0:3b00827bb0b7 7
AdamGreen 0:3b00827bb0b7 8 /*
AdamGreen 0:3b00827bb0b7 9 * Copyright (c) 2006 Axon Digital Design B.V., The Netherlands.
AdamGreen 0:3b00827bb0b7 10 * All rights reserved.
AdamGreen 0:3b00827bb0b7 11 *
AdamGreen 0:3b00827bb0b7 12 * Redistribution and use in source and binary forms, with or without modification,
AdamGreen 0:3b00827bb0b7 13 * are permitted provided that the following conditions are met:
AdamGreen 0:3b00827bb0b7 14 *
AdamGreen 0:3b00827bb0b7 15 * 1. Redistributions of source code must retain the above copyright notice,
AdamGreen 0:3b00827bb0b7 16 * this list of conditions and the following disclaimer.
AdamGreen 0:3b00827bb0b7 17 * 2. Redistributions in binary form must reproduce the above copyright notice,
AdamGreen 0:3b00827bb0b7 18 * this list of conditions and the following disclaimer in the documentation
AdamGreen 0:3b00827bb0b7 19 * and/or other materials provided with the distribution.
AdamGreen 0:3b00827bb0b7 20 * 3. The name of the author may not be used to endorse or promote products
AdamGreen 0:3b00827bb0b7 21 * derived from this software without specific prior written permission.
AdamGreen 0:3b00827bb0b7 22 *
AdamGreen 0:3b00827bb0b7 23 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
AdamGreen 0:3b00827bb0b7 24 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
AdamGreen 0:3b00827bb0b7 25 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
AdamGreen 0:3b00827bb0b7 26 * SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
AdamGreen 0:3b00827bb0b7 27 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
AdamGreen 0:3b00827bb0b7 28 * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
AdamGreen 0:3b00827bb0b7 29 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
AdamGreen 0:3b00827bb0b7 30 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
AdamGreen 0:3b00827bb0b7 31 * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
AdamGreen 0:3b00827bb0b7 32 * OF SUCH DAMAGE.
AdamGreen 0:3b00827bb0b7 33 *
AdamGreen 0:3b00827bb0b7 34 * Author: Christiaan Simons <christiaan.simons@axon.tv>
AdamGreen 0:3b00827bb0b7 35 */
AdamGreen 0:3b00827bb0b7 36
AdamGreen 0:3b00827bb0b7 37 #ifndef __LWIP_SNMP_STRUCTS_H__
AdamGreen 0:3b00827bb0b7 38 #define __LWIP_SNMP_STRUCTS_H__
AdamGreen 0:3b00827bb0b7 39
AdamGreen 0:3b00827bb0b7 40 #include "lwip/opt.h"
AdamGreen 0:3b00827bb0b7 41
AdamGreen 0:3b00827bb0b7 42 #if LWIP_SNMP /* don't build if not configured for use in lwipopts.h */
AdamGreen 0:3b00827bb0b7 43
AdamGreen 0:3b00827bb0b7 44 #include "lwip/snmp.h"
AdamGreen 0:3b00827bb0b7 45
AdamGreen 0:3b00827bb0b7 46 #if SNMP_PRIVATE_MIB
AdamGreen 0:3b00827bb0b7 47 /* When using a private MIB, you have to create a file 'private_mib.h' that contains
AdamGreen 0:3b00827bb0b7 48 * a 'struct mib_array_node mib_private' which contains your MIB. */
AdamGreen 0:3b00827bb0b7 49 #include "private_mib.h"
AdamGreen 0:3b00827bb0b7 50 #endif
AdamGreen 0:3b00827bb0b7 51
AdamGreen 0:3b00827bb0b7 52 #ifdef __cplusplus
AdamGreen 0:3b00827bb0b7 53 extern "C" {
AdamGreen 0:3b00827bb0b7 54 #endif
AdamGreen 0:3b00827bb0b7 55
AdamGreen 0:3b00827bb0b7 56 /* MIB object instance */
AdamGreen 0:3b00827bb0b7 57 #define MIB_OBJECT_NONE 0
AdamGreen 0:3b00827bb0b7 58 #define MIB_OBJECT_SCALAR 1
AdamGreen 0:3b00827bb0b7 59 #define MIB_OBJECT_TAB 2
AdamGreen 0:3b00827bb0b7 60
AdamGreen 0:3b00827bb0b7 61 /* MIB access types */
AdamGreen 0:3b00827bb0b7 62 #define MIB_ACCESS_READ 1
AdamGreen 0:3b00827bb0b7 63 #define MIB_ACCESS_WRITE 2
AdamGreen 0:3b00827bb0b7 64
AdamGreen 0:3b00827bb0b7 65 /* MIB object access */
AdamGreen 0:3b00827bb0b7 66 #define MIB_OBJECT_READ_ONLY MIB_ACCESS_READ
AdamGreen 0:3b00827bb0b7 67 #define MIB_OBJECT_READ_WRITE (MIB_ACCESS_READ | MIB_ACCESS_WRITE)
AdamGreen 0:3b00827bb0b7 68 #define MIB_OBJECT_WRITE_ONLY MIB_ACCESS_WRITE
AdamGreen 0:3b00827bb0b7 69 #define MIB_OBJECT_NOT_ACCESSIBLE 0
AdamGreen 0:3b00827bb0b7 70
AdamGreen 0:3b00827bb0b7 71 /** object definition returned by (get_object_def)() */
AdamGreen 0:3b00827bb0b7 72 struct obj_def
AdamGreen 0:3b00827bb0b7 73 {
AdamGreen 0:3b00827bb0b7 74 /* MIB_OBJECT_NONE (0), MIB_OBJECT_SCALAR (1), MIB_OBJECT_TAB (2) */
AdamGreen 0:3b00827bb0b7 75 u8_t instance;
AdamGreen 0:3b00827bb0b7 76 /* 0 read-only, 1 read-write, 2 write-only, 3 not-accessible */
AdamGreen 0:3b00827bb0b7 77 u8_t access;
AdamGreen 0:3b00827bb0b7 78 /* ASN type for this object */
AdamGreen 0:3b00827bb0b7 79 u8_t asn_type;
AdamGreen 0:3b00827bb0b7 80 /* value length (host length) */
AdamGreen 0:3b00827bb0b7 81 u16_t v_len;
AdamGreen 0:3b00827bb0b7 82 /* length of instance part of supplied object identifier */
AdamGreen 0:3b00827bb0b7 83 u8_t id_inst_len;
AdamGreen 0:3b00827bb0b7 84 /* instance part of supplied object identifier */
AdamGreen 0:3b00827bb0b7 85 s32_t *id_inst_ptr;
AdamGreen 0:3b00827bb0b7 86 };
AdamGreen 0:3b00827bb0b7 87
AdamGreen 0:3b00827bb0b7 88 struct snmp_name_ptr
AdamGreen 0:3b00827bb0b7 89 {
AdamGreen 0:3b00827bb0b7 90 u8_t ident_len;
AdamGreen 0:3b00827bb0b7 91 s32_t *ident;
AdamGreen 0:3b00827bb0b7 92 };
AdamGreen 0:3b00827bb0b7 93
AdamGreen 0:3b00827bb0b7 94 /** MIB const scalar (.0) node */
AdamGreen 0:3b00827bb0b7 95 #define MIB_NODE_SC 0x01
AdamGreen 0:3b00827bb0b7 96 /** MIB const array node */
AdamGreen 0:3b00827bb0b7 97 #define MIB_NODE_AR 0x02
AdamGreen 0:3b00827bb0b7 98 /** MIB array node (mem_malloced from RAM) */
AdamGreen 0:3b00827bb0b7 99 #define MIB_NODE_RA 0x03
AdamGreen 0:3b00827bb0b7 100 /** MIB list root node (mem_malloced from RAM) */
AdamGreen 0:3b00827bb0b7 101 #define MIB_NODE_LR 0x04
AdamGreen 0:3b00827bb0b7 102 /** MIB node for external objects */
AdamGreen 0:3b00827bb0b7 103 #define MIB_NODE_EX 0x05
AdamGreen 0:3b00827bb0b7 104
AdamGreen 0:3b00827bb0b7 105 /** node "base class" layout, the mandatory fields for a node */
AdamGreen 0:3b00827bb0b7 106 struct mib_node
AdamGreen 0:3b00827bb0b7 107 {
AdamGreen 0:3b00827bb0b7 108 /** returns struct obj_def for the given object identifier */
AdamGreen 0:3b00827bb0b7 109 void (*get_object_def)(u8_t ident_len, s32_t *ident, struct obj_def *od);
AdamGreen 0:3b00827bb0b7 110 /** returns object value for the given object identifier,
AdamGreen 0:3b00827bb0b7 111 @note the caller must allocate at least len bytes for the value */
AdamGreen 0:3b00827bb0b7 112 void (*get_value)(struct obj_def *od, u16_t len, void *value);
AdamGreen 0:3b00827bb0b7 113 /** tests length and/or range BEFORE setting */
AdamGreen 0:3b00827bb0b7 114 u8_t (*set_test)(struct obj_def *od, u16_t len, void *value);
AdamGreen 0:3b00827bb0b7 115 /** sets object value, only to be called when set_test() */
AdamGreen 0:3b00827bb0b7 116 void (*set_value)(struct obj_def *od, u16_t len, void *value);
AdamGreen 0:3b00827bb0b7 117 /** One out of MIB_NODE_AR, MIB_NODE_LR or MIB_NODE_EX */
AdamGreen 0:3b00827bb0b7 118 u8_t node_type;
AdamGreen 0:3b00827bb0b7 119 /* array or max list length */
AdamGreen 0:3b00827bb0b7 120 u16_t maxlength;
AdamGreen 0:3b00827bb0b7 121 };
AdamGreen 0:3b00827bb0b7 122
AdamGreen 0:3b00827bb0b7 123 /** derived node for scalars .0 index */
AdamGreen 0:3b00827bb0b7 124 typedef struct mib_node mib_scalar_node;
AdamGreen 0:3b00827bb0b7 125
AdamGreen 0:3b00827bb0b7 126 /** derived node, points to a fixed size const array
AdamGreen 0:3b00827bb0b7 127 of sub-identifiers plus a 'child' pointer */
AdamGreen 0:3b00827bb0b7 128 struct mib_array_node
AdamGreen 0:3b00827bb0b7 129 {
AdamGreen 0:3b00827bb0b7 130 /* inherited "base class" members */
AdamGreen 0:3b00827bb0b7 131 void (*get_object_def)(u8_t ident_len, s32_t *ident, struct obj_def *od);
AdamGreen 0:3b00827bb0b7 132 void (*get_value)(struct obj_def *od, u16_t len, void *value);
AdamGreen 0:3b00827bb0b7 133 u8_t (*set_test)(struct obj_def *od, u16_t len, void *value);
AdamGreen 0:3b00827bb0b7 134 void (*set_value)(struct obj_def *od, u16_t len, void *value);
AdamGreen 0:3b00827bb0b7 135
AdamGreen 0:3b00827bb0b7 136 u8_t node_type;
AdamGreen 0:3b00827bb0b7 137 u16_t maxlength;
AdamGreen 0:3b00827bb0b7 138
AdamGreen 0:3b00827bb0b7 139 /* additional struct members */
AdamGreen 0:3b00827bb0b7 140 const s32_t *objid;
AdamGreen 0:3b00827bb0b7 141 struct mib_node* const *nptr;
AdamGreen 0:3b00827bb0b7 142 };
AdamGreen 0:3b00827bb0b7 143
AdamGreen 0:3b00827bb0b7 144 /** derived node, points to a fixed size mem_malloced array
AdamGreen 0:3b00827bb0b7 145 of sub-identifiers plus a 'child' pointer */
AdamGreen 0:3b00827bb0b7 146 struct mib_ram_array_node
AdamGreen 0:3b00827bb0b7 147 {
AdamGreen 0:3b00827bb0b7 148 /* inherited "base class" members */
AdamGreen 0:3b00827bb0b7 149 void (*get_object_def)(u8_t ident_len, s32_t *ident, struct obj_def *od);
AdamGreen 0:3b00827bb0b7 150 void (*get_value)(struct obj_def *od, u16_t len, void *value);
AdamGreen 0:3b00827bb0b7 151 u8_t (*set_test)(struct obj_def *od, u16_t len, void *value);
AdamGreen 0:3b00827bb0b7 152 void (*set_value)(struct obj_def *od, u16_t len, void *value);
AdamGreen 0:3b00827bb0b7 153
AdamGreen 0:3b00827bb0b7 154 u8_t node_type;
AdamGreen 0:3b00827bb0b7 155 u16_t maxlength;
AdamGreen 0:3b00827bb0b7 156
AdamGreen 0:3b00827bb0b7 157 /* aditional struct members */
AdamGreen 0:3b00827bb0b7 158 s32_t *objid;
AdamGreen 0:3b00827bb0b7 159 struct mib_node **nptr;
AdamGreen 0:3b00827bb0b7 160 };
AdamGreen 0:3b00827bb0b7 161
AdamGreen 0:3b00827bb0b7 162 struct mib_list_node
AdamGreen 0:3b00827bb0b7 163 {
AdamGreen 0:3b00827bb0b7 164 struct mib_list_node *prev;
AdamGreen 0:3b00827bb0b7 165 struct mib_list_node *next;
AdamGreen 0:3b00827bb0b7 166 s32_t objid;
AdamGreen 0:3b00827bb0b7 167 struct mib_node *nptr;
AdamGreen 0:3b00827bb0b7 168 };
AdamGreen 0:3b00827bb0b7 169
AdamGreen 0:3b00827bb0b7 170 /** derived node, points to a doubly linked list
AdamGreen 0:3b00827bb0b7 171 of sub-identifiers plus a 'child' pointer */
AdamGreen 0:3b00827bb0b7 172 struct mib_list_rootnode
AdamGreen 0:3b00827bb0b7 173 {
AdamGreen 0:3b00827bb0b7 174 /* inherited "base class" members */
AdamGreen 0:3b00827bb0b7 175 void (*get_object_def)(u8_t ident_len, s32_t *ident, struct obj_def *od);
AdamGreen 0:3b00827bb0b7 176 void (*get_value)(struct obj_def *od, u16_t len, void *value);
AdamGreen 0:3b00827bb0b7 177 u8_t (*set_test)(struct obj_def *od, u16_t len, void *value);
AdamGreen 0:3b00827bb0b7 178 void (*set_value)(struct obj_def *od, u16_t len, void *value);
AdamGreen 0:3b00827bb0b7 179
AdamGreen 0:3b00827bb0b7 180 u8_t node_type;
AdamGreen 0:3b00827bb0b7 181 u16_t maxlength;
AdamGreen 0:3b00827bb0b7 182
AdamGreen 0:3b00827bb0b7 183 /* additional struct members */
AdamGreen 0:3b00827bb0b7 184 struct mib_list_node *head;
AdamGreen 0:3b00827bb0b7 185 struct mib_list_node *tail;
AdamGreen 0:3b00827bb0b7 186 /* counts list nodes in list */
AdamGreen 0:3b00827bb0b7 187 u16_t count;
AdamGreen 0:3b00827bb0b7 188 };
AdamGreen 0:3b00827bb0b7 189
AdamGreen 0:3b00827bb0b7 190 /** derived node, has access functions for mib object in external memory or device
AdamGreen 0:3b00827bb0b7 191 using 'tree_level' and 'idx', with a range 0 .. (level_length() - 1) */
AdamGreen 0:3b00827bb0b7 192 struct mib_external_node
AdamGreen 0:3b00827bb0b7 193 {
AdamGreen 0:3b00827bb0b7 194 /* inherited "base class" members */
AdamGreen 0:3b00827bb0b7 195 void (*get_object_def)(u8_t ident_len, s32_t *ident, struct obj_def *od);
AdamGreen 0:3b00827bb0b7 196 void (*get_value)(struct obj_def *od, u16_t len, void *value);
AdamGreen 0:3b00827bb0b7 197 u8_t (*set_test)(struct obj_def *od, u16_t len, void *value);
AdamGreen 0:3b00827bb0b7 198 void (*set_value)(struct obj_def *od, u16_t len, void *value);
AdamGreen 0:3b00827bb0b7 199
AdamGreen 0:3b00827bb0b7 200 u8_t node_type;
AdamGreen 0:3b00827bb0b7 201 u16_t maxlength;
AdamGreen 0:3b00827bb0b7 202
AdamGreen 0:3b00827bb0b7 203 /* additional struct members */
AdamGreen 0:3b00827bb0b7 204 /** points to an external (in memory) record of some sort of addressing
AdamGreen 0:3b00827bb0b7 205 information, passed to and interpreted by the funtions below */
AdamGreen 0:3b00827bb0b7 206 void* addr_inf;
AdamGreen 0:3b00827bb0b7 207 /** tree levels under this node */
AdamGreen 0:3b00827bb0b7 208 u8_t tree_levels;
AdamGreen 0:3b00827bb0b7 209 /** number of objects at this level */
AdamGreen 0:3b00827bb0b7 210 u16_t (*level_length)(void* addr_inf, u8_t level);
AdamGreen 0:3b00827bb0b7 211 /** compares object sub identifier with external id
AdamGreen 0:3b00827bb0b7 212 return zero when equal, nonzero when unequal */
AdamGreen 0:3b00827bb0b7 213 s32_t (*ident_cmp)(void* addr_inf, u8_t level, u16_t idx, s32_t sub_id);
AdamGreen 0:3b00827bb0b7 214 void (*get_objid)(void* addr_inf, u8_t level, u16_t idx, s32_t *sub_id);
AdamGreen 0:3b00827bb0b7 215
AdamGreen 0:3b00827bb0b7 216 /** async Questions */
AdamGreen 0:3b00827bb0b7 217 void (*get_object_def_q)(void* addr_inf, u8_t rid, u8_t ident_len, s32_t *ident);
AdamGreen 0:3b00827bb0b7 218 void (*get_value_q)(u8_t rid, struct obj_def *od);
AdamGreen 0:3b00827bb0b7 219 void (*set_test_q)(u8_t rid, struct obj_def *od);
AdamGreen 0:3b00827bb0b7 220 void (*set_value_q)(u8_t rid, struct obj_def *od, u16_t len, void *value);
AdamGreen 0:3b00827bb0b7 221 /** async Answers */
AdamGreen 0:3b00827bb0b7 222 void (*get_object_def_a)(u8_t rid, u8_t ident_len, s32_t *ident, struct obj_def *od);
AdamGreen 0:3b00827bb0b7 223 void (*get_value_a)(u8_t rid, struct obj_def *od, u16_t len, void *value);
AdamGreen 0:3b00827bb0b7 224 u8_t (*set_test_a)(u8_t rid, struct obj_def *od, u16_t len, void *value);
AdamGreen 0:3b00827bb0b7 225 void (*set_value_a)(u8_t rid, struct obj_def *od, u16_t len, void *value);
AdamGreen 0:3b00827bb0b7 226 /** async Panic Close (agent returns error reply,
AdamGreen 0:3b00827bb0b7 227 e.g. used for external transaction cleanup) */
AdamGreen 0:3b00827bb0b7 228 void (*get_object_def_pc)(u8_t rid, u8_t ident_len, s32_t *ident);
AdamGreen 0:3b00827bb0b7 229 void (*get_value_pc)(u8_t rid, struct obj_def *od);
AdamGreen 0:3b00827bb0b7 230 void (*set_test_pc)(u8_t rid, struct obj_def *od);
AdamGreen 0:3b00827bb0b7 231 void (*set_value_pc)(u8_t rid, struct obj_def *od);
AdamGreen 0:3b00827bb0b7 232 };
AdamGreen 0:3b00827bb0b7 233
AdamGreen 0:3b00827bb0b7 234 /** export MIB tree from mib2.c */
AdamGreen 0:3b00827bb0b7 235 extern const struct mib_array_node internet;
AdamGreen 0:3b00827bb0b7 236
AdamGreen 0:3b00827bb0b7 237 /** dummy function pointers for non-leaf MIB nodes from mib2.c */
AdamGreen 0:3b00827bb0b7 238 void noleafs_get_object_def(u8_t ident_len, s32_t *ident, struct obj_def *od);
AdamGreen 0:3b00827bb0b7 239 void noleafs_get_value(struct obj_def *od, u16_t len, void *value);
AdamGreen 0:3b00827bb0b7 240 u8_t noleafs_set_test(struct obj_def *od, u16_t len, void *value);
AdamGreen 0:3b00827bb0b7 241 void noleafs_set_value(struct obj_def *od, u16_t len, void *value);
AdamGreen 0:3b00827bb0b7 242
AdamGreen 0:3b00827bb0b7 243 void snmp_oidtoip(s32_t *ident, ip_addr_t *ip);
AdamGreen 0:3b00827bb0b7 244 void snmp_iptooid(ip_addr_t *ip, s32_t *ident);
AdamGreen 0:3b00827bb0b7 245 void snmp_ifindextonetif(s32_t ifindex, struct netif **netif);
AdamGreen 0:3b00827bb0b7 246 void snmp_netiftoifindex(struct netif *netif, s32_t *ifidx);
AdamGreen 0:3b00827bb0b7 247
AdamGreen 0:3b00827bb0b7 248 struct mib_list_node* snmp_mib_ln_alloc(s32_t id);
AdamGreen 0:3b00827bb0b7 249 void snmp_mib_ln_free(struct mib_list_node *ln);
AdamGreen 0:3b00827bb0b7 250 struct mib_list_rootnode* snmp_mib_lrn_alloc(void);
AdamGreen 0:3b00827bb0b7 251 void snmp_mib_lrn_free(struct mib_list_rootnode *lrn);
AdamGreen 0:3b00827bb0b7 252
AdamGreen 0:3b00827bb0b7 253 s8_t snmp_mib_node_insert(struct mib_list_rootnode *rn, s32_t objid, struct mib_list_node **insn);
AdamGreen 0:3b00827bb0b7 254 s8_t snmp_mib_node_find(struct mib_list_rootnode *rn, s32_t objid, struct mib_list_node **fn);
AdamGreen 0:3b00827bb0b7 255 struct mib_list_rootnode *snmp_mib_node_delete(struct mib_list_rootnode *rn, struct mib_list_node *n);
AdamGreen 0:3b00827bb0b7 256
AdamGreen 0:3b00827bb0b7 257 struct mib_node* snmp_search_tree(struct mib_node *node, u8_t ident_len, s32_t *ident, struct snmp_name_ptr *np);
AdamGreen 0:3b00827bb0b7 258 struct mib_node* snmp_expand_tree(struct mib_node *node, u8_t ident_len, s32_t *ident, struct snmp_obj_id *oidret);
AdamGreen 0:3b00827bb0b7 259 u8_t snmp_iso_prefix_tst(u8_t ident_len, s32_t *ident);
AdamGreen 0:3b00827bb0b7 260 u8_t snmp_iso_prefix_expand(u8_t ident_len, s32_t *ident, struct snmp_obj_id *oidret);
AdamGreen 0:3b00827bb0b7 261
AdamGreen 0:3b00827bb0b7 262 #ifdef __cplusplus
AdamGreen 0:3b00827bb0b7 263 }
AdamGreen 0:3b00827bb0b7 264 #endif
AdamGreen 0:3b00827bb0b7 265
AdamGreen 0:3b00827bb0b7 266 #endif /* LWIP_SNMP */
AdamGreen 0:3b00827bb0b7 267
AdamGreen 0:3b00827bb0b7 268 #endif /* __LWIP_SNMP_STRUCTS_H__ */