Hendrik Vincent / Mbed 2 deprecated Weerstation

Leest de waarde van een sensor binnen een maakt deze beschikbaar via internet

Dependencies:   NTPClient_NetServices mbed

NetServices/lwip/core/snmp/mib_structs.c@0:05ccbd4f84f1, 2013-12-02 (annotated)

Committer:
hendrikvincent
Date:
Mon Dec 02 09:01:23 2013 +0000
Revision:
0:05ccbd4f84f1
eerste programma;

Who changed what in which revision?

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