Changeset 99c2c69e in mainline for kernel/generic/include
- Timestamp:
- 2013-09-13T00:36:30Z (12 years ago)
- Branches:
- lfn, master, serial, ticket/834-toolchain-update, topic/msim-upgrade, topic/simplify-dev-export
- Children:
- 67fbd5e
- Parents:
- 7f84430 (diff), 11d41be5 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the(diff)links above to see all the changes relative to each parent. - Location:
- kernel/generic/include
- Files:
-
- 1 deleted
- 8 edited
-
adt/bitmap.h (modified) (1 diff)
-
adt/list.h (modified) (4 diffs)
-
config.h (modified) (3 diffs)
-
macros.h (modified) (1 diff)
-
mm/as.h (modified) (1 diff)
-
mm/buddy.h (deleted)
-
mm/frame.h (modified) (4 diffs)
-
mm/page.h (modified) (1 diff)
-
mm/slab.h (modified) (3 diffs)
Legend:
- Unmodified
- Added
- Removed
-
kernel/generic/include/adt/bitmap.h
r7f84430 r99c2c69e 38 38 #include <typedefs.h> 39 39 40 #define BITS2BYTES(bits) (bits ? ((((bits)-1)>>3)+1) : 0) 40 #define BITMAP_ELEMENT 8 41 #define BITMAP_REMAINER 7 41 42 42 43 typedef struct { 43 uint8_t *map; 44 size_t bits; 44 size_t elements; 45 uint8_t *bits; 46 size_t next_fit; 45 47 } bitmap_t; 46 48 47 extern void bitmap_initialize(bitmap_t *bitmap, uint8_t *map, size_t bits); 48 extern void bitmap_set_range(bitmap_t *bitmap, size_t start, size_t bits); 49 extern void bitmap_clear_range(bitmap_t *bitmap, size_t start, size_t bits); 50 extern void bitmap_copy(bitmap_t *dst, bitmap_t *src, size_t bits); 49 static inline void bitmap_set(bitmap_t *bitmap, size_t element, 50 unsigned int value) 51 { 52 if (element >= bitmap->elements) 53 return; 54 55 size_t byte = element / BITMAP_ELEMENT; 56 uint8_t mask = 1 << (element & BITMAP_REMAINER); 57 58 if (value) { 59 bitmap->bits[byte] |= mask; 60 } else { 61 bitmap->bits[byte] &= ~mask; 62 bitmap->next_fit = byte; 63 } 64 } 51 65 52 static inline int bitmap_get(bitmap_t *bitmap, size_t bit)66 static inline unsigned int bitmap_get(bitmap_t *bitmap, size_t element) 53 67 { 54 if (bit >= bitmap->bits)68 if (element >= bitmap->elements) 55 69 return 0; 56 70 57 return !! ((bitmap->map)[bit/8] & (1 << (bit & 7))); 71 size_t byte = element / BITMAP_ELEMENT; 72 uint8_t mask = 1 << (element & BITMAP_REMAINER); 73 74 return !!((bitmap->bits)[byte] & mask); 58 75 } 59 76 77 extern size_t bitmap_size(size_t); 78 extern void bitmap_initialize(bitmap_t *, size_t, void *); 79 80 extern void bitmap_set_range(bitmap_t *, size_t, size_t); 81 extern void bitmap_clear_range(bitmap_t *, size_t, size_t); 82 83 extern int bitmap_allocate_range(bitmap_t *, size_t, size_t, size_t, size_t, 84 size_t *); 85 extern void bitmap_copy(bitmap_t *, bitmap_t *, size_t); 60 86 61 87 #endif -
kernel/generic/include/adt/list.h
r7f84430 r99c2c69e 1 1 /* 2 2 * Copyright (c) 2001-2004 Jakub Jermar 3 * Copyright (c) 201 1Jiri Svoboda3 * Copyright (c) 2013 Jiri Svoboda 4 4 * All rights reserved. 5 5 * … … 65 65 66 66 #define list_get_instance(link, type, member) \ 67 ((type *) (((void *)(link)) - ((void *) &(((type *) NULL)->member)))) 68 69 #define list_foreach(list, iterator) \ 70 for (link_t *iterator = (list).head.next; \ 71 iterator != &(list).head; iterator = iterator->next) 67 ((type *) (((void *)(link)) - list_link_to_void(&(((type *) NULL)->member)))) 68 69 #define list_foreach(list, member, itype, iterator) \ 70 for (itype *iterator = NULL; iterator == NULL; iterator = (itype *) 1) \ 71 for (link_t *_link = (list).head.next; \ 72 iterator = list_get_instance(_link, itype, member), \ 73 _link != &(list).head; _link = _link->next) 72 74 73 75 #define assert_link_not_used(link) \ … … 204 206 } 205 207 208 /** Get next item in list. 209 * 210 * @param link Current item link 211 * @param list List containing @a link 212 * 213 * @return Next item or NULL if @a link is the last item. 214 */ 215 static inline link_t *list_next(link_t *link, const list_t *list) 216 { 217 return (link->next == &list->head) ? NULL : link->next; 218 } 219 220 /** Get previous item in list. 221 * 222 * @param link Current item link 223 * @param list List containing @a link 224 * 225 * @return Previous item or NULL if @a link is the first item. 226 */ 227 static inline link_t *list_prev(link_t *link, const list_t *list) 228 { 229 return (link->prev == &list->head) ? NULL : link->prev; 230 } 231 206 232 /** Split or concatenate headless doubly-linked circular list 207 233 * … … 270 296 { 271 297 unsigned int cnt = 0; 272 273 list_foreach(*list, link) { 298 link_t *link; 299 300 link = list_first(list); 301 while (link != NULL) { 274 302 if (cnt == n) 275 303 return link; 276 304 277 305 cnt++; 306 link = list_next(link, list); 278 307 } 279 308 280 309 return NULL; 310 } 311 312 /** Verify that argument type is a pointer to link_t (at compile time). 313 * 314 * This can be used to check argument type in a macro. 315 */ 316 static inline const void *list_link_to_void(const link_t *link) 317 { 318 return link; 281 319 } 282 320 -
kernel/generic/include/config.h
r7f84430 r99c2c69e 37 37 38 38 #include <arch/mm/page.h> 39 #include <macros.h> 39 40 40 #define ONE_FRAME 0 41 #define TWO_FRAMES 1 42 #define FOUR_FRAMES 2 41 #define STACK_FRAMES 2 42 #define STACK_SIZE FRAMES2SIZE(STACK_FRAMES) 43 43 44 #define STACK_FRAMES TWO_FRAMES 45 #define STACK_SIZE ((1 << STACK_FRAMES) << PAGE_WIDTH) 46 47 #define STACK_SIZE_USER (1 * 1024 * 1024) 44 #define STACK_SIZE_USER (1 * 1024 * 1024) 48 45 49 46 #define CONFIG_INIT_TASKS 32 … … 97 94 /** Size of initial stack. */ 98 95 size_t stack_size; 99 96 100 97 bool identity_configured; 101 98 /** Base address of the kernel identity mapped memory. */ … … 103 100 /** Size of the kernel identity mapped memory. */ 104 101 size_t identity_size; 105 106 bool non_identity_configured; 107 102 103 bool non_identity_configured; 104 108 105 /** End of physical memory. */ 109 106 uint64_t physmem_end; -
kernel/generic/include/macros.h
r7f84430 r99c2c69e 117 117 overlaps(KA2PA((x)), (szx), KA2PA((y)), (szy)) 118 118 119 #define PFN2ADDR(frame) ((frame) << FRAME_WIDTH) 120 #define ADDR2PFN(addr) ((addr) >> FRAME_WIDTH) 121 122 #define FRAMES2SIZE(frames) ((frames) << FRAME_WIDTH) 123 #define SIZE2FRAMES(size) \ 124 (((size) == 0) ? 0 : ((((size) - 1) >> FRAME_WIDTH) + 1)) 125 119 126 #define KiB2SIZE(kb) ((kb) << 10) 120 127 #define MiB2SIZE(mb) ((mb) << 20) -
kernel/generic/include/mm/as.h
r7f84430 r99c2c69e 250 250 extern int as_area_change_flags(as_t *, unsigned int, uintptr_t); 251 251 252 //TODO REMOVE!253 extern as_area_t * find_locked_area(as_t *as, uintptr_t va);254 255 252 extern unsigned int as_area_get_flags(as_area_t *); 256 253 extern bool as_area_check_access(as_area_t *, pf_access_t); -
kernel/generic/include/mm/frame.h
r7f84430 r99c2c69e 39 39 #include <typedefs.h> 40 40 #include <trace.h> 41 #include <adt/bitmap.h> 41 42 #include <adt/list.h> 42 #include <mm/buddy.h>43 43 #include <synch/spinlock.h> 44 44 #include <arch/mm/page.h> … … 50 50 typedef uint8_t frame_flags_t; 51 51 52 #define FRAME_NONE 0x0 53 /** Convert the frame address to kernel VA. */ 54 #define FRAME_KA 0x1 52 #define FRAME_NONE 0x00 55 53 /** Do not panic and do not sleep on failure. */ 56 #define FRAME_ATOMIC 0x 254 #define FRAME_ATOMIC 0x01 57 55 /** Do not start reclaiming when no free memory. */ 58 #define FRAME_NO_RECLAIM 0x 456 #define FRAME_NO_RECLAIM 0x02 59 57 /** Do not reserve / unreserve memory. */ 60 #define FRAME_NO_RESERVE 0x 858 #define FRAME_NO_RESERVE 0x04 61 59 /** Allocate a frame which can be identity-mapped. */ 62 #define FRAME_LOWMEM 0x1060 #define FRAME_LOWMEM 0x08 63 61 /** Allocate a frame which cannot be identity-mapped. */ 64 #define FRAME_HIGHMEM 0x20 65 /** Allocate a frame which needs to be from DMA zone. */ 66 #define FRAME_DMA 0x40 62 #define FRAME_HIGHMEM 0x10 67 63 68 64 typedef uint8_t zone_flags_t; 69 65 70 #define ZONE_NONE 0x066 #define ZONE_NONE 0x00 71 67 /** Available zone (free for allocation) */ 72 #define ZONE_AVAILABLE 0x 168 #define ZONE_AVAILABLE 0x01 73 69 /** Zone is reserved (not available for allocation) */ 74 #define ZONE_RESERVED 0x 270 #define ZONE_RESERVED 0x02 75 71 /** Zone is used by firmware (not available for allocation) */ 76 #define ZONE_FIRMWARE 0x 472 #define ZONE_FIRMWARE 0x04 77 73 /** Zone contains memory that can be identity-mapped */ 78 #define ZONE_LOWMEM 0x874 #define ZONE_LOWMEM 0x08 79 75 /** Zone contains memory that cannot be identity-mapped */ 80 #define ZONE_HIGHMEM 0x10 81 /** Zone contains memory suitable for old ISA DMA */ 82 #define ZONE_DMA 0x20 76 #define ZONE_HIGHMEM 0x10 83 77 84 78 /** Mask of zone bits that must be matched exactly. */ 85 #define ZONE_EF_MASK 0x779 #define ZONE_EF_MASK 0x07 86 80 87 #define FRAME_TO_ZONE_FLAGS(ff) \ 88 ((((ff) & FRAME_DMA) ? ZONE_DMA : \ 89 (((ff) & FRAME_LOWMEM) ? ZONE_LOWMEM : \ 81 #define FRAME_TO_ZONE_FLAGS(ff) \ 82 ((((ff) & FRAME_LOWMEM) ? ZONE_LOWMEM : \ 90 83 (((ff) & FRAME_HIGHMEM) ? ZONE_HIGHMEM : \ 91 ZONE_LOWMEM /* | ZONE_HIGHMEM */)) )| \84 ZONE_LOWMEM /* | ZONE_HIGHMEM */)) | \ 92 85 ZONE_AVAILABLE) 93 86 … … 97 90 98 91 typedef struct { 99 size_t refcount; /**< Tracking of shared frames */ 100 link_t buddy_link; /**< Link to the next free block inside 101 one order */ 102 void *parent; /**< If allocated by slab, this points there */ 103 uint8_t buddy_order; /**< Buddy system block order */ 92 size_t refcount; /**< Tracking of shared frames */ 93 void *parent; /**< If allocated by slab, this points there */ 104 94 } frame_t; 105 95 106 96 typedef struct { 107 pfn_t base; /**< Frame_no of the first frame 108 in the frames array */ 109 size_t count; /**< Size of zone */ 110 size_t free_count; /**< Number of free frame_t 111 structures */ 112 size_t busy_count; /**< Number of busy frame_t 113 structures */ 114 zone_flags_t flags; /**< Type of the zone */ 97 /** Frame_no of the first frame in the frames array */ 98 pfn_t base; 115 99 116 frame_t *frames; /**< Array of frame_t structures 117 in this zone */ 118 buddy_system_t *buddy_system; /**< Buddy system for the zone */ 100 /** Size of zone */ 101 size_t count; 102 103 /** Number of free frame_t structures */ 104 size_t free_count; 105 106 /** Number of busy frame_t structures */ 107 size_t busy_count; 108 109 /** Type of the zone */ 110 zone_flags_t flags; 111 112 /** Frame bitmap */ 113 bitmap_t bitmap; 114 115 /** Array of frame_t structures in this zone */ 116 frame_t *frames; 119 117 } zone_t; 120 118 … … 131 129 extern zones_t zones; 132 130 133 NO_TRACE static inline uintptr_t PFN2ADDR(pfn_t frame)134 {135 return (uintptr_t) (frame << FRAME_WIDTH);136 }137 138 NO_TRACE static inline pfn_t ADDR2PFN(uintptr_t addr)139 {140 return (pfn_t) (addr >> FRAME_WIDTH);141 }142 143 NO_TRACE static inline size_t SIZE2FRAMES(size_t size)144 {145 if (!size)146 return 0;147 return (size_t) ((size - 1) >> FRAME_WIDTH) + 1;148 }149 150 NO_TRACE static inline size_t FRAMES2SIZE(size_t frames)151 {152 return (size_t) (frames << FRAME_WIDTH);153 }154 155 #define IS_BUDDY_ORDER_OK(index, order) \156 ((~(((sysarg_t) -1) << (order)) & (index)) == 0)157 #define IS_BUDDY_LEFT_BLOCK(zone, frame) \158 (((frame_index((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 0)159 #define IS_BUDDY_RIGHT_BLOCK(zone, frame) \160 (((frame_index((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 1)161 #define IS_BUDDY_LEFT_BLOCK_ABS(zone, frame) \162 (((frame_index_abs((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 0)163 #define IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame) \164 (((frame_index_abs((zone), (frame)) >> (frame)->buddy_order) & 0x1) == 1)165 166 131 extern void frame_init(void); 167 132 extern bool frame_adjust_zone_bounds(bool, uintptr_t *, size_t *); 168 extern void *frame_alloc_generic(uint8_t, frame_flags_t, size_t *);169 extern void *frame_alloc(uint8_t, frame_flags_t);170 extern void *frame_alloc_noreserve(uint8_t, frame_flags_t);171 extern void frame_free_generic(uintptr_t, frame_flags_t);172 extern void frame_free(uintptr_t );173 extern void frame_free_noreserve(uintptr_t );133 extern uintptr_t frame_alloc_generic(size_t, frame_flags_t, uintptr_t, 134 size_t *); 135 extern uintptr_t frame_alloc(size_t, frame_flags_t, uintptr_t); 136 extern void frame_free_generic(uintptr_t, size_t, frame_flags_t); 137 extern void frame_free(uintptr_t, size_t); 138 extern void frame_free_noreserve(uintptr_t, size_t); 174 139 extern void frame_reference_add(pfn_t); 175 140 extern size_t frame_total_free_get(void); -
kernel/generic/include/mm/page.h
r7f84430 r99c2c69e 65 65 extern void page_table_destroy(pte_t *); 66 66 67 extern int page_find_mapping(uintptr_t, void **);68 extern sysarg_t sys_page_find_mapping(uintptr_t, void*);67 extern int page_find_mapping(uintptr_t, uintptr_t *); 68 extern sysarg_t sys_page_find_mapping(uintptr_t, uintptr_t *); 69 69 70 70 #endif -
kernel/generic/include/mm/slab.h
r7f84430 r99c2c69e 55 55 /** Maximum wasted space we allow for cache */ 56 56 #define SLAB_MAX_BADNESS(cache) \ 57 ( ((unsigned int) PAGE_SIZE << (cache)->order) >> 2)57 (FRAMES2SIZE((cache)->frames) >> 2) 58 58 59 59 /* slab_reclaim constants */ … … 90 90 91 91 /* Configuration */ 92 92 93 /** Size of slab position - align_up(sizeof(obj)) */ 93 94 size_t size; … … 100 101 101 102 /* Computed values */ 102 uint8_t order; /**< Order of frames to be allocated */103 size_t frames; /**< Number of frames to be allocated */ 103 104 size_t objects; /**< Number of objects that fit in */ 104 105
Note:
See TracChangeset
for help on using the changeset viewer.
