3 * MIB tree access/construction functions.
\r
7 * Copyright (c) 2006 Axon Digital Design B.V., The Netherlands.
\r
8 * All rights reserved.
\r
10 * Redistribution and use in source and binary forms, with or without modification,
\r
11 * are permitted provided that the following conditions are met:
\r
13 * 1. Redistributions of source code must retain the above copyright notice,
\r
14 * this list of conditions and the following disclaimer.
\r
15 * 2. Redistributions in binary form must reproduce the above copyright notice,
\r
16 * this list of conditions and the following disclaimer in the documentation
\r
17 * and/or other materials provided with the distribution.
\r
18 * 3. The name of the author may not be used to endorse or promote products
\r
19 * derived from this software without specific prior written permission.
\r
21 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
\r
22 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
\r
23 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
\r
24 * SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
\r
25 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
\r
26 * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
\r
27 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
\r
28 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
\r
29 * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
\r
32 * Author: Christiaan Simons <christiaan.simons@axon.tv>
\r
35 #include "lwip/opt.h"
\r
38 #include "lwip/snmp_structs.h"
\r
39 #include "lwip/mem.h"
\r
43 /** .iso.org.dod.internet address prefix, @see snmp_iso_*() */
\r
44 const s32_t prefix[4] = {1, 3, 6, 1};
\r
46 #define NODE_STACK_SIZE (LWIP_SNMP_OBJ_ID_LEN)
\r
47 /** node stack entry (old news?) */
\r
51 struct mib_node* r_ptr;
\r
52 /** right child identifier */
\r
54 /** right child next level */
\r
57 static u8_t node_stack_cnt = 0;
\r
58 static struct nse node_stack[NODE_STACK_SIZE];
\r
61 * Pushes nse struct onto stack.
\r
64 push_node(struct nse* node)
\r
66 LWIP_ASSERT("node_stack_cnt < NODE_STACK_SIZE",node_stack_cnt < NODE_STACK_SIZE);
\r
67 LWIP_DEBUGF(SNMP_MIB_DEBUG,("push_node() node=%p id=%"S32_F"\n",(void*)(node->r_ptr),node->r_id));
\r
68 if (node_stack_cnt < NODE_STACK_SIZE)
\r
70 node_stack[node_stack_cnt] = *node;
\r
76 * Pops nse struct from stack.
\r
79 pop_node(struct nse* node)
\r
81 if (node_stack_cnt > 0)
\r
84 *node = node_stack[node_stack_cnt];
\r
86 LWIP_DEBUGF(SNMP_MIB_DEBUG,("pop_node() node=%p id=%"S32_F"\n",(void *)(node->r_ptr),node->r_id));
\r
90 * Conversion from ifIndex to lwIP netif
\r
91 * @param ifindex is a s32_t object sub-identifier
\r
92 * @param netif points to returned netif struct pointer
\r
95 snmp_ifindextonetif(s32_t ifindex, struct netif **netif)
\r
97 struct netif *nif = netif_list;
\r
100 ifidx = ifindex - 1;
\r
102 while ((nif != NULL) && (i < ifidx))
\r
111 * Conversion from lwIP netif to ifIndex
\r
112 * @param netif points to a netif struct
\r
113 * @param ifindex points to s32_t object sub-identifier
\r
116 snmp_netiftoifindex(struct netif *netif, s32_t *ifidx)
\r
118 struct netif *nif = netif_list;
\r
122 while (nif != netif)
\r
131 * Conversion from oid to lwIP ip_addr
\r
132 * @param ident points to s32_t ident[4] input
\r
133 * @param ip points to output struct
\r
136 snmp_oidtoip(s32_t *ident, struct ip_addr *ip)
\r
151 * Conversion from lwIP ip_addr to oid
\r
152 * @param ip points to input struct
\r
153 * @param ident points to s32_t ident[4] output
\r
156 snmp_iptooid(struct ip_addr *ip, s32_t *ident)
\r
161 ident[0] = (ipa >> 24) & 0xff;
\r
162 ident[1] = (ipa >> 16) & 0xff;
\r
163 ident[2] = (ipa >> 8) & 0xff;
\r
164 ident[3] = ipa & 0xff;
\r
167 struct mib_list_node *
\r
168 snmp_mib_ln_alloc(s32_t id)
\r
170 struct mib_list_node *ln;
\r
172 ln = (struct mib_list_node *)mem_malloc(sizeof(struct mib_list_node));
\r
184 snmp_mib_ln_free(struct mib_list_node *ln)
\r
189 struct mib_list_rootnode *
\r
190 snmp_mib_lrn_alloc(void)
\r
192 struct mib_list_rootnode *lrn;
\r
194 lrn = (struct mib_list_rootnode*)mem_malloc(sizeof(struct mib_list_rootnode));
\r
197 lrn->get_object_def = noleafs_get_object_def;
\r
198 lrn->get_value = noleafs_get_value;
\r
199 lrn->set_test = noleafs_set_test;
\r
200 lrn->set_value = noleafs_set_value;
\r
201 lrn->node_type = MIB_NODE_LR;
\r
202 lrn->maxlength = 0;
\r
211 snmp_mib_lrn_free(struct mib_list_rootnode *lrn)
\r
217 * Inserts node in idx list in a sorted
\r
218 * (ascending order) fashion and
\r
219 * allocates the node if needed.
\r
221 * @param rn points to the root node
\r
222 * @param objid is the object sub identifier
\r
223 * @param insn points to a pointer to the inserted node
\r
224 * used for constructing the tree.
\r
225 * @return -1 if failed, 1 if inserted, 2 if present.
\r
228 snmp_mib_node_insert(struct mib_list_rootnode *rn, s32_t objid, struct mib_list_node **insn)
\r
230 struct mib_list_node *nn;
\r
233 LWIP_ASSERT("rn != NULL",rn != NULL);
\r
235 /* -1 = malloc failure, 0 = not inserted, 1 = inserted, 2 = was present */
\r
237 if (rn->head == NULL)
\r
239 /* empty list, add first node */
\r
240 LWIP_DEBUGF(SNMP_MIB_DEBUG,("alloc empty list objid==%"S32_F"\n",objid));
\r
241 nn = snmp_mib_ln_alloc(objid);
\r
256 struct mib_list_node *n;
\r
257 /* at least one node is present */
\r
259 while ((n != NULL) && (insert == 0))
\r
261 if (n->objid == objid)
\r
263 /* node is already there */
\r
264 LWIP_DEBUGF(SNMP_MIB_DEBUG,("node already there objid==%"S32_F"\n",objid));
\r
268 else if (n->objid < objid)
\r
270 if (n->next == NULL)
\r
272 /* alloc and insert at the tail */
\r
273 LWIP_DEBUGF(SNMP_MIB_DEBUG,("alloc ins tail objid==%"S32_F"\n",objid));
\r
274 nn = snmp_mib_ln_alloc(objid);
\r
286 /* insertion failure */
\r
292 /* there's more to explore: traverse list */
\r
293 LWIP_DEBUGF(SNMP_MIB_DEBUG,("traverse list\n"));
\r
299 /* n->objid > objid */
\r
300 /* alloc and insert between n->prev and n */
\r
301 LWIP_DEBUGF(SNMP_MIB_DEBUG,("alloc ins n->prev, objid==%"S32_F", n\n",objid));
\r
302 nn = snmp_mib_ln_alloc(objid);
\r
305 if (n->prev == NULL)
\r
307 /* insert at the head */
\r
315 /* insert in the middle */
\r
317 nn->prev = n->prev;
\r
318 n->prev->next = nn;
\r
326 /* insertion failure */
\r
336 LWIP_ASSERT("insert != 0",insert != 0);
\r
341 * Finds node in idx list and returns deletion mark.
\r
343 * @param rn points to the root node
\r
344 * @param objid is the object sub identifier
\r
345 * @param fn returns pointer to found node
\r
346 * @return 0 if not found, 1 if deletable,
\r
347 * 2 can't delete (2 or more children), 3 not a list_node
\r
350 snmp_mib_node_find(struct mib_list_rootnode *rn, s32_t objid, struct mib_list_node **fn)
\r
353 struct mib_list_node *n;
\r
355 LWIP_ASSERT("rn != NULL",rn != NULL);
\r
357 while ((n != NULL) && (n->objid != objid))
\r
365 else if (n->nptr == NULL)
\r
367 /* leaf, can delete node */
\r
372 struct mib_list_rootnode *rn;
\r
374 if (n->nptr->node_type == MIB_NODE_LR)
\r
376 rn = (struct mib_list_rootnode *)n->nptr;
\r
379 /* can't delete node */
\r
384 /* count <= 1, can delete node */
\r
390 /* other node type */
\r
399 * Removes node from idx list
\r
400 * if it has a single child left.
\r
402 * @param rn points to the root node
\r
403 * @param n points to the node to delete
\r
404 * @return the nptr to be freed by caller
\r
406 struct mib_list_rootnode *
\r
407 snmp_mib_node_delete(struct mib_list_rootnode *rn, struct mib_list_node *n)
\r
409 struct mib_list_rootnode *next;
\r
411 LWIP_ASSERT("rn != NULL",rn != NULL);
\r
412 LWIP_ASSERT("n != NULL",n != NULL);
\r
414 /* caller must remove this sub-tree */
\r
415 next = (struct mib_list_rootnode*)(n->nptr);
\r
420 rn->head = n->next;
\r
421 if (n->next != NULL)
\r
423 /* not last node, new list begin */
\r
424 n->next->prev = NULL;
\r
427 else if (n == rn->tail)
\r
429 rn->tail = n->prev;
\r
430 if (n->prev != NULL)
\r
432 /* not last node, new list end */
\r
433 n->prev->next = NULL;
\r
438 /* node must be in the middle */
\r
439 n->prev->next = n->next;
\r
440 n->next->prev = n->prev;
\r
442 LWIP_DEBUGF(SNMP_MIB_DEBUG,("free list objid==%"S32_F"\n",n->objid));
\r
443 snmp_mib_ln_free(n);
\r
444 if (rn->count == 0)
\r
455 * Searches tree for the supplied (scalar?) object identifier.
\r
457 * @param node points to the root of the tree ('.internet')
\r
458 * @param ident_len the length of the supplied object identifier
\r
459 * @param ident points to the array of sub identifiers
\r
460 * @param np points to the found object instance (rerurn)
\r
461 * @return pointer to the requested parent (!) node if success, NULL otherwise
\r
464 snmp_search_tree(struct mib_node *node, u8_t ident_len, s32_t *ident, struct snmp_name_ptr *np)
\r
466 u8_t node_type, ext_level;
\r
469 LWIP_DEBUGF(SNMP_MIB_DEBUG,("node==%p *ident==%"S32_F"\n",(void*)node,*ident));
\r
470 while (node != NULL)
\r
472 node_type = node->node_type;
\r
473 if ((node_type == MIB_NODE_AR) || (node_type == MIB_NODE_RA))
\r
475 struct mib_array_node *an;
\r
480 /* array node (internal ROM or RAM, fixed length) */
\r
481 an = (struct mib_array_node *)node;
\r
483 while ((i < an->maxlength) && (an->objid[i] != *ident))
\r
487 if (i < an->maxlength)
\r
489 /* found it, if available proceed to child, otherwise inspect leaf */
\r
490 LWIP_DEBUGF(SNMP_MIB_DEBUG,("an->objid[%"U16_F"]==%"S32_F" *ident==%"S32_F"\n",i,an->objid[i],*ident));
\r
491 if (an->nptr[i] == NULL)
\r
493 /* a scalar leaf OR table,
\r
494 inspect remaining instance number / table index */
\r
495 np->ident_len = ident_len;
\r
497 return (struct mib_node*)an;
\r
501 /* follow next child pointer */
\r
504 node = an->nptr[i];
\r
509 /* search failed, identifier mismatch (nosuchname) */
\r
510 LWIP_DEBUGF(SNMP_MIB_DEBUG,("an search failed *ident==%"S32_F"\n",*ident));
\r
516 /* search failed, short object identifier (nosuchname) */
\r
517 LWIP_DEBUGF(SNMP_MIB_DEBUG,("an search failed, short object identifier\n"));
\r
521 else if(node_type == MIB_NODE_LR)
\r
523 struct mib_list_rootnode *lrn;
\r
524 struct mib_list_node *ln;
\r
528 /* list root node (internal 'RAM', variable length) */
\r
529 lrn = (struct mib_list_rootnode *)node;
\r
531 /* iterate over list, head to tail */
\r
532 while ((ln != NULL) && (ln->objid != *ident))
\r
538 /* found it, proceed to child */;
\r
539 LWIP_DEBUGF(SNMP_MIB_DEBUG,("ln->objid==%"S32_F" *ident==%"S32_F"\n",ln->objid,*ident));
\r
540 if (ln->nptr == NULL)
\r
542 np->ident_len = ident_len;
\r
544 return (struct mib_node*)lrn;
\r
548 /* follow next child pointer */
\r
556 /* search failed */
\r
557 LWIP_DEBUGF(SNMP_MIB_DEBUG,("ln search failed *ident==%"S32_F"\n",*ident));
\r
563 /* search failed, short object identifier (nosuchname) */
\r
564 LWIP_DEBUGF(SNMP_MIB_DEBUG,("ln search failed, short object identifier\n"));
\r
568 else if(node_type == MIB_NODE_EX)
\r
570 struct mib_external_node *en;
\r
575 /* external node (addressing and access via functions) */
\r
576 en = (struct mib_external_node *)node;
\r
579 len = en->level_length(en->addr_inf,ext_level);
\r
580 while ((i < len) && (en->ident_cmp(en->addr_inf,ext_level,i,*ident) != 0))
\r
588 en->get_objid(en->addr_inf,ext_level,i,&debug_id);
\r
589 LWIP_DEBUGF(SNMP_MIB_DEBUG,("en->objid==%"S32_F" *ident==%"S32_F"\n",debug_id,*ident));
\r
590 if ((ext_level + 1) == en->tree_levels)
\r
592 np->ident_len = ident_len;
\r
594 return (struct mib_node*)en;
\r
598 /* found it, proceed to child */
\r
606 /* search failed */
\r
607 LWIP_DEBUGF(SNMP_MIB_DEBUG,("en search failed *ident==%"S32_F"\n",*ident));
\r
613 /* search failed, short object identifier (nosuchname) */
\r
614 LWIP_DEBUGF(SNMP_MIB_DEBUG,("en search failed, short object identifier\n"));
\r
618 else if (node_type == MIB_NODE_SC)
\r
620 mib_scalar_node *sn;
\r
622 sn = (mib_scalar_node *)node;
\r
623 if ((ident_len == 1) && (*ident == 0))
\r
625 np->ident_len = ident_len;
\r
627 return (struct mib_node*)sn;
\r
631 /* search failed, short object identifier (nosuchname) */
\r
632 LWIP_DEBUGF(SNMP_MIB_DEBUG,("search failed, invalid object identifier length\n"));
\r
638 /* unknown node_type */
\r
639 LWIP_DEBUGF(SNMP_MIB_DEBUG,("search failed node_type %"U16_F" unkown\n",(u16_t)node_type));
\r
643 /* done, found nothing */
\r
644 LWIP_DEBUGF(SNMP_MIB_DEBUG,("search failed node==%p\n",(void*)node));
\r
649 * Test table for presence of at least one table entry.
\r
652 empty_table(struct mib_node *node)
\r
659 node_type = node->node_type;
\r
660 if (node_type == MIB_NODE_LR)
\r
662 struct mib_list_rootnode *lrn;
\r
663 lrn = (struct mib_list_rootnode *)node;
\r
664 if ((lrn->count == 0) || (lrn->head == NULL))
\r
669 else if ((node_type == MIB_NODE_AR) || (node_type == MIB_NODE_RA))
\r
671 struct mib_array_node *an;
\r
672 an = (struct mib_array_node *)node;
\r
673 if ((an->maxlength == 0) || (an->nptr == NULL))
\r
678 else if (node_type == MIB_NODE_EX)
\r
680 struct mib_external_node *en;
\r
681 en = (struct mib_external_node *)node;
\r
682 if (en->tree_levels == 0)
\r
695 snmp_expand_tree(struct mib_node *node, u8_t ident_len, s32_t *ident, struct snmp_obj_id *oidret)
\r
697 u8_t node_type, ext_level, climb_tree;
\r
700 /* reset node stack */
\r
701 node_stack_cnt = 0;
\r
702 while (node != NULL)
\r
705 node_type = node->node_type;
\r
706 if ((node_type == MIB_NODE_AR) || (node_type == MIB_NODE_RA))
\r
708 struct mib_array_node *an;
\r
711 /* array node (internal ROM or RAM, fixed length) */
\r
712 an = (struct mib_array_node *)node;
\r
716 while ((i < an->maxlength) && (an->objid[i] < *ident))
\r
720 if (i < an->maxlength)
\r
722 LWIP_DEBUGF(SNMP_MIB_DEBUG,("an->objid[%"U16_F"]==%"S32_F" *ident==%"S32_F"\n",i,an->objid[i],*ident));
\r
723 /* add identifier to oidret */
\r
724 oidret->id[oidret->len] = an->objid[i];
\r
727 if (an->nptr[i] == NULL)
\r
729 LWIP_DEBUGF(SNMP_MIB_DEBUG,("leaf node\n"));
\r
730 /* leaf node (e.g. in a fixed size table) */
\r
731 if (an->objid[i] > *ident)
\r
733 return (struct mib_node*)an;
\r
735 else if ((i + 1) < an->maxlength)
\r
737 /* an->objid[i] == *ident */
\r
739 oidret->id[oidret->len] = an->objid[i + 1];
\r
741 return (struct mib_node*)an;
\r
745 /* (i + 1) == an->maxlength */
\r
753 struct nse cur_node;
\r
755 LWIP_DEBUGF(SNMP_MIB_DEBUG,("non-leaf node\n"));
\r
756 /* non-leaf, store right child ptr and id */
\r
758 while ((j < an->maxlength) && (empty_table(an->nptr[j])))
\r
762 if (j < an->maxlength)
\r
764 cur_node.r_ptr = an->nptr[j];
\r
765 cur_node.r_id = an->objid[j];
\r
770 cur_node.r_ptr = NULL;
\r
772 push_node(&cur_node);
\r
773 if (an->objid[i] == *ident)
\r
780 /* an->objid[i] < *ident */
\r
783 /* follow next child pointer */
\r
784 node = an->nptr[i];
\r
789 /* i == an->maxlength */
\r
796 /* ident_len == 0, complete with leftmost '.thing' */
\r
798 while ((j < an->maxlength) && empty_table(an->nptr[j]))
\r
802 if (j < an->maxlength)
\r
804 LWIP_DEBUGF(SNMP_MIB_DEBUG,("left an->objid[j]==%"S32_F"\n",an->objid[j]));
\r
805 oidret->id[oidret->len] = an->objid[j];
\r
807 if (an->nptr[j] == NULL)
\r
810 return (struct mib_node*)an;
\r
814 /* no leaf, continue */
\r
815 node = an->nptr[j];
\r
820 /* j == an->maxlength */
\r
825 else if(node_type == MIB_NODE_LR)
\r
827 struct mib_list_rootnode *lrn;
\r
828 struct mib_list_node *ln;
\r
830 /* list root node (internal 'RAM', variable length) */
\r
831 lrn = (struct mib_list_rootnode *)node;
\r
835 /* iterate over list, head to tail */
\r
836 while ((ln != NULL) && (ln->objid < *ident))
\r
842 LWIP_DEBUGF(SNMP_MIB_DEBUG,("ln->objid==%"S32_F" *ident==%"S32_F"\n",ln->objid,*ident));
\r
843 oidret->id[oidret->len] = ln->objid;
\r
845 if (ln->nptr == NULL)
\r
848 if (ln->objid > *ident)
\r
850 return (struct mib_node*)lrn;
\r
852 else if (ln->next != NULL)
\r
854 /* ln->objid == *ident */
\r
856 oidret->id[oidret->len] = ln->next->objid;
\r
858 return (struct mib_node*)lrn;
\r
862 /* ln->next == NULL */
\r
869 struct mib_list_node *jn;
\r
870 struct nse cur_node;
\r
872 /* non-leaf, store right child ptr and id */
\r
874 while ((jn != NULL) && empty_table(jn->nptr))
\r
880 cur_node.r_ptr = jn->nptr;
\r
881 cur_node.r_id = jn->objid;
\r
886 cur_node.r_ptr = NULL;
\r
888 push_node(&cur_node);
\r
889 if (ln->objid == *ident)
\r
896 /* ln->objid < *ident */
\r
899 /* follow next child pointer */
\r
912 struct mib_list_node *jn;
\r
913 /* ident_len == 0, complete with leftmost '.thing' */
\r
915 while ((jn != NULL) && empty_table(jn->nptr))
\r
921 LWIP_DEBUGF(SNMP_MIB_DEBUG,("left jn->objid==%"S32_F"\n",jn->objid));
\r
922 oidret->id[oidret->len] = jn->objid;
\r
924 if (jn->nptr == NULL)
\r
927 LWIP_DEBUGF(SNMP_MIB_DEBUG,("jn->nptr == NULL\n"));
\r
928 return (struct mib_node*)lrn;
\r
932 /* no leaf, continue */
\r
943 else if(node_type == MIB_NODE_EX)
\r
945 struct mib_external_node *en;
\r
948 /* external node (addressing and access via functions) */
\r
949 en = (struct mib_external_node *)node;
\r
955 len = en->level_length(en->addr_inf,ext_level);
\r
956 while ((i < len) && (en->ident_cmp(en->addr_inf,ext_level,i,*ident) < 0))
\r
962 /* add identifier to oidret */
\r
963 en->get_objid(en->addr_inf,ext_level,i,&ex_id);
\r
964 LWIP_DEBUGF(SNMP_MIB_DEBUG,("en->objid[%"U16_F"]==%"S32_F" *ident==%"S32_F"\n",i,ex_id,*ident));
\r
965 oidret->id[oidret->len] = ex_id;
\r
968 if ((ext_level + 1) == en->tree_levels)
\r
970 LWIP_DEBUGF(SNMP_MIB_DEBUG,("leaf node\n"));
\r
972 if (ex_id > *ident)
\r
974 return (struct mib_node*)en;
\r
976 else if ((i + 1) < len)
\r
978 /* ex_id == *ident */
\r
979 en->get_objid(en->addr_inf,ext_level,i + 1,&ex_id);
\r
981 oidret->id[oidret->len] = ex_id;
\r
983 return (struct mib_node*)en;
\r
987 /* (i + 1) == len */
\r
995 struct nse cur_node;
\r
997 LWIP_DEBUGF(SNMP_MIB_DEBUG,("non-leaf node\n"));
\r
998 /* non-leaf, store right child ptr and id */
\r
1002 /* right node is the current external node */
\r
1003 cur_node.r_ptr = node;
\r
1004 en->get_objid(en->addr_inf,ext_level,j,&cur_node.r_id);
\r
1005 cur_node.r_nl = ext_level + 1;
\r
1009 cur_node.r_ptr = NULL;
\r
1011 push_node(&cur_node);
\r
1012 if (en->ident_cmp(en->addr_inf,ext_level,i,*ident) == 0)
\r
1019 /* external id < *ident */
\r
1022 /* proceed to child */
\r
1028 /* i == len (en->level_len()) */
\r
1034 /* ident_len == 0, complete with leftmost '.thing' */
\r
1035 en->get_objid(en->addr_inf,ext_level,0,&ex_id);
\r
1036 LWIP_DEBUGF(SNMP_MIB_DEBUG,("left en->objid==%"S32_F"\n",ex_id));
\r
1037 oidret->id[oidret->len] = ex_id;
\r
1039 if ((ext_level + 1) == en->tree_levels)
\r
1042 LWIP_DEBUGF(SNMP_MIB_DEBUG,("(ext_level + 1) == en->tree_levels\n"));
\r
1043 return (struct mib_node*)en;
\r
1047 /* no leaf, proceed to child */
\r
1052 else if(node_type == MIB_NODE_SC)
\r
1054 mib_scalar_node *sn;
\r
1057 sn = (mib_scalar_node *)node;
\r
1058 if (ident_len > 0)
\r
1065 /* ident_len == 0, complete object identifier */
\r
1066 oidret->id[oidret->len] = 0;
\r
1069 LWIP_DEBUGF(SNMP_MIB_DEBUG,("completed scalar leaf\n"));
\r
1070 return (struct mib_node*)sn;
\r
1075 /* unknown/unhandled node_type */
\r
1076 LWIP_DEBUGF(SNMP_MIB_DEBUG,("expand failed node_type %"U16_F" unkown\n",(u16_t)node_type));
\r
1084 /* find right child ptr */
\r
1085 child.r_ptr = NULL;
\r
1088 while ((node_stack_cnt > 0) && (child.r_ptr == NULL))
\r
1091 /* trim returned oid */
\r
1094 if (child.r_ptr != NULL)
\r
1096 /* incoming ident is useless beyond this point */
\r
1098 oidret->id[oidret->len] = child.r_id;
\r
1100 node = child.r_ptr;
\r
1101 ext_level = child.r_nl;
\r
1105 /* tree ends here ... */
\r
1106 LWIP_DEBUGF(SNMP_MIB_DEBUG,("expand failed, tree ends here\n"));
\r
1111 /* done, found nothing */
\r
1112 LWIP_DEBUGF(SNMP_MIB_DEBUG,("expand failed node==%p\n",(void*)node));
\r
1117 * Test object identifier for the iso.org.dod.internet prefix.
\r
1119 * @param ident_len the length of the supplied object identifier
\r
1120 * @param ident points to the array of sub identifiers
\r
1121 * @return 1 if it matches, 0 otherwise
\r
1124 snmp_iso_prefix_tst(u8_t ident_len, s32_t *ident)
\r
1126 if ((ident_len > 3) &&
\r
1127 (ident[0] == 1) && (ident[1] == 3) &&
\r
1128 (ident[2] == 6) && (ident[3] == 1))
\r
1139 * Expands object identifier to the iso.org.dod.internet
\r
1140 * prefix for use in getnext operation.
\r
1142 * @param ident_len the length of the supplied object identifier
\r
1143 * @param ident points to the array of sub identifiers
\r
1144 * @param oidret points to returned expanded object identifier
\r
1145 * @return 1 if it matches, 0 otherwise
\r
1147 * @note ident_len 0 is allowed, expanding to the first known object id!!
\r
1150 snmp_iso_prefix_expand(u8_t ident_len, s32_t *ident, struct snmp_obj_id *oidret)
\r
1152 const s32_t *prefix_ptr;
\r
1157 prefix_ptr = &prefix[0];
\r
1158 ret_ptr = &oidret->id[0];
\r
1159 ident_len = ((ident_len < 4)?ident_len:4);
\r
1160 while ((i < ident_len) && ((*ident) <= (*prefix_ptr)))
\r
1162 *ret_ptr++ = *prefix_ptr++;
\r
1166 if (i == ident_len)
\r
1168 /* match, complete missing bits */
\r
1171 *ret_ptr++ = *prefix_ptr++;
\r
1179 /* i != ident_len */
\r
1184 #endif /* LWIP_SNMP */
\r