Subversion Repositories HelenOS

Rev

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

  1. /*
  2.  * Copyright (C) 2006 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 ofw
  30.  * @{
  31.  */
  32. /**
  33.  * @file
  34.  * @brief   FHC 'reg' and 'ranges' properties handling.
  35.  *
  36.  */
  37.  
  38. #include <genarch/ofw/ofw_tree.h>
  39. #include <arch/memstr.h>
  40. #include <func.h>
  41. #include <panic.h>
  42. #include <macros.h>
  43.  
  44. bool ofw_fhc_apply_ranges(ofw_tree_node_t *node, ofw_fhc_reg_t *reg, uintptr_t *pa)
  45. {
  46.     ofw_tree_property_t *prop;
  47.     ofw_fhc_range_t *range;
  48.     count_t ranges;
  49.  
  50.     prop = ofw_tree_getprop(node, "ranges");
  51.     if (!prop)
  52.         return false;
  53.        
  54.     ranges = prop->size / sizeof(ofw_fhc_range_t);
  55.     range = prop->value;
  56.    
  57.     int i;
  58.    
  59.     for (i = 0; i < ranges; i++) {
  60.         if (overlaps(reg->addr, reg->size, range[i].child_base, range[i].size)) {
  61.             uintptr_t addr;
  62.            
  63.             addr = range[i].parent_base + (reg->addr - range[i].child_base);
  64.             if (!node->parent->parent) {
  65.                 *pa = addr;
  66.                 return true;
  67.             }
  68.             if (strcmp(ofw_tree_node_name(node->parent), "central") != 0)
  69.                 panic("Unexpected parent node: %s.\n", ofw_tree_node_name(node->parent));
  70.            
  71.             ofw_central_reg_t central_reg;
  72.            
  73.             central_reg.addr = addr;
  74.             central_reg.size = reg->size;
  75.            
  76.             return ofw_central_apply_ranges(node->parent, &central_reg, pa);
  77.         }
  78.     }
  79.  
  80.     return false;
  81. }
  82.  
  83. bool ofw_central_apply_ranges(ofw_tree_node_t *node, ofw_central_reg_t *reg, uintptr_t *pa)
  84. {
  85.     if (node->parent->parent)
  86.         panic("Unexpected parent node: %s.\n", ofw_tree_node_name(node->parent));
  87.    
  88.     ofw_tree_property_t *prop;
  89.     ofw_central_range_t *range;
  90.     count_t ranges;
  91.    
  92.     prop = ofw_tree_getprop(node, "ranges");
  93.     if (!prop)
  94.         return false;
  95.        
  96.     ranges = prop->size / sizeof(ofw_central_range_t);
  97.     range = prop->value;
  98.    
  99.     int i;
  100.    
  101.     for (i = 0; i < ranges; i++) {
  102.         if (overlaps(reg->addr, reg->size, range[i].child_base, range[i].size)) {
  103.             *pa = range[i].parent_base + (reg->addr - range[i].child_base);
  104.             return true;
  105.         }
  106.     }
  107.    
  108.     return false;
  109. }
  110.  
  111. /** @}
  112.  */
  113.