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