NetServices - NetTribute library with debug turned on in FShand…

Users » hexley » Code » NetServices

NetTribute library with debug turned on in FShandler Donatien Garner -> Segundo Equipo -> this version

lwip/core/snmp/mib_structs.c@0:281d6ff68967, 2010-11-19 (annotated)

Committer:: hexley
Date:: Fri Nov 19 01:54:45 2010 +0000
Revision:: 0:281d6ff68967

Who changed what in which revision?

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

Repository toolbox

Export to desktop IDE

Repository details

Type:	Library
Created:	19 Nov 2010
Imports:	44
Forks:	0
Commits:	1
Dependents:	0
Dependencies:	0
Followers:	1

lwip/core/snmp/mib_structs.c@0:281d6ff68967, 2010-11-19 (annotated)

Who changed what in which revision?

Repository toolbox

Repository details

Important Information for this Arm website

Access Warning