Subversion Repositories HelenOS-historic

Rev

Rev 1037 | Rev 1196 | 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. /*
  31.  * Locking order
  32.  *
  33.  * In order to access particular zone, the process must first lock
  34.  * the zones.lock, then lock the zone and then unlock the zones.lock.
  35.  * This insures, that we can fiddle with the zones in runtime without
  36.  * affecting the processes.
  37.  *
  38.  */
  39.  
  40. #include <typedefs.h>
  41. #include <arch/types.h>
  42. #include <mm/frame.h>
  43. #include <mm/as.h>
  44. #include <panic.h>
  45. #include <debug.h>
  46. #include <adt/list.h>
  47. #include <synch/spinlock.h>
  48. #include <arch/asm.h>
  49. #include <arch.h>
  50. #include <print.h>
  51. #include <align.h>
  52. #include <mm/slab.h>
  53. #include <bitops.h>
  54. #include <macros.h>
  55.  
  56. typedef struct {
  57.     count_t refcount;   /**< tracking of shared frames  */
  58.     __u8 buddy_order;   /**< buddy system block order */
  59.     link_t buddy_link;  /**< link to the next free block inside one order */
  60.     void *parent;           /**< If allocated by slab, this points there */
  61. }frame_t;
  62.  
  63. typedef struct {
  64.     SPINLOCK_DECLARE(lock); /**< this lock protects everything below */
  65.     pfn_t base; /**< frame_no of the first frame in the frames array */
  66.     count_t count;          /**< Size of zone */
  67.  
  68.     frame_t *frames;    /**< array of frame_t structures in this zone */
  69.     count_t free_count; /**< number of free frame_t structures */
  70.     count_t busy_count; /**< number of busy frame_t structures */
  71.    
  72.     buddy_system_t * buddy_system; /**< buddy system for the zone */
  73.     int flags;
  74. }zone_t;
  75.  
  76. /*
  77.  * The zoneinfo.lock must be locked when accessing zoneinfo structure.
  78.  * Some of the attributes in zone_t structures are 'read-only'
  79.  */
  80.  
  81. struct {
  82.     SPINLOCK_DECLARE(lock);
  83.     int count;
  84.     zone_t *info[ZONES_MAX];
  85. }zones;
  86.  
  87.  
  88. /*********************************/
  89. /* Helper functions */
  90. static inline index_t frame_index(zone_t *zone, frame_t *frame)
  91. {
  92.     return (index_t)(frame - zone->frames);
  93. }
  94. static inline index_t frame_index_abs(zone_t *zone, frame_t *frame)
  95. {
  96.     return (index_t)(frame - zone->frames) + zone->base;
  97. }
  98. static inline int frame_index_valid(zone_t *zone, index_t index)
  99. {
  100.     return index >= 0 && index < zone->count;
  101. }
  102.  
  103. /** Compute pfn_t from frame_t pointer & zone pointer */
  104. static index_t make_frame_index(zone_t *zone, frame_t *frame)
  105. {
  106.     return frame - zone->frames;
  107. }
  108.  
  109. /** Initialize frame structure
  110.  *
  111.  * Initialize frame structure.
  112.  *
  113.  * @param frame Frame structure to be initialized.
  114.  */
  115. static void frame_initialize(frame_t *frame)
  116. {
  117.     frame->refcount = 1;
  118.     frame->buddy_order = 0;
  119. }
  120.  
  121. /*************************************/
  122. /* Zoneinfo functions */
  123.  
  124. /**
  125.  * Insert-sort zone into zones list
  126.  *
  127.  * @return zone number on success, -1 on error
  128.  */
  129. static int zones_add_zone(zone_t *newzone)
  130. {
  131.     int i,j;
  132.     ipl_t ipl;
  133.     zone_t *z;
  134.  
  135.     ipl = interrupts_disable();
  136.     spinlock_lock(&zones.lock);
  137.     /* Try to merge */
  138.     if (zones.count + 1 == ZONES_MAX)
  139.         panic("Maximum zone(%d) count exceeded.", ZONES_MAX);
  140.     for (i = 0; i < zones.count; i++) {
  141.         /* Check for overflow */
  142.         z = zones.info[i];
  143.         if (overlaps(newzone->base,newzone->count,
  144.                  z->base, z->count)) {
  145.             printf("Zones overlap!\n");
  146.             return -1;
  147.         }
  148.         if (newzone->base < z->base)
  149.             break;
  150.     }
  151.     /* Move other zones up */
  152.     for (j = i;j < zones.count; j++)
  153.         zones.info[j + 1] = zones.info[j];
  154.     zones.info[i] = newzone;
  155.     zones.count++;
  156.     spinlock_unlock(&zones.lock);
  157.     interrupts_restore(ipl);
  158.  
  159.     return i;
  160. }
  161.  
  162. /**
  163.  * Try to find a zone where can we find the frame
  164.  *
  165.  * @param hint Start searching in zone 'hint'
  166.  * @param lock Lock zone if true
  167.  *
  168.  * Assume interrupts disable
  169.  */
  170. static zone_t * find_zone_and_lock(pfn_t frame, int *pzone)
  171. {
  172.     int i;
  173.     int hint = pzone ? *pzone : 0;
  174.     zone_t *z;
  175.    
  176.     spinlock_lock(&zones.lock);
  177.  
  178.     if (hint >= zones.count || hint < 0)
  179.         hint = 0;
  180.    
  181.     i = hint;
  182.     do {
  183.         z = zones.info[i];
  184.         spinlock_lock(&z->lock);
  185.         if (z->base <= frame && z->base + z->count > frame) {
  186.             spinlock_unlock(&zones.lock); /* Unlock the global lock */
  187.             if (pzone)
  188.                 *pzone = i;
  189.             return z;
  190.         }
  191.         spinlock_unlock(&z->lock);
  192.  
  193.         i++;
  194.         if (i >= zones.count)
  195.             i = 0;
  196.     } while(i != hint);
  197.  
  198.     spinlock_unlock(&zones.lock);
  199.     return NULL;
  200. }
  201.  
  202. /** @return True if zone can allocate specified order */
  203. static int zone_can_alloc(zone_t *z, __u8 order)
  204. {
  205.     return buddy_system_can_alloc(z->buddy_system, order);
  206. }
  207.  
  208. /**
  209.  * Find AND LOCK zone that can allocate order frames
  210.  *
  211.  * Assume interrupts are disabled!!
  212.  *
  213.  * @param pzone Pointer to preferred zone or NULL, on return contains zone number
  214.  */
  215. static zone_t * find_free_zone_lock(__u8 order, int *pzone)
  216. {
  217.     int i;
  218.     zone_t *z;
  219.     int hint = pzone ? *pzone : 0;
  220.    
  221.     spinlock_lock(&zones.lock);
  222.     if (hint >= zones.count)
  223.         hint = 0;
  224.     i = hint;
  225.     do {
  226.         z = zones.info[i];
  227.        
  228.         spinlock_lock(&z->lock);
  229.  
  230.         /* Check if the zone has 2^order frames area available  */
  231.         if (zone_can_alloc(z, order)) {
  232.             spinlock_unlock(&zones.lock);
  233.             if (pzone)
  234.                 *pzone = i;
  235.             return z;
  236.         }
  237.         spinlock_unlock(&z->lock);
  238.         if (++i >= zones.count)
  239.             i = 0;
  240.     } while(i != hint);
  241.     spinlock_unlock(&zones.lock);
  242.     return NULL;
  243. }
  244.  
  245. /********************************************/
  246. /* Buddy system functions */
  247.  
  248. /** Buddy system find_block implementation
  249.  *
  250.  * Find block that is parent of current list.
  251.  * That means go to lower addresses, until such block is found
  252.  *
  253.  * @param order - Order of parent must be different then this parameter!!
  254.  */
  255. static link_t *zone_buddy_find_block(buddy_system_t *b, link_t *child,
  256.                      __u8 order)
  257. {
  258.     frame_t * frame;
  259.     zone_t * zone;
  260.     index_t index;
  261.    
  262.     frame = list_get_instance(child, frame_t, buddy_link);
  263.     zone = (zone_t *) b->data;
  264.  
  265.     index = frame_index(zone, frame);
  266.     do {
  267.         if (zone->frames[index].buddy_order != order) {
  268.             return &zone->frames[index].buddy_link;
  269.         }
  270.     } while(index-- > 0);
  271.     return NULL;
  272. }
  273.  
  274. static void zone_buddy_print_id(buddy_system_t *b, link_t *block)
  275. {
  276.     frame_t * frame;
  277.     zone_t * zone;
  278.     index_t index;
  279.  
  280.     frame = list_get_instance(block, frame_t, buddy_link);
  281.     zone = (zone_t *) b->data;
  282.     index = frame_index(zone, frame);
  283.     printf("%d", index);
  284. }                    
  285.  
  286. /** Buddy system find_buddy implementation
  287.  *
  288.  * @param b Buddy system.
  289.  * @param block Block for which buddy should be found
  290.  *
  291.  * @return Buddy for given block if found
  292.  */
  293. static link_t * zone_buddy_find_buddy(buddy_system_t *b, link_t * block)
  294. {
  295.     frame_t * frame;
  296.     zone_t * zone;
  297.     index_t index;
  298.     bool is_left, is_right;
  299.  
  300.     frame = list_get_instance(block, frame_t, buddy_link);
  301.     zone = (zone_t *) b->data;
  302.     ASSERT(IS_BUDDY_ORDER_OK(frame_index_abs(zone, frame), frame->buddy_order));
  303.    
  304.     is_left = IS_BUDDY_LEFT_BLOCK_ABS(zone, frame);
  305.     is_right = IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame);
  306.  
  307.     ASSERT(is_left ^ is_right);
  308.     if (is_left) {
  309.         index = (frame_index(zone, frame)) + (1 << frame->buddy_order);
  310.     } else { // if (is_right)
  311.         index = (frame_index(zone, frame)) - (1 << frame->buddy_order);
  312.     }
  313.    
  314.     if (frame_index_valid(zone, index)) {
  315.         if (zone->frames[index].buddy_order == frame->buddy_order &&
  316.             zone->frames[index].refcount == 0) {
  317.             return &zone->frames[index].buddy_link;
  318.         }
  319.     }
  320.  
  321.     return NULL;   
  322. }
  323.  
  324. /** Buddy system bisect implementation
  325.  *
  326.  * @param b Buddy system.
  327.  * @param block Block to bisect
  328.  *
  329.  * @return right block
  330.  */
  331. static link_t * zone_buddy_bisect(buddy_system_t *b, link_t * block) {
  332.     frame_t * frame_l, * frame_r;
  333.  
  334.     frame_l = list_get_instance(block, frame_t, buddy_link);
  335.     frame_r = (frame_l + (1 << (frame_l->buddy_order - 1)));
  336.    
  337.     return &frame_r->buddy_link;
  338. }
  339.  
  340. /** Buddy system coalesce implementation
  341.  *
  342.  * @param b Buddy system.
  343.  * @param block_1 First block
  344.  * @param block_2 First block's buddy
  345.  *
  346.  * @return Coalesced block (actually block that represents lower address)
  347.  */
  348. static link_t * zone_buddy_coalesce(buddy_system_t *b, link_t * block_1,
  349.                     link_t * block_2)
  350. {
  351.     frame_t *frame1, *frame2;
  352.    
  353.     frame1 = list_get_instance(block_1, frame_t, buddy_link);
  354.     frame2 = list_get_instance(block_2, frame_t, buddy_link);
  355.    
  356.     return frame1 < frame2 ? block_1 : block_2;
  357. }
  358.  
  359. /** Buddy system set_order implementation
  360.  *
  361.  * @param b Buddy system.
  362.  * @param block Buddy system block
  363.  * @param order Order to set
  364.  */
  365. static void zone_buddy_set_order(buddy_system_t *b, link_t * block, __u8 order) {
  366.     frame_t * frame;
  367.     frame = list_get_instance(block, frame_t, buddy_link);
  368.     frame->buddy_order = order;
  369. }
  370.  
  371. /** Buddy system get_order implementation
  372.  *
  373.  * @param b Buddy system.
  374.  * @param block Buddy system block
  375.  *
  376.  * @return Order of block
  377.  */
  378. static __u8 zone_buddy_get_order(buddy_system_t *b, link_t * block) {
  379.     frame_t * frame;
  380.     frame = list_get_instance(block, frame_t, buddy_link);
  381.     return frame->buddy_order;
  382. }
  383.  
  384. /** Buddy system mark_busy implementation
  385.  *
  386.  * @param b Buddy system
  387.  * @param block Buddy system block
  388.  *
  389.  */
  390. static void zone_buddy_mark_busy(buddy_system_t *b, link_t * block) {
  391.     frame_t * frame;
  392.  
  393.     frame = list_get_instance(block, frame_t, buddy_link);
  394.     frame->refcount = 1;
  395. }
  396.  
  397. /** Buddy system mark_available implementation
  398.  *
  399.  * @param b Buddy system
  400.  * @param block Buddy system block
  401.  *
  402.  */
  403. static void zone_buddy_mark_available(buddy_system_t *b, link_t * block) {
  404.     frame_t * frame;
  405.     frame = list_get_instance(block, frame_t, buddy_link);
  406.     frame->refcount = 0;
  407. }
  408.  
  409. static struct buddy_system_operations  zone_buddy_system_operations = {
  410.     .find_buddy = zone_buddy_find_buddy,
  411.     .bisect = zone_buddy_bisect,
  412.     .coalesce = zone_buddy_coalesce,
  413.     .set_order = zone_buddy_set_order,
  414.     .get_order = zone_buddy_get_order,
  415.     .mark_busy = zone_buddy_mark_busy,
  416.     .mark_available = zone_buddy_mark_available,
  417.     .find_block = zone_buddy_find_block,
  418.     .print_id = zone_buddy_print_id
  419. };
  420.  
  421. /*************************************/
  422. /* Zone functions */
  423.  
  424. /** Allocate frame in particular zone
  425.  *
  426.  * Assume zone is locked
  427.  * Panics, if allocation is impossible.
  428.  *
  429.  * @return Frame index in zone
  430.  */
  431. static pfn_t zone_frame_alloc(zone_t *zone,__u8 order)
  432. {
  433.     pfn_t v;
  434.     link_t *tmp;
  435.     frame_t *frame;
  436.  
  437.     /* Allocate frames from zone buddy system */
  438.     tmp = buddy_system_alloc(zone->buddy_system, order);
  439.    
  440.     ASSERT(tmp);
  441.    
  442.     /* Update zone information. */
  443.     zone->free_count -= (1 << order);
  444.     zone->busy_count += (1 << order);
  445.  
  446.     /* Frame will be actually a first frame of the block. */
  447.     frame = list_get_instance(tmp, frame_t, buddy_link);
  448.    
  449.     /* get frame address */
  450.     v = make_frame_index(zone, frame);
  451.     return v;
  452. }
  453.  
  454. /** Free frame from zone
  455.  *
  456.  * Assume zone is locked
  457.  */
  458. static void zone_frame_free(zone_t *zone, index_t frame_idx)
  459. {
  460.     frame_t *frame;
  461.     __u8 order;
  462.  
  463.     frame = &zone->frames[frame_idx];
  464.    
  465.     /* remember frame order */
  466.     order = frame->buddy_order;
  467.  
  468.     ASSERT(frame->refcount);
  469.  
  470.     if (!--frame->refcount) {
  471.         buddy_system_free(zone->buddy_system, &frame->buddy_link);
  472.    
  473.         /* Update zone information. */
  474.         zone->free_count += (1 << order);
  475.         zone->busy_count -= (1 << order);
  476.     }
  477. }
  478.  
  479. /** Return frame from zone */
  480. static frame_t * zone_get_frame(zone_t *zone, index_t frame_idx)
  481. {
  482.     ASSERT(frame_idx < zone->count);
  483.     return &zone->frames[frame_idx];
  484. }
  485.  
  486. /** Mark frame in zone unavailable to allocation */
  487. static void zone_mark_unavailable(zone_t *zone, index_t frame_idx)
  488. {
  489.     frame_t *frame;
  490.     link_t *link;
  491.  
  492.     frame = zone_get_frame(zone, frame_idx);
  493.     if (frame->refcount)
  494.         return;
  495.     link = buddy_system_alloc_block(zone->buddy_system,
  496.                     &frame->buddy_link);
  497.     ASSERT(link);
  498.     zone->free_count--;
  499. }
  500.  
  501. /**
  502.  * Join 2 zones
  503.  *
  504.  * Expect zone_t *z to point to space at least zone_conf_size large
  505.  *
  506.  * Assume z1 & z2 are locked
  507.  */
  508.  
  509. static void _zone_merge(zone_t *z, zone_t *z1, zone_t *z2)
  510. {
  511.     __u8 max_order;
  512.     int i, z2idx;
  513.     pfn_t frame_idx;
  514.     frame_t *frame;
  515.  
  516.     ASSERT(!overlaps(z1->base,z1->count,z2->base,z2->count));
  517.     ASSERT(z1->base < z2->base);
  518.  
  519.     spinlock_initialize(&z->lock, "zone_lock");
  520.     z->base = z1->base;
  521.     z->count = z2->base+z2->count - z1->base;
  522.     z->flags = z1->flags & z2->flags;
  523.  
  524.     z->free_count = z1->free_count + z2->free_count;
  525.     z->busy_count = z1->busy_count + z2->busy_count;
  526.    
  527.     max_order = fnzb(z->count);
  528.  
  529.     z->buddy_system = (buddy_system_t *)&z[1];
  530.     buddy_system_create(z->buddy_system, max_order,
  531.                 &zone_buddy_system_operations,
  532.                 (void *) z);
  533.  
  534.     z->frames = (frame_t *)((void *)z->buddy_system+buddy_conf_size(max_order));
  535.     for (i = 0; i < z->count; i++) {
  536.         /* This marks all frames busy */
  537.         frame_initialize(&z->frames[i]);
  538.     }
  539.     /* Copy frames from both zones to preserve full frame orders,
  540.      * parents etc. Set all frames with refcount=0 to 1, because
  541.      * we add all free frames to buddy allocator later again, clear
  542.      * order to 0.
  543.      */
  544.     for (i=0; i<z1->count; i++)
  545.         z->frames[i] = z1->frames[i];
  546.     for (i=0; i < z2->count; i++) {
  547.         z2idx = i + (z2->base - z1->base);
  548.         z->frames[z2idx] = z2->frames[i];
  549.     }
  550.     for (i=0; i < z->count; i++) {
  551.         if (!z->frames[i].refcount) {
  552.             z->frames[i].refcount = 1;
  553.             z->frames[i].buddy_order = 0;
  554.         }
  555.     }
  556.     /* Add free blocks from the 2 original zones */
  557.     while (zone_can_alloc(z1, 0)) {
  558.         frame_idx = zone_frame_alloc(z1, 0);
  559.         frame = &z->frames[frame_idx];
  560.         frame->refcount = 0;
  561.         buddy_system_free(z->buddy_system, &frame->buddy_link);
  562.     }
  563.     while (zone_can_alloc(z2, 0)) {
  564.         frame_idx = zone_frame_alloc(z2, 0);
  565.         frame = &z->frames[frame_idx + (z2->base-z1->base)];
  566.         frame->refcount = 0;
  567.         buddy_system_free(z->buddy_system, &frame->buddy_link);
  568.     }
  569. }
  570.  
  571. /** Return old configuration frames into the zone
  572.  *
  573.  * We have several cases
  574.  * - the conf. data is outside of zone -> exit, shall we call frame_free??
  575.  * - the conf. data was created by zone_create or
  576.  *   updated with reduce_region -> free every frame
  577.  *
  578.  * @param newzone The actual zone where freeing should occur
  579.  * @param oldzone Pointer to old zone configuration data that should
  580.  *                be freed from new zone
  581.  */
  582. static void return_config_frames(zone_t *newzone, zone_t *oldzone)
  583. {
  584.     pfn_t pfn;
  585.     frame_t *frame;
  586.     count_t cframes;
  587.     int i;
  588.  
  589.     pfn = ADDR2PFN((__address)KA2PA(oldzone));
  590.     cframes = SIZE2FRAMES(zone_conf_size(oldzone->count));
  591.    
  592.     if (pfn < newzone->base || pfn >= newzone->base + newzone->count)
  593.         return;
  594.  
  595.     frame = &newzone->frames[pfn - newzone->base];
  596.     ASSERT(!frame->buddy_order);
  597.  
  598.     for (i=0; i < cframes; i++) {
  599.         newzone->busy_count++;
  600.         zone_frame_free(newzone, pfn+i-newzone->base);
  601.     }
  602. }
  603.  
  604. /** Reduce allocated block to count of order 0 frames
  605.  *
  606.  * The allocated block need 2^order frames of space. Reduce all frames
  607.  * in block to order 0 and free the unneded frames. This means, that
  608.  * when freeing the block, you have to free every frame from block.
  609.  *
  610.  * @param zone
  611.  * @param frame_idx Index to block
  612.  * @param count Allocated space in block
  613.  */
  614. static void zone_reduce_region(zone_t *zone, pfn_t frame_idx, count_t count)
  615. {
  616.     count_t i;
  617.     __u8 order;
  618.     frame_t *frame;
  619.    
  620.     ASSERT(frame_idx+count < zone->count);
  621.  
  622.     order = zone->frames[frame_idx].buddy_order;
  623.     ASSERT((1 << order) >= count);
  624.  
  625.     /* Reduce all blocks to order 0 */
  626.     for (i=0; i < (1 << order); i++) {
  627.         frame = &zone->frames[i + frame_idx];
  628.         frame->buddy_order = 0;
  629.         if (! frame->refcount)
  630.             frame->refcount = 1;
  631.         ASSERT(frame->refcount == 1);
  632.     }
  633.     /* Free unneeded frames */
  634.     for (i=count; i < (1 << order); i++) {
  635.         zone_frame_free(zone, i + frame_idx);
  636.     }
  637. }
  638.  
  639. /** Merge zones z1 and z2
  640.  *
  641.  * - the zones must be 2 zones with no zone existing in between,
  642.  *   which means that z2 = z1+1
  643.  *
  644.  * - When you create a new zone, the frame allocator configuration does
  645.  *   not to be 2^order size. Once the allocator is running it is no longer
  646.  *   possible, merged configuration data occupies more space :-/
  647.  */
  648. void zone_merge(int z1, int z2)
  649. {
  650.     ipl_t ipl;
  651.     zone_t *zone1, *zone2, *newzone;
  652.     int cframes;
  653.     __u8 order;
  654.     int i;
  655.     pfn_t pfn;
  656.  
  657.     ipl = interrupts_disable();
  658.     spinlock_lock(&zones.lock);
  659.  
  660.     if (z1 < 0 || z1 >= zones.count || z2 < 0 || z2 >= zones.count)
  661.         goto errout;
  662.     /* We can join only 2 zones with none existing inbetween */
  663.     if (z2-z1 != 1)
  664.         goto errout;
  665.  
  666.     zone1 = zones.info[z1];
  667.     zone2 = zones.info[z2];
  668.     spinlock_lock(&zone1->lock);
  669.     spinlock_lock(&zone2->lock);
  670.  
  671.     cframes = SIZE2FRAMES(zone_conf_size(zone2->base+zone2->count-zone1->base));
  672.     order = fnzb(cframes) + 1;
  673.  
  674.     /* Allocate zonedata inside one of the zones */
  675.     if (zone_can_alloc(zone1, order))
  676.         pfn = zone1->base + zone_frame_alloc(zone1, order);
  677.     else if (zone_can_alloc(zone2, order))
  678.         pfn = zone2->base + zone_frame_alloc(zone2, order);
  679.     else
  680.         goto errout2;
  681.  
  682.     newzone = (zone_t *)PA2KA(PFN2ADDR(pfn));
  683.  
  684.     _zone_merge(newzone, zone1, zone2);
  685.  
  686.     /* Free unneeded config frames */
  687.     zone_reduce_region(newzone, pfn - newzone->base,  cframes);
  688.     /* Subtract zone information from busy frames */
  689.     newzone->busy_count -= cframes;
  690.  
  691.     /* Replace existing zones in zoneinfo list */
  692.     zones.info[z1] = newzone;
  693.     for (i = z2 + 1; i < zones.count; i++)
  694.         zones.info[i - 1] = zones.info[i];
  695.     zones.count--;
  696.  
  697.     /* Free old zone information */
  698.     return_config_frames(newzone, zone1);
  699.     return_config_frames(newzone, zone2);
  700. errout2:
  701.     /* Nobody is allowed to enter to zone, so we are safe
  702.      * to touch the spinlocks last time */
  703.     spinlock_unlock(&zone1->lock);
  704.     spinlock_unlock(&zone2->lock);
  705. errout:
  706.     spinlock_unlock(&zones.lock);
  707.     interrupts_restore(ipl);
  708. }
  709.  
  710. /**
  711.  * Merge all zones into one big zone
  712.  *
  713.  * It is reasonable to do this on systems whose bios reports parts in chunks,
  714.  * so that we could have 1 zone (it's faster).
  715.  */
  716. void zone_merge_all(void)
  717. {
  718.     int count = zones.count;
  719.  
  720.     while (zones.count > 1 && --count) {
  721.         zone_merge(0,1);
  722.         break;
  723.     }
  724. }
  725.  
  726. /** Create frame zone
  727.  *
  728.  * Create new frame zone.
  729.  *
  730.  * @param start Physical address of the first frame within the zone.
  731.  * @param size Size of the zone. Must be a multiple of FRAME_SIZE.
  732.  * @param conffram Address of configuration frame
  733.  * @param flags Zone flags.
  734.  *
  735.  * @return Initialized zone.
  736.  */
  737. static void zone_construct(pfn_t start, count_t count, zone_t *z, int flags)
  738. {
  739.     int i;
  740.     __u8 max_order;
  741.  
  742.     spinlock_initialize(&z->lock, "zone_lock");
  743.     z->base = start;
  744.     z->count = count;
  745.     z->flags = flags;
  746.     z->free_count = count;
  747.     z->busy_count = 0;
  748.  
  749.     /*
  750.      * Compute order for buddy system, initialize
  751.      */
  752.     max_order = fnzb(count);
  753.     z->buddy_system = (buddy_system_t *)&z[1];
  754.    
  755.     buddy_system_create(z->buddy_system, max_order,
  756.                 &zone_buddy_system_operations,
  757.                 (void *) z);
  758.    
  759.     /* Allocate frames _after_ the conframe */
  760.     /* Check sizes */
  761.     z->frames = (frame_t *)((void *)z->buddy_system+buddy_conf_size(max_order));
  762.     for (i = 0; i<count; i++) {
  763.         frame_initialize(&z->frames[i]);
  764.     }
  765.    
  766.     /* Stuffing frames */
  767.     for (i = 0; i < count; i++) {
  768.         z->frames[i].refcount = 0;
  769.         buddy_system_free(z->buddy_system, &z->frames[i].buddy_link);
  770.     }
  771. }
  772.  
  773. /** Compute configuration data size for zone */
  774. __address zone_conf_size(count_t count)
  775. {
  776.     int size = sizeof(zone_t) + count*sizeof(frame_t);
  777.     int max_order;
  778.  
  779.     max_order = fnzb(count);
  780.     size += buddy_conf_size(max_order);
  781.     return size;
  782. }
  783.  
  784. /** Create and add zone to system
  785.  *
  786.  * @param confframe Where configuration frame is supposed to be.
  787.  *                  Always check, that we will not disturb the kernel and possibly init.
  788.  *                  If confframe is given _outside_ this zone, it is expected,
  789.  *                  that the area is already marked BUSY and big enough
  790.  *                  to contain zone_conf_size() amount of data
  791.  *
  792.  * @return Zone number or -1 on error
  793.  */
  794. int zone_create(pfn_t start, count_t count, pfn_t confframe, int flags)
  795. {
  796.     zone_t *z;
  797.     __address addr;
  798.     count_t confcount;
  799.     int i;
  800.     int znum;
  801.  
  802.     /* Theoretically we could have here 0, practically make sure
  803.      * nobody tries to do that. If some platform requires, remove
  804.      * the assert
  805.      */
  806.     ASSERT(confframe);
  807.     /* If conframe is supposed to be inside our zone, then make sure
  808.      * it does not span kernel & init
  809.      */
  810.     confcount = SIZE2FRAMES(zone_conf_size(count));
  811.     if (confframe >= start && confframe < start+count) {
  812.         for (;confframe < start + count; confframe++) {
  813.             addr = PFN2ADDR(confframe);
  814.             if (overlaps(addr, PFN2ADDR(confcount), KA2PA(config.base), config.kernel_size))
  815.                 continue;
  816.            
  817.             bool overlap = false;
  818.             count_t i;
  819.             for (i = 0; i < init.cnt; i++)
  820.                 if (overlaps(addr, PFN2ADDR(confcount), KA2PA(init.tasks[i].addr), init.tasks[i].size)) {
  821.                     overlap = true;
  822.                     break;
  823.                 }
  824.             if (overlap)
  825.                 continue;
  826.            
  827.             break;
  828.         }
  829.         if (confframe >= start + count)
  830.             panic("Cannot find configuration data for zone.");
  831.     }
  832.  
  833.     z = (zone_t *)PA2KA(PFN2ADDR(confframe));
  834.     zone_construct(start, count, z, flags);
  835.     znum = zones_add_zone(z);
  836.     if (znum == -1)
  837.         return -1;
  838.  
  839.     /* If confdata in zone, mark as unavailable */
  840.     if (confframe >= start && confframe < start+count)
  841.         for (i=confframe; i<confframe+confcount; i++) {
  842.             zone_mark_unavailable(z, i - z->base);
  843.         }
  844.     return znum;
  845. }
  846.  
  847. /***************************************/
  848. /* Frame functions */
  849.  
  850. /** Set parent of frame */
  851. void frame_set_parent(pfn_t pfn, void *data, int hint)
  852. {
  853.     zone_t *zone = find_zone_and_lock(pfn, &hint);
  854.  
  855.     ASSERT(zone);
  856.  
  857.     zone_get_frame(zone, pfn-zone->base)->parent = data;
  858.     spinlock_unlock(&zone->lock);
  859. }
  860.  
  861. void * frame_get_parent(pfn_t pfn, int hint)
  862. {
  863.     zone_t *zone = find_zone_and_lock(pfn, &hint);
  864.     void *res;
  865.  
  866.     ASSERT(zone);
  867.     res = zone_get_frame(zone, pfn - zone->base)->parent;
  868.    
  869.     spinlock_unlock(&zone->lock);
  870.     return res;
  871. }
  872.  
  873. /** Allocate power-of-two frames of physical memory.
  874.  *
  875.  * @param flags Flags for host zone selection and address processing.
  876.  * @param order Allocate exactly 2^order frames.
  877.  * @param pzone Preferred zone
  878.  *
  879.  * @return Allocated frame.
  880.  */
  881. pfn_t frame_alloc_generic(__u8 order, int flags, int * status, int *pzone)
  882. {
  883.     ipl_t ipl;
  884.     int freed;
  885.     pfn_t v;
  886.     zone_t *zone;
  887.    
  888. loop:
  889.     ipl = interrupts_disable();
  890.     /*
  891.      * First, find suitable frame zone.
  892.      */
  893.     zone = find_free_zone_lock(order,pzone);
  894.     /* If no memory, reclaim some slab memory,
  895.        if it does not help, reclaim all */
  896.     if (!zone && !(flags & FRAME_NO_RECLAIM)) {
  897.         freed = slab_reclaim(0);
  898.         if (freed)
  899.             zone = find_free_zone_lock(order,pzone);
  900.         if (!zone) {
  901.             freed = slab_reclaim(SLAB_RECLAIM_ALL);
  902.             if (freed)
  903.                 zone = find_free_zone_lock(order,pzone);
  904.         }
  905.     }
  906.     if (!zone) {
  907.         if (flags & FRAME_PANIC)
  908.             panic("Can't allocate frame.\n");
  909.        
  910.         /*
  911.          * TODO: Sleep until frames are available again.
  912.          */
  913.         interrupts_restore(ipl);
  914.  
  915.         if (flags & FRAME_ATOMIC) {
  916.             ASSERT(status != NULL);
  917.             if (status)
  918.                 *status = FRAME_NO_MEMORY;
  919.             return NULL;
  920.         }
  921.        
  922.         panic("Sleep not implemented.\n");
  923.         goto loop;
  924.     }
  925.     v = zone_frame_alloc(zone,order);
  926.     v += zone->base;
  927.  
  928.     spinlock_unlock(&zone->lock);
  929.     interrupts_restore(ipl);
  930.  
  931.     if (status)
  932.         *status = FRAME_OK;
  933.     return v;
  934. }
  935.  
  936. /** Free a frame.
  937.  *
  938.  * Find respective frame structure for supplied addr.
  939.  * Decrement frame reference count.
  940.  * If it drops to zero, move the frame structure to free list.
  941.  *
  942.  * @param frame Frame no to be freed.
  943.  */
  944. void frame_free(pfn_t pfn)
  945. {
  946.     ipl_t ipl;
  947.     zone_t *zone;
  948.  
  949.     ipl = interrupts_disable();
  950.    
  951.     /*
  952.      * First, find host frame zone for addr.
  953.      */
  954.     zone = find_zone_and_lock(pfn,NULL);
  955.     ASSERT(zone);
  956.    
  957.     zone_frame_free(zone, pfn-zone->base);
  958.    
  959.     spinlock_unlock(&zone->lock);
  960.     interrupts_restore(ipl);
  961. }
  962.  
  963.  
  964.  
  965. /** Mark given range unavailable in frame zones */
  966. void frame_mark_unavailable(pfn_t start, count_t count)
  967. {
  968.     int i;
  969.     zone_t *zone;
  970.     int prefzone = 0;
  971.    
  972.     for (i=0; i < count; i++) {
  973.         zone = find_zone_and_lock(start+i,&prefzone);
  974.         if (!zone) /* PFN not found */
  975.             continue;
  976.         zone_mark_unavailable(zone, start+i-zone->base);
  977.  
  978.         spinlock_unlock(&zone->lock);
  979.     }
  980. }
  981.  
  982. /** Initialize physical memory management
  983.  *
  984.  * Initialize physical memory managemnt.
  985.  */
  986. void frame_init(void)
  987. {
  988.     if (config.cpu_active == 1) {
  989.         zones.count = 0;
  990.         spinlock_initialize(&zones.lock,"zones_glob_lock");
  991.     }
  992.     /* Tell the architecture to create some memory */
  993.     frame_arch_init();
  994.     if (config.cpu_active == 1) {
  995.         pfn_t firstframe = ADDR2PFN(KA2PA(config.base));
  996.         pfn_t lastframe = ADDR2PFN(KA2PA(config.base+config.kernel_size));
  997.         frame_mark_unavailable(firstframe,lastframe-firstframe+1);
  998.        
  999.         count_t i;
  1000.         for (i = 0; i < init.cnt; i++)
  1001.             frame_mark_unavailable(ADDR2PFN(KA2PA(init.tasks[i].addr)), SIZE2FRAMES(init.tasks[i].size));
  1002.     }
  1003. }
  1004.  
  1005.  
  1006.  
  1007. /** Prints list of zones
  1008.  *
  1009.  */
  1010. void zone_print_list(void) {
  1011.     zone_t *zone = NULL;
  1012.     int i;
  1013.     ipl_t ipl;
  1014.  
  1015.     ipl = interrupts_disable();
  1016.     spinlock_lock(&zones.lock);
  1017.     printf("#  Base address\tFree Frames\tBusy Frames\n");
  1018.     printf("   ------------\t-----------\t-----------\n");
  1019.     for (i = 0; i < zones.count; i++) {
  1020.         zone = zones.info[i];
  1021.         spinlock_lock(&zone->lock);
  1022.         printf("%d: %L\t%d\t\t%d\n",i,PFN2ADDR(zone->base),
  1023.                zone->free_count, zone->busy_count);
  1024.         spinlock_unlock(&zone->lock);
  1025.     }
  1026.     spinlock_unlock(&zones.lock);
  1027.     interrupts_restore(ipl);
  1028. }
  1029.  
  1030. /** Prints zone details
  1031.  *
  1032.  * @param base Zone base address OR zone number
  1033.  */
  1034. void zone_print_one(int num) {
  1035.     zone_t *zone = NULL;
  1036.     ipl_t ipl;
  1037.     int i;
  1038.  
  1039.     ipl = interrupts_disable();
  1040.     spinlock_lock(&zones.lock);
  1041.  
  1042.     for (i = 0; i < zones.count; i++) {
  1043.         if (i == num || PFN2ADDR(zones.info[i]->base) == num) {
  1044.             zone = zones.info[i];
  1045.             break;
  1046.         }
  1047.     }
  1048.     if (!zone) {
  1049.         printf("Zone not found.\n");
  1050.         goto out;
  1051.     }
  1052.    
  1053.     spinlock_lock(&zone->lock);
  1054.     printf("Memory zone information\n");
  1055.     printf("Zone base address: %P\n", PFN2ADDR(zone->base));
  1056.     printf("Zone size: %d frames (%dK)\n", zone->count, ((zone->count) * FRAME_SIZE) >> 10);
  1057.     printf("Allocated space: %d frames (%dK)\n", zone->busy_count, (zone->busy_count * FRAME_SIZE) >> 10);
  1058.     printf("Available space: %d (%dK)\n", zone->free_count, (zone->free_count * FRAME_SIZE) >> 10);
  1059.     buddy_system_structure_print(zone->buddy_system, FRAME_SIZE);
  1060.    
  1061.     spinlock_unlock(&zone->lock);
  1062. out:
  1063.     spinlock_unlock(&zones.lock);
  1064.     interrupts_restore(ipl);
  1065. }
  1066.  
  1067.