Subversion Repositories HelenOS-historic

Rev

Rev 703 | Rev 759 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  1. /*
  2.  * Copyright (C) 2001-2005 Jakub Jermar
  3.  * Copyright (C) 2005 Sergey Bondari
  4.  * All rights reserved.
  5.  *
  6.  * Redistribution and use in source and binary forms, with or without
  7.  * modification, are permitted provided that the following conditions
  8.  * are met:
  9.  *
  10.  * - Redistributions of source code must retain the above copyright
  11.  *   notice, this list of conditions and the following disclaimer.
  12.  * - Redistributions in binary form must reproduce the above copyright
  13.  *   notice, this list of conditions and the following disclaimer in the
  14.  *   documentation and/or other materials provided with the distribution.
  15.  * - The name of the author may not be used to endorse or promote products
  16.  *   derived from this software without specific prior written permission.
  17.  *
  18.  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
  19.  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  20.  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
  21.  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
  22.  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  23.  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  24.  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  25.  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  26.  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
  27.  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  28.  */
  29.  
  30. #include <typedefs.h>
  31. #include <arch/types.h>
  32. #include <mm/heap.h>
  33. #include <mm/frame.h>
  34. #include <mm/as.h>
  35. #include <panic.h>
  36. #include <debug.h>
  37. #include <list.h>
  38. #include <synch/spinlock.h>
  39. #include <arch/asm.h>
  40. #include <arch.h>
  41. #include <print.h>
  42. #include <align.h>
  43.  
  44. SPINLOCK_INITIALIZE(zone_head_lock);    /**< this lock protects zone_head list */
  45. LIST_INITIALIZE(zone_head);             /**< list of all zones in the system */
  46.  
  47. /** Blacklist containing non-available areas of memory.
  48.  *
  49.  * This blacklist is used to exclude frames that cannot be allocated
  50.  * (e.g. kernel memory) from available memory map.
  51.  */
  52. region_t zone_blacklist[ZONE_BLACKLIST_SIZE];
  53. count_t zone_blacklist_count = 0;
  54.  
  55. static struct buddy_system_operations  zone_buddy_system_operations = {
  56.     .find_buddy = zone_buddy_find_buddy,
  57.     .bisect = zone_buddy_bisect,
  58.     .coalesce = zone_buddy_coalesce,
  59.     .set_order = zone_buddy_set_order,
  60.     .get_order = zone_buddy_get_order,
  61.     .mark_busy = zone_buddy_mark_busy,
  62. };
  63.  
  64. /** Initialize physical memory management
  65.  *
  66.  * Initialize physical memory managemnt.
  67.  */
  68. void frame_init(void)
  69. {
  70.     if (config.cpu_active == 1) {
  71.         frame_region_not_free(KA2PA(config.base), config.kernel_size);
  72.         if (config.init_size > 0)
  73.             frame_region_not_free(KA2PA(config.init_addr), config.init_size);
  74.     }
  75.  
  76.     frame_arch_init();
  77. }
  78.  
  79. /** Allocate power-of-two frames of physical memory.
  80.  *
  81.  * @param flags Flags for host zone selection and address processing.
  82.  * @param order Allocate exactly 2^order frames.
  83.  *
  84.  * @return Allocated frame.
  85.  */
  86. __address frame_alloc(int flags, __u8 order, int * status)
  87. {
  88.     ipl_t ipl;
  89.     link_t *cur, *tmp;
  90.     zone_t *z;
  91.     zone_t *zone = NULL;
  92.     frame_t *frame = NULL;
  93.     __address v;
  94.    
  95. loop:
  96.     ipl = interrupts_disable();
  97.     spinlock_lock(&zone_head_lock);
  98.  
  99.     /*
  100.      * First, find suitable frame zone.
  101.      */
  102.     for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {
  103.         z = list_get_instance(cur, zone_t, link);
  104.        
  105.         spinlock_lock(&z->lock);
  106.  
  107.         /* Check if the zone has 2^order frames area available  */
  108.         if (buddy_system_can_alloc(z->buddy_system, order)) {
  109.             zone = z;
  110.             break;
  111.         }
  112.        
  113.         spinlock_unlock(&z->lock);
  114.     }
  115.    
  116.     if (!zone) {
  117.         if (flags & FRAME_PANIC)
  118.             panic("Can't allocate frame.\n");
  119.        
  120.         /*
  121.          * TODO: Sleep until frames are available again.
  122.          */
  123.         spinlock_unlock(&zone_head_lock);
  124.         interrupts_restore(ipl);
  125.  
  126.         if (flags & FRAME_NON_BLOCKING) {
  127.             ASSERT(status != NULL);
  128.             *status = FRAME_NO_MEMORY;
  129.             return NULL;
  130.         }
  131.        
  132.         panic("Sleep not implemented.\n");
  133.         goto loop;
  134.     }
  135.        
  136.     /* Allocate frames from zone buddy system */
  137.     tmp = buddy_system_alloc(zone->buddy_system, order);
  138.    
  139.     ASSERT(tmp);
  140.    
  141.     /* Update zone information. */
  142.     zone->free_count -= (1 << order);
  143.     zone->busy_count += (1 << order);
  144.  
  145.     /* Frame will be actually a first frame of the block. */
  146.     frame = list_get_instance(tmp, frame_t, buddy_link);
  147.    
  148.     /* get frame address */
  149.     v = FRAME2ADDR(zone, frame);
  150.  
  151.     spinlock_unlock(&zone->lock);
  152.     spinlock_unlock(&zone_head_lock);
  153.     interrupts_restore(ipl);
  154.  
  155.     if (flags & FRAME_KA)
  156.         v = PA2KA(v);
  157.    
  158.     if (flags & FRAME_NON_BLOCKING) {
  159.         ASSERT(status != NULL);
  160.         *status = FRAME_OK;
  161.     }
  162.     return v;
  163. }
  164.  
  165. /** Free a frame.
  166.  *
  167.  * Find respective frame structrue for supplied addr.
  168.  * Decrement frame reference count.
  169.  * If it drops to zero, move the frame structure to free list.
  170.  *
  171.  * @param addr Address of the frame to be freed. It must be a multiple of FRAME_SIZE.
  172.  */
  173. void frame_free(__address addr)
  174. {
  175.     ipl_t ipl;
  176.     link_t *cur;
  177.     zone_t *z;
  178.     zone_t *zone = NULL;
  179.     frame_t *frame;
  180.     int order;
  181.    
  182.     ASSERT(addr % FRAME_SIZE == 0);
  183.    
  184.     ipl = interrupts_disable();
  185.     spinlock_lock(&zone_head_lock);
  186.    
  187.     /*
  188.      * First, find host frame zone for addr.
  189.      */
  190.     for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {
  191.         z = list_get_instance(cur, zone_t, link);
  192.        
  193.         spinlock_lock(&z->lock);
  194.        
  195.         if (IS_KA(addr))
  196.             addr = KA2PA(addr);
  197.        
  198.         /*
  199.          * Check if addr belongs to z.
  200.          */
  201.         if ((addr >= z->base) && (addr <= z->base + (z->free_count + z->busy_count) * FRAME_SIZE)) {
  202.             zone = z;
  203.             break;
  204.         }
  205.  
  206.         spinlock_unlock(&z->lock);
  207.     }
  208.    
  209.     ASSERT(zone != NULL);
  210.    
  211.     frame = ADDR2FRAME(zone, addr);
  212.    
  213.     /* remember frame order */
  214.     order = frame->buddy_order;
  215.  
  216.     ASSERT(frame->refcount);
  217.  
  218.     if (!--frame->refcount) {
  219.         buddy_system_free(zone->buddy_system, &frame->buddy_link);
  220.     }
  221.  
  222.     /* Update zone information. */
  223.     zone->free_count += (1 << order);
  224.     zone->busy_count -= (1 << order);
  225.    
  226.     spinlock_unlock(&zone->lock);
  227.     spinlock_unlock(&zone_head_lock);
  228.     interrupts_restore(ipl);
  229. }
  230.  
  231. /** Mark frame region not free.
  232.  *
  233.  * Mark frame region not free.
  234.  *
  235.  * @param base Base address of non-available region.
  236.  * @param size Size of non-available region.
  237.  */
  238. void frame_region_not_free(__address base, size_t size)
  239. {
  240.     index_t index;
  241.     index = zone_blacklist_count++;
  242.  
  243.     /* Force base to the nearest lower address frame boundary. */
  244.     base = ALIGN_DOWN(base, FRAME_SIZE);
  245.     /* Align size to frame boundary. */
  246.     size = ALIGN_UP(size, FRAME_SIZE);
  247.  
  248.     ASSERT(index < ZONE_BLACKLIST_SIZE);
  249.     zone_blacklist[index].base = base;
  250.     zone_blacklist[index].size = size;
  251. }
  252.  
  253. /** Create frame zones in region of available memory.
  254.  *
  255.  * Avoid any black listed areas of non-available memory.
  256.  * Assume that the black listed areas cannot overlap
  257.  * one another or cross available memory region boundaries.
  258.  *
  259.  * @param base Base address of available memory region.
  260.  * @param size Size of the region.
  261.  */
  262. void zone_create_in_region(__address base, size_t size) {
  263.     int i;
  264.     zone_t * z;
  265.     __address s;
  266.     size_t sz;
  267.    
  268.     ASSERT(base % FRAME_SIZE == 0);
  269.     ASSERT(size % FRAME_SIZE == 0);
  270.    
  271.     if (!size)
  272.         return;
  273.  
  274.     for (i = 0; i < zone_blacklist_count; i++) {
  275.         if (zone_blacklist[i].base >= base && zone_blacklist[i].base < base + size) {
  276.             s = base; sz = zone_blacklist[i].base - base;
  277.             ASSERT(base != s || sz != size);
  278.             zone_create_in_region(s, sz);
  279.            
  280.             s = zone_blacklist[i].base + zone_blacklist[i].size;
  281.             sz = (base + size) - (zone_blacklist[i].base + zone_blacklist[i].size);
  282.             ASSERT(base != s || sz != size);
  283.             zone_create_in_region(s, sz);
  284.             return;
  285.        
  286.         }
  287.     }
  288.    
  289.     z = zone_create(base, size, 0);
  290.  
  291.     if (!z) {
  292.         panic("Cannot allocate zone (base=%P, size=%d).\n", base, size);
  293.     }
  294.    
  295.     zone_attach(z);
  296. }
  297.  
  298.  
  299. /** Create frame zone
  300.  *
  301.  * Create new frame zone.
  302.  *
  303.  * @param start Physical address of the first frame within the zone.
  304.  * @param size Size of the zone. Must be a multiple of FRAME_SIZE.
  305.  * @param flags Zone flags.
  306.  *
  307.  * @return Initialized zone.
  308.  */
  309. zone_t * zone_create(__address start, size_t size, int flags)
  310. {
  311.     zone_t *z;
  312.     count_t cnt;
  313.     int i;
  314.     __u8 max_order;
  315.  
  316.     ASSERT(start % FRAME_SIZE == 0);
  317.     ASSERT(size % FRAME_SIZE == 0);
  318.    
  319.     cnt = size / FRAME_SIZE;
  320.    
  321.     z = (zone_t *) early_malloc(sizeof(zone_t));
  322.     if (z) {
  323.         link_initialize(&z->link);
  324.         spinlock_initialize(&z->lock, "zone_lock");
  325.    
  326.         z->base = start;
  327.         z->base_index = start / FRAME_SIZE;
  328.        
  329.         z->flags = flags;
  330.  
  331.         z->free_count = cnt;
  332.         z->busy_count = 0;
  333.        
  334.         z->frames = (frame_t *) early_malloc(cnt * sizeof(frame_t));
  335.         if (!z->frames) {
  336.             early_free(z);
  337.             return NULL;
  338.         }
  339.        
  340.         for (i = 0; i<cnt; i++) {
  341.             frame_initialize(&z->frames[i], z);
  342.         }
  343.        
  344.         /*
  345.          * Create buddy system for the zone
  346.          */
  347.         for (max_order = 0; cnt >> max_order; max_order++)
  348.             ;
  349.         z->buddy_system = buddy_system_create(max_order, &zone_buddy_system_operations, (void *) z);
  350.        
  351.         /* Stuffing frames */
  352.         for (i = 0; i<cnt; i++) {
  353.             z->frames[i].refcount = 0;
  354.             buddy_system_free(z->buddy_system, &z->frames[i].buddy_link);  
  355.         }
  356.        
  357.     }
  358.     return z;
  359. }
  360.  
  361. /** Attach frame zone
  362.  *
  363.  * Attach frame zone to zone list.
  364.  *
  365.  * @param zone Zone to be attached.
  366.  */
  367. void zone_attach(zone_t *zone)
  368. {
  369.     ipl_t ipl;
  370.    
  371.     ipl = interrupts_disable();
  372.     spinlock_lock(&zone_head_lock);
  373.    
  374.     list_append(&zone->link, &zone_head);
  375.    
  376.     spinlock_unlock(&zone_head_lock);
  377.     interrupts_restore(ipl);
  378. }
  379.  
  380. /** Initialize frame structure
  381.  *
  382.  * Initialize frame structure.
  383.  *
  384.  * @param frame Frame structure to be initialized.
  385.  * @param zone Host frame zone.
  386.  */
  387. void frame_initialize(frame_t *frame, zone_t *zone)
  388. {
  389.     frame->refcount = 1;
  390.     frame->buddy_order = 0;
  391. }
  392.  
  393.  
  394. /** Buddy system find_buddy implementation
  395.  *
  396.  * @param b Buddy system.
  397.  * @param block Block for which buddy should be found
  398.  *
  399.  * @return Buddy for given block if found
  400.  */
  401. link_t * zone_buddy_find_buddy(buddy_system_t *b, link_t * block) {
  402.     frame_t * frame;
  403.     zone_t * zone;
  404.     index_t index;
  405.     bool is_left, is_right;
  406.  
  407.     frame = list_get_instance(block, frame_t, buddy_link);
  408.     zone = (zone_t *) b->data;
  409.     ASSERT(IS_BUDDY_ORDER_OK(FRAME_INDEX_ABS(zone, frame), frame->buddy_order));
  410.    
  411.    
  412.     is_left = IS_BUDDY_LEFT_BLOCK_ABS(zone, frame);
  413.     is_right = IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame);
  414.    
  415.     ASSERT(is_left ^ is_right);
  416.    
  417.     if (is_left) {
  418.         index = (FRAME_INDEX(zone, frame)) + (1 << frame->buddy_order);
  419.     } else { // if (is_right)
  420.         index = (FRAME_INDEX(zone, frame)) - (1 << frame->buddy_order);
  421.     }
  422.    
  423.     if (FRAME_INDEX_VALID(zone, index)) {
  424.         if (    zone->frames[index].buddy_order == frame->buddy_order &&
  425.             zone->frames[index].refcount == 0) {
  426.             return &zone->frames[index].buddy_link;
  427.         }
  428.     }
  429.    
  430.     return NULL;   
  431. }
  432.  
  433. /** Buddy system bisect implementation
  434.  *
  435.  * @param b Buddy system.
  436.  * @param block Block to bisect
  437.  *
  438.  * @return right block
  439.  */
  440. link_t * zone_buddy_bisect(buddy_system_t *b, link_t * block) {
  441.     frame_t * frame_l, * frame_r;
  442.  
  443.     frame_l = list_get_instance(block, frame_t, buddy_link);
  444.     frame_r = (frame_l + (1 << (frame_l->buddy_order - 1)));
  445.    
  446.     return &frame_r->buddy_link;
  447. }
  448.  
  449. /** Buddy system coalesce implementation
  450.  *
  451.  * @param b Buddy system.
  452.  * @param block_1 First block
  453.  * @param block_2 First block's buddy
  454.  *
  455.  * @return Coalesced block (actually block that represents lower address)
  456.  */
  457. link_t * zone_buddy_coalesce(buddy_system_t *b, link_t * block_1, link_t * block_2) {
  458.     frame_t * frame1, * frame2;
  459.    
  460.     frame1 = list_get_instance(block_1, frame_t, buddy_link);
  461.     frame2 = list_get_instance(block_2, frame_t, buddy_link);
  462.    
  463.     return frame1 < frame2 ? block_1 : block_2;
  464. }
  465.  
  466. /** Buddy system set_order implementation
  467.  *
  468.  * @param b Buddy system.
  469.  * @param block Buddy system block
  470.  * @param order Order to set
  471.  */
  472. void zone_buddy_set_order(buddy_system_t *b, link_t * block, __u8 order) {
  473.     frame_t * frame;
  474.     frame = list_get_instance(block, frame_t, buddy_link);
  475.     frame->buddy_order = order;
  476. }
  477.  
  478. /** Buddy system get_order implementation
  479.  *
  480.  * @param b Buddy system.
  481.  * @param block Buddy system block
  482.  *
  483.  * @return Order of block
  484.  */
  485. __u8 zone_buddy_get_order(buddy_system_t *b, link_t * block) {
  486.     frame_t * frame;
  487.     frame = list_get_instance(block, frame_t, buddy_link);
  488.     return frame->buddy_order;
  489. }
  490.  
  491. /** Buddy system mark_busy implementation
  492.  *
  493.  * @param b Buddy system
  494.  * @param block Buddy system block
  495.  *
  496.  */
  497. void zone_buddy_mark_busy(buddy_system_t *b, link_t * block) {
  498.     frame_t * frame;
  499.     frame = list_get_instance(block, frame_t, buddy_link);
  500.     frame->refcount = 1;
  501. }
  502.  
  503. /** Prints list of zones
  504.  *
  505.  */
  506. void zone_print_list(void) {
  507.     zone_t *zone = NULL;
  508.     link_t *cur;
  509.     ipl_t ipl;
  510.  
  511.     ipl = interrupts_disable();
  512.     spinlock_lock(&zone_head_lock);
  513.     printf("Base address\tFree Frames\tBusy Frames\n");
  514.     printf("------------\t-----------\t-----------\n");
  515.     for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {
  516.         zone = list_get_instance(cur, zone_t, link);
  517.         spinlock_lock(&zone->lock);
  518.         printf("%L\t%d\t\t%d\n",zone->base, zone->free_count, zone->busy_count);
  519.         spinlock_unlock(&zone->lock);
  520.     }
  521.     spinlock_unlock(&zone_head_lock);
  522.     interrupts_restore(ipl);
  523. }
  524.  
  525. /** Prints zone details
  526.  *
  527.  * @param base Zone base address
  528.  */
  529. void zone_print_one(__address base) {
  530.     zone_t *zone = NULL, *z ;
  531.     link_t *cur;
  532.     ipl_t ipl;
  533.  
  534.     ipl = interrupts_disable();
  535.     spinlock_lock(&zone_head_lock);
  536.    
  537.     for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {
  538.         z = list_get_instance(cur, zone_t, link);
  539.         if (base == z->base) {
  540.             zone = z;
  541.             break;
  542.         }
  543.     }
  544.    
  545.     if (!zone) {
  546.         spinlock_unlock(&zone_head_lock);
  547.         interrupts_restore(ipl);
  548.         printf("No zone with address %X\n", base);
  549.         return;
  550.     }
  551.    
  552.     spinlock_lock(&zone->lock);
  553.     printf("Memory zone information\n\n");
  554.     printf("Zone base address: %P\n", zone->base);
  555.     printf("Zone size: %d frames (%dK)\n", zone->free_count + zone->busy_count, ((zone->free_count + zone->busy_count) * FRAME_SIZE) >> 10);
  556.     printf("Allocated space: %d frames (%dK)\n", zone->busy_count, (zone->busy_count * FRAME_SIZE) >> 10);
  557.     printf("Available space: %d (%dK)\n", zone->free_count, (zone->free_count * FRAME_SIZE) >> 10);
  558.    
  559.     printf("\nBuddy allocator structures:\n\n");
  560.     buddy_system_structure_print(zone->buddy_system, FRAME_SIZE);
  561.    
  562.     spinlock_unlock(&zone->lock);
  563.     spinlock_unlock(&zone_head_lock);
  564.     interrupts_restore(ipl);
  565. }
  566.  
  567.