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