Mike Pulice / ublox_C200Test

Integrating the ublox LISA C200 modem

Fork of SprintUSBModemHTTPClientTest by Donatien Garnier

SprintUSBModem/lwip/core/snmp/mib_structs.c@5:3f93dd1d4cb3, 2013-09-26 (annotated)

Committer:
sam_grove
Date:
Thu Sep 26 00:44:20 2013 -0500
Revision:
5:3f93dd1d4cb3
Exported program and replaced contents of the repo with the source

to build and debug using keil mdk. Libs NOT upto date are lwip, lwip-sys

and socket. these have newer versions under mbed_official but were starting

from a know working point

Who changed what in which revision?

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