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