Arlindo Montagnoli / Mbed 2 deprecated ProjetoBB

ProjetoBB

Dependencies:   F7_Ethernet WebSocketClient mbed mcp3008

Fork of Nucleo_F746ZG_Ethernet by Dieter Graef

F7_Ethernet/lwip/core/snmp/mib_structs.c@0:f9b6112278fe, 2016-06-18 (annotated)

Committer:
DieterGraef
Date:
Sat Jun 18 10:49:12 2016 +0000
Revision:
0:f9b6112278fe
Ethernet for the NUCLEO STM32F746 Board Testprogram uses DHCP and NTP to set the clock

Who changed what in which revision?

UserRevisionLine numberNew contents of line
DieterGraef 0:f9b6112278fe 1 /**
DieterGraef 0:f9b6112278fe 2 * @file
DieterGraef 0:f9b6112278fe 3 * MIB tree access/construction functions.
DieterGraef 0:f9b6112278fe 4 */
DieterGraef 0:f9b6112278fe 5
DieterGraef 0:f9b6112278fe 6 /*
DieterGraef 0:f9b6112278fe 7 * Copyright (c) 2006 Axon Digital Design B.V., The Netherlands.
DieterGraef 0:f9b6112278fe 8 * All rights reserved.
DieterGraef 0:f9b6112278fe 9 *
DieterGraef 0:f9b6112278fe 10 * Redistribution and use in source and binary forms, with or without modification,
DieterGraef 0:f9b6112278fe 11 * are permitted provided that the following conditions are met:
DieterGraef 0:f9b6112278fe 12 *
DieterGraef 0:f9b6112278fe 13 * 1. Redistributions of source code must retain the above copyright notice,
DieterGraef 0:f9b6112278fe 14 * this list of conditions and the following disclaimer.
DieterGraef 0:f9b6112278fe 15 * 2. Redistributions in binary form must reproduce the above copyright notice,
DieterGraef 0:f9b6112278fe 16 * this list of conditions and the following disclaimer in the documentation
DieterGraef 0:f9b6112278fe 17 * and/or other materials provided with the distribution.
DieterGraef 0:f9b6112278fe 18 * 3. The name of the author may not be used to endorse or promote products
DieterGraef 0:f9b6112278fe 19 * derived from this software without specific prior written permission.
DieterGraef 0:f9b6112278fe 20 *
DieterGraef 0:f9b6112278fe 21 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
DieterGraef 0:f9b6112278fe 22 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
DieterGraef 0:f9b6112278fe 23 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
DieterGraef 0:f9b6112278fe 24 * SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
DieterGraef 0:f9b6112278fe 25 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
DieterGraef 0:f9b6112278fe 26 * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
DieterGraef 0:f9b6112278fe 27 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
DieterGraef 0:f9b6112278fe 28 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
DieterGraef 0:f9b6112278fe 29 * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
DieterGraef 0:f9b6112278fe 30 * OF SUCH DAMAGE.
DieterGraef 0:f9b6112278fe 31 *
DieterGraef 0:f9b6112278fe 32 * Author: Christiaan Simons <christiaan.simons@axon.tv>
DieterGraef 0:f9b6112278fe 33 */
DieterGraef 0:f9b6112278fe 34
DieterGraef 0:f9b6112278fe 35 #include "lwip/opt.h"
DieterGraef 0:f9b6112278fe 36
DieterGraef 0:f9b6112278fe 37 #if LWIP_SNMP /* don't build if not configured for use in lwipopts.h */
DieterGraef 0:f9b6112278fe 38
DieterGraef 0:f9b6112278fe 39 #include "lwip/snmp_structs.h"
DieterGraef 0:f9b6112278fe 40 #include "lwip/memp.h"
DieterGraef 0:f9b6112278fe 41 #include "lwip/netif.h"
DieterGraef 0:f9b6112278fe 42
DieterGraef 0:f9b6112278fe 43 /** .iso.org.dod.internet address prefix, @see snmp_iso_*() */
DieterGraef 0:f9b6112278fe 44 const s32_t prefix[4] = {1, 3, 6, 1};
DieterGraef 0:f9b6112278fe 45
DieterGraef 0:f9b6112278fe 46 #define NODE_STACK_SIZE (LWIP_SNMP_OBJ_ID_LEN)
DieterGraef 0:f9b6112278fe 47 /** node stack entry (old news?) */
DieterGraef 0:f9b6112278fe 48 struct nse
DieterGraef 0:f9b6112278fe 49 {
DieterGraef 0:f9b6112278fe 50 /** right child */
DieterGraef 0:f9b6112278fe 51 struct mib_node* r_ptr;
DieterGraef 0:f9b6112278fe 52 /** right child identifier */
DieterGraef 0:f9b6112278fe 53 s32_t r_id;
DieterGraef 0:f9b6112278fe 54 /** right child next level */
DieterGraef 0:f9b6112278fe 55 u8_t r_nl;
DieterGraef 0:f9b6112278fe 56 };
DieterGraef 0:f9b6112278fe 57 static u8_t node_stack_cnt;
DieterGraef 0:f9b6112278fe 58 static struct nse node_stack[NODE_STACK_SIZE];
DieterGraef 0:f9b6112278fe 59
DieterGraef 0:f9b6112278fe 60 /**
DieterGraef 0:f9b6112278fe 61 * Pushes nse struct onto stack.
DieterGraef 0:f9b6112278fe 62 */
DieterGraef 0:f9b6112278fe 63 static void
DieterGraef 0:f9b6112278fe 64 push_node(struct nse* node)
DieterGraef 0:f9b6112278fe 65 {
DieterGraef 0:f9b6112278fe 66 LWIP_ASSERT("node_stack_cnt < NODE_STACK_SIZE",node_stack_cnt < NODE_STACK_SIZE);
DieterGraef 0:f9b6112278fe 67 LWIP_DEBUGF(SNMP_MIB_DEBUG,("push_node() node=%p id=%"S32_F"\n",(void*)(node->r_ptr),node->r_id));
DieterGraef 0:f9b6112278fe 68 if (node_stack_cnt < NODE_STACK_SIZE)
DieterGraef 0:f9b6112278fe 69 {
DieterGraef 0:f9b6112278fe 70 node_stack[node_stack_cnt] = *node;
DieterGraef 0:f9b6112278fe 71 node_stack_cnt++;
DieterGraef 0:f9b6112278fe 72 }
DieterGraef 0:f9b6112278fe 73 }
DieterGraef 0:f9b6112278fe 74
DieterGraef 0:f9b6112278fe 75 /**
DieterGraef 0:f9b6112278fe 76 * Pops nse struct from stack.
DieterGraef 0:f9b6112278fe 77 */
DieterGraef 0:f9b6112278fe 78 static void
DieterGraef 0:f9b6112278fe 79 pop_node(struct nse* node)
DieterGraef 0:f9b6112278fe 80 {
DieterGraef 0:f9b6112278fe 81 if (node_stack_cnt > 0)
DieterGraef 0:f9b6112278fe 82 {
DieterGraef 0:f9b6112278fe 83 node_stack_cnt--;
DieterGraef 0:f9b6112278fe 84 *node = node_stack[node_stack_cnt];
DieterGraef 0:f9b6112278fe 85 }
DieterGraef 0:f9b6112278fe 86 LWIP_DEBUGF(SNMP_MIB_DEBUG,("pop_node() node=%p id=%"S32_F"\n",(void *)(node->r_ptr),node->r_id));
DieterGraef 0:f9b6112278fe 87 }
DieterGraef 0:f9b6112278fe 88
DieterGraef 0:f9b6112278fe 89 /**
DieterGraef 0:f9b6112278fe 90 * Conversion from ifIndex to lwIP netif
DieterGraef 0:f9b6112278fe 91 * @param ifindex is a s32_t object sub-identifier
DieterGraef 0:f9b6112278fe 92 * @param netif points to returned netif struct pointer
DieterGraef 0:f9b6112278fe 93 */
DieterGraef 0:f9b6112278fe 94 void
DieterGraef 0:f9b6112278fe 95 snmp_ifindextonetif(s32_t ifindex, struct netif **netif)
DieterGraef 0:f9b6112278fe 96 {
DieterGraef 0:f9b6112278fe 97 struct netif *nif = netif_list;
DieterGraef 0:f9b6112278fe 98 s32_t i, ifidx;
DieterGraef 0:f9b6112278fe 99
DieterGraef 0:f9b6112278fe 100 ifidx = ifindex - 1;
DieterGraef 0:f9b6112278fe 101 i = 0;
DieterGraef 0:f9b6112278fe 102 while ((nif != NULL) && (i < ifidx))
DieterGraef 0:f9b6112278fe 103 {
DieterGraef 0:f9b6112278fe 104 nif = nif->next;
DieterGraef 0:f9b6112278fe 105 i++;
DieterGraef 0:f9b6112278fe 106 }
DieterGraef 0:f9b6112278fe 107 *netif = nif;
DieterGraef 0:f9b6112278fe 108 }
DieterGraef 0:f9b6112278fe 109
DieterGraef 0:f9b6112278fe 110 /**
DieterGraef 0:f9b6112278fe 111 * Conversion from lwIP netif to ifIndex
DieterGraef 0:f9b6112278fe 112 * @param netif points to a netif struct
DieterGraef 0:f9b6112278fe 113 * @param ifidx points to s32_t object sub-identifier
DieterGraef 0:f9b6112278fe 114 */
DieterGraef 0:f9b6112278fe 115 void
DieterGraef 0:f9b6112278fe 116 snmp_netiftoifindex(struct netif *netif, s32_t *ifidx)
DieterGraef 0:f9b6112278fe 117 {
DieterGraef 0:f9b6112278fe 118 struct netif *nif = netif_list;
DieterGraef 0:f9b6112278fe 119 u16_t i;
DieterGraef 0:f9b6112278fe 120
DieterGraef 0:f9b6112278fe 121 i = 0;
DieterGraef 0:f9b6112278fe 122 while ((nif != NULL) && (nif != netif))
DieterGraef 0:f9b6112278fe 123 {
DieterGraef 0:f9b6112278fe 124 nif = nif->next;
DieterGraef 0:f9b6112278fe 125 i++;
DieterGraef 0:f9b6112278fe 126 }
DieterGraef 0:f9b6112278fe 127 *ifidx = i+1;
DieterGraef 0:f9b6112278fe 128 }
DieterGraef 0:f9b6112278fe 129
DieterGraef 0:f9b6112278fe 130 /**
DieterGraef 0:f9b6112278fe 131 * Conversion from oid to lwIP ip_addr
DieterGraef 0:f9b6112278fe 132 * @param ident points to s32_t ident[4] input
DieterGraef 0:f9b6112278fe 133 * @param ip points to output struct
DieterGraef 0:f9b6112278fe 134 */
DieterGraef 0:f9b6112278fe 135 void
DieterGraef 0:f9b6112278fe 136 snmp_oidtoip(s32_t *ident, ip_addr_t *ip)
DieterGraef 0:f9b6112278fe 137 {
DieterGraef 0:f9b6112278fe 138 IP4_ADDR(ip, ident[0], ident[1], ident[2], ident[3]);
DieterGraef 0:f9b6112278fe 139 }
DieterGraef 0:f9b6112278fe 140
DieterGraef 0:f9b6112278fe 141 /**
DieterGraef 0:f9b6112278fe 142 * Conversion from lwIP ip_addr to oid
DieterGraef 0:f9b6112278fe 143 * @param ip points to input struct
DieterGraef 0:f9b6112278fe 144 * @param ident points to s32_t ident[4] output
DieterGraef 0:f9b6112278fe 145 */
DieterGraef 0:f9b6112278fe 146 void
DieterGraef 0:f9b6112278fe 147 snmp_iptooid(ip_addr_t *ip, s32_t *ident)
DieterGraef 0:f9b6112278fe 148 {
DieterGraef 0:f9b6112278fe 149 ident[0] = ip4_addr1(ip);
DieterGraef 0:f9b6112278fe 150 ident[1] = ip4_addr2(ip);
DieterGraef 0:f9b6112278fe 151 ident[2] = ip4_addr3(ip);
DieterGraef 0:f9b6112278fe 152 ident[3] = ip4_addr4(ip);
DieterGraef 0:f9b6112278fe 153 }
DieterGraef 0:f9b6112278fe 154
DieterGraef 0:f9b6112278fe 155 struct mib_list_node *
DieterGraef 0:f9b6112278fe 156 snmp_mib_ln_alloc(s32_t id)
DieterGraef 0:f9b6112278fe 157 {
DieterGraef 0:f9b6112278fe 158 struct mib_list_node *ln;
DieterGraef 0:f9b6112278fe 159
DieterGraef 0:f9b6112278fe 160 ln = (struct mib_list_node *)memp_malloc(MEMP_SNMP_NODE);
DieterGraef 0:f9b6112278fe 161 if (ln != NULL)
DieterGraef 0:f9b6112278fe 162 {
DieterGraef 0:f9b6112278fe 163 ln->prev = NULL;
DieterGraef 0:f9b6112278fe 164 ln->next = NULL;
DieterGraef 0:f9b6112278fe 165 ln->objid = id;
DieterGraef 0:f9b6112278fe 166 ln->nptr = NULL;
DieterGraef 0:f9b6112278fe 167 }
DieterGraef 0:f9b6112278fe 168 return ln;
DieterGraef 0:f9b6112278fe 169 }
DieterGraef 0:f9b6112278fe 170
DieterGraef 0:f9b6112278fe 171 void
DieterGraef 0:f9b6112278fe 172 snmp_mib_ln_free(struct mib_list_node *ln)
DieterGraef 0:f9b6112278fe 173 {
DieterGraef 0:f9b6112278fe 174 memp_free(MEMP_SNMP_NODE, ln);
DieterGraef 0:f9b6112278fe 175 }
DieterGraef 0:f9b6112278fe 176
DieterGraef 0:f9b6112278fe 177 struct mib_list_rootnode *
DieterGraef 0:f9b6112278fe 178 snmp_mib_lrn_alloc(void)
DieterGraef 0:f9b6112278fe 179 {
DieterGraef 0:f9b6112278fe 180 struct mib_list_rootnode *lrn;
DieterGraef 0:f9b6112278fe 181
DieterGraef 0:f9b6112278fe 182 lrn = (struct mib_list_rootnode*)memp_malloc(MEMP_SNMP_ROOTNODE);
DieterGraef 0:f9b6112278fe 183 if (lrn != NULL)
DieterGraef 0:f9b6112278fe 184 {
DieterGraef 0:f9b6112278fe 185 lrn->get_object_def = noleafs_get_object_def;
DieterGraef 0:f9b6112278fe 186 lrn->get_value = noleafs_get_value;
DieterGraef 0:f9b6112278fe 187 lrn->set_test = noleafs_set_test;
DieterGraef 0:f9b6112278fe 188 lrn->set_value = noleafs_set_value;
DieterGraef 0:f9b6112278fe 189 lrn->node_type = MIB_NODE_LR;
DieterGraef 0:f9b6112278fe 190 lrn->maxlength = 0;
DieterGraef 0:f9b6112278fe 191 lrn->head = NULL;
DieterGraef 0:f9b6112278fe 192 lrn->tail = NULL;
DieterGraef 0:f9b6112278fe 193 lrn->count = 0;
DieterGraef 0:f9b6112278fe 194 }
DieterGraef 0:f9b6112278fe 195 return lrn;
DieterGraef 0:f9b6112278fe 196 }
DieterGraef 0:f9b6112278fe 197
DieterGraef 0:f9b6112278fe 198 void
DieterGraef 0:f9b6112278fe 199 snmp_mib_lrn_free(struct mib_list_rootnode *lrn)
DieterGraef 0:f9b6112278fe 200 {
DieterGraef 0:f9b6112278fe 201 memp_free(MEMP_SNMP_ROOTNODE, lrn);
DieterGraef 0:f9b6112278fe 202 }
DieterGraef 0:f9b6112278fe 203
DieterGraef 0:f9b6112278fe 204 /**
DieterGraef 0:f9b6112278fe 205 * Inserts node in idx list in a sorted
DieterGraef 0:f9b6112278fe 206 * (ascending order) fashion and
DieterGraef 0:f9b6112278fe 207 * allocates the node if needed.
DieterGraef 0:f9b6112278fe 208 *
DieterGraef 0:f9b6112278fe 209 * @param rn points to the root node
DieterGraef 0:f9b6112278fe 210 * @param objid is the object sub identifier
DieterGraef 0:f9b6112278fe 211 * @param insn points to a pointer to the inserted node
DieterGraef 0:f9b6112278fe 212 * used for constructing the tree.
DieterGraef 0:f9b6112278fe 213 * @return -1 if failed, 1 if inserted, 2 if present.
DieterGraef 0:f9b6112278fe 214 */
DieterGraef 0:f9b6112278fe 215 s8_t
DieterGraef 0:f9b6112278fe 216 snmp_mib_node_insert(struct mib_list_rootnode *rn, s32_t objid, struct mib_list_node **insn)
DieterGraef 0:f9b6112278fe 217 {
DieterGraef 0:f9b6112278fe 218 struct mib_list_node *nn;
DieterGraef 0:f9b6112278fe 219 s8_t insert;
DieterGraef 0:f9b6112278fe 220
DieterGraef 0:f9b6112278fe 221 LWIP_ASSERT("rn != NULL",rn != NULL);
DieterGraef 0:f9b6112278fe 222
DieterGraef 0:f9b6112278fe 223 /* -1 = malloc failure, 0 = not inserted, 1 = inserted, 2 = was present */
DieterGraef 0:f9b6112278fe 224 insert = 0;
DieterGraef 0:f9b6112278fe 225 if (rn->head == NULL)
DieterGraef 0:f9b6112278fe 226 {
DieterGraef 0:f9b6112278fe 227 /* empty list, add first node */
DieterGraef 0:f9b6112278fe 228 LWIP_DEBUGF(SNMP_MIB_DEBUG,("alloc empty list objid==%"S32_F"\n",objid));
DieterGraef 0:f9b6112278fe 229 nn = snmp_mib_ln_alloc(objid);
DieterGraef 0:f9b6112278fe 230 if (nn != NULL)
DieterGraef 0:f9b6112278fe 231 {
DieterGraef 0:f9b6112278fe 232 rn->head = nn;
DieterGraef 0:f9b6112278fe 233 rn->tail = nn;
DieterGraef 0:f9b6112278fe 234 *insn = nn;
DieterGraef 0:f9b6112278fe 235 insert = 1;
DieterGraef 0:f9b6112278fe 236 }
DieterGraef 0:f9b6112278fe 237 else
DieterGraef 0:f9b6112278fe 238 {
DieterGraef 0:f9b6112278fe 239 insert = -1;
DieterGraef 0:f9b6112278fe 240 }
DieterGraef 0:f9b6112278fe 241 }
DieterGraef 0:f9b6112278fe 242 else
DieterGraef 0:f9b6112278fe 243 {
DieterGraef 0:f9b6112278fe 244 struct mib_list_node *n;
DieterGraef 0:f9b6112278fe 245 /* at least one node is present */
DieterGraef 0:f9b6112278fe 246 n = rn->head;
DieterGraef 0:f9b6112278fe 247 while ((n != NULL) && (insert == 0))
DieterGraef 0:f9b6112278fe 248 {
DieterGraef 0:f9b6112278fe 249 if (n->objid == objid)
DieterGraef 0:f9b6112278fe 250 {
DieterGraef 0:f9b6112278fe 251 /* node is already there */
DieterGraef 0:f9b6112278fe 252 LWIP_DEBUGF(SNMP_MIB_DEBUG,("node already there objid==%"S32_F"\n",objid));
DieterGraef 0:f9b6112278fe 253 *insn = n;
DieterGraef 0:f9b6112278fe 254 insert = 2;
DieterGraef 0:f9b6112278fe 255 }
DieterGraef 0:f9b6112278fe 256 else if (n->objid < objid)
DieterGraef 0:f9b6112278fe 257 {
DieterGraef 0:f9b6112278fe 258 if (n->next == NULL)
DieterGraef 0:f9b6112278fe 259 {
DieterGraef 0:f9b6112278fe 260 /* alloc and insert at the tail */
DieterGraef 0:f9b6112278fe 261 LWIP_DEBUGF(SNMP_MIB_DEBUG,("alloc ins tail objid==%"S32_F"\n",objid));
DieterGraef 0:f9b6112278fe 262 nn = snmp_mib_ln_alloc(objid);
DieterGraef 0:f9b6112278fe 263 if (nn != NULL)
DieterGraef 0:f9b6112278fe 264 {
DieterGraef 0:f9b6112278fe 265 nn->next = NULL;
DieterGraef 0:f9b6112278fe 266 nn->prev = n;
DieterGraef 0:f9b6112278fe 267 n->next = nn;
DieterGraef 0:f9b6112278fe 268 rn->tail = nn;
DieterGraef 0:f9b6112278fe 269 *insn = nn;
DieterGraef 0:f9b6112278fe 270 insert = 1;
DieterGraef 0:f9b6112278fe 271 }
DieterGraef 0:f9b6112278fe 272 else
DieterGraef 0:f9b6112278fe 273 {
DieterGraef 0:f9b6112278fe 274 /* insertion failure */
DieterGraef 0:f9b6112278fe 275 insert = -1;
DieterGraef 0:f9b6112278fe 276 }
DieterGraef 0:f9b6112278fe 277 }
DieterGraef 0:f9b6112278fe 278 else
DieterGraef 0:f9b6112278fe 279 {
DieterGraef 0:f9b6112278fe 280 /* there's more to explore: traverse list */
DieterGraef 0:f9b6112278fe 281 LWIP_DEBUGF(SNMP_MIB_DEBUG,("traverse list\n"));
DieterGraef 0:f9b6112278fe 282 n = n->next;
DieterGraef 0:f9b6112278fe 283 }
DieterGraef 0:f9b6112278fe 284 }
DieterGraef 0:f9b6112278fe 285 else
DieterGraef 0:f9b6112278fe 286 {
DieterGraef 0:f9b6112278fe 287 /* n->objid > objid */
DieterGraef 0:f9b6112278fe 288 /* alloc and insert between n->prev and n */
DieterGraef 0:f9b6112278fe 289 LWIP_DEBUGF(SNMP_MIB_DEBUG,("alloc ins n->prev, objid==%"S32_F", n\n",objid));
DieterGraef 0:f9b6112278fe 290 nn = snmp_mib_ln_alloc(objid);
DieterGraef 0:f9b6112278fe 291 if (nn != NULL)
DieterGraef 0:f9b6112278fe 292 {
DieterGraef 0:f9b6112278fe 293 if (n->prev == NULL)
DieterGraef 0:f9b6112278fe 294 {
DieterGraef 0:f9b6112278fe 295 /* insert at the head */
DieterGraef 0:f9b6112278fe 296 nn->next = n;
DieterGraef 0:f9b6112278fe 297 nn->prev = NULL;
DieterGraef 0:f9b6112278fe 298 rn->head = nn;
DieterGraef 0:f9b6112278fe 299 n->prev = nn;
DieterGraef 0:f9b6112278fe 300 }
DieterGraef 0:f9b6112278fe 301 else
DieterGraef 0:f9b6112278fe 302 {
DieterGraef 0:f9b6112278fe 303 /* insert in the middle */
DieterGraef 0:f9b6112278fe 304 nn->next = n;
DieterGraef 0:f9b6112278fe 305 nn->prev = n->prev;
DieterGraef 0:f9b6112278fe 306 n->prev->next = nn;
DieterGraef 0:f9b6112278fe 307 n->prev = nn;
DieterGraef 0:f9b6112278fe 308 }
DieterGraef 0:f9b6112278fe 309 *insn = nn;
DieterGraef 0:f9b6112278fe 310 insert = 1;
DieterGraef 0:f9b6112278fe 311 }
DieterGraef 0:f9b6112278fe 312 else
DieterGraef 0:f9b6112278fe 313 {
DieterGraef 0:f9b6112278fe 314 /* insertion failure */
DieterGraef 0:f9b6112278fe 315 insert = -1;
DieterGraef 0:f9b6112278fe 316 }
DieterGraef 0:f9b6112278fe 317 }
DieterGraef 0:f9b6112278fe 318 }
DieterGraef 0:f9b6112278fe 319 }
DieterGraef 0:f9b6112278fe 320 if (insert == 1)
DieterGraef 0:f9b6112278fe 321 {
DieterGraef 0:f9b6112278fe 322 rn->count += 1;
DieterGraef 0:f9b6112278fe 323 }
DieterGraef 0:f9b6112278fe 324 LWIP_ASSERT("insert != 0",insert != 0);
DieterGraef 0:f9b6112278fe 325 return insert;
DieterGraef 0:f9b6112278fe 326 }
DieterGraef 0:f9b6112278fe 327
DieterGraef 0:f9b6112278fe 328 /**
DieterGraef 0:f9b6112278fe 329 * Finds node in idx list and returns deletion mark.
DieterGraef 0:f9b6112278fe 330 *
DieterGraef 0:f9b6112278fe 331 * @param rn points to the root node
DieterGraef 0:f9b6112278fe 332 * @param objid is the object sub identifier
DieterGraef 0:f9b6112278fe 333 * @param fn returns pointer to found node
DieterGraef 0:f9b6112278fe 334 * @return 0 if not found, 1 if deletable,
DieterGraef 0:f9b6112278fe 335 * 2 can't delete (2 or more children), 3 not a list_node
DieterGraef 0:f9b6112278fe 336 */
DieterGraef 0:f9b6112278fe 337 s8_t
DieterGraef 0:f9b6112278fe 338 snmp_mib_node_find(struct mib_list_rootnode *rn, s32_t objid, struct mib_list_node **fn)
DieterGraef 0:f9b6112278fe 339 {
DieterGraef 0:f9b6112278fe 340 s8_t fc;
DieterGraef 0:f9b6112278fe 341 struct mib_list_node *n;
DieterGraef 0:f9b6112278fe 342
DieterGraef 0:f9b6112278fe 343 LWIP_ASSERT("rn != NULL",rn != NULL);
DieterGraef 0:f9b6112278fe 344 n = rn->head;
DieterGraef 0:f9b6112278fe 345 while ((n != NULL) && (n->objid != objid))
DieterGraef 0:f9b6112278fe 346 {
DieterGraef 0:f9b6112278fe 347 n = n->next;
DieterGraef 0:f9b6112278fe 348 }
DieterGraef 0:f9b6112278fe 349 if (n == NULL)
DieterGraef 0:f9b6112278fe 350 {
DieterGraef 0:f9b6112278fe 351 fc = 0;
DieterGraef 0:f9b6112278fe 352 }
DieterGraef 0:f9b6112278fe 353 else if (n->nptr == NULL)
DieterGraef 0:f9b6112278fe 354 {
DieterGraef 0:f9b6112278fe 355 /* leaf, can delete node */
DieterGraef 0:f9b6112278fe 356 fc = 1;
DieterGraef 0:f9b6112278fe 357 }
DieterGraef 0:f9b6112278fe 358 else
DieterGraef 0:f9b6112278fe 359 {
DieterGraef 0:f9b6112278fe 360 struct mib_list_rootnode *r;
DieterGraef 0:f9b6112278fe 361
DieterGraef 0:f9b6112278fe 362 if (n->nptr->node_type == MIB_NODE_LR)
DieterGraef 0:f9b6112278fe 363 {
DieterGraef 0:f9b6112278fe 364 r = (struct mib_list_rootnode *)n->nptr;
DieterGraef 0:f9b6112278fe 365 if (r->count > 1)
DieterGraef 0:f9b6112278fe 366 {
DieterGraef 0:f9b6112278fe 367 /* can't delete node */
DieterGraef 0:f9b6112278fe 368 fc = 2;
DieterGraef 0:f9b6112278fe 369 }
DieterGraef 0:f9b6112278fe 370 else
DieterGraef 0:f9b6112278fe 371 {
DieterGraef 0:f9b6112278fe 372 /* count <= 1, can delete node */
DieterGraef 0:f9b6112278fe 373 fc = 1;
DieterGraef 0:f9b6112278fe 374 }
DieterGraef 0:f9b6112278fe 375 }
DieterGraef 0:f9b6112278fe 376 else
DieterGraef 0:f9b6112278fe 377 {
DieterGraef 0:f9b6112278fe 378 /* other node type */
DieterGraef 0:f9b6112278fe 379 fc = 3;
DieterGraef 0:f9b6112278fe 380 }
DieterGraef 0:f9b6112278fe 381 }
DieterGraef 0:f9b6112278fe 382 *fn = n;
DieterGraef 0:f9b6112278fe 383 return fc;
DieterGraef 0:f9b6112278fe 384 }
DieterGraef 0:f9b6112278fe 385
DieterGraef 0:f9b6112278fe 386 /**
DieterGraef 0:f9b6112278fe 387 * Removes node from idx list
DieterGraef 0:f9b6112278fe 388 * if it has a single child left.
DieterGraef 0:f9b6112278fe 389 *
DieterGraef 0:f9b6112278fe 390 * @param rn points to the root node
DieterGraef 0:f9b6112278fe 391 * @param n points to the node to delete
DieterGraef 0:f9b6112278fe 392 * @return the nptr to be freed by caller
DieterGraef 0:f9b6112278fe 393 */
DieterGraef 0:f9b6112278fe 394 struct mib_list_rootnode *
DieterGraef 0:f9b6112278fe 395 snmp_mib_node_delete(struct mib_list_rootnode *rn, struct mib_list_node *n)
DieterGraef 0:f9b6112278fe 396 {
DieterGraef 0:f9b6112278fe 397 struct mib_list_rootnode *next;
DieterGraef 0:f9b6112278fe 398
DieterGraef 0:f9b6112278fe 399 LWIP_ASSERT("rn != NULL",rn != NULL);
DieterGraef 0:f9b6112278fe 400 LWIP_ASSERT("n != NULL",n != NULL);
DieterGraef 0:f9b6112278fe 401
DieterGraef 0:f9b6112278fe 402 /* caller must remove this sub-tree */
DieterGraef 0:f9b6112278fe 403 next = (struct mib_list_rootnode*)(n->nptr);
DieterGraef 0:f9b6112278fe 404 rn->count -= 1;
DieterGraef 0:f9b6112278fe 405
DieterGraef 0:f9b6112278fe 406 if (n == rn->head)
DieterGraef 0:f9b6112278fe 407 {
DieterGraef 0:f9b6112278fe 408 rn->head = n->next;
DieterGraef 0:f9b6112278fe 409 if (n->next != NULL)
DieterGraef 0:f9b6112278fe 410 {
DieterGraef 0:f9b6112278fe 411 /* not last node, new list begin */
DieterGraef 0:f9b6112278fe 412 n->next->prev = NULL;
DieterGraef 0:f9b6112278fe 413 }
DieterGraef 0:f9b6112278fe 414 }
DieterGraef 0:f9b6112278fe 415 else if (n == rn->tail)
DieterGraef 0:f9b6112278fe 416 {
DieterGraef 0:f9b6112278fe 417 rn->tail = n->prev;
DieterGraef 0:f9b6112278fe 418 if (n->prev != NULL)
DieterGraef 0:f9b6112278fe 419 {
DieterGraef 0:f9b6112278fe 420 /* not last node, new list end */
DieterGraef 0:f9b6112278fe 421 n->prev->next = NULL;
DieterGraef 0:f9b6112278fe 422 }
DieterGraef 0:f9b6112278fe 423 }
DieterGraef 0:f9b6112278fe 424 else
DieterGraef 0:f9b6112278fe 425 {
DieterGraef 0:f9b6112278fe 426 /* node must be in the middle */
DieterGraef 0:f9b6112278fe 427 n->prev->next = n->next;
DieterGraef 0:f9b6112278fe 428 n->next->prev = n->prev;
DieterGraef 0:f9b6112278fe 429 }
DieterGraef 0:f9b6112278fe 430 LWIP_DEBUGF(SNMP_MIB_DEBUG,("free list objid==%"S32_F"\n",n->objid));
DieterGraef 0:f9b6112278fe 431 snmp_mib_ln_free(n);
DieterGraef 0:f9b6112278fe 432 if (rn->count == 0)
DieterGraef 0:f9b6112278fe 433 {
DieterGraef 0:f9b6112278fe 434 rn->head = NULL;
DieterGraef 0:f9b6112278fe 435 rn->tail = NULL;
DieterGraef 0:f9b6112278fe 436 }
DieterGraef 0:f9b6112278fe 437 return next;
DieterGraef 0:f9b6112278fe 438 }
DieterGraef 0:f9b6112278fe 439
DieterGraef 0:f9b6112278fe 440
DieterGraef 0:f9b6112278fe 441
DieterGraef 0:f9b6112278fe 442 /**
DieterGraef 0:f9b6112278fe 443 * Searches tree for the supplied (scalar?) object identifier.
DieterGraef 0:f9b6112278fe 444 *
DieterGraef 0:f9b6112278fe 445 * @param node points to the root of the tree ('.internet')
DieterGraef 0:f9b6112278fe 446 * @param ident_len the length of the supplied object identifier
DieterGraef 0:f9b6112278fe 447 * @param ident points to the array of sub identifiers
DieterGraef 0:f9b6112278fe 448 * @param np points to the found object instance (return)
DieterGraef 0:f9b6112278fe 449 * @return pointer to the requested parent (!) node if success, NULL otherwise
DieterGraef 0:f9b6112278fe 450 */
DieterGraef 0:f9b6112278fe 451 struct mib_node *
DieterGraef 0:f9b6112278fe 452 snmp_search_tree(struct mib_node *node, u8_t ident_len, s32_t *ident, struct snmp_name_ptr *np)
DieterGraef 0:f9b6112278fe 453 {
DieterGraef 0:f9b6112278fe 454 u8_t node_type, ext_level;
DieterGraef 0:f9b6112278fe 455
DieterGraef 0:f9b6112278fe 456 ext_level = 0;
DieterGraef 0:f9b6112278fe 457 LWIP_DEBUGF(SNMP_MIB_DEBUG,("node==%p *ident==%"S32_F"\n",(void*)node,*ident));
DieterGraef 0:f9b6112278fe 458 while (node != NULL)
DieterGraef 0:f9b6112278fe 459 {
DieterGraef 0:f9b6112278fe 460 node_type = node->node_type;
DieterGraef 0:f9b6112278fe 461 if ((node_type == MIB_NODE_AR) || (node_type == MIB_NODE_RA))
DieterGraef 0:f9b6112278fe 462 {
DieterGraef 0:f9b6112278fe 463 struct mib_array_node *an;
DieterGraef 0:f9b6112278fe 464 u16_t i;
DieterGraef 0:f9b6112278fe 465
DieterGraef 0:f9b6112278fe 466 if (ident_len > 0)
DieterGraef 0:f9b6112278fe 467 {
DieterGraef 0:f9b6112278fe 468 /* array node (internal ROM or RAM, fixed length) */
DieterGraef 0:f9b6112278fe 469 an = (struct mib_array_node *)node;
DieterGraef 0:f9b6112278fe 470 i = 0;
DieterGraef 0:f9b6112278fe 471 while ((i < an->maxlength) && (an->objid[i] != *ident))
DieterGraef 0:f9b6112278fe 472 {
DieterGraef 0:f9b6112278fe 473 i++;
DieterGraef 0:f9b6112278fe 474 }
DieterGraef 0:f9b6112278fe 475 if (i < an->maxlength)
DieterGraef 0:f9b6112278fe 476 {
DieterGraef 0:f9b6112278fe 477 /* found it, if available proceed to child, otherwise inspect leaf */
DieterGraef 0:f9b6112278fe 478 LWIP_DEBUGF(SNMP_MIB_DEBUG,("an->objid[%"U16_F"]==%"S32_F" *ident==%"S32_F"\n",i,an->objid[i],*ident));
DieterGraef 0:f9b6112278fe 479 if (an->nptr[i] == NULL)
DieterGraef 0:f9b6112278fe 480 {
DieterGraef 0:f9b6112278fe 481 /* a scalar leaf OR table,
DieterGraef 0:f9b6112278fe 482 inspect remaining instance number / table index */
DieterGraef 0:f9b6112278fe 483 np->ident_len = ident_len;
DieterGraef 0:f9b6112278fe 484 np->ident = ident;
DieterGraef 0:f9b6112278fe 485 return (struct mib_node*)an;
DieterGraef 0:f9b6112278fe 486 }
DieterGraef 0:f9b6112278fe 487 else
DieterGraef 0:f9b6112278fe 488 {
DieterGraef 0:f9b6112278fe 489 /* follow next child pointer */
DieterGraef 0:f9b6112278fe 490 ident++;
DieterGraef 0:f9b6112278fe 491 ident_len--;
DieterGraef 0:f9b6112278fe 492 node = an->nptr[i];
DieterGraef 0:f9b6112278fe 493 }
DieterGraef 0:f9b6112278fe 494 }
DieterGraef 0:f9b6112278fe 495 else
DieterGraef 0:f9b6112278fe 496 {
DieterGraef 0:f9b6112278fe 497 /* search failed, identifier mismatch (nosuchname) */
DieterGraef 0:f9b6112278fe 498 LWIP_DEBUGF(SNMP_MIB_DEBUG,("an search failed *ident==%"S32_F"\n",*ident));
DieterGraef 0:f9b6112278fe 499 return NULL;
DieterGraef 0:f9b6112278fe 500 }
DieterGraef 0:f9b6112278fe 501 }
DieterGraef 0:f9b6112278fe 502 else
DieterGraef 0:f9b6112278fe 503 {
DieterGraef 0:f9b6112278fe 504 /* search failed, short object identifier (nosuchname) */
DieterGraef 0:f9b6112278fe 505 LWIP_DEBUGF(SNMP_MIB_DEBUG,("an search failed, short object identifier\n"));
DieterGraef 0:f9b6112278fe 506 return NULL;
DieterGraef 0:f9b6112278fe 507 }
DieterGraef 0:f9b6112278fe 508 }
DieterGraef 0:f9b6112278fe 509 else if(node_type == MIB_NODE_LR)
DieterGraef 0:f9b6112278fe 510 {
DieterGraef 0:f9b6112278fe 511 struct mib_list_rootnode *lrn;
DieterGraef 0:f9b6112278fe 512 struct mib_list_node *ln;
DieterGraef 0:f9b6112278fe 513
DieterGraef 0:f9b6112278fe 514 if (ident_len > 0)
DieterGraef 0:f9b6112278fe 515 {
DieterGraef 0:f9b6112278fe 516 /* list root node (internal 'RAM', variable length) */
DieterGraef 0:f9b6112278fe 517 lrn = (struct mib_list_rootnode *)node;
DieterGraef 0:f9b6112278fe 518 ln = lrn->head;
DieterGraef 0:f9b6112278fe 519 /* iterate over list, head to tail */
DieterGraef 0:f9b6112278fe 520 while ((ln != NULL) && (ln->objid != *ident))
DieterGraef 0:f9b6112278fe 521 {
DieterGraef 0:f9b6112278fe 522 ln = ln->next;
DieterGraef 0:f9b6112278fe 523 }
DieterGraef 0:f9b6112278fe 524 if (ln != NULL)
DieterGraef 0:f9b6112278fe 525 {
DieterGraef 0:f9b6112278fe 526 /* found it, proceed to child */;
DieterGraef 0:f9b6112278fe 527 LWIP_DEBUGF(SNMP_MIB_DEBUG,("ln->objid==%"S32_F" *ident==%"S32_F"\n",ln->objid,*ident));
DieterGraef 0:f9b6112278fe 528 if (ln->nptr == NULL)
DieterGraef 0:f9b6112278fe 529 {
DieterGraef 0:f9b6112278fe 530 np->ident_len = ident_len;
DieterGraef 0:f9b6112278fe 531 np->ident = ident;
DieterGraef 0:f9b6112278fe 532 return (struct mib_node*)lrn;
DieterGraef 0:f9b6112278fe 533 }
DieterGraef 0:f9b6112278fe 534 else
DieterGraef 0:f9b6112278fe 535 {
DieterGraef 0:f9b6112278fe 536 /* follow next child pointer */
DieterGraef 0:f9b6112278fe 537 ident_len--;
DieterGraef 0:f9b6112278fe 538 ident++;
DieterGraef 0:f9b6112278fe 539 node = ln->nptr;
DieterGraef 0:f9b6112278fe 540 }
DieterGraef 0:f9b6112278fe 541 }
DieterGraef 0:f9b6112278fe 542 else
DieterGraef 0:f9b6112278fe 543 {
DieterGraef 0:f9b6112278fe 544 /* search failed */
DieterGraef 0:f9b6112278fe 545 LWIP_DEBUGF(SNMP_MIB_DEBUG,("ln search failed *ident==%"S32_F"\n",*ident));
DieterGraef 0:f9b6112278fe 546 return NULL;
DieterGraef 0:f9b6112278fe 547 }
DieterGraef 0:f9b6112278fe 548 }
DieterGraef 0:f9b6112278fe 549 else
DieterGraef 0:f9b6112278fe 550 {
DieterGraef 0:f9b6112278fe 551 /* search failed, short object identifier (nosuchname) */
DieterGraef 0:f9b6112278fe 552 LWIP_DEBUGF(SNMP_MIB_DEBUG,("ln search failed, short object identifier\n"));
DieterGraef 0:f9b6112278fe 553 return NULL;
DieterGraef 0:f9b6112278fe 554 }
DieterGraef 0:f9b6112278fe 555 }
DieterGraef 0:f9b6112278fe 556 else if(node_type == MIB_NODE_EX)
DieterGraef 0:f9b6112278fe 557 {
DieterGraef 0:f9b6112278fe 558 struct mib_external_node *en;
DieterGraef 0:f9b6112278fe 559 u16_t i, len;
DieterGraef 0:f9b6112278fe 560
DieterGraef 0:f9b6112278fe 561 if (ident_len > 0)
DieterGraef 0:f9b6112278fe 562 {
DieterGraef 0:f9b6112278fe 563 /* external node (addressing and access via functions) */
DieterGraef 0:f9b6112278fe 564 en = (struct mib_external_node *)node;
DieterGraef 0:f9b6112278fe 565
DieterGraef 0:f9b6112278fe 566 i = 0;
DieterGraef 0:f9b6112278fe 567 len = en->level_length(en->addr_inf,ext_level);
DieterGraef 0:f9b6112278fe 568 while ((i < len) && (en->ident_cmp(en->addr_inf,ext_level,i,*ident) != 0))
DieterGraef 0:f9b6112278fe 569 {
DieterGraef 0:f9b6112278fe 570 i++;
DieterGraef 0:f9b6112278fe 571 }
DieterGraef 0:f9b6112278fe 572 if (i < len)
DieterGraef 0:f9b6112278fe 573 {
DieterGraef 0:f9b6112278fe 574 s32_t debug_id;
DieterGraef 0:f9b6112278fe 575
DieterGraef 0:f9b6112278fe 576 en->get_objid(en->addr_inf,ext_level,i,&debug_id);
DieterGraef 0:f9b6112278fe 577 LWIP_DEBUGF(SNMP_MIB_DEBUG,("en->objid==%"S32_F" *ident==%"S32_F"\n",debug_id,*ident));
DieterGraef 0:f9b6112278fe 578 if ((ext_level + 1) == en->tree_levels)
DieterGraef 0:f9b6112278fe 579 {
DieterGraef 0:f9b6112278fe 580 np->ident_len = ident_len;
DieterGraef 0:f9b6112278fe 581 np->ident = ident;
DieterGraef 0:f9b6112278fe 582 return (struct mib_node*)en;
DieterGraef 0:f9b6112278fe 583 }
DieterGraef 0:f9b6112278fe 584 else
DieterGraef 0:f9b6112278fe 585 {
DieterGraef 0:f9b6112278fe 586 /* found it, proceed to child */
DieterGraef 0:f9b6112278fe 587 ident_len--;
DieterGraef 0:f9b6112278fe 588 ident++;
DieterGraef 0:f9b6112278fe 589 ext_level++;
DieterGraef 0:f9b6112278fe 590 }
DieterGraef 0:f9b6112278fe 591 }
DieterGraef 0:f9b6112278fe 592 else
DieterGraef 0:f9b6112278fe 593 {
DieterGraef 0:f9b6112278fe 594 /* search failed */
DieterGraef 0:f9b6112278fe 595 LWIP_DEBUGF(SNMP_MIB_DEBUG,("en search failed *ident==%"S32_F"\n",*ident));
DieterGraef 0:f9b6112278fe 596 return NULL;
DieterGraef 0:f9b6112278fe 597 }
DieterGraef 0:f9b6112278fe 598 }
DieterGraef 0:f9b6112278fe 599 else
DieterGraef 0:f9b6112278fe 600 {
DieterGraef 0:f9b6112278fe 601 /* search failed, short object identifier (nosuchname) */
DieterGraef 0:f9b6112278fe 602 LWIP_DEBUGF(SNMP_MIB_DEBUG,("en search failed, short object identifier\n"));
DieterGraef 0:f9b6112278fe 603 return NULL;
DieterGraef 0:f9b6112278fe 604 }
DieterGraef 0:f9b6112278fe 605 }
DieterGraef 0:f9b6112278fe 606 else if (node_type == MIB_NODE_SC)
DieterGraef 0:f9b6112278fe 607 {
DieterGraef 0:f9b6112278fe 608 mib_scalar_node *sn;
DieterGraef 0:f9b6112278fe 609
DieterGraef 0:f9b6112278fe 610 sn = (mib_scalar_node *)node;
DieterGraef 0:f9b6112278fe 611 if ((ident_len == 1) && (*ident == 0))
DieterGraef 0:f9b6112278fe 612 {
DieterGraef 0:f9b6112278fe 613 np->ident_len = ident_len;
DieterGraef 0:f9b6112278fe 614 np->ident = ident;
DieterGraef 0:f9b6112278fe 615 return (struct mib_node*)sn;
DieterGraef 0:f9b6112278fe 616 }
DieterGraef 0:f9b6112278fe 617 else
DieterGraef 0:f9b6112278fe 618 {
DieterGraef 0:f9b6112278fe 619 /* search failed, short object identifier (nosuchname) */
DieterGraef 0:f9b6112278fe 620 LWIP_DEBUGF(SNMP_MIB_DEBUG,("search failed, invalid object identifier length\n"));
DieterGraef 0:f9b6112278fe 621 return NULL;
DieterGraef 0:f9b6112278fe 622 }
DieterGraef 0:f9b6112278fe 623 }
DieterGraef 0:f9b6112278fe 624 else
DieterGraef 0:f9b6112278fe 625 {
DieterGraef 0:f9b6112278fe 626 /* unknown node_type */
DieterGraef 0:f9b6112278fe 627 LWIP_DEBUGF(SNMP_MIB_DEBUG,("search failed node_type %"U16_F" unkown\n",(u16_t)node_type));
DieterGraef 0:f9b6112278fe 628 return NULL;
DieterGraef 0:f9b6112278fe 629 }
DieterGraef 0:f9b6112278fe 630 }
DieterGraef 0:f9b6112278fe 631 /* done, found nothing */
DieterGraef 0:f9b6112278fe 632 LWIP_DEBUGF(SNMP_MIB_DEBUG,("search failed node==%p\n",(void*)node));
DieterGraef 0:f9b6112278fe 633 return NULL;
DieterGraef 0:f9b6112278fe 634 }
DieterGraef 0:f9b6112278fe 635
DieterGraef 0:f9b6112278fe 636 /**
DieterGraef 0:f9b6112278fe 637 * Test table for presence of at least one table entry.
DieterGraef 0:f9b6112278fe 638 */
DieterGraef 0:f9b6112278fe 639 static u8_t
DieterGraef 0:f9b6112278fe 640 empty_table(struct mib_node *node)
DieterGraef 0:f9b6112278fe 641 {
DieterGraef 0:f9b6112278fe 642 u8_t node_type;
DieterGraef 0:f9b6112278fe 643 u8_t empty = 0;
DieterGraef 0:f9b6112278fe 644
DieterGraef 0:f9b6112278fe 645 if (node != NULL)
DieterGraef 0:f9b6112278fe 646 {
DieterGraef 0:f9b6112278fe 647 node_type = node->node_type;
DieterGraef 0:f9b6112278fe 648 if (node_type == MIB_NODE_LR)
DieterGraef 0:f9b6112278fe 649 {
DieterGraef 0:f9b6112278fe 650 struct mib_list_rootnode *lrn;
DieterGraef 0:f9b6112278fe 651 lrn = (struct mib_list_rootnode *)node;
DieterGraef 0:f9b6112278fe 652 if ((lrn->count == 0) || (lrn->head == NULL))
DieterGraef 0:f9b6112278fe 653 {
DieterGraef 0:f9b6112278fe 654 empty = 1;
DieterGraef 0:f9b6112278fe 655 }
DieterGraef 0:f9b6112278fe 656 }
DieterGraef 0:f9b6112278fe 657 else if ((node_type == MIB_NODE_AR) || (node_type == MIB_NODE_RA))
DieterGraef 0:f9b6112278fe 658 {
DieterGraef 0:f9b6112278fe 659 struct mib_array_node *an;
DieterGraef 0:f9b6112278fe 660 an = (struct mib_array_node *)node;
DieterGraef 0:f9b6112278fe 661 if ((an->maxlength == 0) || (an->nptr == NULL))
DieterGraef 0:f9b6112278fe 662 {
DieterGraef 0:f9b6112278fe 663 empty = 1;
DieterGraef 0:f9b6112278fe 664 }
DieterGraef 0:f9b6112278fe 665 }
DieterGraef 0:f9b6112278fe 666 else if (node_type == MIB_NODE_EX)
DieterGraef 0:f9b6112278fe 667 {
DieterGraef 0:f9b6112278fe 668 struct mib_external_node *en;
DieterGraef 0:f9b6112278fe 669 en = (struct mib_external_node *)node;
DieterGraef 0:f9b6112278fe 670 if (en->tree_levels == 0)
DieterGraef 0:f9b6112278fe 671 {
DieterGraef 0:f9b6112278fe 672 empty = 1;
DieterGraef 0:f9b6112278fe 673 }
DieterGraef 0:f9b6112278fe 674 }
DieterGraef 0:f9b6112278fe 675 }
DieterGraef 0:f9b6112278fe 676 return empty;
DieterGraef 0:f9b6112278fe 677 }
DieterGraef 0:f9b6112278fe 678
DieterGraef 0:f9b6112278fe 679 /**
DieterGraef 0:f9b6112278fe 680 * Tree expansion.
DieterGraef 0:f9b6112278fe 681 */
DieterGraef 0:f9b6112278fe 682 struct mib_node *
DieterGraef 0:f9b6112278fe 683 snmp_expand_tree(struct mib_node *node, u8_t ident_len, s32_t *ident, struct snmp_obj_id *oidret)
DieterGraef 0:f9b6112278fe 684 {
DieterGraef 0:f9b6112278fe 685 u8_t node_type, ext_level, climb_tree;
DieterGraef 0:f9b6112278fe 686
DieterGraef 0:f9b6112278fe 687 ext_level = 0;
DieterGraef 0:f9b6112278fe 688 /* reset node stack */
DieterGraef 0:f9b6112278fe 689 node_stack_cnt = 0;
DieterGraef 0:f9b6112278fe 690 while (node != NULL)
DieterGraef 0:f9b6112278fe 691 {
DieterGraef 0:f9b6112278fe 692 climb_tree = 0;
DieterGraef 0:f9b6112278fe 693 node_type = node->node_type;
DieterGraef 0:f9b6112278fe 694 if ((node_type == MIB_NODE_AR) || (node_type == MIB_NODE_RA))
DieterGraef 0:f9b6112278fe 695 {
DieterGraef 0:f9b6112278fe 696 struct mib_array_node *an;
DieterGraef 0:f9b6112278fe 697 u16_t i;
DieterGraef 0:f9b6112278fe 698
DieterGraef 0:f9b6112278fe 699 /* array node (internal ROM or RAM, fixed length) */
DieterGraef 0:f9b6112278fe 700 an = (struct mib_array_node *)node;
DieterGraef 0:f9b6112278fe 701 if (ident_len > 0)
DieterGraef 0:f9b6112278fe 702 {
DieterGraef 0:f9b6112278fe 703 i = 0;
DieterGraef 0:f9b6112278fe 704 while ((i < an->maxlength) && (an->objid[i] < *ident))
DieterGraef 0:f9b6112278fe 705 {
DieterGraef 0:f9b6112278fe 706 i++;
DieterGraef 0:f9b6112278fe 707 }
DieterGraef 0:f9b6112278fe 708 if (i < an->maxlength)
DieterGraef 0:f9b6112278fe 709 {
DieterGraef 0:f9b6112278fe 710 LWIP_DEBUGF(SNMP_MIB_DEBUG,("an->objid[%"U16_F"]==%"S32_F" *ident==%"S32_F"\n",i,an->objid[i],*ident));
DieterGraef 0:f9b6112278fe 711 /* add identifier to oidret */
DieterGraef 0:f9b6112278fe 712 oidret->id[oidret->len] = an->objid[i];
DieterGraef 0:f9b6112278fe 713 (oidret->len)++;
DieterGraef 0:f9b6112278fe 714
DieterGraef 0:f9b6112278fe 715 if (an->nptr[i] == NULL)
DieterGraef 0:f9b6112278fe 716 {
DieterGraef 0:f9b6112278fe 717 LWIP_DEBUGF(SNMP_MIB_DEBUG,("leaf node\n"));
DieterGraef 0:f9b6112278fe 718 /* leaf node (e.g. in a fixed size table) */
DieterGraef 0:f9b6112278fe 719 if (an->objid[i] > *ident)
DieterGraef 0:f9b6112278fe 720 {
DieterGraef 0:f9b6112278fe 721 return (struct mib_node*)an;
DieterGraef 0:f9b6112278fe 722 }
DieterGraef 0:f9b6112278fe 723 else if ((i + 1) < an->maxlength)
DieterGraef 0:f9b6112278fe 724 {
DieterGraef 0:f9b6112278fe 725 /* an->objid[i] == *ident */
DieterGraef 0:f9b6112278fe 726 (oidret->len)--;
DieterGraef 0:f9b6112278fe 727 oidret->id[oidret->len] = an->objid[i + 1];
DieterGraef 0:f9b6112278fe 728 (oidret->len)++;
DieterGraef 0:f9b6112278fe 729 return (struct mib_node*)an;
DieterGraef 0:f9b6112278fe 730 }
DieterGraef 0:f9b6112278fe 731 else
DieterGraef 0:f9b6112278fe 732 {
DieterGraef 0:f9b6112278fe 733 /* (i + 1) == an->maxlength */
DieterGraef 0:f9b6112278fe 734 (oidret->len)--;
DieterGraef 0:f9b6112278fe 735 climb_tree = 1;
DieterGraef 0:f9b6112278fe 736 }
DieterGraef 0:f9b6112278fe 737 }
DieterGraef 0:f9b6112278fe 738 else
DieterGraef 0:f9b6112278fe 739 {
DieterGraef 0:f9b6112278fe 740 u8_t j;
DieterGraef 0:f9b6112278fe 741 struct nse cur_node;
DieterGraef 0:f9b6112278fe 742
DieterGraef 0:f9b6112278fe 743 LWIP_DEBUGF(SNMP_MIB_DEBUG,("non-leaf node\n"));
DieterGraef 0:f9b6112278fe 744 /* non-leaf, store right child ptr and id */
DieterGraef 0:f9b6112278fe 745 LWIP_ASSERT("i < 0xff", i < 0xff);
DieterGraef 0:f9b6112278fe 746 j = (u8_t)i + 1;
DieterGraef 0:f9b6112278fe 747 while ((j < an->maxlength) && (empty_table(an->nptr[j])))
DieterGraef 0:f9b6112278fe 748 {
DieterGraef 0:f9b6112278fe 749 j++;
DieterGraef 0:f9b6112278fe 750 }
DieterGraef 0:f9b6112278fe 751 if (j < an->maxlength)
DieterGraef 0:f9b6112278fe 752 {
DieterGraef 0:f9b6112278fe 753 cur_node.r_ptr = an->nptr[j];
DieterGraef 0:f9b6112278fe 754 cur_node.r_id = an->objid[j];
DieterGraef 0:f9b6112278fe 755 cur_node.r_nl = 0;
DieterGraef 0:f9b6112278fe 756 }
DieterGraef 0:f9b6112278fe 757 else
DieterGraef 0:f9b6112278fe 758 {
DieterGraef 0:f9b6112278fe 759 cur_node.r_ptr = NULL;
DieterGraef 0:f9b6112278fe 760 }
DieterGraef 0:f9b6112278fe 761 push_node(&cur_node);
DieterGraef 0:f9b6112278fe 762 if (an->objid[i] == *ident)
DieterGraef 0:f9b6112278fe 763 {
DieterGraef 0:f9b6112278fe 764 ident_len--;
DieterGraef 0:f9b6112278fe 765 ident++;
DieterGraef 0:f9b6112278fe 766 }
DieterGraef 0:f9b6112278fe 767 else
DieterGraef 0:f9b6112278fe 768 {
DieterGraef 0:f9b6112278fe 769 /* an->objid[i] < *ident */
DieterGraef 0:f9b6112278fe 770 ident_len = 0;
DieterGraef 0:f9b6112278fe 771 }
DieterGraef 0:f9b6112278fe 772 /* follow next child pointer */
DieterGraef 0:f9b6112278fe 773 node = an->nptr[i];
DieterGraef 0:f9b6112278fe 774 }
DieterGraef 0:f9b6112278fe 775 }
DieterGraef 0:f9b6112278fe 776 else
DieterGraef 0:f9b6112278fe 777 {
DieterGraef 0:f9b6112278fe 778 /* i == an->maxlength */
DieterGraef 0:f9b6112278fe 779 climb_tree = 1;
DieterGraef 0:f9b6112278fe 780 }
DieterGraef 0:f9b6112278fe 781 }
DieterGraef 0:f9b6112278fe 782 else
DieterGraef 0:f9b6112278fe 783 {
DieterGraef 0:f9b6112278fe 784 u8_t j;
DieterGraef 0:f9b6112278fe 785 /* ident_len == 0, complete with leftmost '.thing' */
DieterGraef 0:f9b6112278fe 786 j = 0;
DieterGraef 0:f9b6112278fe 787 while ((j < an->maxlength) && empty_table(an->nptr[j]))
DieterGraef 0:f9b6112278fe 788 {
DieterGraef 0:f9b6112278fe 789 j++;
DieterGraef 0:f9b6112278fe 790 }
DieterGraef 0:f9b6112278fe 791 if (j < an->maxlength)
DieterGraef 0:f9b6112278fe 792 {
DieterGraef 0:f9b6112278fe 793 LWIP_DEBUGF(SNMP_MIB_DEBUG,("left an->objid[j]==%"S32_F"\n",an->objid[j]));
DieterGraef 0:f9b6112278fe 794 oidret->id[oidret->len] = an->objid[j];
DieterGraef 0:f9b6112278fe 795 (oidret->len)++;
DieterGraef 0:f9b6112278fe 796 if (an->nptr[j] == NULL)
DieterGraef 0:f9b6112278fe 797 {
DieterGraef 0:f9b6112278fe 798 /* leaf node */
DieterGraef 0:f9b6112278fe 799 return (struct mib_node*)an;
DieterGraef 0:f9b6112278fe 800 }
DieterGraef 0:f9b6112278fe 801 else
DieterGraef 0:f9b6112278fe 802 {
DieterGraef 0:f9b6112278fe 803 /* no leaf, continue */
DieterGraef 0:f9b6112278fe 804 node = an->nptr[j];
DieterGraef 0:f9b6112278fe 805 }
DieterGraef 0:f9b6112278fe 806 }
DieterGraef 0:f9b6112278fe 807 else
DieterGraef 0:f9b6112278fe 808 {
DieterGraef 0:f9b6112278fe 809 /* j == an->maxlength */
DieterGraef 0:f9b6112278fe 810 climb_tree = 1;
DieterGraef 0:f9b6112278fe 811 }
DieterGraef 0:f9b6112278fe 812 }
DieterGraef 0:f9b6112278fe 813 }
DieterGraef 0:f9b6112278fe 814 else if(node_type == MIB_NODE_LR)
DieterGraef 0:f9b6112278fe 815 {
DieterGraef 0:f9b6112278fe 816 struct mib_list_rootnode *lrn;
DieterGraef 0:f9b6112278fe 817 struct mib_list_node *ln;
DieterGraef 0:f9b6112278fe 818
DieterGraef 0:f9b6112278fe 819 /* list root node (internal 'RAM', variable length) */
DieterGraef 0:f9b6112278fe 820 lrn = (struct mib_list_rootnode *)node;
DieterGraef 0:f9b6112278fe 821 if (ident_len > 0)
DieterGraef 0:f9b6112278fe 822 {
DieterGraef 0:f9b6112278fe 823 ln = lrn->head;
DieterGraef 0:f9b6112278fe 824 /* iterate over list, head to tail */
DieterGraef 0:f9b6112278fe 825 while ((ln != NULL) && (ln->objid < *ident))
DieterGraef 0:f9b6112278fe 826 {
DieterGraef 0:f9b6112278fe 827 ln = ln->next;
DieterGraef 0:f9b6112278fe 828 }
DieterGraef 0:f9b6112278fe 829 if (ln != NULL)
DieterGraef 0:f9b6112278fe 830 {
DieterGraef 0:f9b6112278fe 831 LWIP_DEBUGF(SNMP_MIB_DEBUG,("ln->objid==%"S32_F" *ident==%"S32_F"\n",ln->objid,*ident));
DieterGraef 0:f9b6112278fe 832 oidret->id[oidret->len] = ln->objid;
DieterGraef 0:f9b6112278fe 833 (oidret->len)++;
DieterGraef 0:f9b6112278fe 834 if (ln->nptr == NULL)
DieterGraef 0:f9b6112278fe 835 {
DieterGraef 0:f9b6112278fe 836 /* leaf node */
DieterGraef 0:f9b6112278fe 837 if (ln->objid > *ident)
DieterGraef 0:f9b6112278fe 838 {
DieterGraef 0:f9b6112278fe 839 return (struct mib_node*)lrn;
DieterGraef 0:f9b6112278fe 840 }
DieterGraef 0:f9b6112278fe 841 else if (ln->next != NULL)
DieterGraef 0:f9b6112278fe 842 {
DieterGraef 0:f9b6112278fe 843 /* ln->objid == *ident */
DieterGraef 0:f9b6112278fe 844 (oidret->len)--;
DieterGraef 0:f9b6112278fe 845 oidret->id[oidret->len] = ln->next->objid;
DieterGraef 0:f9b6112278fe 846 (oidret->len)++;
DieterGraef 0:f9b6112278fe 847 return (struct mib_node*)lrn;
DieterGraef 0:f9b6112278fe 848 }
DieterGraef 0:f9b6112278fe 849 else
DieterGraef 0:f9b6112278fe 850 {
DieterGraef 0:f9b6112278fe 851 /* ln->next == NULL */
DieterGraef 0:f9b6112278fe 852 (oidret->len)--;
DieterGraef 0:f9b6112278fe 853 climb_tree = 1;
DieterGraef 0:f9b6112278fe 854 }
DieterGraef 0:f9b6112278fe 855 }
DieterGraef 0:f9b6112278fe 856 else
DieterGraef 0:f9b6112278fe 857 {
DieterGraef 0:f9b6112278fe 858 struct mib_list_node *jn;
DieterGraef 0:f9b6112278fe 859 struct nse cur_node;
DieterGraef 0:f9b6112278fe 860
DieterGraef 0:f9b6112278fe 861 /* non-leaf, store right child ptr and id */
DieterGraef 0:f9b6112278fe 862 jn = ln->next;
DieterGraef 0:f9b6112278fe 863 while ((jn != NULL) && empty_table(jn->nptr))
DieterGraef 0:f9b6112278fe 864 {
DieterGraef 0:f9b6112278fe 865 jn = jn->next;
DieterGraef 0:f9b6112278fe 866 }
DieterGraef 0:f9b6112278fe 867 if (jn != NULL)
DieterGraef 0:f9b6112278fe 868 {
DieterGraef 0:f9b6112278fe 869 cur_node.r_ptr = jn->nptr;
DieterGraef 0:f9b6112278fe 870 cur_node.r_id = jn->objid;
DieterGraef 0:f9b6112278fe 871 cur_node.r_nl = 0;
DieterGraef 0:f9b6112278fe 872 }
DieterGraef 0:f9b6112278fe 873 else
DieterGraef 0:f9b6112278fe 874 {
DieterGraef 0:f9b6112278fe 875 cur_node.r_ptr = NULL;
DieterGraef 0:f9b6112278fe 876 }
DieterGraef 0:f9b6112278fe 877 push_node(&cur_node);
DieterGraef 0:f9b6112278fe 878 if (ln->objid == *ident)
DieterGraef 0:f9b6112278fe 879 {
DieterGraef 0:f9b6112278fe 880 ident_len--;
DieterGraef 0:f9b6112278fe 881 ident++;
DieterGraef 0:f9b6112278fe 882 }
DieterGraef 0:f9b6112278fe 883 else
DieterGraef 0:f9b6112278fe 884 {
DieterGraef 0:f9b6112278fe 885 /* ln->objid < *ident */
DieterGraef 0:f9b6112278fe 886 ident_len = 0;
DieterGraef 0:f9b6112278fe 887 }
DieterGraef 0:f9b6112278fe 888 /* follow next child pointer */
DieterGraef 0:f9b6112278fe 889 node = ln->nptr;
DieterGraef 0:f9b6112278fe 890 }
DieterGraef 0:f9b6112278fe 891
DieterGraef 0:f9b6112278fe 892 }
DieterGraef 0:f9b6112278fe 893 else
DieterGraef 0:f9b6112278fe 894 {
DieterGraef 0:f9b6112278fe 895 /* ln == NULL */
DieterGraef 0:f9b6112278fe 896 climb_tree = 1;
DieterGraef 0:f9b6112278fe 897 }
DieterGraef 0:f9b6112278fe 898 }
DieterGraef 0:f9b6112278fe 899 else
DieterGraef 0:f9b6112278fe 900 {
DieterGraef 0:f9b6112278fe 901 struct mib_list_node *jn;
DieterGraef 0:f9b6112278fe 902 /* ident_len == 0, complete with leftmost '.thing' */
DieterGraef 0:f9b6112278fe 903 jn = lrn->head;
DieterGraef 0:f9b6112278fe 904 while ((jn != NULL) && empty_table(jn->nptr))
DieterGraef 0:f9b6112278fe 905 {
DieterGraef 0:f9b6112278fe 906 jn = jn->next;
DieterGraef 0:f9b6112278fe 907 }
DieterGraef 0:f9b6112278fe 908 if (jn != NULL)
DieterGraef 0:f9b6112278fe 909 {
DieterGraef 0:f9b6112278fe 910 LWIP_DEBUGF(SNMP_MIB_DEBUG,("left jn->objid==%"S32_F"\n",jn->objid));
DieterGraef 0:f9b6112278fe 911 oidret->id[oidret->len] = jn->objid;
DieterGraef 0:f9b6112278fe 912 (oidret->len)++;
DieterGraef 0:f9b6112278fe 913 if (jn->nptr == NULL)
DieterGraef 0:f9b6112278fe 914 {
DieterGraef 0:f9b6112278fe 915 /* leaf node */
DieterGraef 0:f9b6112278fe 916 LWIP_DEBUGF(SNMP_MIB_DEBUG,("jn->nptr == NULL\n"));
DieterGraef 0:f9b6112278fe 917 return (struct mib_node*)lrn;
DieterGraef 0:f9b6112278fe 918 }
DieterGraef 0:f9b6112278fe 919 else
DieterGraef 0:f9b6112278fe 920 {
DieterGraef 0:f9b6112278fe 921 /* no leaf, continue */
DieterGraef 0:f9b6112278fe 922 node = jn->nptr;
DieterGraef 0:f9b6112278fe 923 }
DieterGraef 0:f9b6112278fe 924 }
DieterGraef 0:f9b6112278fe 925 else
DieterGraef 0:f9b6112278fe 926 {
DieterGraef 0:f9b6112278fe 927 /* jn == NULL */
DieterGraef 0:f9b6112278fe 928 climb_tree = 1;
DieterGraef 0:f9b6112278fe 929 }
DieterGraef 0:f9b6112278fe 930 }
DieterGraef 0:f9b6112278fe 931 }
DieterGraef 0:f9b6112278fe 932 else if(node_type == MIB_NODE_EX)
DieterGraef 0:f9b6112278fe 933 {
DieterGraef 0:f9b6112278fe 934 struct mib_external_node *en;
DieterGraef 0:f9b6112278fe 935 s32_t ex_id;
DieterGraef 0:f9b6112278fe 936
DieterGraef 0:f9b6112278fe 937 /* external node (addressing and access via functions) */
DieterGraef 0:f9b6112278fe 938 en = (struct mib_external_node *)node;
DieterGraef 0:f9b6112278fe 939 if (ident_len > 0)
DieterGraef 0:f9b6112278fe 940 {
DieterGraef 0:f9b6112278fe 941 u16_t i, len;
DieterGraef 0:f9b6112278fe 942
DieterGraef 0:f9b6112278fe 943 i = 0;
DieterGraef 0:f9b6112278fe 944 len = en->level_length(en->addr_inf,ext_level);
DieterGraef 0:f9b6112278fe 945 while ((i < len) && (en->ident_cmp(en->addr_inf,ext_level,i,*ident) < 0))
DieterGraef 0:f9b6112278fe 946 {
DieterGraef 0:f9b6112278fe 947 i++;
DieterGraef 0:f9b6112278fe 948 }
DieterGraef 0:f9b6112278fe 949 if (i < len)
DieterGraef 0:f9b6112278fe 950 {
DieterGraef 0:f9b6112278fe 951 /* add identifier to oidret */
DieterGraef 0:f9b6112278fe 952 en->get_objid(en->addr_inf,ext_level,i,&ex_id);
DieterGraef 0:f9b6112278fe 953 LWIP_DEBUGF(SNMP_MIB_DEBUG,("en->objid[%"U16_F"]==%"S32_F" *ident==%"S32_F"\n",i,ex_id,*ident));
DieterGraef 0:f9b6112278fe 954 oidret->id[oidret->len] = ex_id;
DieterGraef 0:f9b6112278fe 955 (oidret->len)++;
DieterGraef 0:f9b6112278fe 956
DieterGraef 0:f9b6112278fe 957 if ((ext_level + 1) == en->tree_levels)
DieterGraef 0:f9b6112278fe 958 {
DieterGraef 0:f9b6112278fe 959 LWIP_DEBUGF(SNMP_MIB_DEBUG,("leaf node\n"));
DieterGraef 0:f9b6112278fe 960 /* leaf node */
DieterGraef 0:f9b6112278fe 961 if (ex_id > *ident)
DieterGraef 0:f9b6112278fe 962 {
DieterGraef 0:f9b6112278fe 963 return (struct mib_node*)en;
DieterGraef 0:f9b6112278fe 964 }
DieterGraef 0:f9b6112278fe 965 else if ((i + 1) < len)
DieterGraef 0:f9b6112278fe 966 {
DieterGraef 0:f9b6112278fe 967 /* ex_id == *ident */
DieterGraef 0:f9b6112278fe 968 en->get_objid(en->addr_inf,ext_level,i + 1,&ex_id);
DieterGraef 0:f9b6112278fe 969 (oidret->len)--;
DieterGraef 0:f9b6112278fe 970 oidret->id[oidret->len] = ex_id;
DieterGraef 0:f9b6112278fe 971 (oidret->len)++;
DieterGraef 0:f9b6112278fe 972 return (struct mib_node*)en;
DieterGraef 0:f9b6112278fe 973 }
DieterGraef 0:f9b6112278fe 974 else
DieterGraef 0:f9b6112278fe 975 {
DieterGraef 0:f9b6112278fe 976 /* (i + 1) == len */
DieterGraef 0:f9b6112278fe 977 (oidret->len)--;
DieterGraef 0:f9b6112278fe 978 climb_tree = 1;
DieterGraef 0:f9b6112278fe 979 }
DieterGraef 0:f9b6112278fe 980 }
DieterGraef 0:f9b6112278fe 981 else
DieterGraef 0:f9b6112278fe 982 {
DieterGraef 0:f9b6112278fe 983 u8_t j;
DieterGraef 0:f9b6112278fe 984 struct nse cur_node;
DieterGraef 0:f9b6112278fe 985
DieterGraef 0:f9b6112278fe 986 LWIP_DEBUGF(SNMP_MIB_DEBUG,("non-leaf node\n"));
DieterGraef 0:f9b6112278fe 987 /* non-leaf, store right child ptr and id */
DieterGraef 0:f9b6112278fe 988 LWIP_ASSERT("i < 0xff", i < 0xff);
DieterGraef 0:f9b6112278fe 989 j = (u8_t)i + 1;
DieterGraef 0:f9b6112278fe 990 if (j < len)
DieterGraef 0:f9b6112278fe 991 {
DieterGraef 0:f9b6112278fe 992 /* right node is the current external node */
DieterGraef 0:f9b6112278fe 993 cur_node.r_ptr = node;
DieterGraef 0:f9b6112278fe 994 en->get_objid(en->addr_inf,ext_level,j,&cur_node.r_id);
DieterGraef 0:f9b6112278fe 995 cur_node.r_nl = ext_level + 1;
DieterGraef 0:f9b6112278fe 996 }
DieterGraef 0:f9b6112278fe 997 else
DieterGraef 0:f9b6112278fe 998 {
DieterGraef 0:f9b6112278fe 999 cur_node.r_ptr = NULL;
DieterGraef 0:f9b6112278fe 1000 }
DieterGraef 0:f9b6112278fe 1001 push_node(&cur_node);
DieterGraef 0:f9b6112278fe 1002 if (en->ident_cmp(en->addr_inf,ext_level,i,*ident) == 0)
DieterGraef 0:f9b6112278fe 1003 {
DieterGraef 0:f9b6112278fe 1004 ident_len--;
DieterGraef 0:f9b6112278fe 1005 ident++;
DieterGraef 0:f9b6112278fe 1006 }
DieterGraef 0:f9b6112278fe 1007 else
DieterGraef 0:f9b6112278fe 1008 {
DieterGraef 0:f9b6112278fe 1009 /* external id < *ident */
DieterGraef 0:f9b6112278fe 1010 ident_len = 0;
DieterGraef 0:f9b6112278fe 1011 }
DieterGraef 0:f9b6112278fe 1012 /* proceed to child */
DieterGraef 0:f9b6112278fe 1013 ext_level++;
DieterGraef 0:f9b6112278fe 1014 }
DieterGraef 0:f9b6112278fe 1015 }
DieterGraef 0:f9b6112278fe 1016 else
DieterGraef 0:f9b6112278fe 1017 {
DieterGraef 0:f9b6112278fe 1018 /* i == len (en->level_len()) */
DieterGraef 0:f9b6112278fe 1019 climb_tree = 1;
DieterGraef 0:f9b6112278fe 1020 }
DieterGraef 0:f9b6112278fe 1021 }
DieterGraef 0:f9b6112278fe 1022 else
DieterGraef 0:f9b6112278fe 1023 {
DieterGraef 0:f9b6112278fe 1024 /* ident_len == 0, complete with leftmost '.thing' */
DieterGraef 0:f9b6112278fe 1025 en->get_objid(en->addr_inf,ext_level,0,&ex_id);
DieterGraef 0:f9b6112278fe 1026 LWIP_DEBUGF(SNMP_MIB_DEBUG,("left en->objid==%"S32_F"\n",ex_id));
DieterGraef 0:f9b6112278fe 1027 oidret->id[oidret->len] = ex_id;
DieterGraef 0:f9b6112278fe 1028 (oidret->len)++;
DieterGraef 0:f9b6112278fe 1029 if ((ext_level + 1) == en->tree_levels)
DieterGraef 0:f9b6112278fe 1030 {
DieterGraef 0:f9b6112278fe 1031 /* leaf node */
DieterGraef 0:f9b6112278fe 1032 LWIP_DEBUGF(SNMP_MIB_DEBUG,("(ext_level + 1) == en->tree_levels\n"));
DieterGraef 0:f9b6112278fe 1033 return (struct mib_node*)en;
DieterGraef 0:f9b6112278fe 1034 }
DieterGraef 0:f9b6112278fe 1035 else
DieterGraef 0:f9b6112278fe 1036 {
DieterGraef 0:f9b6112278fe 1037 /* no leaf, proceed to child */
DieterGraef 0:f9b6112278fe 1038 ext_level++;
DieterGraef 0:f9b6112278fe 1039 }
DieterGraef 0:f9b6112278fe 1040 }
DieterGraef 0:f9b6112278fe 1041 }
DieterGraef 0:f9b6112278fe 1042 else if(node_type == MIB_NODE_SC)
DieterGraef 0:f9b6112278fe 1043 {
DieterGraef 0:f9b6112278fe 1044 mib_scalar_node *sn;
DieterGraef 0:f9b6112278fe 1045
DieterGraef 0:f9b6112278fe 1046 /* scalar node */
DieterGraef 0:f9b6112278fe 1047 sn = (mib_scalar_node *)node;
DieterGraef 0:f9b6112278fe 1048 if (ident_len > 0)
DieterGraef 0:f9b6112278fe 1049 {
DieterGraef 0:f9b6112278fe 1050 /* at .0 */
DieterGraef 0:f9b6112278fe 1051 climb_tree = 1;
DieterGraef 0:f9b6112278fe 1052 }
DieterGraef 0:f9b6112278fe 1053 else
DieterGraef 0:f9b6112278fe 1054 {
DieterGraef 0:f9b6112278fe 1055 /* ident_len == 0, complete object identifier */
DieterGraef 0:f9b6112278fe 1056 oidret->id[oidret->len] = 0;
DieterGraef 0:f9b6112278fe 1057 (oidret->len)++;
DieterGraef 0:f9b6112278fe 1058 /* leaf node */
DieterGraef 0:f9b6112278fe 1059 LWIP_DEBUGF(SNMP_MIB_DEBUG,("completed scalar leaf\n"));
DieterGraef 0:f9b6112278fe 1060 return (struct mib_node*)sn;
DieterGraef 0:f9b6112278fe 1061 }
DieterGraef 0:f9b6112278fe 1062 }
DieterGraef 0:f9b6112278fe 1063 else
DieterGraef 0:f9b6112278fe 1064 {
DieterGraef 0:f9b6112278fe 1065 /* unknown/unhandled node_type */
DieterGraef 0:f9b6112278fe 1066 LWIP_DEBUGF(SNMP_MIB_DEBUG,("expand failed node_type %"U16_F" unkown\n",(u16_t)node_type));
DieterGraef 0:f9b6112278fe 1067 return NULL;
DieterGraef 0:f9b6112278fe 1068 }
DieterGraef 0:f9b6112278fe 1069
DieterGraef 0:f9b6112278fe 1070 if (climb_tree)
DieterGraef 0:f9b6112278fe 1071 {
DieterGraef 0:f9b6112278fe 1072 struct nse child;
DieterGraef 0:f9b6112278fe 1073
DieterGraef 0:f9b6112278fe 1074 /* find right child ptr */
DieterGraef 0:f9b6112278fe 1075 child.r_ptr = NULL;
DieterGraef 0:f9b6112278fe 1076 child.r_id = 0;
DieterGraef 0:f9b6112278fe 1077 child.r_nl = 0;
DieterGraef 0:f9b6112278fe 1078 while ((node_stack_cnt > 0) && (child.r_ptr == NULL))
DieterGraef 0:f9b6112278fe 1079 {
DieterGraef 0:f9b6112278fe 1080 pop_node(&child);
DieterGraef 0:f9b6112278fe 1081 /* trim returned oid */
DieterGraef 0:f9b6112278fe 1082 (oidret->len)--;
DieterGraef 0:f9b6112278fe 1083 }
DieterGraef 0:f9b6112278fe 1084 if (child.r_ptr != NULL)
DieterGraef 0:f9b6112278fe 1085 {
DieterGraef 0:f9b6112278fe 1086 /* incoming ident is useless beyond this point */
DieterGraef 0:f9b6112278fe 1087 ident_len = 0;
DieterGraef 0:f9b6112278fe 1088 oidret->id[oidret->len] = child.r_id;
DieterGraef 0:f9b6112278fe 1089 oidret->len++;
DieterGraef 0:f9b6112278fe 1090 node = child.r_ptr;
DieterGraef 0:f9b6112278fe 1091 ext_level = child.r_nl;
DieterGraef 0:f9b6112278fe 1092 }
DieterGraef 0:f9b6112278fe 1093 else
DieterGraef 0:f9b6112278fe 1094 {
DieterGraef 0:f9b6112278fe 1095 /* tree ends here ... */
DieterGraef 0:f9b6112278fe 1096 LWIP_DEBUGF(SNMP_MIB_DEBUG,("expand failed, tree ends here\n"));
DieterGraef 0:f9b6112278fe 1097 return NULL;
DieterGraef 0:f9b6112278fe 1098 }
DieterGraef 0:f9b6112278fe 1099 }
DieterGraef 0:f9b6112278fe 1100 }
DieterGraef 0:f9b6112278fe 1101 /* done, found nothing */
DieterGraef 0:f9b6112278fe 1102 LWIP_DEBUGF(SNMP_MIB_DEBUG,("expand failed node==%p\n",(void*)node));
DieterGraef 0:f9b6112278fe 1103 return NULL;
DieterGraef 0:f9b6112278fe 1104 }
DieterGraef 0:f9b6112278fe 1105
DieterGraef 0:f9b6112278fe 1106 /**
DieterGraef 0:f9b6112278fe 1107 * Test object identifier for the iso.org.dod.internet prefix.
DieterGraef 0:f9b6112278fe 1108 *
DieterGraef 0:f9b6112278fe 1109 * @param ident_len the length of the supplied object identifier
DieterGraef 0:f9b6112278fe 1110 * @param ident points to the array of sub identifiers
DieterGraef 0:f9b6112278fe 1111 * @return 1 if it matches, 0 otherwise
DieterGraef 0:f9b6112278fe 1112 */
DieterGraef 0:f9b6112278fe 1113 u8_t
DieterGraef 0:f9b6112278fe 1114 snmp_iso_prefix_tst(u8_t ident_len, s32_t *ident)
DieterGraef 0:f9b6112278fe 1115 {
DieterGraef 0:f9b6112278fe 1116 if ((ident_len > 3) &&
DieterGraef 0:f9b6112278fe 1117 (ident[0] == 1) && (ident[1] == 3) &&
DieterGraef 0:f9b6112278fe 1118 (ident[2] == 6) && (ident[3] == 1))
DieterGraef 0:f9b6112278fe 1119 {
DieterGraef 0:f9b6112278fe 1120 return 1;
DieterGraef 0:f9b6112278fe 1121 }
DieterGraef 0:f9b6112278fe 1122 else
DieterGraef 0:f9b6112278fe 1123 {
DieterGraef 0:f9b6112278fe 1124 return 0;
DieterGraef 0:f9b6112278fe 1125 }
DieterGraef 0:f9b6112278fe 1126 }
DieterGraef 0:f9b6112278fe 1127
DieterGraef 0:f9b6112278fe 1128 /**
DieterGraef 0:f9b6112278fe 1129 * Expands object identifier to the iso.org.dod.internet
DieterGraef 0:f9b6112278fe 1130 * prefix for use in getnext operation.
DieterGraef 0:f9b6112278fe 1131 *
DieterGraef 0:f9b6112278fe 1132 * @param ident_len the length of the supplied object identifier
DieterGraef 0:f9b6112278fe 1133 * @param ident points to the array of sub identifiers
DieterGraef 0:f9b6112278fe 1134 * @param oidret points to returned expanded object identifier
DieterGraef 0:f9b6112278fe 1135 * @return 1 if it matches, 0 otherwise
DieterGraef 0:f9b6112278fe 1136 *
DieterGraef 0:f9b6112278fe 1137 * @note ident_len 0 is allowed, expanding to the first known object id!!
DieterGraef 0:f9b6112278fe 1138 */
DieterGraef 0:f9b6112278fe 1139 u8_t
DieterGraef 0:f9b6112278fe 1140 snmp_iso_prefix_expand(u8_t ident_len, s32_t *ident, struct snmp_obj_id *oidret)
DieterGraef 0:f9b6112278fe 1141 {
DieterGraef 0:f9b6112278fe 1142 const s32_t *prefix_ptr;
DieterGraef 0:f9b6112278fe 1143 s32_t *ret_ptr;
DieterGraef 0:f9b6112278fe 1144 u8_t i;
DieterGraef 0:f9b6112278fe 1145
DieterGraef 0:f9b6112278fe 1146 i = 0;
DieterGraef 0:f9b6112278fe 1147 prefix_ptr = &prefix[0];
DieterGraef 0:f9b6112278fe 1148 ret_ptr = &oidret->id[0];
DieterGraef 0:f9b6112278fe 1149 ident_len = ((ident_len < 4)?ident_len:4);
DieterGraef 0:f9b6112278fe 1150 while ((i < ident_len) && ((*ident) <= (*prefix_ptr)))
DieterGraef 0:f9b6112278fe 1151 {
DieterGraef 0:f9b6112278fe 1152 *ret_ptr++ = *prefix_ptr++;
DieterGraef 0:f9b6112278fe 1153 ident++;
DieterGraef 0:f9b6112278fe 1154 i++;
DieterGraef 0:f9b6112278fe 1155 }
DieterGraef 0:f9b6112278fe 1156 if (i == ident_len)
DieterGraef 0:f9b6112278fe 1157 {
DieterGraef 0:f9b6112278fe 1158 /* match, complete missing bits */
DieterGraef 0:f9b6112278fe 1159 while (i < 4)
DieterGraef 0:f9b6112278fe 1160 {
DieterGraef 0:f9b6112278fe 1161 *ret_ptr++ = *prefix_ptr++;
DieterGraef 0:f9b6112278fe 1162 i++;
DieterGraef 0:f9b6112278fe 1163 }
DieterGraef 0:f9b6112278fe 1164 oidret->len = i;
DieterGraef 0:f9b6112278fe 1165 return 1;
DieterGraef 0:f9b6112278fe 1166 }
DieterGraef 0:f9b6112278fe 1167 else
DieterGraef 0:f9b6112278fe 1168 {
DieterGraef 0:f9b6112278fe 1169 /* i != ident_len */
DieterGraef 0:f9b6112278fe 1170 return 0;
DieterGraef 0:f9b6112278fe 1171 }
DieterGraef 0:f9b6112278fe 1172 }
DieterGraef 0:f9b6112278fe 1173
DieterGraef 0:f9b6112278fe 1174 #endif /* LWIP_SNMP */