WebSVN – HelenOS – Blame – /branches/network/uspace/srv/net/structures/int_map.h

Rev	Author	Line No.	Line
3666	mejdrech	1	/*
3912	mejdrech	2	* Copyright (c) 2009 Lukas Mejdrech
3666	mejdrech	3	* All rights reserved.
		4	*
		5	* Redistribution and use in source and binary forms, with or without
		6	* modification, are permitted provided that the following conditions
		7	* are met:
		8	*
		9	* - Redistributions of source code must retain the above copyright
		10	* notice, this list of conditions and the following disclaimer.
		11	* - Redistributions in binary form must reproduce the above copyright
		12	* notice, this list of conditions and the following disclaimer in the
		13	* documentation and/or other materials provided with the distribution.
		14	* - The name of the author may not be used to endorse or promote products
		15	* derived from this software without specific prior written permission.
		16	*
		17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
		18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
		19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
		20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
		21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
		22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
		23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
		24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
		25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
		26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
		27	*/
		28
		29	/** @addtogroup net
3912	mejdrech	30	* @{
3666	mejdrech	31	*/
		32
3912	mejdrech	33	/** @file
3666	mejdrech	34	*/
		35
		36	#ifndef __NET_INT_MAP_H__
		37	#define __NET_INT_MAP_H__
		38
		39	#include <errno.h>
		40	#include <malloc.h>
4192	mejdrech	41	#include <mem.h>
3666	mejdrech	42
3846	mejdrech	43	#define INT_MAP_MAGIC_VALUE 0x11223344
3666	mejdrech	44	#define INT_MAP_ITEM_MAGIC_VALUE 0x55667788
		45
3846	mejdrech	46	#define INT_MAP_DECLARE( name, type ) \
		47	\
		48	typedef struct name name##_t; \
		49	typedef name##_t * name##_ref; \
		50	typedef struct name##_item name##_item_t; \
		51	typedef name##_item_t * name##_item_ref; \
		52	\
		53	struct name##_item{ \
		54	int key; \
		55	type * value; \
		56	int magic; \
		57	}; \
		58	\
		59	struct name{ \
4243	mejdrech	60	size_t size; \
3846	mejdrech	61	int next; \
		62	name##_item_ref items; \
		63	int magic; \
		64	}; \
		65	\
		66	int name##_add( name##_ref map, int key, type * value ); \
		67	void name##_clear( name##_ref map ); \
		68	int name##_count( name##_ref map ); \
		69	void name##_destroy( name##_ref map ); \
		70	void name##_exclude( name##_ref map, int key ); \
		71	void name##_exclude_index( name##_ref map, int index ); \
		72	type * name##_find( name##_ref map, int key ); \
		73	type * name##_get_index( name##_ref map, int index ); \
		74	int name##_initialize( name##_ref map ); \
		75	int name##_is_valid( name##_ref map ); \
		76	void name##_item_destroy( name##_item_ref item ); \
		77	int name##_item_is_valid( name##_item_ref item );
3666	mejdrech	78
3846	mejdrech	79	#define INT_MAP_IMPLEMENT( name, type ) \
		80	\
		81	int name##_add( name##_ref map, int key, type * value ){ \
		82	if( name##_is_valid( map )){ \
		83	if( map->next == ( map->size - 1 )){ \
		84	name##_item_ref tmp; \
		85	\
4197	mejdrech	86	tmp = ( name##_item_ref ) realloc( map->items, sizeof( name##_item_t ) * 2 * map->size ); \
3846	mejdrech	87	if( ! tmp ) return ENOMEM; \
		88	map->size *= 2; \
		89	map->items = tmp; \
		90	} \
		91	map->items[ map->next ].key = key; \
		92	map->items[ map->next ].value = value; \
		93	map->items[ map->next ].magic = INT_MAP_ITEM_MAGIC_VALUE; \
		94	++ map->next; \
		95	map->items[ map->next ].magic = 0; \
		96	return map->next - 1; \
		97	} \
		98	return EINVAL; \
		99	} \
		100	\
		101	void name##_clear( name##_ref map ){ \
		102	if( name##_is_valid( map )){ \
		103	int index; \
		104	\
		105	/* map->magic = 0;*/ \
		106	for( index = 0; index < map->next; ++ index ){ \
		107	if( name##_item_is_valid( &( map->items[ index ] ))){ \
		108	name##_item_destroy( &( map->items[ index ] )); \
		109	} \
		110	} \
		111	map->next = 0; \
		112	map->items[ map->next ].magic = 0; \
		113	/* map->magic = INT_MAP_MAGIC_VALUE;*/ \
		114	} \
		115	} \
		116	\
		117	int name##_count( name##_ref map ){ \
		118	return name##_is_valid( map ) ? map->next : -1; \
		119	} \
		120	\
		121	void name##_destroy( name##_ref map ){ \
		122	if( name##_is_valid( map )){ \
		123	int index; \
		124	\
		125	map->magic = 0; \
		126	for( index = 0; index < map->next; ++ index ){ \
		127	if( name##_item_is_valid( &( map->items[ index ] ))){ \
		128	name##_item_destroy( &( map->items[ index ] )); \
		129	} \
		130	} \
		131	free( map->items ); \
		132	} \
		133	} \
		134	\
		135	void name##_exclude( name##_ref map, int key ){ \
		136	if( name##_is_valid( map )){ \
		137	int index; \
		138	\
		139	for( index = 0; index < map->next; ++ index ){ \
3666	mejdrech	140	if( name##_item_is_valid( &( map->items[ index ] )) && ( map->items[ index ].key == key )){ \
3846	mejdrech	141	name##_item_destroy( &( map->items[ index ] )); \
		142	} \
		143	} \
		144	} \
		145	} \
		146	\
		147	void name##_exclude_index( name##_ref map, int index ){ \
3666	mejdrech	148	if( name##_is_valid( map ) && ( index >= 0 ) && ( index < map->next ) && name##_item_is_valid( &( map->items[ index ] ))){ \
3846	mejdrech	149	name##_item_destroy( &( map->items[ index ] )); \
		150	} \
		151	} \
		152	\
		153	type * name##_find( name##_ref map, int key ){ \
		154	if( name##_is_valid( map )){ \
		155	int index; \
		156	\
		157	for( index = 0; index < map->next; ++ index ){ \
3666	mejdrech	158	if( name##_item_is_valid( &( map->items[ index ] )) && ( map->items[ index ].key == key )){ \
3846	mejdrech	159	return map->items[ index ].value; \
		160	} \
		161	} \
		162	} \
		163	return NULL; \
		164	} \
		165	\
		166	type * name##_get_index( name##_ref map, int index ){ \
3666	mejdrech	167	if( name##_is_valid( map ) && ( index >= 0 ) && ( index < map->next ) && name##_item_is_valid( &( map->items[ index ] ))){ \
3846	mejdrech	168	return map->items[ index ].value; \
		169	} \
		170	return NULL; \
		171	} \
		172	\
		173	int name##_initialize( name##_ref map ){ \
		174	if( ! map ) return EINVAL; \
		175	map->size = 2; \
		176	map->next = 0; \
3666	mejdrech	177	map->items = ( name##_item_ref ) malloc( sizeof( name##_item_t ) * map->size ); \
3846	mejdrech	178	if( ! map->items ) return ENOMEM; \
		179	map->items[ map->next ].magic = 0; \
		180	map->magic = INT_MAP_MAGIC_VALUE; \
		181	return EOK; \
		182	} \
		183	\
		184	int name##_is_valid( name##_ref map ){ \
		185	return map && ( map->magic == INT_MAP_MAGIC_VALUE ); \
		186	} \
		187	\
		188	void name##_item_destroy( name##_item_ref item ){ \
		189	if( name##_item_is_valid( item )){ \
		190	item->magic = 0; \
		191	if( item->value ){ \
		192	free( item->value ); \
		193	item->value = NULL; \
		194	} \
		195	} \
		196	} \
		197	\
		198	int name##_item_is_valid( name##_item_ref item ){ \
		199	return item && ( item->magic == INT_MAP_ITEM_MAGIC_VALUE ); \
3666	mejdrech	200	}
		201
		202	#endif
		203
		204	/** @}
		205	*/
		206

Subversion Repositories HelenOS

(root)/branches/network/uspace/srv/net/structures/int_map.h @ 4743 – Rev 4243