Mihail Stoyanov / HTTPServer

My fork of the HTTPServer (working)

Dependents:   DGWWebServer LAN2

Core/lwIP/core/snmp/mib_structs.c@0:7a64fbb4069d, 2012-08-06 (annotated)

Committer:
screamer
Date:
Mon Aug 06 09:23:14 2012 +0000
Revision:
0:7a64fbb4069d
[mbed] converted /DGWWebServer/HTTPServer

Who changed what in which revision?

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