Pascal Nysten / lwip

Dependencies:   DebugLib

Dependents:   LoRaWAN-lmic-app LoRaWAN-lmic-app LoRaWAN-test-10secs LoRaPersonalizedDeviceForEverynet ... more

Fork of lwip_ppp_ethernet by Donatien Garnier

Committer:
pnysten
Date:
Fri Nov 20 12:30:58 2015 +0000
Revision:
3:a9e6ba815945
Parent:
0:8e01dca41002
Adapted to Nucleo, LoRa Semtech

Who changed what in which revision?

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