Subversion Repositories HelenOS

Rev

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

  1. /*
  2.  * Copyright (C) 2006 Martin Decky
  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 genericmm
  30.  * @{
  31.  */
  32.  
  33. /**
  34.  * @file
  35.  * @brief   RAM disk support.
  36.  *
  37.  * Support for RAM disk images.
  38.  */
  39.  
  40. #include <lib/rd.h>
  41. #include <arch/byteorder.h>
  42. #include <mm/frame.h>
  43. #include <sysinfo/sysinfo.h>
  44. #include <ddi/ddi.h>
  45.  
  46. static parea_t rd_parea;        /**< Physical memory area for rd. */
  47.  
  48. int init_rd(rd_header * header, size_t size)
  49. {
  50.     /* Identify RAM disk */
  51.     if ((header->magic[0] != RD_MAG0) || (header->magic[1] != RD_MAG1) ||
  52.         (header->magic[2] != RD_MAG2) || (header->magic[3] != RD_MAG3))
  53.         return RE_INVALID;
  54.    
  55.     /* Identify version */ 
  56.     if (header->version != RD_VERSION)
  57.         return RE_UNSUPPORTED;
  58.    
  59.     uint32_t hsize;
  60.     uint64_t dsize;
  61.     switch (header->data_type) {
  62.     case RD_DATA_LSB:
  63.         hsize = uint32_t_le2host(header->header_size);
  64.         dsize = uint64_t_le2host(header->data_size);
  65.         break;
  66.     case RD_DATA_MSB:
  67.         hsize = uint32_t_be2host(header->header_size);
  68.         dsize = uint64_t_le2host(header->data_size);
  69.         break;
  70.     default:
  71.         return RE_UNSUPPORTED;
  72.     }
  73.    
  74.     if ((hsize % FRAME_SIZE) || (dsize % FRAME_SIZE))
  75.         return RE_UNSUPPORTED;
  76.    
  77.     if (hsize > size)
  78.         return RE_INVALID;
  79.    
  80.     if ((uint64_t) hsize + dsize > size)
  81.         dsize = size - hsize;
  82.    
  83.     rd_parea.pbase = KA2PA((void *) header + hsize);
  84.     rd_parea.vbase = (uintptr_t) ((void *) header + hsize);
  85.     rd_parea.frames = SIZE2FRAMES(dsize);
  86.     rd_parea.cacheable = true;
  87.     ddi_parea_register(&rd_parea);
  88.  
  89.     sysinfo_set_item_val("rd", NULL, true);
  90.     sysinfo_set_item_val("rd.size", NULL, dsize);
  91.     sysinfo_set_item_val("rd.address.physical", NULL, (unative_t)
  92.         KA2PA((void *) header + hsize));
  93.     sysinfo_set_item_val("rd.address.color", NULL, (unative_t)
  94.         PAGE_COLOR((uintptr_t) header + hsize));
  95.  
  96.     return RE_OK;
  97. }
  98.  
  99. /** @}
  100.  */
  101.