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