WebSVN – HelenOS-historic – Diff – /kernel/trunk/genarch/src/mm/asid_fifo.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 genarchmm
 * @{
 */
 
/**
 * @file
 * @brief   FIFO queue ASID management.
 *
 * Architectures that link with this file keep the unallocated ASIDs
 * in FIFO queue. The queue can be statically (e.g. mips32) or
 * dynamically allocated (e.g ia64 and sparc64).
 */
 
#include <genarch/mm/asid_fifo.h>
#include <arch/mm/asid.h>
#include <mm/asid.h>
#include <typedefs.h>
#include <adt/fifo.h>
 
#define FIFO_STATIC_LIMIT   1024
#define FIFO_STATIC     (ASIDS_ALLOCABLE<FIFO_STATIC_LIMIT)
 
/**
 * FIFO queue containing unassigned ASIDs.
 * Can be only accessed when asidlock is held.
 */
#if FIFO_STATIC
FIFO_INITIALIZE_STATIC(free_asids, asid_t, ASIDS_ALLOCABLE);
#else
FIFO_INITIALIZE_DYNAMIC(free_asids, asid_t, ASIDS_ALLOCABLE);
#endif
 
/** Initialize data structures for O(1) ASID allocation and deallocation. */
void asid_fifo_init(void)
{
    int i;
 
    #if (!FIFO_STATIC)
    fifo_create(free_asids);
    #endif
       
    for (i = 0; i < ASIDS_ALLOCABLE; i++) {
        fifo_push(free_asids, ASID_START + i);
    }
}
 
/** Allocate free ASID.
 *
 * Allocation runs in O(1).
 *
 * @return Free ASID.
 */
asid_t asid_find_free(void)
{
    return fifo_pop(free_asids);
}
 
/** Return ASID among free ASIDs.
 *
 * This operation runs in O(1).
 *
 * @param asid ASID being freed.
 */
void asid_put_arch(asid_t asid)
{
    fifo_push(free_asids, asid);
}
 
 /** @}
 */
 
 

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/genarch/src/mm/asid_fifo.c – Rev 1266 → 1702

Rev 1266		Rev 1702
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
-		29	/** @addtogroup genarchmm
-		30	* @{
-		31	*/
28		32
29	/**	33	/**
30	* @file asid_fifo.c	34	* @file
31	* @brief FIFO queue ASID management.	35	* @brief FIFO queue ASID management.
32	*	36	*
33	* Architectures that link with this file keep the unallocated ASIDs	37	* Architectures that link with this file keep the unallocated ASIDs
34	* in FIFO queue. The queue can be statically (e.g. mips32) or	38	* in FIFO queue. The queue can be statically (e.g. mips32) or
35	* dynamically allocated (e.g ia64 and sparc64).	39	* dynamically allocated (e.g ia64 and sparc64).
36	*/	40	*/
37		41
38	#include <genarch/mm/asid_fifo.h>	42	#include <genarch/mm/asid_fifo.h>
39	#include <arch/mm/asid.h>	43	#include <arch/mm/asid.h>
40	#include <mm/asid.h>	44	#include <mm/asid.h>
41	#include <typedefs.h>	45	#include <typedefs.h>
42	#include <adt/fifo.h>	46	#include <adt/fifo.h>
43		47
44	#define FIFO_STATIC_LIMIT 1024	48	#define FIFO_STATIC_LIMIT 1024
45	#define FIFO_STATIC (ASIDS_ALLOCABLE<FIFO_STATIC_LIMIT)	49	#define FIFO_STATIC (ASIDS_ALLOCABLE<FIFO_STATIC_LIMIT)
46		50
47	/**	51	/**
48	* FIFO queue containing unassigned ASIDs.	52	* FIFO queue containing unassigned ASIDs.
49	* Can be only accessed when asidlock is held.	53	* Can be only accessed when asidlock is held.
50	*/	54	*/
51	#if FIFO_STATIC	55	#if FIFO_STATIC
52	FIFO_INITIALIZE_STATIC(free_asids, asid_t, ASIDS_ALLOCABLE);	56	FIFO_INITIALIZE_STATIC(free_asids, asid_t, ASIDS_ALLOCABLE);
53	#else	57	#else
54	FIFO_INITIALIZE_DYNAMIC(free_asids, asid_t, ASIDS_ALLOCABLE);	58	FIFO_INITIALIZE_DYNAMIC(free_asids, asid_t, ASIDS_ALLOCABLE);
55	#endif	59	#endif
56		60
57	/** Initialize data structures for O(1) ASID allocation and deallocation. */	61	/** Initialize data structures for O(1) ASID allocation and deallocation. */
58	void asid_fifo_init(void)	62	void asid_fifo_init(void)
59	{	63	{
60	int i;	64	int i;
61		65
62	#if (!FIFO_STATIC)	66	#if (!FIFO_STATIC)
63	fifo_create(free_asids);	67	fifo_create(free_asids);
64	#endif	68	#endif
65		69
66	for (i = 0; i < ASIDS_ALLOCABLE; i++) {	70	for (i = 0; i < ASIDS_ALLOCABLE; i++) {
67	fifo_push(free_asids, ASID_START + i);	71	fifo_push(free_asids, ASID_START + i);
68	}	72	}
69	}	73	}
70		74
71	/** Allocate free ASID.	75	/** Allocate free ASID.
72	*	76	*
73	* Allocation runs in O(1).	77	* Allocation runs in O(1).
74	*	78	*
75	* @return Free ASID.	79	* @return Free ASID.
76	*/	80	*/
77	asid_t asid_find_free(void)	81	asid_t asid_find_free(void)
78	{	82	{
79	return fifo_pop(free_asids);	83	return fifo_pop(free_asids);
80	}	84	}
81		85
82	/** Return ASID among free ASIDs.	86	/** Return ASID among free ASIDs.
83	*	87	*
84	* This operation runs in O(1).	88	* This operation runs in O(1).
85	*	89	*
86	* @param asid ASID being freed.	90	* @param asid ASID being freed.
87	*/	91	*/
88	void asid_put_arch(asid_t asid)	92	void asid_put_arch(asid_t asid)
89	{	93	{
90	fifo_push(free_asids, asid);	94	fifo_push(free_asids, asid);
91	}	95	}
-		96
-		97	/** @}
-		98	*/
-		99
92		100