Subversion Repositories HelenOS

Rev

Rev 788 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 788 Rev 830
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
#include <genarch/mm/asid_fifo.h>
29
#include <genarch/mm/asid_fifo.h>
30
#include <arch/mm/asid.h>
30
#include <arch/mm/asid.h>
31
#include <mm/asid.h>
31
#include <mm/asid.h>
32
#include <typedefs.h>
32
#include <typedefs.h>
33
#include <adt/fifo.h>
33
#include <adt/fifo.h>
34
 
34
 
-
 
35
#define FIFO_STATIC_LIMIT   1024
-
 
36
#define FIFO_STATIC     (ASIDS_ALLOCABLE<FIFO_STATIC_LIMIT)
35
/**
37
/**
36
 * FIFO queue containing unassigned ASIDs.
38
 * FIFO queue containing unassigned ASIDs.
37
 * Can be only accessed when asidlock is held.
39
 * Can be only accessed when asidlock is held.
38
 */
40
 */
-
 
41
#if FIFO_STATIC
39
FIFO_INITIALIZE(free_asids, asid_t, ASIDS_ALLOCABLE);
42
FIFO_INITIALIZE_STATIC(free_asids, asid_t, ASIDS_ALLOCABLE);
-
 
43
#else
-
 
44
FIFO_INITIALIZE_DYNAMIC(free_asids, asid_t, ASIDS_ALLOCABLE);
-
 
45
#endif
40
 
46
 
41
/** Initialize data structures for O(1) ASID allocation and deallocation. */
47
/** Initialize data structures for O(1) ASID allocation and deallocation. */
42
void asid_fifo_init(void)
48
void asid_fifo_init(void)
43
{
49
{
44
    int i;
50
    int i;
-
 
51
 
-
 
52
    #if (!FIFO_STATIC)
-
 
53
    fifo_create(free_asids);
-
 
54
    #endif
45
   
55
       
46
    for (i = 0; i < ASIDS_ALLOCABLE; i++) {
56
    for (i = 0; i < ASIDS_ALLOCABLE; i++) {
47
        fifo_push(free_asids, ASID_START + i);
57
        fifo_push(free_asids, ASID_START + i);
48
    }
58
    }
49
}
59
}
50
 
60
 
51
/** Allocate free ASID.
61
/** Allocate free ASID.
52
 *
62
 *
53
 * Allocation runs in O(1).
63
 * Allocation runs in O(1).
54
 *
64
 *
55
 * @return Free ASID.
65
 * @return Free ASID.
56
 */
66
 */
57
asid_t asid_find_free(void)
67
asid_t asid_find_free(void)
58
{
68
{
59
    return fifo_pop(free_asids);
69
    return fifo_pop(free_asids);
60
}
70
}
61
 
71
 
62
/** Return ASID among free ASIDs.
72
/** Return ASID among free ASIDs.
63
 *
73
 *
64
 * This operation runs in O(1).
74
 * This operation runs in O(1).
65
 *
75
 *
66
 * @param asid ASID being freed.
76
 * @param asid ASID being freed.
67
 */
77
 */
68
void asid_put_arch(asid_t asid)
78
void asid_put_arch(asid_t asid)
69
{
79
{
70
    fifo_push(free_asids, asid);
80
    fifo_push(free_asids, asid);
71
}
81
}
72
 
82