CK Sin / Mbed 2 deprecated Ethernetwebsocket

Ethernetwebsoc

Dependencies:   C12832_lcd LM75B WebSocketClient mbed-rtos mbed Socket lwip-eth lwip-sys lwip

EthernetInterface/lwip/core/snmp/mib_structs.c@0:0ed2a7c7190c, 2013-05-31 (annotated)

Committer:
GordonSin
Date:
Fri May 31 04:09:54 2013 +0000
Revision:
0:0ed2a7c7190c
31/5/2013;

Who changed what in which revision?

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