| 1 | /*
|
|---|
| 2 | * Copyright (c) 2011 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 | /** @addtogroup generic
|
|---|
| 30 | * @{
|
|---|
| 31 | */
|
|---|
| 32 | /** @file
|
|---|
| 33 | */
|
|---|
| 34 |
|
|---|
| 35 | #ifndef KERN_RA_H_
|
|---|
| 36 | #define KERN_RA_H_
|
|---|
| 37 |
|
|---|
| 38 | #include <typedefs.h>
|
|---|
| 39 | #include <adt/list.h>
|
|---|
| 40 | #include <adt/hash_table.h>
|
|---|
| 41 |
|
|---|
| 42 | typedef struct {
|
|---|
| 43 | list_t spans; /**< List of arena's spans. */
|
|---|
| 44 | } ra_arena_t;
|
|---|
| 45 |
|
|---|
| 46 | typedef struct {
|
|---|
| 47 | link_t span_link; /**< Arena's list of spans link. */
|
|---|
| 48 |
|
|---|
| 49 | list_t segments; /**< List of span's segments. */
|
|---|
| 50 |
|
|---|
| 51 | size_t max_order; /**< Base 2 logarithm of span's size. */
|
|---|
| 52 | list_t *free; /**< max_order segment free lists. */
|
|---|
| 53 |
|
|---|
| 54 | hash_table_t used;
|
|---|
| 55 |
|
|---|
| 56 | uintptr_t base; /**< Span base. */
|
|---|
| 57 | size_t size; /**< Span size. */
|
|---|
| 58 | } ra_span_t;
|
|---|
| 59 |
|
|---|
| 60 | /*
|
|---|
| 61 | * We would like to achieve a good ratio of the size of one unit of the
|
|---|
| 62 | * represented resource (e.g. a page) and sizeof(ra_segment_t). We therefore
|
|---|
| 63 | * attempt to have as few redundant information in the segment as possible. For
|
|---|
| 64 | * example, the size of the segment needs to be calculated from the segment
|
|---|
| 65 | * base and the base of the following segment.
|
|---|
| 66 | */
|
|---|
| 67 | typedef struct {
|
|---|
| 68 | link_t segment_link; /**< Span's segment list link. */
|
|---|
| 69 | link_t fu_link; /**< Span's free list or used hash link. */
|
|---|
| 70 |
|
|---|
| 71 | uintptr_t base; /**< Segment base. */
|
|---|
| 72 | } ra_segment_t;
|
|---|
| 73 |
|
|---|
| 74 | extern ra_arena_t *ra_arena_create(uintptr_t, size_t);
|
|---|
| 75 | extern bool ra_span_add(ra_arena_t *, uintptr_t, size_t);
|
|---|
| 76 | extern uintptr_t ra_alloc(ra_arena_t *, size_t, size_t);
|
|---|
| 77 | extern void ra_free(ra_arena_t *, uintptr_t, size_t);
|
|---|
| 78 |
|
|---|
| 79 | #endif
|
|---|
| 80 |
|
|---|
| 81 | /** @}
|
|---|
| 82 | */
|
|---|
