StrippedDownNetServices - This library is stripped down version of NetServi…

Users » idinor » Code » StrippedDownNetServices

idinor Launcher / StrippedDownNetServices

This library is stripped down version of NetServices library. HTTP server and client function is NOT supported.

lwip/core/snmp/mib_structs.c@0:dcf3c92487ca, 2011-07-20 (annotated)

Committer:: idinor
Date:: Wed Jul 20 11:45:39 2011 +0000
Revision:: 0:dcf3c92487ca

Who changed what in which revision?

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

Repository toolbox

Export to desktop IDE

Repository details

Type:	Library
Created:	20 Jul 2011
Imports:	35
Forks:	0
Commits:	1
Dependents:	1
Dependencies:	0
Followers:	1

lwip/core/snmp/mib_structs.c@0:dcf3c92487ca, 2011-07-20 (annotated)

Who changed what in which revision?

Repository toolbox

Repository details

Important Information for this Arm website

Access Warning