mbed unsupported / lwip

A version of LWIP, provided for backwards compatibility.

Dependents:   AA_DemoBoard DemoBoard HelloServerDemo DemoBoard_RangeIndicator ... more

trunk/Core/lwIP/core/snmp/mib_structs.c@0:5e1631496985, 2012-05-08 (annotated)

Committer:
root@mbed.org
Date:
Tue May 08 15:32:10 2012 +0100
Revision:
0:5e1631496985
initial commit

Who changed what in which revision?

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