WebSVN – HelenOS-historic – Diff – /kernel/trunk/generic/src/adt/bitmap.c


/*
 * Copyright (C) 2006 Jakub Jermar
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
/** @addtogroup genericadt
 * @{
 */
/**
 * @file
 * @brief   Implementation of bitmap ADT.
 *
 * This file implements bitmap ADT and provides functions for
 * setting and clearing ranges of bits.
 */
 
#include <adt/bitmap.h>
#include <typedefs.h>
#include <arch/types.h>
#include <align.h>
#include <debug.h>
#include <macros.h>
 
#define ALL_ONES    0xff
#define ALL_ZEROES  0x00
 
/** Initialize bitmap.
 *
 * No portion of the bitmap is set or cleared by this function.
 *
 * @param bitmap Bitmap structure.
 * @param map Address of the memory used to hold the map.
 * @param bits Number of bits stored in bitmap.
 */
void bitmap_initialize(bitmap_t *bitmap, uint8_t *map, count_t bits)
{
    bitmap->map = map;
    bitmap->bits = bits;
}
 
/** Set range of bits.
 *
 * @param bitmap Bitmap structure.
 * @param start Starting bit.
 * @param bits Number of bits to set.
 */
void bitmap_set_range(bitmap_t *bitmap, index_t start, count_t bits)
{
    index_t i=0;
    index_t aligned_start;
    count_t lub;        /* leading unaligned bits */
    count_t amb;        /* aligned middle bits */
    count_t tab;        /* trailing aligned bits */
   
    ASSERT(start + bits <= bitmap->bits);
   
    aligned_start = ALIGN_UP(start, 8);
    lub = min(aligned_start - start, bits);
    amb = bits > lub ? bits - lub : 0;
    tab = amb % 8;
   
    if ( start + bits < aligned_start ) {
        /*
        * Set bits in the middle of byte
        */
        bitmap->map[start / 8] |= ((1 << lub)-1) << (start&7);
        return;
    }
   
    if (lub) {
        /*
         * Make sure to set any leading unaligned bits.
         */
        bitmap->map[start / 8] |= ~((1 << (8 - lub)) - 1);
    }
    for (i = 0; i < amb / 8; i++) {
        /*
         * The middle bits can be set byte by byte.
         */
        bitmap->map[aligned_start / 8 + i] = ALL_ONES;
    }
    if (tab) {
        /*
         * Make sure to set any trailing aligned bits.
         */
        bitmap->map[aligned_start / 8 + i] |= (1 << tab) - 1;
    }
   
}
 
/** Clear range of bits.
 *
 * @param bitmap Bitmap structure.
 * @param start Starting bit.
 * @param bits Number of bits to clear.
 */
void bitmap_clear_range(bitmap_t *bitmap, index_t start, count_t bits)
{
    index_t i=0;
    index_t aligned_start;
    count_t lub;        /* leading unaligned bits */
    count_t amb;        /* aligned middle bits */
    count_t tab;        /* trailing aligned bits */
   
    ASSERT(start + bits <= bitmap->bits);
   
    aligned_start = ALIGN_UP(start, 8);
    lub = min(aligned_start - start, bits);
    amb = bits > lub ? bits - lub : 0;
    tab = amb % 8;
 
    if ( start + bits < aligned_start )
    {
        /*
        * Set bits in the middle of byte
        */
        bitmap->map[start / 8] &= ~(((1 << lub)-1) << (start&7));
        return;
    }
 
 
    if (lub) {
        /*
         * Make sure to clear any leading unaligned bits.
         */
        bitmap->map[start / 8] &= (1 << (8 - lub)) - 1;
    }
    for (i = 0; i < amb / 8; i++) {
        /*
         * The middle bits can be cleared byte by byte.
         */
        bitmap->map[aligned_start / 8 + i] = ALL_ZEROES;
    }
    if (tab) {
        /*
         * Make sure to clear any trailing aligned bits.
         */
        bitmap->map[aligned_start / 8 + i] &= ~((1 << tab) - 1);
    }
 
}
 
/** Copy portion of one bitmap into another bitmap.
 *
 * @param dst Destination bitmap.
 * @param src Source bitmap.
 * @param bits Number of bits to copy.
 */
void bitmap_copy(bitmap_t *dst, bitmap_t *src, count_t bits)
{
    index_t i;
   
    ASSERT(bits <= dst->bits);
    ASSERT(bits <= src->bits);
   
    for (i = 0; i < bits / 8; i++)
        dst->map[i] = src->map[i];
   
    if (bits % 8) {
        bitmap_clear_range(dst, i * 8, bits % 8);
        dst->map[i] |= src->map[i] & ((1 << (bits % 8)) - 1);
    }
}
 
/** @}
 */
 

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/adt/bitmap.c – Rev 1757 → 1780

Rev 1757		Rev 1780
1	/*	1	/*
2	* Copyright (C) 2006 Jakub Jermar	2	* Copyright (C) 2006 Jakub Jermar
3	* All rights reserved.	3	* All rights reserved.
4	*	4	*
5	* Redistribution and use in source and binary forms, with or without	5	* Redistribution and use in source and binary forms, with or without
6	* modification, are permitted provided that the following conditions	6	* modification, are permitted provided that the following conditions
7	* are met:	7	* are met:
8	*	8	*
9	* - Redistributions of source code must retain the above copyright	9	* - Redistributions of source code must retain the above copyright
10	* notice, this list of conditions and the following disclaimer.	10	* notice, this list of conditions and the following disclaimer.
11	* - Redistributions in binary form must reproduce the above copyright	11	* - Redistributions in binary form must reproduce the above copyright
12	* notice, this list of conditions and the following disclaimer in the	12	* notice, this list of conditions and the following disclaimer in the
13	* documentation and/or other materials provided with the distribution.	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	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.	15	* derived from this software without specific prior written permission.
16	*	16	*
17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR	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	18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.	19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,	20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT	21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,	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	23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT	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	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.	26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27	*/	27	*/
28		28
29	/** @addtogroup genericadt	29	/** @addtogroup genericadt
30	* @{	30	* @{
31	*/	31	*/
32	/**	32	/**
33	* @file	33	* @file
34	* @brief Implementation of bitmap ADT.	34	* @brief Implementation of bitmap ADT.
35	*	35	*
36	* This file implements bitmap ADT and provides functions for	36	* This file implements bitmap ADT and provides functions for
37	* setting and clearing ranges of bits.	37	* setting and clearing ranges of bits.
38	*/	38	*/
39		39
40	#include <adt/bitmap.h>	40	#include <adt/bitmap.h>
41	#include <typedefs.h>	41	#include <typedefs.h>
42	#include <arch/types.h>	42	#include <arch/types.h>
43	#include <align.h>	43	#include <align.h>
44	#include <debug.h>	44	#include <debug.h>
45	#include <macros.h>	45	#include <macros.h>
46		46
47	#define ALL_ONES 0xff	47	#define ALL_ONES 0xff
48	#define ALL_ZEROES 0x00	48	#define ALL_ZEROES 0x00
49		49
50	/** Initialize bitmap.	50	/** Initialize bitmap.
51	*	51	*
52	* No portion of the bitmap is set or cleared by this function.	52	* No portion of the bitmap is set or cleared by this function.
53	*	53	*
54	* @param bitmap Bitmap structure.	54	* @param bitmap Bitmap structure.
55	* @param map Address of the memory used to hold the map.	55	* @param map Address of the memory used to hold the map.
56	* @param bits Number of bits stored in bitmap.	56	* @param bits Number of bits stored in bitmap.
57	*/	57	*/
58	void bitmap_initialize(bitmap_t bitmap, __u8 map, count_t bits)	58	void bitmap_initialize(bitmap_t bitmap, uint8_t map, count_t bits)
59	{	59	{
60	bitmap->map = map;	60	bitmap->map = map;
61	bitmap->bits = bits;	61	bitmap->bits = bits;
62	}	62	}
63		63
64	/** Set range of bits.	64	/** Set range of bits.
65	*	65	*
66	* @param bitmap Bitmap structure.	66	* @param bitmap Bitmap structure.
67	* @param start Starting bit.	67	* @param start Starting bit.
68	* @param bits Number of bits to set.	68	* @param bits Number of bits to set.
69	*/	69	*/
70	void bitmap_set_range(bitmap_t *bitmap, index_t start, count_t bits)	70	void bitmap_set_range(bitmap_t *bitmap, index_t start, count_t bits)
71	{	71	{
72	index_t i=0;	72	index_t i=0;
73	index_t aligned_start;	73	index_t aligned_start;
74	count_t lub; /* leading unaligned bits */	74	count_t lub; /* leading unaligned bits */
75	count_t amb; /* aligned middle bits */	75	count_t amb; /* aligned middle bits */
76	count_t tab; /* trailing aligned bits */	76	count_t tab; /* trailing aligned bits */
77		77
78	ASSERT(start + bits <= bitmap->bits);	78	ASSERT(start + bits <= bitmap->bits);
79		79
80	aligned_start = ALIGN_UP(start, 8);	80	aligned_start = ALIGN_UP(start, 8);
81	lub = min(aligned_start - start, bits);	81	lub = min(aligned_start - start, bits);
82	amb = bits > lub ? bits - lub : 0;	82	amb = bits > lub ? bits - lub : 0;
83	tab = amb % 8;	83	tab = amb % 8;
84		84
85	if ( start + bits < aligned_start ) {	85	if ( start + bits < aligned_start ) {
86	/*	86	/*
87	* Set bits in the middle of byte	87	* Set bits in the middle of byte
88	*/	88	*/
89	bitmap->map[start / 8] \|= ((1 << lub)-1) << (start&7);	89	bitmap->map[start / 8] \|= ((1 << lub)-1) << (start&7);
90	return;	90	return;
91	}	91	}
92		92
93	if (lub) {	93	if (lub) {
94	/*	94	/*
95	* Make sure to set any leading unaligned bits.	95	* Make sure to set any leading unaligned bits.
96	*/	96	*/
97	bitmap->map[start / 8] \|= ~((1 << (8 - lub)) - 1);	97	bitmap->map[start / 8] \|= ~((1 << (8 - lub)) - 1);
98	}	98	}
99	for (i = 0; i < amb / 8; i++) {	99	for (i = 0; i < amb / 8; i++) {
100	/*	100	/*
101	* The middle bits can be set byte by byte.	101	* The middle bits can be set byte by byte.
102	*/	102	*/
103	bitmap->map[aligned_start / 8 + i] = ALL_ONES;	103	bitmap->map[aligned_start / 8 + i] = ALL_ONES;
104	}	104	}
105	if (tab) {	105	if (tab) {
106	/*	106	/*
107	* Make sure to set any trailing aligned bits.	107	* Make sure to set any trailing aligned bits.
108	*/	108	*/
109	bitmap->map[aligned_start / 8 + i] \|= (1 << tab) - 1;	109	bitmap->map[aligned_start / 8 + i] \|= (1 << tab) - 1;
110	}	110	}
111		111
112	}	112	}
113		113
114	/** Clear range of bits.	114	/** Clear range of bits.
115	*	115	*
116	* @param bitmap Bitmap structure.	116	* @param bitmap Bitmap structure.
117	* @param start Starting bit.	117	* @param start Starting bit.
118	* @param bits Number of bits to clear.	118	* @param bits Number of bits to clear.
119	*/	119	*/
120	void bitmap_clear_range(bitmap_t *bitmap, index_t start, count_t bits)	120	void bitmap_clear_range(bitmap_t *bitmap, index_t start, count_t bits)
121	{	121	{
122	index_t i=0;	122	index_t i=0;
123	index_t aligned_start;	123	index_t aligned_start;
124	count_t lub; /* leading unaligned bits */	124	count_t lub; /* leading unaligned bits */
125	count_t amb; /* aligned middle bits */	125	count_t amb; /* aligned middle bits */
126	count_t tab; /* trailing aligned bits */	126	count_t tab; /* trailing aligned bits */
127		127
128	ASSERT(start + bits <= bitmap->bits);	128	ASSERT(start + bits <= bitmap->bits);
129		129
130	aligned_start = ALIGN_UP(start, 8);	130	aligned_start = ALIGN_UP(start, 8);
131	lub = min(aligned_start - start, bits);	131	lub = min(aligned_start - start, bits);
132	amb = bits > lub ? bits - lub : 0;	132	amb = bits > lub ? bits - lub : 0;
133	tab = amb % 8;	133	tab = amb % 8;
134		134
135	if ( start + bits < aligned_start )	135	if ( start + bits < aligned_start )
136	{	136	{
137	/*	137	/*
138	* Set bits in the middle of byte	138	* Set bits in the middle of byte
139	*/	139	*/
140	bitmap->map[start / 8] &= ~(((1 << lub)-1) << (start&7));	140	bitmap->map[start / 8] &= ~(((1 << lub)-1) << (start&7));
141	return;	141	return;
142	}	142	}
143		143
144		144
145	if (lub) {	145	if (lub) {
146	/*	146	/*
147	* Make sure to clear any leading unaligned bits.	147	* Make sure to clear any leading unaligned bits.
148	*/	148	*/
149	bitmap->map[start / 8] &= (1 << (8 - lub)) - 1;	149	bitmap->map[start / 8] &= (1 << (8 - lub)) - 1;
150	}	150	}
151	for (i = 0; i < amb / 8; i++) {	151	for (i = 0; i < amb / 8; i++) {
152	/*	152	/*
153	* The middle bits can be cleared byte by byte.	153	* The middle bits can be cleared byte by byte.
154	*/	154	*/
155	bitmap->map[aligned_start / 8 + i] = ALL_ZEROES;	155	bitmap->map[aligned_start / 8 + i] = ALL_ZEROES;
156	}	156	}
157	if (tab) {	157	if (tab) {
158	/*	158	/*
159	* Make sure to clear any trailing aligned bits.	159	* Make sure to clear any trailing aligned bits.
160	*/	160	*/
161	bitmap->map[aligned_start / 8 + i] &= ~((1 << tab) - 1);	161	bitmap->map[aligned_start / 8 + i] &= ~((1 << tab) - 1);
162	}	162	}
163		163
164	}	164	}
165		165
166	/** Copy portion of one bitmap into another bitmap.	166	/** Copy portion of one bitmap into another bitmap.
167	*	167	*
168	* @param dst Destination bitmap.	168	* @param dst Destination bitmap.
169	* @param src Source bitmap.	169	* @param src Source bitmap.
170	* @param bits Number of bits to copy.	170	* @param bits Number of bits to copy.
171	*/	171	*/
172	void bitmap_copy(bitmap_t dst, bitmap_t src, count_t bits)	172	void bitmap_copy(bitmap_t dst, bitmap_t src, count_t bits)
173	{	173	{
174	index_t i;	174	index_t i;
175		175
176	ASSERT(bits <= dst->bits);	176	ASSERT(bits <= dst->bits);
177	ASSERT(bits <= src->bits);	177	ASSERT(bits <= src->bits);
178		178
179	for (i = 0; i < bits / 8; i++)	179	for (i = 0; i < bits / 8; i++)
180	dst->map[i] = src->map[i];	180	dst->map[i] = src->map[i];
181		181
182	if (bits % 8) {	182	if (bits % 8) {
183	bitmap_clear_range(dst, i * 8, bits % 8);	183	bitmap_clear_range(dst, i * 8, bits % 8);
184	dst->map[i] \|= src->map[i] & ((1 << (bits % 8)) - 1);	184	dst->map[i] \|= src->map[i] & ((1 << (bits % 8)) - 1);
185	}	185	}
186	}	186	}
187		187
188	/** @}	188	/** @}
189	*/	189	*/
190		190